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-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, 4: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information U-274: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information October 4, 2012 - 6:00am Addthis PROBLEM: HP Network Node Manager I (NNMi) for HP-UX, Linux, Solaris, and Windows, Remote Disclosure of Information PLATFORM: HP Network Node Manager I (NNMi) v9.20 for HP-UX, Linux, Solaris, and Windows. ABSTRACT: Vulnerabilities can be exploited by malicious people to cause a DoS (Denial of Service) and potentially compromise a vulnerable system. reference LINKS: HP Security Bulletin: c03507708 SecurityTracker Alert ID: 1027605 Security Focus: 524302 CVE-2012-3267 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified with HP Network Node

2

U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

9: HP Network Node Manager i Input Validation Flaw Permits 9: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks August 7, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: HP Network Node Manager I (NNMi) v8.x, v9.0x, v9.1x, v9.20 for HP-UX, Linux, Solaris, and Windows ABSTRACT: 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). Reference LINKS: HP Document ID: c03405705 SecurityTracker Alert ID: 1027345 Bugtraq ID: 54815 CVE-2012-2022 IMPACT ASSESSMENT:

3

U-025: HP OpenView Network Node Manager Bugs Let Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-025: HP OpenView Network Node Manager Bugs Let Remote Users U-025: HP OpenView Network Node Manager Bugs Let Remote Users Execute Arbitrary Code U-025: HP OpenView Network Node Manager Bugs Let Remote Users Execute Arbitrary Code November 2, 2011 - 8:00am Addthis PROBLEM: HP OpenView Network Node Manager Bugs Let Remote Users Execute Arbitrary Code. PLATFORM: HP OpenView Network Node Manager (OV NNM) v7.51, v7.53 running on HP-UX, Linux, Solaris, and Windows ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Support Center Document ID: c03054052 SecurityTracker Alert ID: 1026260 CVE-2011-1365 CVE-2011-1366 CVE-2011-1367 IMPACT ASSESSMENT: Medium Discussion: Several vulnerabilities were reported in HP OpenView Network Node Manager. A remote user can execute arbitrary code on the target system.

4

U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager i Input Validation Hole Permits 4: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks July 3, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 8.x, 9.0x, 9.1x ABSTRACT: 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). reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027215 CVE-2012-2018 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP Network Node Manager i. The software does not properly filter HTML code from user-supplied input before

5

U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

204: HP Network Node Manager i Input Validation Hole Permits 204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks July 3, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 8.x, 9.0x, 9.1x ABSTRACT: 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). reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027215 CVE-2012-2018 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP Network Node Manager i. The software does not properly filter HTML code from user-supplied input before

6

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-214: HP Network Node Manager Java JDK / JRE Multiple U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities July 17, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities PLATFORM: The vulnerabilities are reported in version 9.0x running on HP-UX, Linux, Solaris, and Windows. ABSTRACT: Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS). reference LINKS: HP Support document ID: c03405642 Secunia Advisory SA49966 IMPACT ASSESSMENT: High Discussion: HP has acknowledged some vulnerabilities in HP Network Node Manager, which can be exploited by malicious, local users to disclose potentially sensitive information and by malicious people to disclose potentially

7

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Network Node Manager Java JDK / JRE Multiple 4: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities U-214: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities July 17, 2012 - 7:00am Addthis PROBLEM: HP Network Node Manager Java JDK / JRE Multiple Vulnerabilities PLATFORM: The vulnerabilities are reported in version 9.0x running on HP-UX, Linux, Solaris, and Windows. ABSTRACT: Vulnerabilities could be remotely exploited resulting in unauthorized information disclosure, modification, Denial of Service (DoS). reference LINKS: HP Support document ID: c03405642 Secunia Advisory SA49966 IMPACT ASSESSMENT: High Discussion: HP has acknowledged some vulnerabilities in HP Network Node Manager, which can be exploited by malicious, local users to disclose potentially sensitive information and by malicious people to disclose potentially

8

Particle removal challenges with EUV patterned mask for the sub-22nm HP node  

SciTech Connect

The particle removal efficiency (PRE) of cleaning processes diminishes whenever the minimum defect size for a specific technology node becomes smaller. For the sub-22 nm half-pitch (HP) node, it was demonstrated that exposure to high power megasonic up to 200 W/cm{sup 2} did not damage 60 nm wide TaBN absorber lines corresponding to the 16 nm HP node on wafer. An ammonium hydroxide mixture and megasonics removes {ge}50 nm SiO{sub 2} particles with a very high PRE, A sulfuric acid hydrogen peroxide mixture (SPM) in addition to ammonium hydroxide mixture (APM) and megasonic is required to remove {ge}28 nm SiO{sub 2} particles with a high PRE. Time-of-flight secondary ion mass spectroscopy (TOFSIMS) studies show that the presence of O{sub 2} during a vacuum ultraviolet (VUV) ({lambda} = 172 nm) surface conditioning step will result in both surface oxidation and Ru removal, which drastically reduce extreme ultraviolet (EUV) mask life time under multiple cleanings. New EUV mask cleaning processes show negligible or no EUV reflectivity loss and no increase in surface roughness after up to 15 cleaning cycles. Reviewing of defect with a high current density scanning electron microscope (SEM) drastically reduces PRE and deforms SiO{sub 2} particles. 28 nm SiO{sub 2} particles on EUV masks age very fast and will deform over time, Care must be taken when reviewing EUV mask defects by SEM. Potentially new particles should be identified to calibrate short wavelength inspection tools, Based on actinic image review, 50 nm SiO{sub 2} particles on top of the EUV mask will be printed on the wafer.

Rastegar, A.; Eichenlaub, S.; Kadaksham, A. J.; Lee, B.; House, M.; Huh, S.; Cha, B.; Yun, H.; Mochi, I.; Goldberg, K. A.

2010-03-12T23:59:59.000Z

9

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

10

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

11

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.

12

Enhancing opportunistic networks with legacy nodes  

Science Journals Connector (OSTI)

Mobile opportunistic networking utilizes device-to-device communication to provide messaging and content sharing mechanisms between mobile users without the need for supporting infrastructure networks. However, enabling opportunistic networking in practice ... Keywords: cookies, dtn, http, opportunistic networking, web storage

Marcin Nagy, Teemu Kärkkäinen, Jörg Ott

2014-09-01T23:59:59.000Z

13

Performance of wireless sensor networks under random node failures  

SciTech Connect

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

14

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

15

Modeling and Analysis of Energy Harvesting Nodes in Body Sensor Networks  

E-Print Network (OSTI)

Modeling 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. The results provide insight into the performance of energy harvesting nodes in a body sensor network as well

Sikdar, Biplab

16

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"

17

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.

18

Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes  

E-Print Network (OSTI)

the number of bits to transmit ([3], [15]), making a node to go into power saving modes: (sleepEfficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes Vinod Sharma, Utpal Mukherji and Vinay Joseph Abstract-- We study sensor networks with energy harvesting nodes

Sharma, Vinod

19

A Node Stability Index-Based Connected Dominating Set Algorithm for Mobile Ad Hoc Networks  

Science Journals Connector (OSTI)

We propose a Node Stability Index (NSI)-based algorithm to determine stable connected dominating sets (CDS) for Mobile Ad hoc Networks ... algorithm prefers to include (to the CDS) covered nodes that have the lar...

Natarajan Meghanathan

2012-01-01T23:59:59.000Z

20

Timing Synchronization at the Relay Node in Physical Layer Network Coding  

E-Print Network (OSTI)

In recent times, there has been an increased focus on the problem of information exchange between two nodes using a relay node. The introduction of physical layer network coding has improved the throughput efficiency of such an exchange. In practice...

Basireddy, Ashish

2012-07-16T23: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.


21

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

NLE Websites -- All DOE Office Websites (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...

22

Energy-aware Node Placement in Wireless Sensor Networks Peng Cheng, Chen-Nee Chuah  

E-Print Network (OSTI)

-dependent, the network lifetime can be limited by nodes with heavier data load and thus greater power consumption power, node densities, and huge data volume. Power conservation is a primary concern in prolonging to a sink node. Typical applications include traffic monitoring and data collection in warehouses. Data load

Chuah, Chen-Nee

23

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

24

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

25

Robust and distributed range-free localization using anchor nodes with varying communication range for three dimensional wireless sensor networks  

Science Journals Connector (OSTI)

Localization of the nodes in a sensor network is a premier activity which influences the performance of the network. The data collected by a sensor node may become useless if the location of that node is not known. Sensor networks are mostly deployed ...

Manas Kumar Mishra; M. M. Gore

2011-02-01T23:59:59.000Z

26

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

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

Secure Localization of Nodes in Wireless Sensor Networks with Limited Number of Truth Tellers  

E-Print Network (OSTI)

a wireless medium. The energy of each node is limited to the capacity of its battery. The consumption of energy for both communication and information processing must be mini- mized. Sensor networks use multi of sensors, also trusted by the other nodes -- often referred in literature as auditors or v

Barbeau, Michel

30

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

31

Intermediate Node Initiated (INI) Signalling: A Hybrid Resevation Technique for Optical Burst-Switched Networks  

Science Journals Connector (OSTI)

We introduce a new reservation scheme, Intermediate Node Initiation, which provides the functionality of both TAW and JET in the same network. INI scheme provides a trade-off between...

Karanam, Ravikiran; Vokkarane, Vinod M; Jue, Jason P

32

Analyzing Social Media Networks with NodeXL: Insights from a Connected World  

Science Journals Connector (OSTI)

Businesses, entrepreneurs, individuals, and government agencies alike are looking to social network analysis (SNA) tools for insight into trends, connections, and fluctuations in social media. Microsoft's NodeXL is a free, open-source SNA plug-in for ...

Derek Hansen; Ben Shneiderman; Marc A. Smith

2010-09-01T23:59:59.000Z

33

Energy efficient node addressing scheme in self-organised sensor networks  

Science Journals Connector (OSTI)

Sensor networks are envisioned to support autonomous and spontaneous networking for a wide range of applications such as environment monitoring. Due to energy constraints, it is difficult for wireless sensor nodes to handle heavy protocol stacks with a large protocol overhead. In this paper, we present a novel address auto configuration scheme, which we call SMallest-size sensor AddRess auToconfiguration scheme (SMART), to configure potential shortest-size local unique addresses for sensor networks with energy efficiency. SMART achieves energy efficiency in three ways. First, it automatically configures node address within a potential smallest address space for a number of sensor nodes, in order to achieve the small address size. Second, it avoids address conflicts during the address configuration. Third, it configures addresses with a small configuration overhead and achieves load balance among sensor nodes.

Rui Teng

2009-01-01T23:59:59.000Z

34

TinyNode: a comprehensive platform for wireless sensor network applications  

Science Journals Connector (OSTI)

We introduce the TinyNode platform for wireless sensor networks. Supporting both research and industrial deployments, the platform offers communication ranges that exceed current platforms by a factor of 3 to 5, while consuming similar energy. It comes ... Keywords: embedded systems, wireless sensor networks

Henri Dubois-Ferrière; Laurent Fabre; Roger Meier; Pierre Metrailler

2006-04-01T23:59:59.000Z

35

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

36

Modeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks  

E-Print Network (OSTI)

with an energy harvesting device that collects energy from ambient sources such as motion, light, and heat or motion energy harvesting in a body sensor network. We assume that at the end of each time slot the deviceModeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks Alireza Seyedi

Sikdar, Biplab

37

Comparing Trust Mechanisms for Monitoring Aggregator Nodes in Sensor Networks  

E-Print Network (OSTI)

With increasingly smaller sizes and reduced costs, the range of possible application domains for sensor networks has, such as fire de- tection, securing sensitive locations, detecting nuclear leak- age, etc. An average sensor (BS). The BS processes the data and gives the final decision to alert the network operator or consider

Sen, Sandip

38

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

39

Energy-efficient mobile target detection in Wireless Sensor Networks with random node deployment and partial coverage  

Science Journals Connector (OSTI)

This paper addresses the problem of engineering energy-efficient target detection applications, using unattended Wireless Sensor Networks (WSNs) with random node deployment and partial coverage, for long-lasting surveillance of areas of interest. As ... Keywords: Latency before detection, Optimization toolbox, Partial coverage, Probability of missed detection, Random node deployment, Target detection, Wireless Sensor Network (WSN)

Paolo Medagliani; Jérémie Leguay; Gianluigi Ferrari; Vincent Gay; Mario Lopez-Ramos

2012-06-01T23:59:59.000Z

40

Smart sensor/actuator node reprogramming in changing environments using a neural network model  

Science Journals Connector (OSTI)

The techniques currently developed for updating software in sensor nodes located in changing environments require usually the use of reprogramming procedures, which clearly increments the costs in terms of time and energy consumption. This work presents ... Keywords: Arduino, Constructive Neural Networks, Microcontroller

Francisco Ortega-Zamorano, José M. Jerez, José L. Subirats, Ignacio Molina, Leonardo Franco

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


41

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

42

A mutual authentication and key establishment scheme for heterogeneous sensor networks supporting nodes mobility  

Science Journals Connector (OSTI)

In the last two decades, wireless sensor networks (WSNs) have greatly attracted the attention of the research community because their flexibility, adaptability and self-organising properties make them a technology solution suitable for diverse application scenarios ranging from home and industrial automation to military surveillance. Since these networks consist of resource constrained devices and can be deployed in remote and unattended areas, supporting security could represent a challenging task especially if mobility scenarios are taken into consideration. In this context, key management facilitates the adoption of cryptography techniques to support secure data communication and to protect the resource constrained devices from various security attacks. This paper specifically focuses on mobile heterogeneous wireless sensor networks consisting of mobile sensor nodes with few fixed sensor nodes and presents a mutual authentication and key management scheme suitable for the considered scenario. Analytical and OMNET++ simulation results show that the proposed scheme provides better network connectivity, consumes less memory, has better network resilience against attacks and introduces lower communication overhead compared to state-of-the-art solutions.

Sarmad Ullah Khan; Claudio Pastrone; Luciano Lavagno; Maurizio A. Spirito

2012-01-01T23:59:59.000Z

43

U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

code via network, User access via network Solution: The vendor has issued a fix. The patch is available at HP support Center Addthis Related Articles U-137: HP Performance...

44

U-095: HP Data Protector Media Operations Lets Remote Users Execute...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

of arbitrary code via network, User access via network Solution: Hp has provided a patch (SMO A.06.20.01) to resolve this vulnerability. Addthis Related Articles T-538: HP...

45

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.

46

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

SciTech Connect

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

47

Compute nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

nodes Compute nodes Compute Node Configuration 5,576 nodes two 12-core Intel "Ivy Bridge" processors at 2.4GHz per node 24 cores per node (133,824 total cores) 1 AVX (vector)...

48

Connectivity of vehicular ad hoc networks with continuous node distribution patterns  

E-Print Network (OSTI)

nodes, given market penetration rates. Traffic signal Policec density and market penetration rate along the path. Forc density by ?(x), market penetration rate by µ(x), and node

Jin, W L; Wang, Bruce

2010-01-01T23:59:59.000Z

49

Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations  

Science Journals Connector (OSTI)

In this paper, we consider the problem of sending a set of multiple commodities from their origin to destination nodes via intermediate hubs. Each hub node is associated with a reliability function, which depends on the total flow that crosses that hub. ... Keywords: Congestion, Cutting planes, Integer programming, Multicommodity flow, Node reliabilities

Bita Tadayon, J. Cole Smith

2014-05-01T23:59:59.000Z

50

Multiple node remote messaging  

DOE Patents (OSTI)

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

Blumrich, Matthias A. (Ridgefield, CT); Chen, Dong (Croton on Hudson, NY); Gara, Alan G. (Mount Kisco, NY); Giampapa, Mark E. (Irvington, NY); Heidelberger, Philip (Cortlandt Manor, NY); Ohmacht, Martin (Yorktown Heights, NY); Salapura, Valentina (Chappaqua, NY); Steinmacher-Burow, Burkhard (Esslingen, DE); Vranas, Pavlos (Danville, CA)

2010-08-31T23:59:59.000Z

51

HP Angle Light 4x3 Blue  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Hewlett-Packard Development Company, L.P. Hewlett-Packard Development Company, L.P. 1 © Copyright 2010 Hewlett-Packard Development Company, L.P. Garett Montgomery DVLabs, TippingPoint 18May2010 SCADA: THREAT LANDSCAPE © Copyright 2010 Hewlett-Packard Development Company, L.P. 2 GARETT MONTGOMERY - US Navy: Electronics Technician (Communications) - Network Security at Naval Postgraduate School - Masters Degree in Information Assurance * CISSP, CWSP, GSNA, SnortCP, C|EH, etc. - Security Researcher at TippingPoint DVLabs * Focusing on SCADA * TippingPoint is a leading provider of Intrusion Prevention Systems (IPS). * www.tippingpoint.com * HP purchased TippingPoint as part of 3com acquisition, April 2010. * http://www.hp.com/hpinfo/newsroom/press/2009/091111xa.html © Copyright 2010 Hewlett-Packard Development Company, L.P.

52

Optimal Design of Multiechelon Supply Chain Networks with Generalized Production and Warehousing Nodes  

Science Journals Connector (OSTI)

To wit, at least one supplier should be contracted with at least one plant in order to receive raw materials and transform them to end products. ... Finally, purchasing cost has a fixed element (CnSYnS), the cost required to establish a relationship (supplier management costs, technology integration investments, and hedging costs for financial risk, etc.) with node n ? S (CnS), and a variable element (CinSSin), the product of the unit purchase price of material i from node n ? S (CinS) and the continuous variable expressing the purchased amounts of material i from the selected node n ? S (Sin). ... Uncertainties are introduced in demands, market prices, raw material costs, and prodn. ...

Magdalini A. Kalaitzidou; Pantelis Longinidis; Panagiotis Tsiakis; Michael C. Georgiadis

2014-07-29T23:59:59.000Z

53

hp calculators HP 50g Using a Secure Digital Card with ROM 2.08  

E-Print Network (OSTI)

hp calculators HP 50g Using a Secure Digital Card with ROM 2.08 Introduction Inserting and Removing in a directory on an SD card Upgrading the HP 50g ROM using an SD Card Frequently Asked Questions about SD Cards and the HP 50g #12;hp calculators HP 50g Using a Secure Digital Card with ROM 2.08 hp calculators - 2 - HP 50

Vetter, Frederick J.

54

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

55

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

56

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

57

On Relay Nodes Deployment for Distributed Detection in Wireless Sensor Networks  

E-Print Network (OSTI)

considered the use of relaying to improve the energy-efficiency of the sensor network. The work in [8] also the energy-efficiency of the sensor network. Our interest in this paper will be focused on how to deploy Engineering, Alexandria University, Alexandria 21544, Egypt. and Institute for Systems Research kseddik

Liu, K. J. Ray

58

NERSC's Data Transfer Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Data Transfer Nodes Data Transfer Nodes Data Transfer Nodes Overview The data transfer nodes are NERSC servers dedicated to performing transfers between NERSC data storage resources such as HPSS and the NERSC Global Filesystem (NGF), and storage resources at other sites including the Leadership Computing Facility at ORNL (Oak Ridge National Laboratory). These nodes are being managed (and monitored for performance) as part of a collaborative effort between ESnet, NERSC, and ORNL to enable high performance data movement over the high-bandwidth 10Gb ESnet wide-area network (WAN). Restrictions In order to keep the data transfer nodes performing optimally for data transfers, we request that users restrict interactive use of these systems to tasks that are related to preparing data for transfer or are directly

59

Imaging Sensor Nets: An RFID-inspired Framework for Million Node Sensor Networks  

E-Print Network (OSTI)

by these networks have a host of applications, including intelligent automation in homes and factories for many small-scale applications, such as home or building automation. However, there are many

Rodwell, Mark J. W.

60

Efficient Computation of Sensitivity Coefficients of Node Voltages and Line Currents in Unbalanced Electrical Networks  

E-Print Network (OSTI)

The problem of optimal control of power distribution systems is becoming increasingly compelling due to the progressive penetration of distributed energy resources in this specific layer of the electrical infrastructure. Distribution systems are, indeed, experiencing significant changes in terms of operation philosophies that are often based on optimal control strategies relying on the computation of linearized dependencies between controlled (e.g. voltages) and control variables (e.g. power injections). As the implementation of these strategies in real-time controllers imposes stringent time constraints, the derivation of analytical dependency between controlled and control variables becomes a non-trivial task to be solved. With reference to optimal voltage and power flow controls, this paper aims at providing an analytical derivation of node voltage and line current flows as a function of the nodal power injections. Compared to other approaches presented in the literature, the one proposed here is based on ...

Christakou, Konstantina; Paolone, Mario; Tomozei, Dan-Cristian

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


61

Network neighborhood analysis with the multi-node topological overlap measure  

Science Journals Connector (OSTI)

......report the P-values of the Kruskal-Wallis rank sum test, which is a non-parametric...report the P-values of the Kruskal-Wallis rank sum test, which is a standard...PPI network. We report the Kruskal-Wallis P-values for comparing the......

Ai Li; Steve Horvath

2007-01-15T23:59:59.000Z

62

Babel: Using a Common Bridge Node to Deliver Multiple Keys in Wireless Sensor Networks  

E-Print Network (OSTI)

investigated efficient data delivery, energy conservation, and other related issues [1]. Network security has@cs.uno.edu Yunghsiang S. Han Graduate Institute of Communication Engineering National Taipei University Sanhsia, Taipei and modification. In order to provide security for communication and data col- lection in WSNs, security keys need

Deng, Jing

63

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Service Manager Unspecified Flaw Lets Remote Users Gain 8: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access August 15, 2013 - 1:30am Addthis PROBLEM: A potential security vulnerability has been identified with HP Service Manager. The vulnerability could be exploited to allow remote unauthenticated access and elevation of privilege. PLATFORM: HP Service Manager v9.31, v9.30, v9.21, v7.11, v6.2.8 ABSTRACT: The vulnerabilities are reported in versions 9.31 and prior. REFERENCE LINKS: SecurityTracker Alert ID: 1028912 CVE-2013-4808 IMPACT ASSESSMENT: High DISCUSSION: A vulnerability was reported in HP Service Manager. A remote user can gain unauthorized access on the target system. IMPACT: User access via network

64

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Service Manager Unspecified Flaw Lets Remote Users Gain 8: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access V-218: HP Service Manager Unspecified Flaw Lets Remote Users Gain Unauthorized Access August 15, 2013 - 1:30am Addthis PROBLEM: A potential security vulnerability has been identified with HP Service Manager. The vulnerability could be exploited to allow remote unauthenticated access and elevation of privilege. PLATFORM: HP Service Manager v9.31, v9.30, v9.21, v7.11, v6.2.8 ABSTRACT: The vulnerabilities are reported in versions 9.31 and prior. REFERENCE LINKS: SecurityTracker Alert ID: 1028912 CVE-2013-4808 IMPACT ASSESSMENT: High DISCUSSION: A vulnerability was reported in HP Service Manager. A remote user can gain unauthorized access on the target system. IMPACT: User access via network

65

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

66

T-608: HP Virtual Server Environment Lets Remote Authenticated...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

running HP software products should be applied in accordance with the customer's patch management policy. Recommended Update: HP Software media set 6.3 HP Insight Software...

67

Hewlett Packard Company HP | Open Energy Information  

Open Energy Info (EERE)

Hewlett Packard Company HP Hewlett Packard Company HP Jump to: navigation, search Name Hewlett-Packard Company (HP) Place Palo Alto, California Zip 94304 Sector Solar Product US-based personal and corporate computer manufacturer, software developer, and IT infrastructure company and owner of SunPower Corporation; designer, manufacturer and installer of solar powered electricity systems. References Hewlett-Packard Company (HP)[1] LinkedIn Connections CrunchBase Profile No CrunchBase profile. Create one now! This article is a stub. You can help OpenEI by expanding it. Hewlett-Packard Company (HP) is a company located in Palo Alto, California . References ↑ "Hewlett-Packard Company (HP)" Retrieved from "http://en.openei.org/w/index.php?title=Hewlett_Packard_Company_HP&oldid=346506

68

The personal node (PN)  

Science Journals Connector (OSTI)

A Personal Node (PN) is a small, wallet-sized device that integrates people into the Internet. A PN incorporates wireless communication, limited user I/O, and local environmental telemetry to catalyze the coordination of other smart space (SS) and network ...

Gregory G. Finn; Joe Touch

1999-03-01T23:59:59.000Z

69

T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

70: HP Security Bulletin - HP-UX Running OpenSSL, Remote 70: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass March 4, 2011 - 3:05pm Addthis PROBLEM: Potential Security Impact: Remote execution of arbitrary code, Denial of Service (DoS), authentication bypass. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31 running OpenSSL before vA.00.09.08q. ABSTRACT: A potential security vulnerability has been identified with HP-UX OpenSSL. This vulnerability could be exploited remotely to execute arbitrary code or create a Denial of Service (DoS) or an authentication bypass. reference LINKS: Net-Security Advisory: HPSBUX02638

70

T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP Security Bulletin - HP-UX Running OpenSSL, Remote 0: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass T-570: HP Security Bulletin - HP-UX Running OpenSSL, Remote Execution of Arbitrary Code, Denial of Service (DoS), Authentication Bypass March 4, 2011 - 3:05pm Addthis PROBLEM: Potential Security Impact: Remote execution of arbitrary code, Denial of Service (DoS), authentication bypass. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31 running OpenSSL before vA.00.09.08q. ABSTRACT: A potential security vulnerability has been identified with HP-UX OpenSSL. This vulnerability could be exploited remotely to execute arbitrary code or create a Denial of Service (DoS) or an authentication bypass. reference LINKS: Net-Security Advisory: HPSBUX02638

71

Using Ranked nodes to model qualitative judgements in Bayesian Networks Norman Fenton, Martin Neil and Jose Gallan Caballero  

E-Print Network (OSTI)

is to construct relevant NPTs using the minimal amount of expert elicitation, recognising that it is rarely cost in a joint distribution is characterised by a directed acyclic graph, with nodes representing random in earlier real-world BN model building (such as in the model for software safety in the nuclear industry [17

Neil, Martin

72

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

73

Hopper Login Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Login Nodes Login Nodes Login Nodes Login Node Quick Facts When you ssh to hopper.nersc.gov, you are connecting to a "login node." Login nodes are used to edit files, compile codes, and submit job scripts to the batch system to run on the "compute nodes." Hopper has 12 login nodes (this is largely transparent to users). 4 quad-core AMD 2.4 GHz Opteron processers (16 cores total) on 8 of the login nodes 4 8-core AMD 2.0 GHz Opteron processors (32 cores total) on 4 of the login nodes. Each login node has 128 GB of memory. The login nodes sit behind a load balancer. New connections are assigned to a login node on a round robin fashion with the exception that if you've connected to Hopper recently, the load balancer will attempt to put you on the same login node as your previous connection.

74

Synchronizing compute node time bases in a parallel computer  

SciTech Connect

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

75

U-013: HP Data Protector Multiple Unspecified Vulnerabilities | Department  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP Data Protector Multiple Unspecified Vulnerabilities 3: HP Data Protector Multiple Unspecified Vulnerabilities U-013: HP Data Protector Multiple Unspecified Vulnerabilities October 18, 2011 - 9:00am Addthis PROBLEM: HP Data Protector Multiple Unspecified Vulnerabilities. PLATFORM: HP Data Protector Notebook Extension 6.20; HP Data Protector for Personal Computers 7.0 ABSTRACT: Multiple vulnerabilities were reported in HP Data Protector. A remote user can execute arbitrary code on the target system. reference LINKS: HP Security Document ID: c03054543 SecurityTracker Alert ID: 1026195 Secunia Advisory: SA46468 CVE-2011-3156 CVE-2011-3157 CVE-2011-3158 CVE-2011-3159 CVE-2011-3160 CVE-2011-3161 CVE-2011-3162 IMPACT ASSESSMENT: High Discussion: Potential security vulnerabilities has been identified with HP Data Protector Notebook Extension. These vulnerabilities could be remotely

76

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP Business Availability Center Input Validation Hole 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 Scripting Attacks May 16, 2011 - 3:05pm Addthis PROBLEM: A vulnerability was reported in HP Business Availability Center. A remote user can conduct cross-site scripting attacks. PLATFORM: HP Business Availability Center software 8.06 and prior versions ABSTRACT: The software does not properly filter HTML code from user-supplied input before displaying the input. reference LINKS: SecurityTracker Alert ID:1025535 HP Knowledge Base CVE-2011-1856 Secunia ID: SA44569 HP Document ID:c02823184 | ESB-2011.0525 IMPACT ASSESSMENT: High Discussion: A remote user can cause arbitrary scripting code to be executed by the

77

Hopper Compute Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Compute Nodes Compute Nodes Compute Nodes MC-proc.png Compute Node Configuration 6,384 nodes 2 twelve-core AMD 'MagnyCours' 2.1-GHz processors per node (see die image to the right and schematic below) 24 cores per node (153,216 total cores) 32 GB DDR3 1333-MHz memory per node (6,000 nodes) 64 GB DDR3 1333-MHz memory per node (384 nodes) Peak Gflop/s rate: 8.4 Gflops/core 201.6 Gflops/node 1.28 Peta-flops for the entire machine Each core has its own L1 and L2 caches, with 64 KB and 512KB respectively One 6-MB L3 cache shared between 6 cores on the Magny-Cours processor Four DDR3 1333-MHz memory channels per twelve-core 'MagnyCours' processor Compute Node Software By default the compute nodes run a restricted low-overhead operating system optimized for high performance computing called "Cray Linux Environment"

78

Data Transfer Nodes Yield Results!  

NLE Websites -- All DOE Office Websites (Extended Search)

DTN DTN Data Transfer Nodes Yield Results August 1, 2011 | Tags: Accelerator Science, Data Transfer, ESnet Linda Vu, +1 510 495 2402, lvu@lbl.gov The ability to reliably move and share data around the globe is essential to scientific collaboration, that's why three Department of Energy (DOE) Scientific Computing Centers-Argonne and Oak Ridge Leadership Computing Facilities, and the National Energy Research Scientific Computing Center (NERSC)-have teamed up to focus on optimizing wide area network (WAN) transfers. This ongoing effort began several years ago when each site deployed dedicated transfer nodes (DTNs), optimized for carrying data between the DOE facilities. Today, engineers from each site continue to meet regularly with DOE's Energy Sciences Network staff (ESnet) to develop strategies

79

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

80

PDSF Interactive Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Interactive (login) Nodes Interactive (login) Nodes Interactive (login) Nodes There are 4 interactive nodes at PDSF, pdsf[1-4].nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the gateways to accessing the rest of PDSF. Users can submit batch jobs as well as view and manipulate their files and directories from the interactive nodes. The configuration of the interactive nodes is shown in the table below. Processor Clock Speed (GHz) Architecture Cores Total Memory (GB) Scratch Space (GB) Intel Xeon X5650 2.67 x86_64 12 47 184 Because these nodes are shared by many users anything disruptive you might do affects not only your work but their work, too. Please take a look at the Best Practices page for guidance about what you should and should not do on the interactive nodes.

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

PDSF Compute Nodes  

NLE Websites -- All DOE Office Websites (Extended Search)

Compute Nodes Compute Nodes Compute Nodes There are currently 2632 nodes available on PDSF. The compute (batch) nodes at PDSF are heterogenous, reflecting the periodic procurement of new nodes (and the eventual retirement of old nodes). From the user's perspective they are essentially all equivalent except that some have more memory per job slot. If your jobs have memory requirements beyond the default maximum of 1.1GB you should specify that in your job submission and the batch system will run your job on an appropriate node. See Submitting jobs for more information. Processor Clock Speed (GHz) Architecture Cores Available Memory (GB) Scratch (GB/core) Job Slots Quad Intel 2.2 lx24-amd64 8 23.4 10 8 QuadCore AMD/Intel 2.1 lx24-amd64 8 15.6 10 8 6 Core Intel 2.3 lx24-amd64 12 47.0 10 12

82

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

83

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: HP Protect Tools Device Access Manager Unspecified Bug Lets 2: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code U-052: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code December 6, 2011 - 7:00am Addthis PROBLEM: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code. PLATFORM: HP Protect Tools Device Access Manager for Windows earlier than v.6.1.0.1 running on the following HP PCs: HP EliteBook 2560p Notebook 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 EliteBook 8760w Mobile Workstation HP ProBook 4230s Notebook PC

84

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: HP Protect Tools Device Access Manager Unspecified Bug Lets 2: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code U-052: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code December 6, 2011 - 7:00am Addthis PROBLEM: HP Protect Tools Device Access Manager Unspecified Bug Lets Remote Users Deny Service and Execute Arbitrary Code. PLATFORM: HP Protect Tools Device Access Manager for Windows earlier than v.6.1.0.1 running on the following HP PCs: HP EliteBook 2560p Notebook 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 EliteBook 8760w Mobile Workstation HP ProBook 4230s Notebook PC

85

A Novel Grid Node-by-Node Security Model  

Science Journals Connector (OSTI)

In this paper, we present a novel grid Node by Node security model. We partition the numerous grid nodes into different autonomy areas and each ... key, integrity and encrypt algorithm between the grid nodes are ...

Zhengyou Xia; Yichuan Jiang

2004-01-01T23:59:59.000Z

86

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

87

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Friday, April 13, 2012 11:33 AM Friday, April 13, 2012 11:33 AM To: Exparte Communications Cc: Watt, Steve Subject: HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies This following notes summarize the discussion that HP held via teleconference with the Department of Energy on April 10, 2012. Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY STAR, are the most effective mechanism for improving energy efficiency of IT products, but we understand the approach of regulating mandatory minimum efficiencies to address poor performing products. HP is a

88

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Tuesday, April 17, 2012 4:04 PM Tuesday, April 17, 2012 4:04 PM To: Mulveny, Jennifer; Exparte Communications Cc: Watt, Steve; Kido, Michael Subject: RE: HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies This following notes summarize the discussion that HP held via teleconference with the Department of Energy on April 10, 2012. Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY STAR, are the most effective mechanism for improving energy efficiency of IT products, but we understand the approach of regulating mandatory minimum efficiencies to address poor performing products. HP is a

89

T-538: HP OpenView Storage Data Protector Bug Lets Remote Users...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

HP-UX Software Assistant is an enhanced application that replaces HP-UX Security Patch Check. It analyzes all Security Bulletins issued by HP and lists recommended actions...

90

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

vulnerability. HP MFP Digital Sending Software v4.20 can be downloaded from HP Driver, Patch, Security and Support Addthis Related Articles V-210: HP LaserJet Pro Printer Bug Lets...

91

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

4: HP Printers Let Remote Users Access Files on the Printer 4: HP Printers Let Remote Users Access Files on the Printer V-144: HP Printers Let Remote Users Access Files on the Printer April 29, 2013 - 12:27am Addthis PROBLEM: HP Printers Let Remote Users Access Files on the Printer PLATFORM: HP Color LaserJet 3000 Q7534A HP Color LaserJet 3800 Q5981A HP Color LaserJet 4700 Q7492A HP Color LaserJet 4730 Multifunction Printer CB480A HP Color LaserJet 4730 Multifunction Printer CB480A HP Color LaserJet 5550 Q3714A HP Color LaserJet 9500 Multifunction Printer C8549A HP Color LaserJet CM6030 Multifunction Printer CE664A HP Color LaserJet CM6040 Multifunction Printer Q3939A HP Color LaserJet CP3505 CB442A HP Color LaserJet CP3525 CC469A HP Color LaserJet CP4005 CB503A HP Color LaserJet CP6015 Q3932A HP Color LaserJet Enterprise CP4025 CC490A

92

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

93

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

94

Perlick: ENERGY STAR Referral (HP48RO-S)  

Energy.gov (U.S. Department of Energy (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.

95

A novel EDAs based method for HP model protein folding  

Science Journals Connector (OSTI)

The protein structure prediction (PSP) problem is one of the most important problems in computational biology. This paper proposes a novel Estimation of Distribution Algorithms (EDAs) based method to solve the PSP problem on HP model. Firstly, a composite ...

Benhui Chen; Long Li; Jinglu Hu

2009-05-01T23:59:59.000Z

96

New 1 Terabyte Memory Node  

NLE Websites -- All DOE Office Websites (Extended Search)

New 1 Terabyte Memory Node New 1 Terabyte Memory Node June 17, 2011 by Francesca Verdier (0 Comments) A new "extra large" memory node that has four 8-core Nehalem EX processors (32...

97

U-203: HP Photosmart Bug Lets Remote Users Deny Service | Department of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

03: HP Photosmart Bug Lets Remote Users Deny Service 03: HP Photosmart Bug Lets Remote Users Deny Service U-203: HP Photosmart Bug Lets Remote Users Deny Service July 2, 2012 - 8:00am Addthis PROBLEM: HP Photosmart Bug Lets Remote Users Deny Service PLATFORM: HP Photosmart Wireless e-All-in-One Printer series - B110 HP Photosmart e-All-in-One Printer series - D110 HP Photosmart Plus e-All-in-One Printer series - B210 HP Photosmart eStation All-in-One Printer series - C510 HP Photosmart Ink Advantage e-All-in-One Printer series - K510 HP Photosmart Premium Fax e-All-in-One Printer series - C410 ABSTRACT: A vulnerability was reported in HP Photosmart. A remote user can cause denial of service conditions. Reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027213 CVE-2012-2017 IMPACT ASSESSMENT: High Discussion:

98

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

DOE Patents (OSTI)

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

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

2008-06-03T23:59:59.000Z

99

RIT's HP Indigo Substrate Certification Program enables substrate manufacturers, suppli-ers, and HP Indigo digital press owners to evaluate substrate compatibility with HP Indigo  

E-Print Network (OSTI)

and background areas of the previously printed image. Blanket-temperature operating window ­ the ability of the substrate to perform through a wide ranges of blanket temperatures. The wider the blanket temperature range will be published so HP Indigo users can develop awareness of approved ma- terials and buying sources. Certification

Zanibbi, Richard

100

Effect of Single-Site Mutations on HP Lattice Proteins  

SciTech Connect

We developed a heuristic method for determining the ground-state degeneracy of hydrophobic-polar (HP) lattice proteins, based on Wang-Landau and multicanonical sampling. It is applied during comprehensive studies of single-site mutations in specific HP proteins with different sequences. The effects in which we are interested include structural changes in ground-states, changes of ground-state energy, degeneracy, and thermodynamic properties of the system. With respect to mutations, both extremely sensitive and insensitive positions in the HP sequence have been found. That is, ground state energies and degeneracies, as well as other thermodynamic and structural quantities may be either largely unaffected or may change significantly due to mutation.

Shi, Guangjie [University of Georgia, Athens, GA; Vogel, Thomas [Los Alamos National Laboratory (LANL); Wuest, Thomas [Swiss Federal Research Institute, Switzerland; Li, Ying Wai [ORNL; Landau, David P [University of Georgia, Athens, GA

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


101

Wireless sensor node localization  

Science Journals Connector (OSTI)

...need to be asymmetrical, with small, passive sensor nodes listening for signals from one or more larger transmitters. The fact...is dropping. For example, the $600 MEMS-based analogue device ADIS16360 unit has a tri-axis accelerometer and a tri-axis...

2012-01-01T23:59:59.000Z

102

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary 208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code U-208: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code July 10, 2012 - 7:00am Addthis PROBLEM: HP Operations Agent Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Operations Agent for AIX, HP-UX, Linux, Solaris, and Windows prior to v11.03.12. ABSTRACT: Two vulnerabilities were reported in HP Operations Agent. A remote user can execute arbitrary code on the target system reference LINKS: The Vendor's Advisory SecurityTracker Alert ID: 1027225 CVE-2012-2019 CVE-2012-2020 IMPACT ASSESSMENT: High Discussion: Potential security vulnerabilities have been identified with HP Operations Agent for AIX, HP-UX, Linux, Solaris, and Windows. The vulnerabilities could be remotely exploited resulting in the execution of arbitrary code.

103

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: HP Performance Manager Unspecified Bug Lets Remote Users 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 30, 2012 - 9:15am Addthis PROBLEM: HP Performance Manager Unspecified Bug Lets Remote Users Execute Arbitrary Codes PLATFORM: HP-UX B.11.31 HP-UX B.11.23 ABSTRACT: A remote user can execute arbitrary code on the target system. REFERENCE LINKS: HP Support Document ID: c03255321 SecurityTracker Alert ID: 1026869 CVE-2012-0127 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified with HP Performance Manager running on HP-UX, Linux, Solaris, and Windows. The vulnerability could be exploited remotely to execute arbitrary code and to create a Denial of Service (DoS).

104

T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Virtual Server Environment Lets Remote Authenticated 8: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges T-608: HP Virtual Server Environment Lets Remote Authenticated Users Gain Elevated Privileges April 22, 2011 - 7:47am Addthis PROBLEM: A vulnerability was reported in HP Virtual Server Environment. A remote authenticated user can obtain elevated privileges on the target system. PLATFORM: HP Virtual Server Environment prior to v6.3 ABSTRACT: A potential security vulnerability has been identified in HP Virtual Server Environment for Windows. The vulnerability could be exploited remotely to elevate privileges. reference LINKS: HP Document ID: c02749050 SecurityTracker Alert ID: 1025429 CVE-2011-1724 HP Insight Software media set 6.3 HP Technical Knowledge Base Discussion: System management and security procedures must be reviewed frequently to

105

Final report for the mobile node authentication LDRD project.  

SciTech Connect

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

106

Mobility and cooperation to thwart node capture attacks in MANETs  

Science Journals Connector (OSTI)

The nature of mobile ad hoc networks (MANETs), often unattended, makes this type of networks subject to some unique security issues. In particular, one of the most vexing problem for MANETs security is the node capture attack: an adversary can capture ...

Mauro Conti; Roberto Di Pietro; Luigi V. Mancini; Alessandro Mei

2009-02-01T23:59:59.000Z

107

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

108

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

44: HP Operations Agent and Performance Agent Lets Local Users 44: 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 Directory November 23, 2011 - 8:00am Addthis PROBLEM: HP Operations Agent and Performance Agent Lets Local Users Access a Restricted Directory. PLATFORM: HP Operations Agent v11.00 and Performance Agent v4.73, v5.0 for AIX, HP-UX, Linux, and Solaris ABSTRACT: A local user can access a directory on the target system. reference LINKS: HP Security Bulletin Document ID: c03091656 CVE-2011-4160 SecurityTracker Alert ID: 1026345 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP Operations Agent and Performance Agent. A local user can access data on the target system. A local user can gain

109

V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP Performance Insight Bugs with Sybase Database Let Remote 6: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System V-016: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System November 5, 2012 - 6:00am Addthis PROBLEM: HP Performance Insight Bugs with Sybase Database Let Remote Users Deny Service and Take Full Control of the Target System PLATFORM: HP Performance Insight v5.31, v5.40 and v5.41 running on HP-UX, Solaris, Linux, and Windows and using Sybase as the database ABSTRACT: Two vulnerabilities were reported in HP Performance Insight. REFERENCE LINKS: HP Support Document ID: c03555488 SecurityTracker Alert ID: 1027719 CVE-2012-3269 CVE-2012-3270 IMPACT ASSESSMENT: High DISCUSSION:

110

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

643: HP OpenView Storage Data Protector Unspecified Code 643: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability T-643: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability June 9, 2011 - 3:45pm Addthis PROBLEM: HP OpenView Storage Data Protector Unspecified Code Execution Vulnerability PLATFORM: Versions 6.0, 6.10, and 6.11 running on HP-UX, Solaris, Linux and Windows. ABSTRACT: A vulnerability has been reported in HP OpenView Storage Data Protector, which can be exploited by malicious people to compromise a vulnerable system. reference LINKS: Secunia Advisory SA44884 CVE-2011-1864 SecurityTracker Alert ID: 1025620 HP Document ID: c02712867 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP OpenView Storage Data Protector. A remote user can execute arbitrary code on the target system.

111

U-048: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update  

NLE Websites -- All DOE Office Websites (Extended Search)

8: HP LaserJet Printers Unspecified Flaw Lets Remote Users 8: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update Firmware with Arbitrary Code U-048: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update Firmware with Arbitrary Code November 30, 2011 - 8:15am Addthis PROBLEM: HP LaserJet Printers Unspecified Flaw Lets Remote Users Update Firmware with Arbitrary Code . PLATFORM: HP LaserJet Printers manufactured prior to 2009 ABSTRACT A remote user can upgrade the printer's firmware with arbitrary code. reference LINKS: SecurityTracker Alert ID:1026357 HP Security for Imaging and Printing HP Clarifies on Printer Security IMPACT ASSESSMENT: Low Discussion: A vulnerability was reported in some HP LaserJet Printers. A remote user can update the firmware with arbitrary code. A remote user can send a specially crafted print job or specially crafted data to the

112

U-158: HP NonStop Server Java Multiple Vulnerabilities | Department of  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP NonStop Server Java Multiple Vulnerabilities 8: HP NonStop Server Java Multiple Vulnerabilities U-158: HP NonStop Server Java Multiple Vulnerabilities April 30, 2012 - 7:00am Addthis PROBLEM: HP NonStop Server Java Multiple Vulnerabilities PLATFORM: HP NonStop Server 6.x ABSTRACT: Multiple vulnerabilities have been reported in HP NonStop Server Reference links: Secunia Advisory SA48977 CVE-2011-3547 CVE-2011-3551 CVE-2011-3553 IMPACT ASSESSMENT: High Discussion: HP has acknowledged multiple vulnerabilities in HP NonStop Server, which can be exploited by malicious users to disclose sensitive information and by malicious people to disclose sensitive information, manipulate certain data, cause a DoS (Denial of Service), and compromise a vulnerable system. Impact: Successful exploitation of this vulnerability may allow remote manipulation

113

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

8: HP Service Manager Input Validation Flaw Permits Cross-Site 8: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks August 17, 2012 - 7:00am Addthis PROBLEM: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 7.11, 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 to inject arbitrary web script or HTML via unspecified vectors. REFERENCE LINKS: www2.hp.com http://www.securitytracker.com/id/1027399 CVE-2012-3251 IMPACT ASSESSMENT: Moderate Discussion: A vulnerability was reported in HP Service Manager. A remote user can conduct cross-site scripting attacks. The software does not properly filter

114

U-095: HP Data Protector Media Operations Lets Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP Data Protector Media Operations Lets Remote Users Execute 5: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code U-095: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code February 3, 2012 - 1:33am Addthis PROBLEM: HP Data Protector Media Operations Lets Remote Users Execute Arbitrary Code PLATFORM: Windows (2003, XP, 2008), HP Data Protector Media Operations version 6.11 and earlier ABSTRACT: Remote execution of arbitrary code reference LINKS: SecurityTracker Alert ID: 1026626 HP Support Center Document ID: c03179046 CVE-2011-4791 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP Data Protector Media Operations. A remote user can execute arbitrary code on the target system. Information on CVSS is documented in HP Customer Notice: HPSN-2008-002. Impact:

115

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP Diagnostics Input Validation Hole Permits Cross-Site 0: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks March 29, 2011 - 3:05pm Addthis PROBLEM: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks in ActiveSync Lets Remote Users Execute Arbitrary Code. PLATFORM: HP Diagnostics software: version(s) 7.5, 8.0 prior to 8.05.54.225 ABSTRACT: A potential security vulnerability has been identified in HP Diagnostics. The vulnerability could be exploited remotely resulting in cross site scripting (XSS). reference LINKS: HP Document ID: c02770512 SecurityTracker Alert ID: 1025255 CVE-2011-0892 Security Focus Document ID: c02770512 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP Diagnostics. A remote user can conduct

116

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: HP MFP Digital Sending Software Lets Local Users Obtain 7: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information U-017: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information October 24, 2011 - 12:30pm Addthis PROBLEM: HP MFP Digital Sending Software Lets Local Users Obtain Potentially Sensitive Information . PLATFORM: HP MFP Digital Sending Software v4.91.21 and all previous 4.9x versions ABSTRACT: A vulnerability was reported in HP MFP Digital Sending Software. A local user can obtain potentially sensitive information. reference LINKS: HP Advisory ID: c03052686 SecurityTracker Alert ID: 1026228 CVE-2011-3163 IMPACT ASSESSMENT: Medium Discussion: A potential security vulnerability has been identified with HP MFP Digital Sending Software running on Windows. The vulnerability could result in

117

T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

T-538: HP OpenView Storage Data Protector Bug Lets Remote Users T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code T-538: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code January 20, 2011 - 6:39am Addthis PROBLEM: HP OpenView Storage Data Protector Bug Lets Remote Users Execute Arbitrary Code. PLATFORM: HP OpenView Storage Data Protector v6.11 ABSTRACT: A vulnerability was reported in HP OpenView Storage Data Protector. A remote user can execute arbitrary code on the target system. reference LINKS: HP Security Bulletin SecurityTracker Alert ID: 1024983 CVE-2011-0273 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified with HP OpenView Storage Data Protector. The vulnerability could be remotely exploited to execute arbitrary code.

118

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

38: HP Service Manager Input Validation Flaw Permits Cross-Site 38: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks U-238: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks August 17, 2012 - 7:00am Addthis PROBLEM: HP Service Manager Input Validation Flaw Permits Cross-Site Scripting Attacks PLATFORM: Version(s): 7.11, 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 to inject arbitrary web script or HTML via unspecified vectors. REFERENCE LINKS: www2.hp.com http://www.securitytracker.com/id/1027399 CVE-2012-3251 IMPACT ASSESSMENT: Moderate Discussion: A vulnerability was reported in HP Service Manager. A remote user can conduct cross-site scripting attacks. The software does not properly filter

119

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP Diagnostics Input Validation Hole Permits Cross-Site 0: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks T-590: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks March 29, 2011 - 3:05pm Addthis PROBLEM: HP Diagnostics Input Validation Hole Permits Cross-Site Scripting Attacks in ActiveSync Lets Remote Users Execute Arbitrary Code. PLATFORM: HP Diagnostics software: version(s) 7.5, 8.0 prior to 8.05.54.225 ABSTRACT: A potential security vulnerability has been identified in HP Diagnostics. The vulnerability could be exploited remotely resulting in cross site scripting (XSS). reference LINKS: HP Document ID: c02770512 SecurityTracker Alert ID: 1025255 CVE-2011-0892 Security Focus Document ID: c02770512 IMPACT ASSESSMENT: High Discussion: A vulnerability was reported in HP Diagnostics. A remote user can conduct

120

U-087: HP-UX update for Java | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: HP-UX update for Java 7: HP-UX update for Java U-087: HP-UX update for Java January 24, 2012 - 7:00am Addthis PROBLEM: HP issued an update for Java in HP-UX to address multiple vulnerabilities. PLATFORM: HP-UX 11.x ABSTRACT: Multiple vulnerabilities can be exploited by malicious users to disclose certain information and by malicious people to disclose potentially sensitive information. reference LINKS: Secunia Advisory 47709 Secunia Advisory 46512 HP Support Document IMPACT ASSESSMENT: High Discussion: The vulnerabilities are reported in versions B.11.11, B.11.23, and B.11.31 running HP JDK and JRE 6.0.12 and prior. Vulnerabilities inlcude the ability to hijack a user's session, conduct DNS cache poisoning attacks, manipulate certain data, cause a DoS (Denial of Service), and compromise 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.


121

Perlick: ENERGY STAR Referral (HP72ROO-S) | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Perlick: ENERGY STAR Referral (HP72ROO-S) February 8, 2011 DOE referred Perlick refrigerator HP72ROO-S to EPA, brand manager of the ENERGY STAR program, for appropriate action...

122

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

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

123

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

124

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

actions on the site acting as the target user. Solution: HP has provided HP Diagnostics patch version 8.05.54.225 to resolve the vulnerability. This patch can be obtained by...

125

High-pressure synthesis and crystal structure of the lithium borate HP-LiB{sub 3}O{sub 5}  

SciTech Connect

The new lithium borate HP-LiB{sub 3}O{sub 5} was synthesized under high-pressure/high-temperature conditions of 6 GPa and 1050 deg. C in a multianvil press with a Walker-type module. The compound crystallizes in the space group Pnma (no. 62) with the lattice parameters a=829.7(2), b=759.6(2), and c=1726.8(4) pm (Z=16). The high-pressure compound HP-LiB{sub 3}O{sub 5} is built up from a three-dimensional network of BO{sub 4} tetrahedra and BO{sub 3} groups, which incorporates Li{sup +} ions in channels along the b-axis. Band assignments of measured IR- and Raman spectra were done via quantum-mechanical calculations. Additionally, the thermal behavior of HP-LiB{sub 3}O{sub 5} was investigated. - Graphical abstract: The new high-pressure compound HP-LiB{sub 3}O{sub 5} is built up from a three-dimensional network of BO4 tetrahedra and BO{sub 3} groups, which incorporates Li{sup +} ions in channels along the b-axis. In this paper, the synthesis, the crystal structure, and the properties of HP-LiB{sub 3}O{sub 5} are described. Highlights: > Synthesis of a new lithium borate with the composition HP-LiB{sub 3}O{sub 5} at high pressure. > In contrast to the non-centrosymmetric phase LiB{sub 3}O{sub 5}, this high-pressure phase is centrosymmetric. > First example of ternary alkali borates exhibiting threefold bridging oxygen atoms.

Neumair, Stephanie C.; Vanicek, Stefan [Institut fuer Allgemeine, Anorganische und Theoretische Chemie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52a, A-6020 Innsbruck (Austria); Kaindl, Reinhard; Toebbens, Daniel M. [Institut fuer Mineralogie und Petrographie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52, A-6020 Innsbruck (Austria); Wurst, Klaus [Institut fuer Allgemeine, Anorganische und Theoretische Chemie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52a, A-6020 Innsbruck (Austria); Huppertz, Hubert, E-mail: Hubert.Huppertz@uibk.ac.at [Institut fuer Allgemeine, Anorganische und Theoretische Chemie, Leopold-Franzens-Universitaet Innsbruck, Innrain 52a, A-6020 Innsbruck (Austria)

2011-09-15T23:59:59.000Z

126

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

127

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.

128

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.

129

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

130

Mao of HP-CAT Awarded Aminoff Prize in Crystallography  

NLE Websites -- All DOE Office Websites (Extended Search)

Mao of HP-CAT Awarded Aminoff Prize in Crystallography Mao of HP-CAT Awarded Aminoff Prize in Crystallography The Royal Swedish Academy of Sciences has awarded David H. Mao of the Geophysical Laboratory the Gregori Aminoff Prize in Crystallography 2005 "for pioneering research of materials at ultrahigh pressures and temperatures." Dr. Mao is the Director of the High Pressure Collaborative Access Team, which manages the beamlines at Advanced Photon Source (APS) sector 16. Named after Gregori Aminoff, the pioneering Swedish crystallographer, the prize is given annually to recognized scientists, or to a group of no more than three persons of international distinction, who have made a major contribution to crystallography. David H. Mao showing a panoramic high-pressure diamond-anvil cell to Murray Gibson

131

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

132

Network  

NLE Websites -- All DOE Office Websites (Extended Search)

Network Network Facts & Stats Engineering Services The Network Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet Site Availabiliy OSCARS Fasterdata...

133

NUG Single Node Optimization Presentation.  

NLE Websites -- All DOE Office Websites (Extended Search)

Node Optimization on Hopper Michael Stewart, NERSC Introduction Why are there so many compilers available on Hopper? Strengths and weaknesses of each compiler. Advice...

134

U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP StorageWorks File Migration Agent Buffer Overflows Let 6: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code July 19, 2012 - 7:14am Addthis PROBLEM: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code PLATFORM: HP StorageWorks File Migration Agent ABSTRACT: Two vulnerabilities were reported in HP StorageWorks File Migration Agent. reference LINKS: SecurityTracker Alert ID: 1027281 ZDI-12-127 ZDI-12-126 IMPACT ASSESSMENT: High Discussion: The vulnerability allows remote attackers to execute arbitrary code on vulnerable installations of HP StorageWorks File Migration Agent. Authentication is not required to exploit this vulnerability. 1. (ZDI-12-127) The specific flaw exists within the HsmCfgSvc.exe service

135

U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-216: HP StorageWorks File Migration Agent Buffer Overflows Let U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code U-216: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code July 19, 2012 - 7:14am Addthis PROBLEM: HP StorageWorks File Migration Agent Buffer Overflows Let Remote Users Execute Arbitrary Code PLATFORM: HP StorageWorks File Migration Agent ABSTRACT: Two vulnerabilities were reported in HP StorageWorks File Migration Agent. reference LINKS: SecurityTracker Alert ID: 1027281 ZDI-12-127 ZDI-12-126 IMPACT ASSESSMENT: High Discussion: The vulnerability allows remote attackers to execute arbitrary code on vulnerable installations of HP StorageWorks File Migration Agent. Authentication is not required to exploit this vulnerability.

136

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

NLE Websites -- All DOE Office Websites (Extended Search)

HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External Power Supplies Hewlett-Packard Company (HP) appreciates the opportunity to comment on the new DOE rulemaking for Battery Chargers and External Power Supplies. Thank you for taking the time to speak with us. HP believes that existing voluntary Market Access Requirements, such as EPEAT and ENERGY STAR, are the most effective mechanism for improving energy efficiency of IT products, but we understand the approach of regulating mandatory minimum efficiencies to address poor performing products. HP_Ex_Parte_Memo.pdf More Documents & Publications HP Ex Parte Memo on Proposed Rulemaking for Battery Chargers and External

137

U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

42: HP Onboard Administrator Bugs Let Remote Users Gain Access, 42: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks April 6, 2012 - 7:00am Addthis PROBLEM: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks PLATFORM: HP Onboard Administrator (OA) up to and including v3.32 ABSTRACT: A remote user can obtain potentially sensitive information. reference LINKS: HP Support Document ID: c03263573 SecurityTracker Alert ID: 1026889 CVE-2012-0128, CVE-2012-0129, CVE-2012-0130 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Onboard Administrator. A remote

138

U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

2: HP Onboard Administrator Bugs Let Remote Users Gain Access, 2: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks U-142: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks April 6, 2012 - 7:00am Addthis PROBLEM: HP Onboard Administrator Bugs Let Remote Users Gain Access, Obtain Information, and Conduct URL Redirection Attacks PLATFORM: HP Onboard Administrator (OA) up to and including v3.32 ABSTRACT: A remote user can obtain potentially sensitive information. reference LINKS: HP Support Document ID: c03263573 SecurityTracker Alert ID: 1026889 CVE-2012-0128, CVE-2012-0129, CVE-2012-0130 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Onboard Administrator. A remote

139

U-071:HP Database Archiving Software Bugs Let Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1:HP Database Archiving Software Bugs Let Remote Users Execute 1:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code U-071:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code December 29, 2011 - 8:15am Addthis PROBLEM: HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Database Archiving Software v6.31 ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Database Document ID: c03128302 SecurityTracker Alert ID: 1026467 CVE-2011-4163 CVE-2011-4164 CVE-2011-4165 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Database Archiving Software. A remote user can execute arbitrary code on the target system. Impact: A remote user can execute arbitrary code on the target system. Solution:

140

U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0: HP-UX System Administration Manager Lets Local Users Gain 0: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges November 17, 2011 - 8:00am Addthis PROBLEM: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31; running Enterprise Mobility Suite (EMS) prior to A.04.20.11.04_01 ABSTRACT: A local user can obtain elevated privileges on the target system. reference LINKS: HP Support Center Document ID: c03089106 CVE-2011-4159 SecurityTracker Alert ID: 1026331 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP-UX System Administration Manager. A local user can obtain elevated privileges on the target system. A local user can gain full control of the target system.

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

U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

40: HP-UX System Administration Manager Lets Local Users Gain 40: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges U-040: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges November 17, 2011 - 8:00am Addthis PROBLEM: HP-UX System Administration Manager Lets Local Users Gain Elevated Privileges. PLATFORM: HP-UX B.11.11, B.11.23, B.11.31; running Enterprise Mobility Suite (EMS) prior to A.04.20.11.04_01 ABSTRACT: A local user can obtain elevated privileges on the target system. reference LINKS: HP Support Center Document ID: c03089106 CVE-2011-4159 SecurityTracker Alert ID: 1026331 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP-UX System Administration Manager. A local user can obtain elevated privileges on the target system. A local user can gain full control of the target system.

142

U-071:HP Database Archiving Software Bugs Let Remote Users Execute  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1:HP Database Archiving Software Bugs Let Remote Users Execute 1:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code U-071:HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code December 29, 2011 - 8:15am Addthis PROBLEM: HP Database Archiving Software Bugs Let Remote Users Execute Arbitrary Code PLATFORM: HP Database Archiving Software v6.31 ABSTRACT: A remote user can execute arbitrary code on the target system. reference LINKS: HP Database Document ID: c03128302 SecurityTracker Alert ID: 1026467 CVE-2011-4163 CVE-2011-4164 CVE-2011-4165 IMPACT ASSESSMENT: High Discussion: Several vulnerabilities were reported in HP Database Archiving Software. A remote user can execute arbitrary code on the target system. Impact: A remote user can execute arbitrary code on the target system. Solution:

143

Semantic associative network for text analysis (SANTA)  

E-Print Network (OSTI)

Based on theories of associations, the Semantic Associative Network for Text Analysis (SANTA) has been developed. Nodes in the network represent words and links between nodes represent the association strengths between them. The links are adjusted...

Airhart, Robert William

2012-06-07T23:59:59.000Z

144

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

35: HP WBEM Discloses Diagnostic Data to Remote and Local Users 35: HP WBEM Discloses Diagnostic Data to Remote and Local Users U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users March 28, 2012 - 7:00am Addthis PROBLEM: HP WBEM Discloses Diagnostic Data to Remote and Local Users PLATFORM: HP-UX 11.11, 11.23, and 11.31 ABSTRACT: Two vulnerabilities were reported in HP WBEM. A remote or local user can gain access to diagnostic data. REFERENCE LINKS: SecurityTracker Alert ID: 1026849 CVE-2012-0125 CVE-2012-0126 iIMPACT ASSESSMENT Medium Discussion: A potential security vulnerability has been identified with certain HP-UX WBEM components. The vulnerability could be exploited remotely in HP-UX 11.11 and HP-UX 11.23 to gain unauthorized access to diagnostic data. The vulnerability could be exploited locally in HP-UX 11.31 to gain

145

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data V-210: HP LaserJet Pro Printer Bug Lets Remote Users Access Data August 3, 2013 - 2:37am Addthis PROBLEM: A vulnerability was reported in HP Printers. A remote user can obtain potentially sensitive information. PLATFORM: HP LaserJet Pro products ABSTRACT: A potential security vulnerability has been identified with certain HP LaserJet Pro printers. The vulnerability could be exploited remotely to gain unauthorized access to data. REFERENCE LINKS: SecurityTracker Alert ID 1028869 CVE-2013-4807 Vendor URL IMPACT ASSESSMENT: Medium DISCUSSION: The following models are affected: HP LaserJet Pro P1102w CE657A/CE658A HP LaserJet Pro P1606dn CE749A HP LaserJet Pro M1212nf MFP CE841A HP LaserJet Pro M1213nf MFP CE845A

146

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP WBEM Discloses Diagnostic Data to Remote and Local Users 5: HP WBEM Discloses Diagnostic Data to Remote and Local Users U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users March 28, 2012 - 7:00am Addthis PROBLEM: HP WBEM Discloses Diagnostic Data to Remote and Local Users PLATFORM: HP-UX 11.11, 11.23, and 11.31 ABSTRACT: Two vulnerabilities were reported in HP WBEM. A remote or local user can gain access to diagnostic data. REFERENCE LINKS: SecurityTracker Alert ID: 1026849 CVE-2012-0125 CVE-2012-0126 iIMPACT ASSESSMENT Medium Discussion: A potential security vulnerability has been identified with certain HP-UX WBEM components. The vulnerability could be exploited remotely in HP-UX 11.11 and HP-UX 11.23 to gain unauthorized access to diagnostic data. The vulnerability could be exploited locally in HP-UX 11.31 to gain

147

Centdian computation for sensor networks  

Science Journals Connector (OSTI)

This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common The cactus network has important applications for wireless ... Keywords: cactus graph, centdian node, distributed algorithm, sensor network

Boaz Ben-Moshe; Amit Dvir; Michael Segal; Arie Tamir

2010-06-01T23:59:59.000Z

148

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP-UX Directory Server Discloses Passwords to Remote 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 29, 2013 - 12:32am Addthis PROBLEM: HP-UX Directory Server Discloses Passwords to Remote Authenticated and Local Users PLATFORM: Directory Server B.08.10.04 ABSTRACT: Two vulnerabilities were reported in HP-UX Directory Server. REFERENCE LINKS: HP Document ID: c03772083 SecurityTracker Alert ID: 1028593 CVE-2012-2678 CVE-2012-2746 IMPACT ASSESSMENT: High DISCUSSION: A local user can access the plaintext password in certain cases [CVE-2012-2678]. A remote authenticated user can can view the password for a target LDAP user when audit logging is enabled by reading the audit log [CVE-2012-2678].

149

T-588: HP Virtual SAN Appliance Stack Overflow | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

T-588: HP Virtual SAN Appliance Stack Overflow T-588: HP Virtual SAN Appliance Stack Overflow T-588: HP Virtual SAN Appliance Stack Overflow March 25, 2011 - 5:05pm Addthis PROBLEM: HP Virtual SAN Appliance Stack Overflow in 'hydra.exe' Lets Remote Users Execute Arbitrary Code. PLATFORM: HP StorageWorks P4000 Virtual SAN Appliance Software ABSTRACT: 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. reference LINKS: Secunia advisory 34782 SecurityTracker Alert ID: 1025249 ZDI-11-111 Bugtraq ID: 47005 IMPACT ASSESSMENT: High Discussion: Hewlett-Packard Virtual SAN Appliance is prone to a remote buffer-overflow vulnerability. Attackers may exploit this issue to execute arbitrary code within the context of the affected application. Failed exploit attempts may result in

150

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP Service Manager Bugs Permit Cross-Site Scripting and 6: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks V-146: HP Service Manager Bugs Permit Cross-Site Scripting and Information Disclosure Attacks May 1, 2013 - 12:43am Addthis PROBLEM: HP Service Manager Bugs Permit 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: HP Document ID: c03748875 SecurityTracker Alert ID: 1028496 CVE-2012-5222 CVE-2013-2321 IMPACT ASSESSMENT: Medium DISCUSSION: A remote user can obtain potentially sensitive information [CVE-2012-5222]. Service Manager Web Tier does not properly filter HTML code from user-supplied input before displaying the input [CVE-2013-2321]. A remote

151

V-203: HP LoadRunner Multiple Bugs Let Remote Users Deny Service and  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

3: HP LoadRunner Multiple Bugs Let Remote Users Deny Service 3: HP LoadRunner Multiple Bugs Let Remote Users Deny Service and Execute Arbitrary Code V-203: HP LoadRunner Multiple Bugs Let Remote Users Deny Service and Execute Arbitrary Code July 26, 2013 - 3:31am Addthis PROBLEM: A remote user can execute arbitrary code on the target system. A remote user can cause denial of service conditions. PLATFORM: HP LoadRunner prior to 11.52 ABSTRACT: Multiple vulnerabilities were reported in HP LoadRunner. REFERENCE LINKS: Security Tracker Alert ID: 1028833 CVE-2013-2368 CVE-2013-2369 CVE-2013-2370 CVE-2013-4797 CVE-2013-4798 CVE-2013-4799 CVE-2013-4800 CVE-2013-4801 IMPACT ASSESSMENT: Medium DISCUSSION: Potential security vulnerabilities have been identified with HP LoadRunner. The vulnerabilities could be remotely exploited to allow execution of code

152

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

7: Potential security vulnerability has been identified with 7: Potential security vulnerability has been identified with certain HP printers and HP digital senders U-117: Potential security vulnerability has been identified with certain HP printers and HP digital senders March 5, 2012 - 7:00am Addthis PROBLEM: The vulnerability could be exploited remotely to install unauthorized printer firmware. PLATFORM: Select HP printers and Digital Senders ABSTRACT: Remote attackers could execute arbitrary code by using a session on TCP port 9100 to upload a crafted firmware update. reference LINKS: Vendor Advisory CVE-2011-4161 Previous JC3 Advisory Bulletin IMPACT ASSESSMENT: High Discussion: The default configuration of the HP CM8060 Color MFP with Edgeline; Color LaserJet 3xxx, 4xxx, 5550, 9500, CMxxxx, CPxxxx, and Enterprise CPxxxx;

153

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP IBRIX X9000 Storage Discloses Information to Remote Users 5: HP IBRIX X9000 Storage Discloses Information to Remote Users U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users October 5, 2012 - 6:00am Addthis PROBLEM: HP IBRIX X9000 Storage Discloses Information to Remote Users PLATFORM: Version(s): IBRIX X9000; 6.1.196, 6.1.210, 6.1.228, 6.1.243, 6.1.247, 6.1.249, 6.1.251 ABSTRACT: A potential security vulnerability has been identified with HP IBRIX X9000 Storage. The vulnerability could be remotely exploited to allow disclosure of information. reference LINKS: HP Security Bulletin: c03510876 SecurityTracker Alert ID: 1027590 CVE-2012-3266 IMPACT ASSESSMENT: Medium Discussion: A remote user can create a specially crafted JLS-compressed image file that, when loaded by the target user, will trigger a heap overflow in the

154

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

0:HP Onboard Administrator Unspecified Flaw Lets Remote Users 0:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access U-010:HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access October 13, 2011 - 8:15am Addthis PROBLEM: HP Onboard Administrator Unspecified Flaw Lets Remote Users Gain Access PLATFORM: Onboard Administrator (OA) 3.21 through 3.31 ABSTRACT: A remote user can gain access to the target system reference LINKS: HP Support document ID: c03048779 SecurityTracker Alert ID: 1026158 CVE-2011-3155 IMPACT ASSESSMENT: Medium Discussion: A potential security vulnerability has been identified with HP Onboard Administrator (OA). The vulnerability could be exploited remotely to gain unauthorized access. Impact: A remote user can gain access to the target system. Solution: Onboard Administrator (OA) v3.32 is available.

155

V-010: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

10: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote 10: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take Administrative Actions V-010: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take Administrative Actions October 25, 2012 - 6:00am Addthis PROBLEM: 3Com, HP, and H3C Switches SNMP Configuration Lets Remote Users Take Administrative Actions PLATFORM: 3COM, and H3C Routers & Switches Specific products and model numbers is provided in the vendor's advisory. ABSTRACT: A vulnerability was reported in 3Com, HP, and H3C Switches. REFERENCE LINKS: HP Support document ID: c03515685 SecurityTracker Alert ID: 1027694 CVE-2012-3268 IMPACT ASSESSMENT: High DISCUSSION: A remote user with knowledge of the SNMP public community string can access potentially sensitive data (e.g., user names, passwords) in the

156

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP IBRIX X9000 Storage Discloses Information to Remote Users 5: HP IBRIX X9000 Storage Discloses Information to Remote Users U-275: HP IBRIX X9000 Storage Discloses Information to Remote Users October 5, 2012 - 6:00am Addthis PROBLEM: HP IBRIX X9000 Storage Discloses Information to Remote Users PLATFORM: Version(s): IBRIX X9000; 6.1.196, 6.1.210, 6.1.228, 6.1.243, 6.1.247, 6.1.249, 6.1.251 ABSTRACT: A potential security vulnerability has been identified with HP IBRIX X9000 Storage. The vulnerability could be remotely exploited to allow disclosure of information. reference LINKS: HP Security Bulletin: c03510876 SecurityTracker Alert ID: 1027590 CVE-2012-3266 IMPACT ASSESSMENT: Medium Discussion: A remote user can create a specially crafted JLS-compressed image file that, when loaded by the target user, will trigger a heap overflow in the

157

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

NLE Websites -- All DOE Office Websites (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...

158

LBN: Load-Balancing Network for Data Gathering Wireless Sensor Networks  

Science Journals Connector (OSTI)

Hotspots of energy consumption and network congestions can be caused by load imbalance among sensor nodes in wireless sensor networks. This may lead to loss of data packets and premature death of sensor nodes ......

Wenlu Yang; Chongqing Zhang; Minglu Li

2006-01-01T23:59:59.000Z

159

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

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

Articles U-135: HP WBEM Discloses Diagnostic Data to Remote and Local Users U-200: Red Hat Directory Server Information Disclosure Security Issue and Vulnerability T-692:...

160

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

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

Integrating real-time hybrid task scheduling into a sensor node platform  

Science Journals Connector (OSTI)

In general, two different types of low-end sensor node platforms are currently considered: event driven and multi-tasking operating systems. It is commonly assumed that event driven operating systems are more suited to WSN (Wireless Sensor Networks) ... Keywords: hybrid task sets, scheduling, sensor node platform

Taehoon Kim; Bora Kang; E. K. Park; Sungwoo Tak

2010-03-01T23:59:59.000Z

162

Two from HP-CAT win Balzan Prize  

NLE Websites -- All DOE Office Websites (Extended Search)

HPCAT HPCAT Two from HP-CAT win Balzan Prize Russell J. Hemley and Ho-kwang (David) Mao (both Carnegie Institution of Washington/Carnegie/DOE Alliance Center and the High-Pressure Collaborative Access Team, APS sector 16) are recipients of the 2005 International Balzan Foundation Prize for Mineral Physics. The foundation, which is based in Milan, Italy, made the award "For the impressive impact of their joint work leading to fundamental breakthroughs, theoretical and experimental, in the field of minerals submitted to extreme physical conditions. They have operated as a highly effective team, characterized by twenty years of research contributions at the highest level. They have developed techniques which allow them to study the behaviour of a wide range of materials, such as hydrogen, the most abundant "mineral" in

163

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

164

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

165

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

166

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

167

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

168

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

169

On the Connectivity Analysis over Large-Scale Hybrid Wireless Networks  

E-Print Network (OSTI)

are hybrid networks which include infrastructure nodes in multi-hop wireless networks, such as sinks nodes. hybrid networks which include infrastructure nodes in multi- hop wireless networks, such as sinksOn the Connectivity Analysis over Large-Scale Hybrid Wireless Networks Chi Yi and Wenye Wang

Wang, Wenye

170

An On-Demand Energy-Efficient Routing Algorithm for Wireless Ad Hoc Networks  

Science Journals Connector (OSTI)

Ad hoc networks are non-infrastructure networks which consist of mobile nodes. Since the mobile nodes have limited battery power, it is very important to use energy efficiently in ad hoc networks. In order ... ro...

Hong-Ryeol Gil; Joon Yoo; Jong-Won Lee

2003-01-01T23:59:59.000Z

171

U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute Arbitrary  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute Arbitrary Code U-140: HP-UX Unspecified Flaw in DCE Lets Remote Users Execute Arbitrary Code April 4, 2012 - 7:15am Addthis PROBLEM: A vulnerability was reported in HP-UX PLATFORM: Version(s): 11.11, 11.23; running DCE ABSTRACT: A remote user can execute arbitrary code on the target system. A remote user can send specially crafted data to execute arbitrary code on the target system. The code will run with the privileges of the target service. Reference LINKS: Vendor Advisory Security Tracker ID 1026885 CVE-2012-0131 IMPACT ASSESSMENT: High Discussion: A potential security vulnerability has been identified in HP-UX running DCE. The vulnerability could be exploited remotely to create a Denial of Service (DoS).

172

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1: HP System Management Homepage Bugs Let Remote Users Deny 1: 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: A vulnerability was reported in HP System Management Homepage. PLATFORM: Version(s): prior to 7.1.1 ABSTRACT: The vulnerabilities could be exploited remotely resulting in unauthorized access, disclosure of information, data modification, Denial of Service (DoS), and execution of arbitrary code. Reference links: Original Advisory Security Tracker ID 1027209 CVE-2012-2012, CVE-2012-2013, CVE-2012-2014 CVE-2012-2015, CVE-2012-2016 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP System Management Homepage. A remote authenticated user can gain elevated privileges. A remote authenticated

173

Seven health physics calculator programs for the HP-41CV  

SciTech Connect

Several user-oriented programs for the Hewlett-Packard HP-41CV are explained. The first program builds, stores, alters, and ages a list of radionuclides. This program only handles single- and double-decay chains. The second program performs convenient conversions for the six nuclides of concern in plutonium handling. The conversions are between mass, activity, and weight percents of the isotopes. The source can be aged and/or neutron generation rates can be computed. The third program is a timekeeping program that improves the process of manually estimating and tracking personnel exposure during high dose rate tasks by replacing the pencil, paper, and stopwatch method. This program requires a time module. The remaining four programs deal with computations of time-integrated air concentrations at various distances from an airborne release. Building wake effects, source depletion by ground deposition, and sector averaging can all be included in the final printout of the X/Q - Hanford and X/Q - Pasquill programs. The shorter versions of these, H/Q and P/Q, compute centerline or sector-averaged values and include a subroutine to facilitate dose estimation by entering dose factors and quantities released. The horizontal and vertical dispersion parameters in the Pasquill-Gifford programs were modeled with simple, two-parameter functions that agreed very well with the usual textbook graphs. 8 references, 7 appendices.

Rittmann, P.D.

1984-08-01T23:59:59.000Z

174

V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to 1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems April 24, 2013 - 1:06am Addthis PROBLEM: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems PLATFORM: HP ElitePad 900 with BIOS version vF.00 ABSTRACT: A vulnerability was reported in HP ElitePad 900 REFERENCE LINKS: HP Document ID: c03727435 SecurityTracker Alert ID: 1028461 CVE-2012-5218 IMPACT ASSESSMENT: Medium DISCUSSION: The BIOS secure boot feature of the BIOS may not be enabled. A local user may be able to bypass the secure boot feature and boot an alternate operating system. IMPACT: A local user can may be able to boot to an alternate operating system. SOLUTION:

175

V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to 1: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems V-141: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems April 24, 2013 - 1:06am Addthis PROBLEM: HP ElitePad 900 Secure Boot Bug Lets Local Users Boot to Other Operating Systems PLATFORM: HP ElitePad 900 with BIOS version vF.00 ABSTRACT: A vulnerability was reported in HP ElitePad 900 REFERENCE LINKS: HP Document ID: c03727435 SecurityTracker Alert ID: 1028461 CVE-2012-5218 IMPACT ASSESSMENT: Medium DISCUSSION: The BIOS secure boot feature of the BIOS may not be enabled. A local user may be able to bypass the secure boot feature and boot an alternate operating system. IMPACT: A local user can may be able to boot to an alternate operating system. SOLUTION:

176

V-226: HP StoreOnce D2D Backup Systems Denial of Service Vulnerability |  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

6: HP StoreOnce D2D Backup Systems Denial of Service 6: HP StoreOnce D2D Backup Systems Denial of Service Vulnerability V-226: HP StoreOnce D2D Backup Systems Denial of Service Vulnerability August 24, 2013 - 3:45am Addthis PROBLEM: A vulnerability has been reported in HP StoreOnce D2D Backup Systems, which can be exploited by malicious people to cause a DoS (Denial of Service). PLATFORM: HP StoreOnce D2D Backup Systems 1.x, HP StoreOnce D2D Backup Systems 2.x ABSTRACT: The vulnerability is reported in versions 2.2.18 and prior and 1.2.18 and prior. REFERENCE LINKS: Secunia Advisory SA54598 CVE-2013-2353 IMPACT ASSESSMENT: Moderate DISCUSSION: A vulnerability has been reported in HP StoreOnce D2D Backup Systems, which can be exploited by malicious people to cause a DoS (Denial of Service). The vulnerability is caused due to an unspecified error. No further

177

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

178

Computer Networking Group | Stanford Synchrotron Radiation Lightsource  

NLE Websites -- All DOE Office Websites (Extended Search)

Networking Group Networking Group Do you need help? For assistance please submit a CNG Help Request ticket. CNG Logo Chris Ramirez SSRL Computer and Networking Group Manager (650) 926-2901 | email Jerry Camuso SSRL Computer and Networking (650) 926-2994 | email Networking Support The Networking group provides connectivity and communications services for SSRL. The services provided by the Networking Support Group include: Local Area Network support for cable and wireless connectivity. Installation and maintenance of network printers and queues. Telephony installations and support. Printing Support The Networking group provides printer maintenance and support for SSRL Beamline Printers and plotters. The following models are supported: HP - Designjet large format plotters HP - Color and B/W Laserjet, Inkjet, Deskjet, Officejet

179

hp-FEM for Two-component Flows with Applications in Optofluidics.  

E-Print Network (OSTI)

??This thesis is concerned with the application of hp-adaptive finite element methods to a mathematical model of immiscible two-component flows. With the aim of simulating… (more)

Ronnås, Staffan

2012-01-01T23:59:59.000Z

180

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

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

the update from The HP Software Support Online (SSO). Addthis Related Articles V-171: Apple Safari Bugs Let Remote Users Execute Arbitrary Code and Conduct Cross-Site Scripting...

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

A TLD-O4B interfaced with HP-41CV  

Science Journals Connector (OSTI)

A TLD-O4B reader was interfaced with a HP-4lCV. The main characteristics of the interface are discussed and the software developed is reported. The software package permits the determination of individual cali...

P. Zaránd; B. Szabó

1986-03-01T23:59:59.000Z

182

Petri net based evaluation of energy consumption in wireless sensor nodes  

Science Journals Connector (OSTI)

Wireless Sensor Networks have proven their capability to deal with problems where wide and hardly accessible areas need to be monitored. Among the other systems there are also sensor networks in which nodes can voluntarily modify their positions to better ... Keywords: Environmental Monitoring, Fluid Stochastic Petri Nets, Power Consumption Modelling, Power-Aware Systems

Maurizio D'Arienzo; Mauro Iacono; Stefano Marrone; Roberto Nardone

2013-10-01T23:59:59.000Z

183

SiNode Systems | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

SiNode Systems SiNode Systems National Clean Energy Business Plan Competition 2013 31 likes SiNode Systems Northwestern University SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process. SiNode seeks to change the landscape for lithium-ion batteries so they can meet the demands of a wide range of industries, from consumer electronics to electric vehicles. SiNode technology uses a composite of silicon nano-particles and porous graphene, developed by Dr. Harold H. Kung at Northwestern University. SiNode's anodes offer dramatic energy capacity increases (3200 mAh/g vs.

184

SiNode Systems | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

SiNode Systems SiNode Systems National Clean Energy Business Plan Competition 2013 31 likes SiNode Systems Northwestern University SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process. SiNode seeks to change the landscape for lithium-ion batteries so they can meet the demands of a wide range of industries, from consumer electronics to electric vehicles. SiNode technology uses a composite of silicon nano-particles and porous graphene, developed by Dr. Harold H. Kung at Northwestern University. SiNode's anodes offer dramatic energy capacity increases (3200 mAh/g vs.

185

SiNode Systems | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

SiNode Systems SiNode Systems National Clean Energy Business Plan Competition 2013 31 likes SiNode Systems Northwestern University SiNode Systems is a battery materials venture developing silicon-graphene anodes for the next generation of lithium-ion batteries. SiNode anodes offer higher battery capacity and faster charging rates, all while being produced via a low cost solution chemistry-based manufacturing process. SiNode seeks to change the landscape for lithium-ion batteries so they can meet the demands of a wide range of industries, from consumer electronics to electric vehicles. SiNode technology uses a composite of silicon nano-particles and porous graphene, developed by Dr. Harold H. Kung at Northwestern University. SiNode's anodes offer dramatic energy capacity increases (3200 mAh/g vs.

186

Routing with a density-based probabilistic algorithm for mobile ad-hoc networks  

Science Journals Connector (OSTI)

Ad-hoc networks can operate even when there is a scarcity of network infrastructure. This research examines ad-hoc networks that have varying node densities. These environments can be found in areas struck by disasters to urban city environments. Mobile ... Keywords: Broadcast Management, Density Based Probabilistic Algorithm, Mobile Ad-Hoc Networks, Nodes Connectivity Management, Nodes Density

Hean-Loong Ong; Essam Natsheh; Tat-Chee Wan

2011-04-01T23:59:59.000Z

187

A modified algorithm for computing the upper-bound reliabilty of computer networks  

Science Journals Connector (OSTI)

This paper presents a modified algorithm to node elimination process for computing the upper-bound reliability of two-terminal networks. The algorithm has two technique; nodes removal and decomposition technique. The first technique is a modified algorithm ... Keywords: Computer networks, Network reliability, Networks decomposition, Nodes removal, The upper bound reliability

Y. B. Mahdy, A. Younes, M. A. Soliman, M. H. Abdellha

2005-01-01T23:59:59.000Z

188

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

189

Energy Consumption in Access Networks  

Science Journals Connector (OSTI)

We present a comparison of energy consumption of access networks. We consider passive optical networks, fiber to the node, point-to-point optical systems and WiMAX. Optical access...

Baliga, Jayant; Ayre, Robert; Sorin, Wayne V; Hinton, Kerry; Tucker, Rodney S

190

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

191

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

192

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

NLE Websites -- All DOE Office Websites (Extended Search)

Complexed Complexed Adsorbed HP1 HP1 L2 L7 L7 L7 L2 H3 H3 National Energy Research Scientific Computing Center 2011 Annual Report Ernest Orlando Lawrence Berkeley National Laboratory 1 Cyclotron Road, Berkeley, CA 94720-8148 This work was supported by the Director, Office of Science, Office of Advanced Scientific Computing Research of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. National Energy Research Scientific Computing Center 2011 Annual Report The Year in Perspective Research News New Mathematical Method Reveals Where Genes Switch On or Off Small Particles Have Big Impact Detailed Model Changes View of Ancient Climate Change A Better Way to Find Extreme Weather Events in Climate Modeling Data Turning Grass into Gas for Less Bubbles Help Break Energy Storage Record for Lithium-Air Batteries

193

Network  

NLE Websites -- All DOE Office Websites (Extended Search)

Site Feedback: info@es.net About ESnet A Nationwide Platform for Science Discovery The Energy Sciences Network (ESnet) is a high-performance, unclassified national network built to...

194

Improved Connectivity using Hybrid Uni/Omni-Directional Antennas in Sensor Networks  

E-Print Network (OSTI)

the capability of networks to be able to report sensed information. The ability of member nodes to communicate with each other and collectively report data largely depends on connectivity. Density of node deployment, the transmission radius of the antenna... and the communication paradigm employed has a significant effect on connectivity. A network deployment is said to be connected when every node within the network is capable of communicating, either via multi-hops or direct links to every other node in the network...

Kwon, Ji Heon

2008-05-27T23:59:59.000Z

195

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

196

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

197

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

198

E-Print Network 3.0 - acceptance organizational impact Sample...  

NLE Websites -- All DOE Office Websites (Extended Search)

Network Summary: network simply has too few nodes for organizational structuring decisions to have a significant impact... of organizational structuring. We describe a...

199

Resetting Bounding Nodes in Acquiring Spanish  

E-Print Network (OSTI)

This paper addresses the issue of whether L2 learners can reset parameters, by testing English speakers learning Spanish on their ability to reset the bounding node parameter. The bounding nodes are : IP and NP in English, CP and NP in Spanish...

Cebreiros, Ramiro

1996-01-01T23:59:59.000Z

200

Power-aware node-disjoint multipath source routing with low overhead in MANET  

Science Journals Connector (OSTI)

With the advance of wireless communication technologies, small-size and high-performance computing and communication devices like laptops and personal digital assistants are increasingly used in daily life. After the success of second generation mobile system, more interest was started in wireless communications. This interest had led to two types of the wireless networks such as infrastructure wireless network and infrastructure less wireless network, also called mobile ad hoc network (MANET). The research challenges in MANET are related to the routing, security, reliability, scalability, quality of services, internetworking, power consumption and multimedia applications. All the mobile nodes of MANET operate on the battery power; hence power consumption becomes an important issue in MANET. It proposes a power-aware node-disjoint multipath source routing (PNDMSR) for real-time traffic, which balances the node energy utilisation to increase the network lifetime. It takes the network congestion into account to reduce the routing delay across the network, and increases the reliability of the data packets reaching the destination.

M. Bheemalingaiah; M.M. Naidu; D. Sreenivasa Rao; G. Varaprasad

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.


201

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

202

The Node Monitoring Component of a Scalable Systems Software Environment  

SciTech Connect

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

203

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

SciTech Connect

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

204

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

205

U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users 5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code September 21, 2012 - 6:00am Addthis PROBLEM: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code PLATFORM: HP SiteScope v11.10, v11.11, v11.12 for Windows, Linux and Solaris ABSTRACT: A vulnerability was reported in HP SiteScope. reference LINKS: HP Security Bulletin Document ID: c03489683 SecurityTracker Alert ID: 1027547 CVE-2012-3259 CVE-2012-3260 CVE-2012-3261 CVE-2012-3262 CVE-2012-3263 CVE-2012-3264 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP SiteScope. A remote user can execute

206

U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users 5: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code U-265: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code September 21, 2012 - 6:00am Addthis PROBLEM: HP SiteScope Bugs in SiteScope SOAP Feature Let Remote Users Obtain Information and Execute Arbitrary Code PLATFORM: HP SiteScope v11.10, v11.11, v11.12 for Windows, Linux and Solaris ABSTRACT: A vulnerability was reported in HP SiteScope. reference LINKS: HP Security Bulletin Document ID: c03489683 SecurityTracker Alert ID: 1027547 CVE-2012-3259 CVE-2012-3260 CVE-2012-3261 CVE-2012-3262 CVE-2012-3263 CVE-2012-3264 IMPACT ASSESSMENT: Medium Discussion: A vulnerability was reported in HP SiteScope. A remote user can execute

207

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

E-Print Network (OSTI)

Numerical simulation of borehole acoustic logging in the frequency and time domains with hp elasticity Coupled problems hp-adaptive finite elements a b s t r a c t Accurate numerical simulation physical modeling combined with accurate and efficient numerical dis- cretization and solution techniques

Torres-Verdín, Carlos

208

Evolving networks with bimodal degree distribution  

Science Journals Connector (OSTI)

Networks with bimodal degree distribution are most robust to targeted and random attacks. We present a model for constructing a network with bimodal degree distribution. The procedure adopted is to add nodes ...

Abhijeet R. Sonawane; A. Bhattacharyay; M. S. Santhanam…

2012-04-01T23:59:59.000Z

209

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

210

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

211

HP-CAT to Lead the Way in New Research under NNSA Grante  

NLE Websites -- All DOE Office Websites (Extended Search)

4th, 2003 4th, 2003 HP-CAT to Lead the Way in New Research under NNSA Grant The High Pressure Collaborative Access Team (HP-CAT) at APS sector 16 will be a primary location for research carried our under a new grant from the National Nuclear Security Administration (NNSA). The $5.9-million, 2.75-year NNSA grant to the Geophysical Laboratory of the Carnegie Institution in Washington, D.C., under the Stewardship Science Academic Alliances program, will fund research into the behavior of materials under extreme pressure conditions at the Carnegie/Department of Energy Alliance Center (CDAC). The NNSA selected CDAC because of the leadership of its team in the development of new techniques and capabilities in high-pressure and high-temperature materials research. As principal investigator for the

212

ANL=OHS/HP=83=102 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM  

Office of Legacy Management (LM)

' DO E/EV=0005/40 ' DO E/EV=0005/40 ANL=OHS/HP=83=102 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE ALBANY METALLURGICAL RESEARCH CENTER UNITED STATES BUREAU OF MINES ALBANY, OREGON Q\OLO G/C G- 4& G HP-83-102 ARGONNE NATIONAL LABORATORY 9700 South Cass Avenue Argonne, Illinois 60439 FORMERLY UTILIZED MED/AEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE ALBANY METALLURGICAL RESEARCH CENTER

213

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

214

RIS: A Reciprocal Incentive Scheme in Selfish Opportunistic Networks  

Science Journals Connector (OSTI)

Data dissemination in opportunistic networks has been extensively studied in recent years. In the resource-constrained opportunistic networks (e.g., the buffer size, the communication bandwidth and the energy of nodes are scarce), the nodes usually behave ... Keywords: Channel, Incentive scheme, Opportunistic networks, Selfish

Guangsong Zhao; Ming Chen; Xianglin Wei

2013-06-01T23:59:59.000Z

215

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

216

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.

217

Self-Stabilizing Local Routing in Ad Hoc Networks  

Science Journals Connector (OSTI)

......MANET) have no fixed network infrastructure (nodes are free to change...need for any existing network infrastructure or administration. Each node...networks modelled as a honeycomb grid is proposed in ref. [15...collected data. Protocol is a hybrid of the protocols and . The......

Doina Bein; Ajoy K. Datta; Vincent Villain

2007-03-01T23:59:59.000Z

218

CSP-based counter abstraction for systems with node identifiers  

Science Journals Connector (OSTI)

Abstract The Parameterised Model Checking Problem asks whether an implementation I m p l ( t ) satisfies a specification S p e c ( t ) for all instantiations of parameter  t . In general, t  can determine numerous entities: the number of processes used in a network, the type of data, the capacities of buffers, etc. The main theme of this paper is automation of uniform verification of a subclass of PMCP with the parameter of the first kind, i.e. where it determines the number of processes used in a network. We use CSP as our formalism. Counter abstraction is a technique that replaces a concrete state space by an abstract one, where each abstract state is a tuple of integer counters ( c 1 , … , c k ) such that for each  i , c i counts how many node processes are currently in the i -th state. Each counter c i is given a finite threshold z i and we interpret c i = z i as there being z i or more processes in the i -th state. Standard counter abstraction techniques require all processes to be identical, which means that nodes cannot use node identifiers. In this paper we present how counter abstraction techniques can be extended to processes that make use of node identifiers in a symmetrical way. Our method creates a process A b s t r that is independent of  t and is refined by ? ( I m p l ( T ) ) for all sufficiently large  T , where ? maps all (sufficiently large) instantiations T of the parameter to some fixed type. By transitivity of refinement, testing if A b s t r refines S p e c ( ? ( t ) ) implies that S p e c ( ? ( t ) ) is refined by ? ( I m p l ( T ) ) . Then, using the type reduction theory from Mazur and Lowe (2012) [29], we can deduce that S p e c ( T ) is refined by I m p l ( T ) for all sufficiently large T , thus obtaining a positive answer to the original verification problem.

Tomasz Mazur; Gavin Lowe

2014-01-01T23:59:59.000Z

219

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

SciTech Connect

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

220

Robust Beamforming for OFDM Modulated Two-Way MIMO Relay Network  

E-Print Network (OSTI)

This thesis studies a two-way relay network (TWRN), which consists of two single antenna source nodes and a multi-antenna relay node. The source nodes exchange information via the assistance of the relay node in the middle. The relay scheme...

Zhou, Jianwei

2012-07-16T23: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

Facebook or Fakebook? The effects of simulated mobile applications on simulated mobile networks  

Science Journals Connector (OSTI)

The credibility of mobile ad hoc network simulations depends on accurate characterisations of user behaviour, e.g., mobility and application usage. If simulated nodes communicate at different rates to real nodes, or move in an unrealistic fashion, this ... Keywords: Opportunistic networks, Privacy, Simulation, Social networks, Social-network routing

Iain Parris; Fehmi Ben Abdesslem; Tristan Henderson

2014-01-01T23:59:59.000Z

222

Using the HP-41CV calculator as a data acquisition system for personal carbon monoxide exposure monitors  

SciTech Connect

The use of small, personal monitors as instruments for air pollution data acquisition, storage, and retrieval presents a new set of monitoring considerations. Portability, ruggedness, power supplies, and data capture are functions to be addressed in designing personal monitoring systems. The emphasis herein is on the data capture function. This paper describes experiences using the Hewlett-Packard HP-41CV system as a data management system interfaced with personal carbon monoxide monitors (General Electric Carbon Monoxide Detector, Model 15EC53CO3). In general, the HP-41CV proved to be reliable, adaptable, and easy to use. Problems with the monitor power source (battery failure) were more frequent than with the HP-41CV itself. Using the HP-41CV for the specific data collection requirements of the Washington Microenvironment Study is a focal point of this presentation.

Fitz-Simons, T.; Sauls, H.B.

1984-09-01T23:59:59.000Z

223

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

224

Clock Agreement Among Parallel Supercomputer Nodes  

SciTech Connect

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

225

Clock Agreement Among Parallel Supercomputer Nodes  

DOE Data Explorer (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.

226

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.

Crosette, Dario B. (DeSoto, TX)

1994-01-01T23:59:59.000Z

227

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

228

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

SciTech Connect

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

229

Dynamic Networks: Recent Results and Applications  

E-Print Network (OSTI)

Networks provide us with the means to cross distance in order to conduct our work, and to see our. #12;Duke Energy Gas Pipeline Network #12;Components of Common Physical Networks Network System Nodes Links Flows Transportation Intersections, Homes, Workplaces, Airports, Railyards Roads, Airline Routes

Nagurney, Anna

230

Analysis of lattice Boltzmann nodes initialization in  

E-Print Network (OSTI)

Analysis of lattice Boltzmann nodes initialization in Moving Boundary problems A. Caiazzo: The lattice Boltzmann method is a numerical scheme based on a fixed grid. Dealing with moving boundary. The theoretical predictions are tested on simple benchmarks. Keywords: lattice Boltzmann equation, lattice

231

Creation and maintenance of a communication tree in wireless sensor networks  

E-Print Network (OSTI)

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree...

Jung, Eun Jae

2008-10-10T23:59:59.000Z

232

Creation and maintenance of a communication tree in wireless sensor networks  

E-Print Network (OSTI)

A local reconfiguration algorithm (INP) for reliable routing in wireless sensor networks that consist of many static (fixed) energy-constrained nodes is introduced in the dissertation. For routing around crash fault nodes, a communication tree...

Jung, Eun Jae

2009-05-15T23:59:59.000Z

233

Mobility Management Using Virtual Multi-parent Tree in Infrastructure Incorporated Mobile Ad Hoc Networks  

Science Journals Connector (OSTI)

Mobile nodes in the integrated network of infrastructure networks and mobile ad hoc networks need ... other traditional methods - proactive, reactive, and hybrid by resorting to simulation. The result shows...

Trung-Dinh Han; Hoon Oh

2009-01-01T23:59:59.000Z

234

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

E-Print Network (OSTI)

As the size of networks increases continuously, dealing with networks with faulty nodes becomes unavoidable. In this dissertation, we introduce a new measure for network fault tolerance, the strong fault tolerance (or strong Menger...

Oh, Eunseuk

2004-11-15T23:59:59.000Z

235

The normalization of meshes and nodes in electrical networks  

E-Print Network (OSTI)

hF7 ,7(39695 u,7?i79grp Sp 8( )8m79 .r 3w + i r ?- 691 8( g 3 ? ? ? ? ,61869( a7, (7g391n ?7 (77 5F65p 89 )797,6+p 5F7 ,7(39695 u,7?i79g87( 13 935 18 coincide with the natural frequencies and that a resonant frequency is greater than...S + R12 + ? i l l ( s ) ? ?+??( ? ?22 ? ?u??? 868?(? ? 0a39 (i.(585i589) m6+i7( u,3e ??+?? S7 F6m7 ???? (36) 22 r-AAA/------V W ro W CO C - O rH - J U U L r ovO I?I CO o iH K1A vOo- OJ Figure 23 ? (? ? ? ?n??? ? ? ???n?? ? 8...

Johnson, Allen Forrest

2013-10-04T23:59:59.000Z

236

Randomized location service in Mobile Ad Hoc Networks  

E-Print Network (OSTI)

of the node. Home regions near a node are aware of the nodes exact location (that is, the unit region it occupies) while home regions that are far from the node know only of a larger region that contains the node. Camp, Boleng and Wilcox [12] have dcvclopcd..., *' in Proc. IEEE Wireless Communication and Networking Conference (WCNC), Orlando, FL, 2002, pp. 874-578. [12] T. Camp, J. Boleng and L. Wilcox, "Location Information Services in Mobile Ad Hoc Networks, " in IEEE Int. Conf. Communications, 2002, pp. 3318...

Bhattacharya, Sangeeta

2012-06-07T23:59:59.000Z

237

Singlet generation in mixed-state quantum networks  

SciTech Connect

We study the generation of singlets in quantum networks with nodes initially sharing a finite number of partially entangled bipartite mixed states. We prove that singlets between arbitrary nodes in such networks can be created if and only if the initial states connecting the nodes have a particular form. We then generalize the method of entanglement percolation, previously developed for pure states, to mixed states of this form. As part of this, we find and compare different distillation protocols necessary to convert groups of mixed states shared between neighboring nodes of the network into singlets. In addition, we discuss protocols that only rely on local rules for the efficient connection of two remote nodes in the network via entanglement swapping. Further improvements of the success probability of singlet generation are developed by using particular forms of ''quantum preprocessing'' on the network. This includes generalized forms of entanglement swapping and we show how such strategies can be embedded in regular and hierarchical quantum networks.

Broadfoot, S.; Dorner, U. [Clarendon Laboratory, University of Oxford, Oxford OX1 3PU (United Kingdom); Jaksch, D. [Clarendon Laboratory, University of Oxford, Oxford OX1 3PU (United Kingdom); Centre for Quantum Technologies, National University of Singapore, 117543 (Singapore)

2010-04-15T23:59:59.000Z

238

Generative models of rich clubs in Hebbian neuronal networks and large-scale human brain networks  

Science Journals Connector (OSTI)

...Theme Issue Complex network theory and the brain compiled and edited by David Papo, Javier...neuronal networks and large-scale human brain networks Petra E. Vertes 1 Aaron Alexander-Bloch...Theme Issue Complex network theory and the brain . Rich clubs arise when nodes that are...

2014-01-01T23:59:59.000Z

239

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

240

An energy efficient RF transceiver for wireless microsensor networks  

E-Print Network (OSTI)

A wireless microsensor network consists of a group of sensor nodes that are deployed remotely and used to relay sensing data to the end-user. Due to their remote deployment, large scale wireless sensor networks require a ...

Daly, Denis Clarke

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


241

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

242

On the performance management of heterogeneous networks using SNMP  

E-Print Network (OSTI)

effectively address the myriad needs of a typical distributed network viz. simple IP node discovery, alarm handling, modeling or performance monitoring. Based on an extensive analysis of these tools on (live' network devices, a design strategy for a...

Kunapareddy, Padmaja

2012-06-07T23:59:59.000Z

243

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

244

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

245

An investigation of two network flow optimization algorithms  

E-Print Network (OSTI)

of attention has been paid to a class of problems known as optimization problems. An important subclass of these problems are network problems. Networks consist, of a set of nodes interconnected by a set of arcs, as discussed more completely below. Many... of the network algorithms and a liter- ature survey. Graph Theory A graph is a set of points or nodes and a set of line segments or arcs mapped into pairs of nodes. These arcs are mapped so that no node is interior to any line segment and each end point...

Steelquist, John Anders

2012-06-07T23:59:59.000Z

246

FLOP Counts for Single-Node Tests  

NLE Websites -- All DOE Office Websites (Extended Search)

FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests FLOP Counts for "Small" Single-Node Miniapplication Tests These data, obtained using the NERSC Hopper system, are provided for reference. Code MPI Tasks Threads Reference TFLOP Count Benchmark Time (seconds) # of iterations miniFE 144 1 5.05435E+12 130.2 (total program time) miniGhost 96 1 6.55500E+12 76.5 AMG 96 1 1.30418E+12 66.95 18 UMT 96 1 1.30211E+13 416.99 49 SNAP 96 1 5.84246E+11 15.37 3059 miniDFT 40 1 2.32379E+13 153.97 GTC 64 1 6.63670E+13 1839.4 MILC 24 1 1.45971E+13 744.3 CORRECTION (02 August 2013): The values given for the reference counts are FLOPs, not TFLOPs. Last edited: 2013-08-02 09:40:18

247

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

E-Print Network (OSTI)

A Mechanically Stable, Low Profile, Omni-Directional Solar-Cell Integrated Antenna for Outdoor nodes have been integrated with solar cells to increase the robustness of the network [2]. To boost under the solar cell circuitry. Several solar antenna integration methods have been published

Tentzeris, Manos

248

Sensor network minimal energy routing with latency guarantees  

Science Journals Connector (OSTI)

We consider wireless sensor networks with nodes switching ON (awake) and OFF (sleeping) to preserve energy, and transmitting data over channels with varying quality. The objective is to determine the best path from each node to a single gateway. Performance ... Keywords: energy and resource management, large deviations, latency, routing, sensor networks, sleeping schedule

Wei Lai; Ioannis Ch. Paschalidis

2007-09-01T23:59:59.000Z

249

Timescale decoupled routing and rate control in intermittently connected networks  

Science Journals Connector (OSTI)

We study an intermittently connected network (ICN) composed of multiple clusters of wireless nodes. Within each cluster, nodes can communicate directly using the wireless links. However, these clusters are far away from each other such that direct communication ... Keywords: back-pressure (BP) routing and rate control, intermittently connected networks (ICNs)

Jung Ryu; Lei Ying; Sanjay Shakkottai

2012-08-01T23:59:59.000Z

250

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

251

Secure Aggregation for Wireless Networks Lingxuan Hu David Evans  

E-Print Network (OSTI)

. To conserve power, intermediate network nodes should aggregate results from individual sensors. However nodes within the network and use them to transmit false messages. Further, an adversary may compromise of the messages themselves to be unnecessary and focus only on the integrity of the results transmitted

Evans, David

252

Advanced mobile networking, sensing, and controls.  

SciTech Connect

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

253

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

254

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

255

Pinning impulsive control algorithms for complex network  

SciTech Connect

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

256

DOE/EV-0005/26 ANL-OHS/HP-82-100  

Office of Legacy Management (LM)

J-L.f!~: J-L.f!~: r*' c;,:i &3&j DOE/EV-0005/26 ANL-OHS/HP-82-100 i$; ' ,\ : -ed - *' J&&&g y FORMERLY UTILIZED MED/AEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE GEORGE HERBERT JONES CHEMICAL LABORATORY THE UNIVERSITY OF CHICAGO CHICAGO, ILLINOIS June 1347, 1977 OCCUPATIONAL HEALTH AND SAFETY DIVISION Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Prepared for the U. S. DEPARTMENT OF ENERGY under Contract W -31409-Eng=38 The facilities of Argonne National Laboratory are owned by the United States Government. Under the terms of a contract (W-31-109-Eng-38) among the U. S. Department of Energy, Argonne Universities Association and The University of Chicago, the University employs the staff and operates the Laboratory in

257

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

Office of Legacy Management (LM)

//, .<.' //, .<.' I ' 1 TL\ t+, -- DOEIEV-0005/37 ANL=OHS/HP-83406 FORMERLY UTILIZED MEDIAEC SITES REMEDIAL ACTION PROGRAM RADIOLOGICAL SURVEY OF THE FORMER WATERTOWN ARSENAL PROPERTY SITE 34 AND SITE 41 WATERTOWN, MASSACHUSETTS o\o\-0 G /Q e-+ a+ -? q+ mii ' ( . % QL G+ OCCUPATIONAL HEALTH AND SAFETY INViSiON Health Physics Section ARGONNE NATIONAL LABORATORY, ARGONNE, ILLINOIS Operated by THE UNIVERSITY O F CHICAGO for the U. S. DEPARTMENT O F ENERGY under Contract W=314 09.Eng-38 Argonne National Laboratory, with facilities in the states of Illinois and Idaho, is owned by the United States government, and operated by The University of Chicago under the provisions of a contract with the Department of Energy. r----- DISCLAIMER I This report was prepared as an account of work sponsored by an

258

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

SciTech Connect

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

259

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

260

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

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

Routing protocols in ad hoc networks  

Science Journals Connector (OSTI)

Ad hoc networking involves computers, typically wireless mobile nodes (MNs), that cooperatively form a network without specific user administration or configuration. In other words, ad hoc networking allows an arbitrary collection of MNs to create a ... Keywords: associativity-based routing (ABR), distributed bellman-ford (DBF), dynamic source routing (DSR), on-demand routing protocols

Dan Galatchi; Roxana Zoican

2005-03-01T23:59:59.000Z

262

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

NLE Websites -- All DOE Office Websites (Extended Search)

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

263

E-Print Network 3.0 - ali Sample Search Results  

NLE Websites -- All DOE Office Websites (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....

264

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

NLE Websites -- All DOE Office Websites (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...

265

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

266

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

NLE Websites -- All DOE Office Websites (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...

267

HP Laboratories 2/18/96 Tapu:Documents:Giordano Beretta:Research:NIP 95:Small Poster  

E-Print Network (OSTI)

HP Laboratories 2/18/96 Tapu:Documents:Giordano Beretta:Research:NIP 95:Small Poster Implementing:Research:NIP 95:Small Poster Outline · Background for the standard · Data representation · The color facsimile Laboratories 2/18/96 Tapu:Documents:Giordano Beretta:Research:NIP 95:Small Poster Four categories of business

Beretta, Giordano

268

Printing a Poster on the HP DesignJet 500PS Open your pdf in Acrobat and choose File > Print  

E-Print Network (OSTI)

Printing a Poster on the HP DesignJet 500PS Open your pdf in Acrobat and choose File > Print Choose menu, choose Postscript Custom Page Size #12;Enter the dimensions of your poster in the Width window. #12;Check the orientation of your poster in the preview window. Page Scaling should be set to Fit

Barrash, Warren

269

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

E-Print Network (OSTI)

the problem of electing a leader in faulty asynchronous general net- works. The network coritams a reliable path connecting all the nodes in the network. The type of failure the links experience is interinittent. Since thc network is asyn- chronous... are faulty in nature. A faulty network may contain either faulty nodes, faulty links or both. In reliable networlcs, even if some of the elements fail, the whole network still will work reliably, giving the impression that everytliing is fine. Under a...

Lateef, Mohammed Afroz

2012-06-07T23:59:59.000Z

270

Analyzing covert social network foundation behind terrorism disaster  

E-Print Network (OSTI)

This paper addresses a method to analyze the covert social network foundation hidden behind the terrorism disaster. It is to solve a node discovery problem, which means to discover a node, which functions relevantly in a social network, but escaped from monitoring on the presence and mutual relationship of nodes. The method aims at integrating the expert investigator's prior understanding, insight on the terrorists' social network nature derived from the complex graph theory, and computational data processing. The social network responsible for the 9/11 attack in 2001 is used to execute simulation experiment to evaluate the performance of the method.

Maeno, Yoshiharu

2007-01-01T23:59:59.000Z

271

Cascade-based attacks on complex networks  

Science Journals Connector (OSTI)

We live in a modern world supported by large, complex networks. Examples range from financial markets to communication and transportation systems. In many realistic situations the flow of physical quantities in the network, as characterized by the loads on nodes, is important. We show that for such networks where loads can redistribute among the nodes, intentional attacks can lead to a cascade of overload failures, which can in turn cause the entire or a substantial part of the network to collapse. This is relevant for real-world networks that possess a highly heterogeneous distribution of loads, such as the Internet and power grids. We demonstrate that the heterogeneity of these networks makes them particularly vulnerable to attacks in that a large-scale cascade may be triggered by disabling a single key node. This brings obvious concerns on the security of such systems.

Adilson E. Motter and Ying-Cheng Lai

2002-12-20T23:59:59.000Z

272

On effectiveness of cooperation enforcement mechanisms in wireless ad hoc networks  

Science Journals Connector (OSTI)

Wireless ad hoc networks are resource constrained, infrastructureless peer to peer networks where nodes are responsible for performing routing activity for other nodes to establish end to end communication. Due to limited resources (energy and bandwidth), in certain networks, nodes may behave selfishly and not forward packets for other nodes. Many cooperation enforcement mechanisms are proposed in literature to enforce packet forwarding on resource constrained nodes, and are shown to perform better than the defenseless dynamic source routing (DSR) protocol under their own set of assumptions. However, they do not consider the effect on network lifetime and energy consumption. Here we analyse routing overhead, end to end packet delivery ratio (PDR), and per packet energy cost of DSR and a representative set of cooperation enforcement mechanisms using various network scenario to show that in absence of infrastructure support cooperation enforcement mechanisms in their present form are not effective in dealing with node selfishness.

Manish Chaturvedi; Sanjay Srivastava

2012-01-01T23:59:59.000Z

273

Physical model of human blood electronic memristors network  

Science Journals Connector (OSTI)

For the first time using therapeutic methodology, network of physical model (three memristors in series and parallel combination) of memristors was experimentally studied. The combination of memristors manifested memristor's characteristics (only as defined by Williams of HP, USA). Key potential applications towards biomedical electronics specially man-machine interface, artificial brain, and signal processing is envisaged.

Shiv Prasad Kosta; Mukta Bhatele; Prateek Gupta; Preeti Nair; Shakti Kosta; Siddharth Dutt Choubey; Luni Thakre; Piyush R. Vaghela; K.N. Patel; B.K. Dave; Jaimin Chavda; Chintan Bhatt; Tushar Nigam

2014-01-01T23:59:59.000Z

274

Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking  

E-Print Network (OSTI)

]; and hybrid networks, where infrastructure nodes coexist with multihopping [5]. In all these networks-theoretic results have shown that high- rate transmission over networks without any infrastructure (ad hoc networks of an infrastructure made of base stations (BSs or access points) connected by a high-capacity backbone. This class

Kramer, Gerhard

275

Matching Services with Users in Opportunistic Network Environments  

Science Journals Connector (OSTI)

Opportunistic Networks are a specific type of wireless ad hoc network where there is an absence of a continuous end-to-end path. The proliferation of mobile devices with Wi-Fi capability creates opportunities to forward packets by utilizing nodes as ... Keywords: ad hoc network, opportunistic network, matchmaking, service oriented computing

Anthony Smith, Stuart Berry, Richard Hill

2014-07-01T23:59:59.000Z

276

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

277

An Architecture for Distributed Real-Time Passive Network Measurement Tilman Wolf, Ramaswamy Ramaswamy, Siddhartha Bunga, and Ning Yang  

E-Print Network (OSTI)

An Architecture for Distributed Real-Time Passive Network Measurement Tilman Wolf, Ramaswamy network information be- tween several measurement nodes placed at different loca- tions in the network-processing them on the measurement node itself. Real-time queries are implemented by breaking them down

Shenoy, Prashant

278

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

279

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

280

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

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

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

282

New approach for calibration the efficiency of HpGe detectors  

SciTech Connect

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 gamma–point 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

283

Cascading Failures in Power Grid under Three Node Attack Strategies  

Science Journals Connector (OSTI)

This paper studies cascading failures of power grid under three node attack strategies based on...k is k ? , and ?...is a tunable parameter. We investigated the...

Sui-Min Jia; Yun-Ye Wang; Cong Feng; Zhi-Juan Jia…

2014-01-01T23:59:59.000Z

284

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

285

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

286

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

SciTech Connect

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

287

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

288

Constant Price of Anarchy in Network Creation Games via Public Service Advertising  

E-Print Network (OSTI)

Network creation games have been studied in many different settings recently. These games are motivated by social networks in which selfish agents want to construct a connection graph among themselves. Each node wants to ...

Demaine, Erik D.

289

Efficient Node Overlap Removal Using a Proximity Stress Model  

E-Print Network (OSTI)

Efficient Node Overlap Removal Using a Proximity Stress Model Emden R. Gansner and Yifan Hu AT the structural information inherent in a layout using little additional area. This paper presents a new node overlap removal algorithm that does well by these measures. 1 Introduction Most existing symmetric graph

Hu, Yifan

290

Bridge-Node Selection and Loss Recovery in Island Multicast  

E-Print Network (OSTI)

Bridge-Node Selection and Loss Recovery in Island Multicast W.-P. Ken Yiu K.-F. Simon Wong S.-H in their bridge-node selection. H multicast-capable domains (the so-called islands) while overlay connections are used to bridge islands

Chan, Shueng-Han Gary

291

The Small Motion at the Nodes of a Vibrating String  

Science Journals Connector (OSTI)

... IT is generally recognised that the nodes of a string which is maintained permanently in oscillation in two or more loops cannot be points of ... node is in a phase which is different from that of the rest of the string. The exact difference of phase is shown by a dynamical investigation to be a ...

C. V. RAMAN

1909-11-04T23:59:59.000Z

292

Langlie Test Method Program for use with the HP-41CV/X calculator  

SciTech Connect

Explosive component designers need to test the sensitivity of some unit response as a function level of stress, for example, the sensitivity of a detonator or ignitor bridgewire to input current. There exists a threshold level, above which the detonator will function and below which it will not. Statistical testing of explosive components often requires destructive testing of expensive hardware. If the unit functions, it is destroyed; and if it doesn't fire, the results from any further testing cannot be relied on because the initial test affects the detonator. In order to obtain meaningful results and not expend a large number of units, the Langlie ''One-Shot'' Method of testing is employed. Typical component attributes that require Langlie testing include ''all-fire'' and ''no-fire'' tests to determine threshold levels of performance. Generally, any sensitivity testing lends itself to the Langlie method. This method has also been shown to be insensitive to design. Typically, support test groups and venders implement the test method with their own computers. The method is subject to some interpretation which may lead to inconsistency in results from facility to facility. Another concern is that an error made in choosing a stimulus level will affect subsequent levels, resulting in an analysis that is not a true Langlie. A program has been written for the HP-41CV/X calculator in order to standardize the Langlie test procedures at the various facilities, and to minimize the possibilities of introducing errors in the test method. A distinct advantage of using the calculator is the ability to hand carry it in the field and perform the Langlie test method at remote locations. 2 refs.

Kopczewski, M.R.

1987-10-01T23:59:59.000Z

293

Surface-Reflection-Based Communication and Localization in Underwater Sensor Networks  

Science Journals Connector (OSTI)

Most communication and localization algorithms in underwater environments have been constrained by dependencies on the Line Of Sight (LOS), which is hard to guarantee due to the inherent node mobility. This constraint hinders node discovery and ad hoc ... Keywords: Localization, ad hoc networks, underwater sensor networks

Lloyd Emokpae, Mohamed Younis

2014-04-01T23:59:59.000Z

294

Mobile Ad Hoc Data Networks for Emergency Preparedness Telecommunications -Dynamic Power-Conscious Routing Concepts  

E-Print Network (OSTI)

Mobile Ad Hoc Data Networks for Emergency Preparedness Telecommunications - Dynamic Power networks MANETs for emer- gency telecommunication. A MANET is an autonomous collection of mobile nodes into mobile nodes. A MANET for emergency telecommunication may operate in a stand-alone manner or be connected

295

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

296

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

297

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

298

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

299

Information mobility in complex networks  

Science Journals Connector (OSTI)

The concept of information mobility in complex networks is introduced on the basis of a stochastic process taking place in the network. The transition matrix for this process represents the probability that the information arising at a given node is transferred to a target one. We use the fractional powers of this transition matrix to investigate the stochastic process at fractional time intervals. The mobility coefficient is then introduced on the basis of the trace of these fractional powers of the stochastic matrix. The fractional time at which a network diffuses 50% of the information contained in its nodes (1/k50) is also introduced. We then show that the scale-free random networks display a better spread of information than the non-scale-free ones. We study 38 real-world networks and analyze their performance in spreading information from their nodes. We find that some real-world networks perform even better than the scale-free networks with the same average degree and we point out some of the structural parameters that make this possible.

Ernesto Estrada

2009-08-05T23:59:59.000Z

300

SIA: Secure information aggregation in sensor networks  

Science Journals Connector (OSTI)

In sensor networks, data aggregation is a vital primitive enabling efficient data queries. An on-site aggregator device collects data from sensor nodes and produces a condensed summary which is forwarded to the off-site querier, thus reducing the communication ... Keywords: Sensor networks, approximate interactive proofs, information aggregation, security

Haowen Chan; Adrian Perrig; Bartosz Przydatek; Dawn Song

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


301

FUNDAMENTAL PERFORMANCE LIMITS OF WIRELESS SENSOR NETWORKS  

E-Print Network (OSTI)

on each of the sensors (e.g., solar energy sources), our analysis concludes that the maximum sustainable throughput in energy-constrained sensor networks scales worse than the capacity based on interference among. In this case, when the number of nodes is sufficiently high, the energy-constrained network capacity dominates

Li, Baochun

302

Cascade Control and Defense in Complex Networks  

Science Journals Connector (OSTI)

Complex networks with a heterogeneous distribution of loads may undergo a global cascade of overload failures when highly loaded nodes or edges are removed due to attacks or failures. Since a small attack or failure has the potential to trigger a global cascade, a fundamental question regards the possible strategies of defense to prevent the cascade from propagating through the entire network. Here we introduce and investigate a costless strategy of defense based on a selective further removal of nodes and edges, right after the initial attack or failure. This intentional removal of network elements is shown to drastically reduce the size of the cascade.

Adilson E. Motter

2004-08-26T23:59:59.000Z

303

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

304

Computational Complexity of Relay Placement in Sensor Networks  

E-Print Network (OSTI)

-hoc network which will route data from sensor nodes towards a sink node · Energy consumption must be very low include environmental and weather monitoring; home automation; agriculture; tracking goods in commerce Problem (2) Example: problem instance = 0.0 maximise average = 0.5 = 1.0 maximise minimum (1

Suomela, Jukka

305

Scaling of load in communications networks Onuttom Narayan1  

E-Print Network (OSTI)

that the load at each node in a preferential attachment network scales as a power of the degree of the node power-law degree distributions as compared to the scaling of the load versus degree. This emphasizes that the probability distribution for the load scales as p(l) 1/l with = 2.2. Subsequently, data for net- works

California at Santa Cruz, University of

306

Redundancy Control in Large Scale Sensor Networks via Compressive Sensing  

E-Print Network (OSTI)

, China. The authors deployed 100 sensor nodes and 1096 relay nodes to monitor the urban CO2 in a 5000(mRedundancy Control in Large Scale Sensor Networks via Compressive Sensing Liwen Xu1 , Yongcai Wang1, and require high data storage and management costs. To deal with these challenges, compressive sensing (CS

Wang, Yongcai

307

Achieving Congestion Diversity in Wireless Ad-hoc Networks  

E-Print Network (OSTI)

consisting of 12 802.11g nodes. This small test-bed enables an imperical comparison of CDP's performance is particularly acute in multi-hop networks, where nodes must relay each others packets. We present a congestion- varying distance metric that approximates the queue draining times along each path. Our proposed

Snoeren, Alex

308

ESTR -Energy Saving Token Ring Protocol for Wireless Sensor Networks  

E-Print Network (OSTI)

ESTR - Energy Saving Token Ring Protocol for Wireless Sensor Networks Faruk Bagci, Theo Ungerer a long lifetime of the sensor network and the application it is important to save energy. A sensor node control (MAC) protocol for wireless sensor networks, called Energy Saving Token Ring Protocol (ESTR). ESTR

Ungerer, Theo

309

RFID Enabled Vehicular Network for Ubiquitous Travel Query  

Science Journals Connector (OSTI)

Fixed infrastructure based wireless network is very expensive to provide total coverage and offer ubiquitous communication capacity. RFID enabled Vehicular Network emerges as an alternative which can leverage mobile nodes to bridge the gap between information ... Keywords: Delay, Mobile Relay, Partially Connected, RFID, Vehicular Ad Hoc Network VANET

ZongWei Luo, Tianle Zhang, Chunlu Wang, Shuihua Han, Mengyuan Dong

2011-07-01T23:59:59.000Z

310

Snow Monitoring with Sensor Networks Thomas C. Henderson  

E-Print Network (OSTI)

having the ability to communicate, compute and sense the environment temperature, light intensity, pressure, and other properties. We have developed several distributed algorithms for such networks network [7], [8], [9], [10], [11]. We are developing a 50 to 100 node sensor network testbed

Henderson, Thomas C.

311

An Implicit Optimization Approach for Survivable Network Design  

E-Print Network (OSTI)

heavily on networked systems such as the electric power grid, water and gas distribution systems, com networks. For example, nodes can represent genera- tors, load points, and junctions in a power system capacities) even after the disruption of a subset of the network's arcs. Specifically, we consider the case

Pinar, Ali

312

Phenomenological models of socioeconomic network dynamics  

Science Journals Connector (OSTI)

We study a general set of models of social network evolution and dynamics. The models consist of both a dynamics on the network and evolution of the network. Links are formed preferentially between “similar” nodes, where the similarity is defined by the particular process taking place on the network. The interplay between the two processes produces phase transitions and hysteresis, as seen using numerical simulations for three specific processes. We obtain analytic results using mean-field approximations, and for a particular case we derive an exact solution for the network. In common with real-world social networks, we find coexistence of high and low connectivity phases and history dependence.

George C. M. A. Ehrhardt; Matteo Marsili; Fernando Vega-Redondo

2006-09-13T23:59:59.000Z

313

The Network  

NLE Websites -- All DOE Office Websites (Extended Search)

Network Engineering Services The Network Network Maps Network Facts & Stats Connected Sites Peering Connections ESnet Site Availabiliy OSCARS Fasterdata IPv6 Network Network...

314

Algebraic Watchdog: Mitigating Misbehavior in Wireless Network Coding  

E-Print Network (OSTI)

We propose a secure scheme for wireless network coding, called the algebraic watchdog. By enabling nodes to detect malicious behaviors probabilistically and use overheard messages to police their downstream neighbors ...

Kim, MinJi

315

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

316

A Routing and Network Dimensioning Strategy to reduce ...  

E-Print Network (OSTI)

fibers and WDM systems must be considered in the wavelength assignment ... on the real contribution, we neither consider node costs nor protection in this ..... The test scenarios comprise a German, European, and US network defined in [1].

2007-02-12T23:59:59.000Z

317

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

318

An Autonomy Oriented Computing (AOC) Approach to Distributed Network Community Mining  

Science Journals Connector (OSTI)

A network community is a special sub-network that contains a group of nodes sharing similar linked patterns. A distributed network community mining problem (D-NCMP) is concerned with finding all such communities from a distributed network. A variety ...

Bo Yang; Jiming Liu

2007-07-01T23:59:59.000Z

319

PARAMETERIZED NEIGHBORHOODBASED FLOODING FOR AD HOC WIRELESS NETWORKS Vijay Dheap, Mohammad Ahmad Munawar, Sagar Naik, Paul A.S. Ward  

E-Print Network (OSTI)

PARAMETERIZED NEIGHBORHOOD­BASED FLOODING FOR AD HOC WIRELESS NETWORKS Vijay Dheap, Mohammad Ahmad Flooding is a simple routing technique that can be used to transmit data from one node to every other node in a network. The focus of this paper is to investigate im­ provements to flooding techniques used in ad hoc

Ward, Paul A.S.

320

Mobile Robot Coordination and navigation with directional antennas in positionless Wireless Sensor Networks  

Science Journals Connector (OSTI)

Three schemes are proposed to coordinate and navigate mobile robots with directional antennas in a positionless wireless sensor network for the purpose of emergency rescue. The k-farthest-node forwarding scheme is for Waiting-for-Rescue (WFR) nodes to broadcast packets to ask mobile robots to come to help. The Mobile Robot Coordination (MRC) is to coordinate multiple mobile robots so that each WFR node is associated one nearby mobile node which is navigated by the Tree Assisted Navigation (TAN) scheme to fast reach the WFR node. The schemes' effectiveness is verified by the ns-2 simulator.

Jehn-Ruey Jiang; Yung-Liang Lai; Fu-Cheng Deng

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


321

Exploring Hardware Support For Scaling Irregular Applications on Multi-node Multi-core Architectures  

SciTech Connect

With the recent emergence of large-scale knowledge dis- covery, data mining and social network analysis, irregular applications have gained renewed interest. Classic cache-based high-performance architectures do not provide optimal performances with such kind of workloads, mainly due to the very low spatial and temporal locality of the irregular control and memory access patterns. In this paper, we present a multi-node, multi-core, fine-grained multi-threaded shared-memory system architecture specifically designed for the execution of large-scale irregular applications, and built on top of three pillars, that we believe are fundamental to support these workloads. First, we offer transparent hardware support for Partitioned Global Address Space (PGAS) to provide a large globally-shared address space with no software library overhead. Second, we employ multi-threaded multi-core processing nodes to achieve the necessary latency tolerance required by accessing global memory, which potentially resides in a remote node. Finally, we devise hardware support for inter-thread synchronization on the whole global address space. We first model the performances by using an analytical model that takes into account the main architecture and application characteristics. We describe the hardware design of the proposed cus- tom architectural building blocks that provide support for the above- mentioned three pillars. Finally, we present a limited-scale evaluation of the system on a multi-board FPGA prototype with typical irregular kernels and benchmarks. The experimental evaluation demonstrates the architecture performance scalability for different configurations of the whole system.

Secchi, Simone; Ceriani, Marco; Tumeo, Antonino; Villa, Oreste; Palermo, Gianluca; Raffo, Luigi

2013-06-05T23:59:59.000Z

322

Networks, smart grids: new model for synchronization  

NLE Websites -- All DOE Office Websites (Extended Search)

Stories » Stories » Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Researchers developed a surprisingly simple mathematical model that accurately predicts synchronization as a function of the parameters and the topology of the underlying network. May 21, 2013 High voltage transmission lines carry electrical power. High voltage transmission lines carry electrical power. The researchers envision that their method could be applied to assess synchronization and robustness quickly in electrical grids under volatile operating conditions. Networks of individual oscillating nodes often spontaneously synchronize and begin to oscillate at a coherent frequency. From heart cells to flashing fireflies to electric power grids, coupled oscillator networks are

323

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

324

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

325

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

326

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

327

Complex network synchronization of chaotic systems with delay coupling  

SciTech Connect

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

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

328

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

329

Robustness of airline alliance route networks  

Science Journals Connector (OSTI)

Abstract The aim of this study is to analyze the robustness of the three major airline alliances’ (i.e., Star Alliance, oneworld and SkyTeam) route networks. Firstly, the normalization of a multi-scale measure of vulnerability is proposed in order to perform the analysis in networks with different sizes, i.e., number of nodes. An alternative node selection criterion is also proposed in order to study robustness and vulnerability of such complex networks, based on network efficiency. And lastly, a new procedure – the inverted adaptive strategy – is presented to sort the nodes in order to anticipate network breakdown. Finally, the robustness of the three alliance networks are analyzed with (1) a normalized multi-scale measure of vulnerability, (2) an adaptive strategy based on four different criteria and (3) an inverted adaptive strategy based on the efficiency criterion. The results show that Star Alliance has the most resilient route network, followed by SkyTeam and then oneworld. It was also shown that the inverted adaptive strategy based on the efficiency criterion – inverted efficiency – shows a great success in quickly breaking networks similar to that found with betweenness criterion but with even better results.

Oriol Lordan; Jose M. Sallan; Pep Simo; David Gonzalez-Prieto

2015-01-01T23:59:59.000Z

330

Efficient RC Power Grid Verification Using Node Elimination  

E-Print Network (OSTI)

Efficient RC Power Grid Verification Using Node Elimination Ankit Goyal Department of ECE to reduce the size of power grids but their fo- cus is more on simulation. In verification, we are concerned. This paper pro- poses a novel approach to systematically reduce the power grid and accurately compute

Najm, Farid N.

331

Power Grid Verification Using Node and Branch Nahi Abdul Ghani  

E-Print Network (OSTI)

Power Grid Verification Using Node and Branch Dominance Nahi Abdul Ghani ECE Department University Toronto, Ontario, Canada f.najm@utoronto.ca ABSTRACT The verification of power grids in modern integrated, Verification Keywords Power grid, voltage drop, dominance 1. INTRODUCTION The rising demand for low

Najm, Farid N.

332

Identifying Proxy Nodes in a Tor Anonymization Circuit Sambuddho Chakravarty  

E-Print Network (OSTI)

agnostic Onion Routing scheme [11] to anonymize the traffic. The strength of the scheme is the use is vulnerable to traffic analysis at- tacks. These attacks can expose the identity of a Tor client or of the proxy nodes used in an anonymous Tor circuit when an adversary can manipulate the traffic entering

Yang, Junfeng

333

Tamanoir : Gbit software programmable node Echidna : Distributed Active Traffic generator  

E-Print Network (OSTI)

to support Grid infrastructure Laurent Lefèvre, Saâd El Hadri, Jean-Patrick Gelas Laurent resources deployed around VTHD backbone. Full view of active deployed resources · Hybrid P2P architecture service. · Tamanoir nodes are deployed around VTHD backbone to support Grid applications in RNTL Etoile

Gelas, Jean-Patrick

334

Design Considerations for Ultra-Low Energy Wireless Microsensor Nodes  

E-Print Network (OSTI)

. The most familiar sources of ambient energy include solar power, thermal gradients, radio-frequency (RF to retain local energy storage. Coupling energy- harvesting techniques with some form of energy storage canDesign Considerations for Ultra-Low Energy Wireless Microsensor Nodes Benton H. Calhoun, Student

Chandrakasan, Anantha

335

INTRODUCTION Hensen's node, the amniote equivalent of the amphibian  

E-Print Network (OSTI)

INTRODUCTION Hensen's node, the amniote equivalent of the amphibian `Spemann's organizer', is generally considered to be the most important region of the very early, gastrulating embryo. Not only does- sible for inducing and patterning the whole of the central nervous system. Like its amphibian

Stern, Claudio

336

On the degree distribution of the nodes in increasing trees  

Science Journals Connector (OSTI)

Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e., labellings of the nodes by distinct integers of the set {1,...,n} in such a way ... Keywords: Degree distribution, Increasing trees, Limiting distribution

Markus Kuba; Alois Panholzer

2007-05-01T23:59:59.000Z

337

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.

338

An Operating System for a Time-Predictable Computing Node  

E-Print Network (OSTI)

An Operating System for a Time-Predictable Computing Node Guenter Khyo, Peter Puschner, and Martin control structures generated before runtime can as well be used within the operating system of an embedded real-time system. In this way we make not only task timing but also the timing of the operating system

339

PARAMETERIZED NEIGHBORHOOD-BASED FLOODING FOR AD HOC WIRELESS NETWORKS Vijay Dheap, Mohammad Ahmad Munawar, Sagar Naik, Paul A.S. Ward  

E-Print Network (OSTI)

PARAMETERIZED NEIGHBORHOOD-BASED FLOODING FOR AD HOC WIRELESS NETWORKS Vijay Dheap, Mohammad Ahmad Flooding is a simple routing technique that can be used to transmit data from one node to every other node in a network. The focus of this paper is to investigate im- provements to flooding techniques used in ad hoc

Ward, Paul A.S.

340

Assessment of Delaware and Groningen effects on dual-laterolog measurements with a self-adaptive hp finite-element method  

E-Print Network (OSTI)

Assessment of Delaware and Groningen effects on dual-laterolog measurements with a self-adaptive hp and Groningen effects. Both effects give rise to abnormally high readings of DLL measurements under extreme laterolog mea- surements, generating the so-called Groningen effect. INTRODUCTION The electrical resistivity

Torres-Verdín, Carlos

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

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)

Radiation (Hp) in the Tropical Pacific Ocean RONG-HUA ZHANG State Key Laboratory of Satellite OceanUsing Satellite Ocean Color Data to Derive an Empirical Model for the Penetration Depth of Solar Environment Dynamics, Second Institute of Oceanography, State Oceanic Administration, Hangzhou, Zhejiang

Chen, .Dake

342

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

343

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

344

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

345

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

346

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

347

Page not found | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

81 - 28590 of 31,917 results. 81 - 28590 of 31,917 results. Article U-229: HP Network Node Manager i Input Validation Flaw Permits Cross-Site Scripting Attacks 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). http://energy.gov/cio/articles/u-229-hp-network-node-manager-i-input-validation-flaw-permits-cross-site-scripting Article Passive Housing for an Aggressive Region A telling perspective of Washingtonian's connection with their energy consumption, architecture and ambition in their professional and personal lives. http://energy.gov/energysaver/articles/passive-housing-aggressive-region Article U-258: Adobe Flash Player Flaw Lets Remote Users Execute Arbitrary

348

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

349

A Realistic Power Consumption Model for Wireless Sensor Network Devices  

E-Print Network (OSTI)

1 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 sensor network node devices is presented. Simple power consumption models for major components

Hempstead, Mark

350

Distributed Symmetric Function Computation in Noisy Wireless Sensor Networks  

E-Print Network (OSTI)

is to cooperatively provide information to this fusion center so it can compute some function of the sensor. The network has a special node called the fusion center whose goal is to compute a symmetric function of these measurements. The problem studied is to minimize the total transmission energy used by the network when

Srikant, Rayadurgam

351

Efficient Asynchronous Low Power Listening for Wireless Sensor Networks  

E-Print Network (OSTI)

Efficient Asynchronous Low Power Listening for Wireless Sensor Networks Rajesh Krishna Panta, James mechanism to reduce energy consumption of sensor devices and to increase the lifetime of the network. A side during idle listening--the time period for which the radio transceiver of a sensor node is awake

Fisher, Kathleen

352

Collaborative Approaches to Probabilistic Reasoning in Network Management  

E-Print Network (OSTI)

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 104 6.3 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105 6.4 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106 A Source Code for Tools and Utilities 133 B Network... network and seeing which nodes return the error message, and in so doing identify themselves. Traceroutes [100] from a set of distributed servers [101] [102] [103] [104] can be stitched together, to provide more complete topologies than the trees resulting...

Ewy, Benjamin

2014-08-31T23:59:59.000Z

353

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

354

Efficient searching and annotation of metabolic networks using chemical similarity  

Science Journals Connector (OSTI)

......report a Byers-Waterman type pathway search algorithm for further paring down pertinent networks. Results: Benchmarking tests run with SimIndex show it can reduce the number of nodes visited in searching a putative network by 100-fold with a computational......

Dante A. Pertusi; Andrew E. Stine; Linda J. Broadbelt; Keith E.J. Tyo

2014-11-01T23:59:59.000Z

355

Deployment Alternatives for Performance Debugging in Wireless Sensor Networks  

E-Print Network (OSTI)

of accuracy in the available representation of network status. As well as the energy saving associated with , both bandwidth and energy are at a premium. The common performance monitoring approach of frequently in the network. Carrying out this analysis on the node's themselves rather than at the sink allows us to reduce

Sreenan, Cormac J.

356

A Scalable Interconnection Network Architecture for Petaflops Computing  

Science Journals Connector (OSTI)

Extrapolating technology advances in the near future, a computer architecture capable of petaflops performance will likely be based on a collection of processing nodes interconnected by a high-performance network. One possible organization would consist ... Keywords: computer architecture, interconnection networks, performance analysis, petaflops computing

Constantine Katsinis; Bahram Nabet

2004-02-01T23:59:59.000Z

357

Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks  

E-Print Network (OSTI)

the maximum number of sets of sensor nodes that cover the whole monitored area. Each sensor node is associated constrained coverage problem and proposal a scheduling algorithm based on a greedy approach. In the proposed algorithm, we consider the impact of both the network geometry and the energy consumption by sensors

Islam, M. Saif

358

An Optimal Energy Allocation Algorithm for Energy Harvesting Wireless Sensor Networks  

E-Print Network (OSTI)

. Traditionally, a sensor node is mainly powered by a non-rechargeable battery, which has a limited energy storage by enabling the wireless sensor nodes to replenish energy from ambient sources, such as solar, windAn Optimal Energy Allocation Algorithm for Energy Harvesting Wireless Sensor Networks Shaobo Mao

Wong, Vincent

359

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

360

Localized Low-Weight Graph and Its Applications in Wireless Ad Hoc Networks  

E-Print Network (OSTI)

with O(log n) bits) and small computation cost, where n is the number of wireless nodes. Test results through multi- hop wireless links by using intermediate nodes to relay the message. Consequently, each if the Euclidean distance uv is less than one unit. Wireless ad hoc networks require special treatment

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

Random Access Compressed Sensing for Energy-Efficient Underwater Sensor Networks  

E-Print Network (OSTI)

nodes are anchored to the bottom of the ocean and deployed for long periods of time. Each sensor node reconstructs the map of the physical field. Bandwidth and battery power are severely limited in underwater [3][4]. Authors in [5] are the first to introduce the application of compressed sensing in networks

Hochberg, Michael

362

Biologically-Inspired Adaptive Data Aggregation for Multi-Modal Wireless Sensor Networks  

E-Print Network (OSTI)

that BiSNET allows sensor nodes to autonomously adapt their duty cycle intervals for power efficiency. Introduction Multi-modal wireless sensor networks (MWSNs) face several challenges1 . The first challenge is autonomy. Since sensor nodes can be deployed in an unattended area (e.g., forest and ocean) or physically

Suzuki, Jun

363

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

364

Application of Artificial Neural Network for Estimating Tight Gas Sand Intrinsic Permeability  

Science Journals Connector (OSTI)

Application of Artificial Neural Network for Estimating Tight Gas Sand Intrinsic Permeability ... This jth neuron occupies a general position in the network since it accepts inputs from nodes in the input layer and sends its output to neurons to the second hidden layer. ... (15)?Veelenturf, L. P. J. Analysis and Applications of Artificial Neural Networks; Prentice Hall:? London, 1995. ...

Ali A. Garrouch; Nejib Smaoui

1996-09-19T23:59:59.000Z

365

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

366

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

367

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"

368

A spatial statistics approach to characterizing and modeling the structure of cognitive wireless networks  

Science Journals Connector (OSTI)

The performance of cognitive wireless networks (CWNs) depends heavily on their spatial structure. However, highly simplified models are still routinely used for performance evaluation of CWNs and other wireless networks, with node locations often being ... Keywords: Cognitive wireless networks, Point processes, Spatial statistics, Stochastic geometry

Janne Riihijärvi; Petri Mähönen

2012-07-01T23:59:59.000Z

369

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

370

Flash Flooding: Exploiting the Capture Effect for Rapid Flooding in Wireless Sensor Networks  

E-Print Network (OSTI)

Flash Flooding: Exploiting the Capture Effect for Rapid Flooding in Wireless Sensor Networks,whitehouse}@cs.virginia.edu Abstract--We present the Flash flooding protocol for rapid network flooding in wireless sensor networks. Traditional flooding protocols can be very slow because of neighborhood contention: nodes cannot propagate

Whitehouse, Kamin

371

The exact evaluation of the corner-to-corner resistance of an M N resistor network  

E-Print Network (OSTI)

, U.S.A. PACS numbers: 01.55+b, 02.10.Yn Key words: resistance, electrical networks, asymptotics of electric circuits is the computation of the resistance between two nodes in a resistor network. FormulatedThe exact evaluation of the corner-to-corner resistance of an M Ã? N resistor network: Asymptotic

372

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

373

B.2.Creating a network Using the icons in the Topology Configuration window to create a network  

E-Print Network (OSTI)

47 B.2.Creating a network Using the icons in the Topology Configuration window to create a network topology. =========== Step 1) create a node Select an icon (e.g., RFG) by clicking on it in the Topology Configuration window. Now move the pointer to the Topology window, the pointer will become the selected icon

374

New Technique for Proposing Network's Topology using GPS and GIS  

E-Print Network (OSTI)

The problem of proposed topology for network comes when using Prim's algorithm with default distance (unrealistic distances) between network's nodes and don't care about the lakes, high hills, buildings, etc. This problem will cause incorrect estimations for cost (budget) of requirements like the media (optic fibre) and the number or type of Access-points, regenerator, Optic Amplifier, etc. This paper proposed a new technique of implementing Prim's algorithm to obtain realistic topology using realistic distances between network's nodes via Global Positioning System GPS and Geographic Information Systems GIS packages. Applying the new technique on academic institutes network of Erbil city from view of media (optic fibre) shows that there is disability in cost (budget) of the media which is needed (nearly) 4 times if implement default Prim's algorithm (don't using GPS & GIS) base on unrealistic distances between the nodes.

Ismaeel, Ayad Ghany

2012-01-01T23:59:59.000Z

375

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

DOE Patents (OSTI)

A data collector for a massively parallel computer system obtains call-return stack traceback data for multiple nodes by retrieving partial call-return stack traceback data from each node, grouping the nodes in subsets according to the partial traceback data, and obtaining further call-return stack traceback data from a representative node or nodes of each subset. Preferably, the partial data is a respective instruction address from each node, nodes having identical instruction address being grouped together in the same subset. Preferably, a single node of each subset is chosen and full stack traceback data is retrieved from the call-return stack within the chosen node.

Gooding, Thomas Michael (Rochester, MN); McCarthy, Patrick Joseph (Rochester, MN)

2010-03-02T23:59:59.000Z

376

Network Maps  

NLE Websites -- All DOE Office Websites (Extended Search)

Fasterdata IPv6 Network Network Performance Tools The ESnet Engineering Team Network R&D Overview Experimental Network Testbeds Performance (perfSONAR) Software & Tools...

377

Scaling of load in communications networks  

Science Journals Connector (OSTI)

We show that the load at each node in a preferential attachment network scales as a power of the degree of the node. For a network whose degree distribution is p(k)?k??, we show that the load is l(k)?k? with ?=??1, implying that the probability distribution for the load is p(l)?1/l2 independent of ?. The results are obtained through scaling arguments supported by finite size scaling studies. They contradict earlier claims, but are in agreement with the exact solution for the special case of tree graphs. Results are also presented for real communications networks at the IP layer, using the latest available data. Our analysis of the data shows relatively poor power-law degree distributions as compared to the scaling of the load versus degree. This emphasizes the importance of the load in network analysis.

Onuttom Narayan and Iraj Saniee

2010-09-02T23:59:59.000Z

378

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.

379

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

380

Robust Distributed Routing in Dynamical Networks - Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures  

E-Print Network (OSTI)

Strong resilience properties of dynamical networks are analyzed for distributed routing policies. The latter are characterized by the property that the way the outflow at a non-destination node gets split among its outgoing ...

Como, Giacomo

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

A Network Layer Protocol for UANs to Address Propagation Delay Induced Performance Limitations*  

E-Print Network (OSTI)

network nodes and presents some of the preliminary simulation findings regarding the viability by several key characteristics of the shallow water channel. Many of these issues are adequately addressed technologies. These include selective frequency absorption, temporal spreading, Doppler induced frequency

Xie, Geoffrey

382

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

383

Mobile power management for maximum battery life in wireless communication networks  

Science Journals Connector (OSTI)

We address the problem of how a mobile node in a wireless network should vary its transmitter power so that energy consumption is minimized, subject to fixed quality-of-service constraints. Optimal solutions are obtained for channels with stationary, ...

John M. Rulnick; Nicholas Bambos

1996-03-01T23:59:59.000Z

384

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

NLE Websites -- All DOE Office Websites (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)...

385

Partitioning networks into communities by message passing  

Science Journals Connector (OSTI)

Community structures are found to exist ubiquitously in a number of systems conveniently represented as complex networks. Partitioning networks into communities is thus important and crucial to both capture and simplify these systems’ complexity. The prevalent and standard approach to meet this goal is related to the maximization of a quality function, modularity, which measures the goodness of a partition of a network into communities. However, it has recently been found that modularity maximization suffers from a resolution limit, which prevents its effectiveness and range of applications. Even when neglecting the resolution limit, methods designed for detecting communities in undirected networks cannot always be easily extended, and even less directly applied, to directed networks (for which specifically designed community detection methods are very limited). Furthermore, real-world networks are frequently found to possess hierarchical structure and the problem of revealing such type of structure is far from being addressed. In this paper, we propose a scheme that partitions networks into communities by electing community leaders via message passing between nodes. Using random walk on networks, this scheme derives an effective similarity measure between nodes, which is closely related to community memberships of nodes. Importantly, this approach can be applied to a very broad range of networks types. In fact, the successful validation of the proposed scheme on real and synthetic networks shows that this approach can effectively (i) address the problem of resolution limit and (ii) find communities in both directed and undirected networks within a unified framework, including revealing multiple levels of robust community partitions.

Darong Lai; Christine Nardini; Hongtao Lu

2011-01-31T23:59:59.000Z

386

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

387

Reviewing P2P network community detection  

Science Journals Connector (OSTI)

In this paper we present a summary of the state of the art concerning community detection in distributed computer architectures, for instance so-called P2P systems. The main algorithms for the extraction of communities are reviewed. Each set of nodes ... Keywords: P2P, clustering, community detection algorithms, networks

Anna Puig-Centelles; Oscar Ripolles; Miguel Chover

2007-03-01T23:59:59.000Z

388

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.

389

Hardware demonstration of high-speed networks for satellite applications.  

SciTech Connect

This report documents the implementation results of a hardware demonstration utilizing the Serial RapidIO{trademark} and SpaceWire protocols that was funded by Sandia National Laboratories (SNL's) Laboratory Directed Research and Development (LDRD) office. This demonstration was one of the activities in the Modeling and Design of High-Speed Networks for Satellite Applications LDRD. This effort has demonstrated the transport of application layer packets across both RapidIO and SpaceWire networks to a common downlink destination using small topologies comprised of commercial-off-the-shelf and custom devices. The RapidFET and NEX-SRIO debug and verification tools were instrumental in the successful implementation of the RapidIO hardware demonstration. The SpaceWire hardware demonstration successfully demonstrated the transfer and routing of application data packets between multiple nodes and also was able reprogram remote nodes using configuration bitfiles transmitted over the network, a key feature proposed in node-based architectures (NBAs). Although a much larger network (at least 18 to 27 nodes) would be required to fully verify the design for use in a real-world application, this demonstration has shown that both RapidIO and SpaceWire are capable of routing application packets across a network to a common downlink node, illustrating their potential use in real-world NBAs.

Donaldson, Jonathon W.; Lee, David S.

2008-09-01T23:59:59.000Z

390

Multiplexity-facilitated cascades in networks  

Science Journals Connector (OSTI)

Elements of networks interact in many ways, so modeling them with graphs requires multiple types of edges (or network layers). Here we show that such multiplex networks are generically more vulnerable to global cascades than simplex networks. We generalize the threshold cascade model [Watts, Proc. Natl. Acad. Sci. USA 99, 5766 (2002)] to multiplex networks, in which a node activates if a sufficiently large fraction of neighbors in any layer are active. We show that both combining layers (i.e., realizing other interactions play a role) and splitting a network into layers (i.e., recognizing distinct kinds of interactions) facilitate cascades. Notably, layers unsusceptible to global cascades can cooperatively achieve them if coupled. On one hand, this suggests fundamental limitations on predicting cascades without full knowledge of a system's multiplexity; on the other hand, it offers feasible means to control cascades by introducing or removing sparse layers in an existing network.

Charles D. Brummitt; Kyu-Min Lee; K.-I. Goh

2012-04-27T23:59:59.000Z

391

Multiple crossbar network: A switched high-speed local network  

SciTech Connect

The Multiple Crossbar Network (MCN) is a prototype High-Speed Local Network at the Los Alamos National Laboratory. It will interconnect supercomputers, network servers and workstations from various commercial vendors. The MCN can also serve as a backbone for message traffic between local area networks. The MCN is a switched local network of switching nodes called Cross-Point Stars (CPs). Hosts and CPs are connected by 800-Mbit/s (100-Mbyte/s) point-to-point ANSI High-Speed Channels. CPs include RISC-based network protocol processors called Crossbar Interfaces and a switching core called the Crossbar Switch. Protocols include physical, data link, intranet, and network access functionality. Various internet and transport protocols are intended to run above the MCN protocol suite. A network management and simple naming service is also included within the Los Alamos Network Architecture. Immediate applications include visualization. The MCN is intended to also serve as a framework for multicomputer applications. 36 refs., 10 figs.

Hoebelheinrich, R.; Thomsen, R.

1989-01-01T23:59:59.000Z

392

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

393

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

394

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

395

Policies for implementing network firewalls  

SciTech Connect

Corporate networks are frequently protected by {open_quotes}firewalls{close_quotes} or gateway systems that control access to/from other networks, e.g., the Internet, in order to reduce the network`s vulnerability to hackers and other unauthorized access. Firewalls typically limit access to particular network nodes and application protocols, and they often perform special authentication and authorization functions. One of the difficult issues associated with network firewalls is determining which applications should be permitted through the firewall. For example, many networks permit the exchange of electronic mail with the outside but do not permit file access to be initiated by outside users, as this might allow outside users to access sensitive data or to surreptitiously modify data or programs (e.g., to intall Trojan Horse software). However, if access through firewalls is severely restricted, legitimate network users may find it difficult or impossible to collaborate with outside users and to share data. Some of the most serious issues regarding firewalls involve setting policies for firewalls with the goal of achieving an acceptable balance between the need for greater functionality and the associated risks. Two common firewall implementation techniques, screening routers and application gateways, are discussed below, followed by some common policies implemented by network firewalls.

Brown, C.D.

1994-05-01T23:59:59.000Z

396

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

Science Journals Connector (OSTI)

We perform 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-law relations between the folding time and the number of nodes and bonds. We show that these scalings are determined by the fractal properties of first-passage networks. Thus, we have identified a possible mechanism—the small fractal dimension of first passage networks—which can give rise to reliable folding in proteins with rugged energy landscapes.

Gregg Lois; Jerzy Blawzdziewicz; Corey S. O’Hern

2010-05-06T23:59:59.000Z

397

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

398

SRC burn test in 700-hp oil-designed boiler. Annex Volume C. Boiler emission report. Final technical report  

SciTech Connect

The Solvent-Refined Coal (SRC) test burn program was conducted at the Pittsburgh Energy Technology Center (PETC) located in Bruceton, Pa. One of the objectives of the study was to determine the feasibility of burning SRC fuels in boilers set up for fuel oil firing and to characterize emissions. Testing was conducted on the 700-hp oil-fired boiler used for research projects. No. 6 fuel oil was used for baseline data comparison, and the following SRC fuels were tested: SRC Fuel (pulverized SRC), SRC Residual Oil, and SRC-Water Slurry. Uncontrolled particulate emission rates averaged 0.9243 lb/10/sup 6/ Btu for SRC Fuel, 0.1970 lb/10/sup 6/ Btu for SRC Residual Oil, and 0.9085 lb/10/sup 6/ Btu for SRC-Water Slurry. On a lb/10/sup 6/ Btu basis, emissions from SRC Residual Oil averaged 79 and 78%, respectively, lower than the SRC Fuel and SRC-Water Slurry. The lower SRC Residual Oil emissions were due, in part, to the lower ash content of the oil and more efficient combustion. The SRC Fuel had the highest emission rate, but only 2% higher than the SRC-Water Slurry. Each fuel type was tested under variable boiler operating parameters to determine its effect on boiler emissions. The program successfully demonstrated that the SRC fuels could be burned in fuel oil boilers modified to handle SRC fuels. This report details the particulate emission program and results from testing conducted at the boiler outlet located before the mobile precipitator take-off duct. The sampling method was EPA Method 17, which uses an in-stack filter.

Not Available

1983-09-01T23:59:59.000Z

399

Adjuvant Docetaxel for Node-Positive Breast Cancer  

Science Journals Connector (OSTI)

...contained doxorubicin or epirubicin reduced the annual risk of recurrence of breast cancer by 12 percent and the annual risk of death by 11 percent. Rates of disease-free and overall survival were similar among women treated with either six cycles (spanning 24 weeks) of cyclophosphamide, methotrexate, and... This randomized trial included almost 1500 women with breast cancer and positive axillary nodes and compared treatment with doxorubicin and cyclophosphamide combined with either fluorouracil or docetaxel. The rates of disease-free and overall survival were significantly higher among women in the docetaxel group.

Martin M.; Pienkowski T.; Mackey J.

2005-06-02T23:59:59.000Z

400

Voltage Control Devices on the IEEE 8500 Node Test Feeder  

SciTech Connect

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

Schneider, Kevin P.; Fuller, Jason C.

2010-01-06T23: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

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

402

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

403

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

404

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

405

HP Steam Trap Monitoring  

E-Print Network (OSTI)

Consumption Peak Demand Mgt Peak Demand Mgt Similar Weather Day Analysis Metering and Verafication Steam Meter Monitoring ? Peak Demand Management ? Steam Consumption Management ? Steam Bill Verification ? Measurement and Verification ... Consumption Peak Demand Mgt Peak Demand Mgt Similar Weather Day Analysis Metering and Verafication Steam Meter Monitoring ? Peak Demand Management ? Steam Consumption Management ? Steam Bill Verification ? Measurement and Verification ...

Pascone, S.

2011-01-01T23:59:59.000Z

406

Self-limiting adaptive protocols for controlled flooding in ad hoc networks Larry Hughes and Ying Zhang  

E-Print Network (OSTI)

Self-limiting adaptive protocols for controlled flooding in ad hoc networks Larry Hughes and Ying power consumption, reduce traffic, and restrict flooding, are of growing importance. In this paper-aware nodes, can reduce the number of nodes involved in a transmission. Simulation results show

Hughes, Larry

407

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

408

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.

409

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.

410

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

411

Hybrid function projective synchronization in complex dynamical networks  

SciTech Connect

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

412

Characteristic times of biased random walks on complex networks  

Science Journals Connector (OSTI)

We consider degree-biased random walkers whose probability to move from a node to one of its neighbors of degree k is proportional to k?, where ? is a tuning parameter. We study both numerically and analytically three types of characteristic times, namely (i) the time the walker needs to come back to the starting node, (ii) the time it takes to visit a given node for the first time, and (iii) the time it takes to visit all the nodes of the network. We consider a large data set of real-world networks and we show that the value of ? which minimizes the three characteristic times differs from the value ?min=?1 analytically found for uncorrelated networks in the mean-field approximation. In addition to this, we found that assortative networks have preferentially a value of ?min in the range [?1,?0.5], while disassortative networks have ?min in the range [?0.5,0]. We derive an analytical relation between the degree correlation exponent ? and the optimal bias value ?min, which works well for real-world assortative networks. When only local information is available, degree-biased random walks can guarantee smaller characteristic times than the classical unbiased random walks by means of an appropriate tuning of the motion bias.

Moreno Bonaventura; Vincenzo Nicosia; Vito Latora

2014-01-09T23:59:59.000Z

413

Complex networks in confined comminution  

Science Journals Connector (OSTI)

The physical process of confined comminution is investigated within the framework of complex networks. We first characterize the topology of the unweighted contact networks as generated by the confined comminution process. We find this process gives rise to an ultimate contact network which exhibits a scale-free degree distribution and small world properties. In particular, if viewed in the context of networks through which information travels along shortest paths, we find that the global average of the node vulnerability decreases as the comminution process continues, with individual node vulnerability correlating with grain size. A possible application to the design of synthetic networks (e.g., sensor networks) is highlighted. Next we turn our attention to the physics of the granular comminution process and examine force transmission with respect to the weighted contact networks, where each link is weighted by the inverse magnitude of the normal force acting at the associated contact. We find that the strong forces (i.e., force chains) are transmitted along pathways in the network which are mainly following shortest-path routing protocols, as typically found, for example, in communication systems. Motivated by our earlier studies of the building blocks for self-organization in dense granular systems, we also explore the properties of the minimal contact cycles. The distribution of the contact strain energy intensity of 4-cycle motifs in the ultimate state of the confined comminution process is shown to be consistent with a scale-free distribution with infinite variance, thereby suggesting that 4-cycle arrangements of grains are capable of storing vast amounts of energy in their contacts without breaking.

David M. Walker; Antoinette Tordesillas; Itai Einav; Michael Small

2011-08-08T23:59:59.000Z

414

Cascade of failures in coupled network systems with multiple support-dependence relations  

Science Journals Connector (OSTI)

We study, both analytically and numerically, the cascade of failures in two coupled network systems A and B, where multiple support-dependence relations are randomly built between nodes of networks A and B. In our model we assume that each node in one network can function only if it has at least a single support link connecting it to a functional node in the other network. We assume that networks A and B have (i) sizes NA and NB, (ii) degree distributions of connectivity links PA(k) and PB(k), (iii) degree distributions of support links P?A(k) and P?B(k), and (iv) random attack removes (1-RA)NA and (1-RB)NB nodes form the networks A and B, respectively. We find the fractions of nodes ??A and ??B which remain functional (giant component) at the end of the cascade process in networks A and B in terms of the generating functions of the degree distributions of their connectivity and support links. In a special case of Erd?s-Rényi networks with average degrees a and b in networks A and B, respectively, and Poisson distributions of support links with average degrees a? and b? in networks A and B, respectively, ??A=RA[1-exp(-a???B)][1-exp(-a??A)] and ??B=RB[1-exp(-b???A)][1-exp(-b??B)]. In the limit of a??? and b???, both networks become independent, and our model becomes equivalent to a random attack on a single Erd?s-Rényi network. We also test our theory on two coupled scale-free networks, and find good agreement with the simulations.

Jia Shao; Sergey V. Buldyrev; Shlomo Havlin; H. Eugene Stanley

2011-03-29T23:59:59.000Z

415

Networks, smart grids: new model for synchronization  

NLE Websites -- All DOE Office Websites (Extended Search)

Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Networks, smart grids: new model for synchronization Researchers developed a surprisingly simple mathematical model that accurately predicts synchronization as a function of the parameters and the topology of the underlying network. May 21, 2013 High voltage transmission lines carry electrical power. High voltage transmission lines carry electrical power. The researchers envision that their method could be applied to assess synchronization and robustness quickly in electrical grids under volatile operating conditions. Networks of individual oscillating nodes often spontaneously synchronize and begin to oscillate at a coherent frequency. From heart cells to flashing fireflies to electric power grids, coupled oscillator networks are

416

Determination of lithology from well logs using a neural network  

SciTech Connect

The authors have developed a computer program to automatically determine lithologies from well logs using a back-propagation neural network. Unlike a conventional serial computer, a neural network is a computational system composed of nodes (sometimes called neurons, neurodes, or units) and the connections between these nodes. Neural computing attempts to emulate the functions of the mammalian brain, thus mimicking thought processes. The neural network approach differs from previous pattern recognition methods in its ability to learn from examples. Unlike conventional statistical methods, this new approach does not require sophisticated mathematics and a large amount of statistical data. This paper discusses the application of neural networks to a pattern recognition problem in geology: the determination of lithology from well logs. The neural network determined the lithologies (limestone, dolomite, sandstone, shale, sandy and dolomitic limestones, sandy dolomite, and shale sandstone) from selected well logs in a fraction of the time required by an experienced human log analyst.

Rogers, S.J.; Fang, J.H. (Univ. of Alabama, Tuscaloosa (United States)); Karr, C.L.; Stanley, D.A. (Bureau of Mines, Tuscaloosa, AL (United States))

1992-05-01T23:59:59.000Z

417

Power grid vulnerability: A complex network approach  

Science Journals Connector (OSTI)

Power grids exhibit patterns of reaction to outages similar to complex networks. Blackout sequences follow power laws as complex systems operating near a critical point. Here the tolerance of electric power grids to both accidental and malicious outages is analyzed in the framework of complex network theory. In particular the quantity known as efficiency is modified by introducing a new concept of distance between nodes. As a result a new parameter called net-ability is proposed to evaluate the performance of power grids. A comparison between efficiency and net-ability is provided by estimating the vulnerability of sample networks in terms of both the metrics.

S. Arianos; E. Bompard; A. Carbone; F. Xue

2009-01-01T23:59:59.000Z

418

Spreading dynamics in complex networks  

Science Journals Connector (OSTI)

Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from epidemic control, innovation diffusion, viral marketing, and social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community—LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in the LiveJournal social network, only a small fraction of them are involved in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with a large influence. Our results should provide useful information for designing efficient spreading strategies in reality.

Sen Pei; Hernán A Makse

2013-01-01T23:59:59.000Z

419

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

SciTech Connect

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

420

Video-rate fluorescence diffuse optical tomography for in vivo sentinel lymph node imaging  

Science Journals Connector (OSTI)

We have developed a fiber-based, video-rate fluorescence diffuse optical tomography (DOT) system for noninvasive in vivo sentinel lymph node (SLN) mapping. Concurrent acquisition of...

Solomon, Metasebya; White, Brian R; Nothdruft, Ralph E; Akers, Walter; Sudlow, Gail; Eggebrecht, Adam T; Achilefu, Samuel; Culver, Joseph P

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


421

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

422

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

423

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

NLE Websites -- All DOE Office Websites (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...

424

A Fuzzy Logic-Based Approach for Node Localization in Mobile Sensor Networks  

E-Print Network (OSTI)

and signal interference. We propose FuzLoc, a range-based, anchor-based, fuzzy logic enabled system system for localization. Quantities like RSS and distance are transformed into linguistic variables such as Low, Medium, High etc. by binning. The location...

Chenji Jayanth, Harshavardhan

2011-02-22T23:59:59.000Z

425

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

NLE Websites -- All DOE Office Websites (Extended Search)

Princeton Plasma Physics Laboratory, Theory Department Collection: Plasma Physics and Fusion 3 Annales Geophysicae (2004) 22: 267287 European Geosciences Union 2004 Geophysicae...

426

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

NLE Websites -- All DOE Office Websites (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...

427

E-Print Network 3.0 - atrioventricular node ablation Sample Search...  

NLE Websites -- All DOE Office Websites (Extended Search)

Summary: , DVM; G. Allan Johnson, PhD; Margaret L. Kirby, PhD Cardiac neural crest (CNC) ablation in embryonic... -operated and CNC-ablated embryos acquired by magnetic...

428

Analysis of critical and redundant nodes in controlling directed and undirected complex networks using dominating sets  

Science Journals Connector (OSTI)

......immediate knowledge about cascading failures in power grids, spread of virus over the Internet, emergence of consciousness in the brain or the chemical transformations in metabolic pathways, respectively. The representation of real-world dynamical systems......

Jose C. Nacher; Tatsuya Akutsu

2014-12-01T23:59:59.000Z

429

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

430

Multi-Node Cooperative Resource Allocation to Improve Coverage Area in Wireless Networks  

E-Print Network (OSTI)

for improving service coverage and reducing the cost of constructing base stations. So expanding the service control can be combined together to optimize the resource usages [2]. Other adaptation such as turbo code

Liu, K. J. Ray

431

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

432

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

433

Shortening treatment time in robotic radiosurgery using a novel node reduction technique  

SciTech Connect

Purpose: The fraction duration of robotic radiosurgery treatments can be reduced by generating more time-efficient treatment plans with a reduced number of node positions, beams, and monitor units (MUs). Node positions are preprogramed locations where the robot can position the focal spot of the x-ray beam. As the time needed for the robot to travel between node positions takes up a large part of the treatment time, the aim of this study was to develop and evaluate a node reduction technique in order to reduce the treatment time per fraction for robotic radiosurgery. Methods: Node reduction was integrated into the inverse planning algorithm, developed in-house for the robotic radiosurgery modality. It involved repeated inverse optimization, each iteration excluding low-contribution node positions from the planning and resampling new candidate beams from the remaining node positions. Node reduction was performed until the exclusion of a single node position caused a constraint violation, after which the shortest treatment plan was selected retrospectively. Treatment plans were generated with and without node reduction for two lung cases of different complexity, one oropharyngeal case and one prostate case. Plan quality was assessed using the number of node positions, beams and MUs, and the estimated treatment time per fraction. All treatment plans had to fulfill all clinical dose constraints. Extra constraints were added to maintain the low-dose conformality and restrict skin doses during node reduction. Results: Node reduction resulted in 12 residual node positions, on average (reduction by 77%), at the cost of an increase in the number of beams and total MUs of 28% and 9%, respectively. Overall fraction durations (excluding patient setup) were shortened by 25% (range of 18%-40%), on average. Dose distributions changed only little and dose in low-dose regions was effectively restricted by the additional constraints. Conclusions: The fraction duration of robotic radiosurgery treatments can be reduced considerably by node reduction with minimal changes in dosimetrical plan quality. Additional constraints are required to guarantee low-dose conformality and to avoid unacceptable skin dose.

Water, Steven van de; Hoogeman, Mischa S.; Breedveld, Sebastiaan; Heijmen, Ben J. M. [Department of Radiation Oncology, Erasmus MC-Daniel den Hoed Cancer Center, Groene Hilledijk 301, 3075 EA Rotterdam (Netherlands)

2011-03-15T23:59:59.000Z

434

A novel MAC scheduler to minimize the energy consumption in a Wireless Sensor Network  

Science Journals Connector (OSTI)

The rising success of the Internet of Things has led the Wireless Sensor Networks to play an important role in many fields, ranging from military to civilian applications. However, since sensor nodes are battery powered, communication protocols and applications ... Keywords: Duty cycle, Energy saving, MAC scheduler, Performance evaluation, Wireless Sensor Network

Luca Anchora; Antonio Capone; Vincenzo Mighali; Luigi Patrono; Francesco Simone

2014-05-01T23:59:59.000Z

435

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

436

COMMUNITY-BASED PUBLIC AUTHORING WITH MOBILE CHEMICAL SENSOR NETWORKS C. Brueton, 1  

E-Print Network (OSTI)

COMMUNITY-BASED PUBLIC AUTHORING WITH MOBILE CHEMICAL SENSOR NETWORKS G. Lane,1 C. Brueton, 1 D of empowerment promoted. In this paper we introduce the current version of a mobile chemical sensor network node which forms the core of such an RFPA built around the Urban Tapestries platform. Finally, we report

Roussos, George

437

Minimization of voltage deviation and power losses in power networks using Pareto optimization methods  

Science Journals Connector (OSTI)

Voltage regulation is an important task in electrical engineering for controlling node voltages in a power network. A widely used solution for the problem of voltage regulation is based on adjusting the taps in under load tap changers (ULTCs) power transformers ... Keywords: Multi-objective optimization, Power distribution network, Power losses, Under load tap changers, Voltage regulation

Francisco G. Montoya; Raúl Baños; Consolación Gil; Antonio Espín; Alfredo Alcayde; Julio Gómez

2010-08-01T23:59:59.000Z

438

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

439

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"

440

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

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

Redundancy, diversity, and connectivity to achieve multilevel network resilience, survivability, and disruption tolerance invited paper  

Science Journals Connector (OSTI)

Communication networks are constructed as a multilevel stack of infrastructure, protocols, and mechanisms: links and nodes, topology, routing paths, interconnected realms (ASs), end-to-end transport, and application interaction. The resilience of each ... Keywords: Cross-layer optimisation, Dependability, reliability, availability, performability, Multilevel network analysis, Redundancy, diversity, eventual connectivity, Resilient, survivable, disruption-tolerant Future Internet

James P. Sterbenz, David Hutchison, Egemen K. Çetinkaya, Abdul Jabbar, Justin P. Rohrer, Marcus Schöller, Paul Smith

2014-05-01T23:59:59.000Z

442

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

443

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

444

Using Heterogeneous Networks to Improve Energy Efficiency in Direct Coherence Protocols for Many-Core CMPs  

E-Print Network (OSTI)

Using Heterogeneous Networks to Improve Energy Efficiency in Direct Coherence Protocols for Many, thus avoiding the indirection caused by accessing a separate directory (usually in the home node requests, but at the price of significantly increasing network traffic, and consequently, energy

Fernández Pascual, Ricardo

445

Optimal Transmission Range for Wireless Ad Hoc Networks Based on Energy Efficiency  

E-Print Network (OSTI)

, and security issues, we investigate the efficiency of energy consumption in wireless ad hoc networks-efficient mechanisms is of importance. In wireless ad hoc networks, energy consumption at each node is mainly due energy consumption of system operation and data processing, energy consumption economy of radio

Deng, Jing

446

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

447

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.

448

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

449

On small, reduced, and fast universal accepting networks of splicing processors  

Science Journals Connector (OSTI)

In this paper, we show that accepting networks of splicing processors (ANSPs) of size 2 are computationally complete. Since, by definition, an ANSP needs at least two nodes to perform non-trivial computations, this completely settles the question of ... Keywords: Molecular computation, Networks of processors, Splicing

Remco Loos; Florin Manea; Victor Mitrana

2009-02-01T23:59:59.000Z

450

~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"

451

Structure of optimal pipe networks subject to a global constraint Marc Durand  

E-Print Network (OSTI)

the total energy dissipation rate is studied analytically. Among all the possible pipe networks that can, among others, the water, natural gas and power supply of a city, telecommunication networks, rail are not independent but must satisfy a conservation law at every source, sink, and ad­ ditional node. That is, the sum

452

OTGsim: Simulation of an Off-the-Grid Radar Network with High Sensing Energy Cost  

E-Print Network (OSTI)

OTGsim: Simulation of an Off-the-Grid Radar Network with High Sensing Energy Cost Brian C. Donovan|kurose@cs.umass.edu Abstract--Many sensor network studies assume that the energy cost for sensing is negligible compared sensors with a high energy cost such as radar. For a node utilizing radar as its primary sensor

Kurose, Jim

453

On the Connectivity in One-Dimensional Ad Hoc Wireless Networks with a Forbidden Zone  

E-Print Network (OSTI)

the ocean temperature for an accurate weather prediction, detecting the 1 Email: xdhu@mspil.edu.cn 2 Email region [7]. As each node in the ad hoc networks has a limit transmis- sion power and the networks have in the future. 2. Main results and proofs In order to state our main results, we first introduce some

454

Shock waves on complex networks  

E-Print Network (OSTI)

Power grids, road maps, and river streams are examples of infrastructural networks which are highly vulnerable to external perturbations. An abrupt local change of load (voltage, traffic density, or water level) might propagate in a cascading way and affect a significant fraction of the network. Almost discontinuous perturbations can be modeled by shock waves which can eventually interfere constructively and endanger the normal functionality of the infrastructure. We study their dynamics by solving the Burgers equation under random perturbations on several real and artificial directed graphs. Even for graphs with a narrow distribution of node properties (e.g., degree or betweenness), a steady state is reached exhibiting a heterogeneous load distribution, having a difference of one order of magnitude between the highest and average loads. Unexpectedly we find for the European power grid and for finite Watts-Strogatz networks a broad pronounced bimodal distribution for the loads. To identify the most vulnerable...

Mones, Enys; Vicsek, Tamás; Herrmann, Hans J

2014-01-01T23:59:59.000Z

455

This paper presents a neural network based technique for the solution of a water system state estimation problem.The technique  

E-Print Network (OSTI)

ABSTRACT This paper presents a neural network based technique for the solution of a water system applied to a realistic 34-node water network. By changing the values of neural network parameters both with respect to their sensitivity to measurement errors. INTRODUCTION Efficient control of a complex water

Bargiela, Andrzej

456

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

457

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

458

A Gaussian graphical model approach to climate networks  

SciTech Connect

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 Hügel 20, 53121 Bonn (Germany)] [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany); Friederichs, Petra; Hense, Andreas [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany) [Meteorological Institute, University of Bonn, Auf dem Hügel 20, 53121 Bonn (Germany); Interdisciplinary Center for Complex Systems, University of Bonn, Brühler Straße 7, 53119 Bonn (Germany); Lehnertz, Klaus [Department of Epileptology, University of Bonn, Sigmund-Freud-Straße 25, 53105 Bonn (Germany) [Department of Epileptology, University of Bonn, Sigmund-Freud-Straße 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, Brühler Straße 7, 53119 Bonn (Germany)

2014-06-15T23:59:59.000Z

459

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

460

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

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

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.

462

Role of second trials in cascades of information over networks  

Science Journals Connector (OSTI)

We study the propagation of information in social networks. To do so, we focus on a cascade model where nodes are infected with probability p1 after their first contact with the information and with probability p2 at all subsequent contacts. The diffusion starts from one random node and leads to a cascade of infection. It is shown that first and subsequent trials play different roles in the propagation and that the size of the cascade depends in a nontrivial way on p1, p2, and on the network structure. Second trials are shown to amplify the propagation in dense parts of the network while first trials are dominant for the exploration of new parts of the network and launching new seeds of infection.

C. de Kerchove; G. Krings; R. Lambiotte; P. Van Dooren; V. D. Blondel

2009-01-30T23:59:59.000Z

463

Routing with Mutual Information Accumulation in Wireless Networks  

E-Print Network (OSTI)

We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual information with every packet transmission. This enables a significant performance gain over conventional shortest path routing. Further, it also outperforms cooperative communication techniques that are based on energy accumulation. However, it creates complex and combinatorial networking decisions concerning which nodes participate in transmission, and which decode ordering to use. We formulate the general problem as a combinatorial optimization problem and then make use of several structural properties to simplify the solution and derive an optimal greedy algorithm. Although the reduced problem still has exponential complexity, using the insight obtained from the optimal solution to a line network, we propose two simple heuristics that can be implemented in polynomial time in a distributed fashion and compare them with the optimal s...

Urgaonkar, Rahul

2010-01-01T23:59:59.000Z

464

Total number of slots consumed in long_excl.q (exclusive nodes) will be  

NLE Websites -- All DOE Office Websites (Extended Search)

Total number of slots consumed in long_excl.q Total number of slots consumed in long_excl.q (exclusive nodes) will be restricted to 320 slots on June 4, 2013 Total number of slots consumed in long_excl.q (exclusive nodes) will be restricted to 320 slots on June 4, 2013 May 28, 2013 (0 Comments) The long queue has had a per-user limit of 320 slots (or 40 8-core nodes) for several months. The long_excl.q has not had a similar limit. On June 4, a per-user 320 slot limit will be introduced on the exclusive nodes (or 20 16-core nodes). This will ensure that a single user cannot consume too many resources simultaneously in the long queues. For large calculations requiring a great deal of resources, the normal queues should be targeted (jobs < 12 hours), as there are no per-user slots limits on those queues.

465

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

DOE Patents (OSTI)

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

None

2013-06-04T23:59:59.000Z

466

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, João

2013-01-01T23:59:59.000Z

467

On the Feasibility of Early Detection of Environmental Events through Wireless Sensor Networks and the Use of 802.15.4 and GPRS  

Science Journals Connector (OSTI)

In this paper, a general model of an Early Detection of Environmental Events System is presented. It follows established technologies and it is based on wireless sensor network nodes connected to a central com...

Jorge Santos; Rodrigo M. Santos; Javier D. Orozco

2009-01-01T23:59:59.000Z

468

Cross-linked structure of network evolution  

SciTech Connect

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

469

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

SciTech Connect

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

470

The impact of the number of excised axillary nodes and of the percentage of involved nodes on regional nodal failure in patients treated by breast-conserving surgery with or without regional irradiation  

SciTech Connect

Purpose: After breast-conserving surgery, recommendations for regional nodal radiotherapy are usually based on the number of positive nodes. This number is dependent on the number of nodes removed during the axillary dissection. This study examines whether the percentage of positive nodes may help to select patients for regional radiotherapy. Methods and Materials: A retrospective study was conducted on 1,372 T1-T2 node-positive breast cancer patients treated at L'Hotel-Dieu de Quebec Hospital between 1972 and 1997. Results: Among the patients who did not receive regional radiotherapy, the percentage of involved nodes was significantly associated with axillary failure. Ten-year axillary control rates were 97% and 91% when the percentage of involved nodes was <50% and {>=}50%, respectively (p = 0.007). In addition, regional radiotherapy is always significantly associated with a decrease in overall regional failure (axillary and/or supraclavicular), regardless of the percentage of involved nodes. However, regional radiotherapy reduced the axillary failure rate (2% vs. 9%, p = 0.007) only when more than a specific percentage of nodes was involved ({>=}40% if N1-3 and {>=}50% if N>3 nodes). Conclusions: The percentage of involved nodes should be taken into consideration in selecting patients for regional radiotherapy. Irradiation of the axilla should be reserved for patients with a specific ratio: >40% involved nodes if N1-3 and {>=}50% involved nodes if N>3 nodes.

Fortin, Andre [Department of Radiation Oncology, L'Hotel-Dieu de Quebec, Quebec City, Quebec (Canada)]. E-mail: afortin@videotron.ca; Dagnault, Anne [Department of Radiation Oncology, L'Hotel-Dieu de Quebec, Quebec City, Quebec (Canada); Blondeau, Lucie [Department of Radiation Oncology, L'Hotel-Dieu de Quebec, Quebec City, Quebec (Canada); Thi Trinh Thuc Vu [Department of Radiation Oncology, L'Hotel-Dieu de Quebec, Quebec City, Quebec (Canada); Larochelle, Marie [Department of Radiation Oncology, L'Hotel-Dieu de Quebec, Quebec City, Quebec (Canada)

2006-05-01T23:59:59.000Z

471

An efficient flooding algorithm for improving network performance in optical WDM networks  

Science Journals Connector (OSTI)

In any networking environment, network and resource information has to be maintained periodically for re-routing the traffic. Especially in fault tolerant optical networks, after the faults are detected and recovered, the network topology changes have to be constantly configured for correct light path decisions to be made. In order to maintain correct routing tables and also to prevent blocking of forthcoming calls by the failed connection, the flooding messages have been broadcast to all nodes. When every node in the network floods the messages, problems arise of excessive redundancy of messages, resource contention and signal collision. This causes high protocol overhead and interference with the existing traffic in the networks. In this paper, lazy flooding algorithm is analysed and simulated by comparing the performance of all-flooding method and threshold flooding. Here, instead of flooding for each channel status update, such as to be changed from available to occupy or vice versa, we hold the process of update till it reaches certain points. The simulation results shows that the proposed flooding method achieves reduced blocking probability with increased throughput thereby increasing the scalability of the network.

M. Arunachalam; V. Rajamani

2014-01-01T23:59:59.000Z

472

Binary threshold networks as a natural null model for biological networks  

Science Journals Connector (OSTI)

Spin models of neural networks and genetic networks are considered elegant as they are accessible to statistical mechanics tools for spin glasses and magnetic systems. However, the conventional choice of variables in spin systems may cause problems in some models when parameter choices are unrealistic from a biological perspective. Obviously, this may limit the role of a model as a template model for biological systems. Perhaps less obviously, also ensembles of random networks are affected and may exhibit different critical properties. We consider here a prototypical network model that is biologically plausible in its local mechanisms. We study a discrete dynamical network with two characteristic properties: Nodes with binary states 0 and 1, and a modified threshold function with ?0(0)=0. We explore the critical properties of random networks of such nodes and find a critical connectivity Kc=2.0 with activity vanishing at the critical point. Finally, we observe that the present model allows a more natural implementation of recent models of budding yeast and fission yeast cell-cycle control networks.

Matthias Rybarsch and Stefan Bornholdt

2012-08-27T23:59:59.000Z

473

Multilevel method for modeling large-scale networks.  

SciTech Connect

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

Safro, I. M. (Mathematics and Computer Science)

2012-02-24T23:59:59.000Z

474

JC3 Medium Impact Assessment Bulletins | Department of Energy  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

July 5, 2012 July 5, 2012 U-205: RSA Access Manager Session Replay Flaw Lets Remote Users Access the System A vulnerability was reported in RSA Access Manager. A remote user can gain access to the target system. July 3, 2012 U-204: HP Network Node Manager i Input Validation Hole Permits Cross-Site Scripting Attacks 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). June 29, 2012 U-202: Apple QuickTime Multiple Stack Overflow Vulnerabilities Visiting a maliciously crafted website may lead to an unexpected application termination or arbitrary code execution. June 28, 2012 U-201: HP System Management Homepage Bugs Let Remote Users Deny Service

475

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.

476

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

477

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.

478

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

479

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

480

Cables, Paths and \\Subconscious" Reasoning Propositional Semantic Networks  

E-Print Network (OSTI)

Cables, Paths and \\Subconscious" Reasoning in Propositional Semantic Networks Stuart C. Shapiro represented by the propositional node, the label This is a preliminary version of S. C. Shapiro, Cables, paths-7022 (716) 636-3182 shapiro@cs.bu alo.edu 1 Introduction In this paper, I will discuss two aspects of SNe

Shapiro, Stuart C.

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

Saving Energy in Wireless Local Area Sensor Networks  

Science Journals Connector (OSTI)

......can see in this study, each device has been man- ufactured for...Lucent WaveLAN IEEE 802.11 device. Their paper shows a series...energy consumption of this device operating in an ad hoc networking...originated the packet. A node listening to these packets makes a corresponding......

Jaime Lloret; Sandra Sendra; Hugo Coll; Miguel Garcia

2010-12-01T23:59:59.000Z

482

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

483

Wireless Sensor Networks for Monitoring of Large Public Buildings  

E-Print Network (OSTI)

for a communication infrastructure set-up. Using energy-conservation techniques (putting nodes to sleep whenWireless Sensor Networks for Monitoring of Large Public Buildings Murat Demirbas Department potential, monitoring of large public buildings is a significant emerging application area for wireless

Demirbas, Murat

484

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

485

APPROXIMATE SOLUTION OF A CLASS OF QUEUEING NETWORKS WITH BREAKDOWNS  

E-Print Network (OSTI)

breakdowns and are subsequently repaired. The network topology is a pipeline with feedback from the final of operational servers at each node in the pipeline. This model is in general intractable, however an iterative], but changed the nature of the fail- ure so that queues were preserved during repair peri- ods. The same

Imperial College, London

486

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

487

1 INTRODUCTION We consider network protection (NP) by line switch-  

E-Print Network (OSTI)

framework applied to a realistic case study, i.e. the Italian 380kV power transmission grid, are summa as a network of N nodes (substations or buses) and K edges (transmission lines). Two types of buses that minimizes the consequences of cascading failures on an electrical grid. The 380 kV Italian power

Paris-Sud XI, Université de

488

Local Connectivity Tests to Identify Wormholes in Wireless Networks  

E-Print Network (OSTI)

Local Connectivity Tests to Identify Wormholes in Wireless Networks Xiaomeng Ban Computer Science and removal algorithm based on local connectivity tests. The basic idea is that the neighborhood of a wormhole contains two sets of nodes corresponding to two sides of the wormhole. The distance between these two sets

Gao, Jie

489

Deployment and coverage maintenance in mobile sensor networks  

E-Print Network (OSTI)

Deployment of mobile nodes in a region of interest is a critical issue in building a mobile sensor network because it affects cost and detection capabilities of the system. The deployment of mobile sensors in essence is the movement of sensors from...

Lee, Jaeyong

2009-05-15T23:59:59.000Z

490

Fully Polynomial Approximation Algorithm for Collaborative Relaying in Sensor Networks  

E-Print Network (OSTI)

to minimize the total average trans- mission power and satisfy the given probability of outage. We develop two-relay quantization, we reduce the problem to the well-known k-median problem [1] on line graphs and show a a simple O networks. One technique for minimizing transmission energy in a cluster is collaborative re- laying. Nodes

Wei, Shuangqing

491

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

492

Dynamic theory of cascades on finite clustered random networks with a threshold rule  

Science Journals Connector (OSTI)

Cascade dynamics on networks are usually analyzed statically to determine existence criteria for cascades. Here, the Watts model of threshold dynamics on random Erd?s-Rényi networks is analyzed to determine the dynamic time evolution of cascades. The network is assumed to have a specific finite number of nodes n and is not assumed to be treelike. All combinations of threshold ?, network average nodal degree z, and seed sizes |S| from a single node up are included. The analysis permits study of network size effects and increased clustering coefficient. Several size effects not found by infinite network theory are predicted by the analysis and confirmed by simulations. In the region of ? and z where a single node can start a cascade, cascades are expanding, in the sense that each step flips a larger group than the previous step did. We show that this region extends to larger values of z than predicted by infinite network analyses. In the region where larger seeds are needed (size proportional to n), cascades begin by contracting: at the outset, each step flips fewer nodes than the previous step, but eventually the process reverses and becomes expanding. A critical mass that grows during the cascade beyond an easily-calculated threshold is identified as the cause of this reversal.

Daniel E. Whitney

2010-12-08T23:59:59.000Z

493

Artificial Neural Networks Single Layer Networks Multi Layer Networks Generalization Artificial Neural Networks  

E-Print Network (OSTI)

Artificial Neural Networks Single Layer Networks Multi Layer Networks Generalization Artificial Neural Networks #12;Artificial Neural Networks Single Layer Networks Multi Layer Networks Generalization 1 Artificial Neural Networks Properties Applications Classical Examples Biological Background 2

Kjellström, Hedvig

494

Artificial Neural Networks Single Layer Networks Multi Layer Networks Generalization Artificial Neural Networks  

E-Print Network (OSTI)

Artificial Neural Networks Single Layer Networks Multi Layer Networks Generalization Artificial Neural Networks Artificial Neural Networks Single Layer Networks Multi Layer Networks Generalization 1 Artificial Neural Networks Properties Applications Classical Examples Biological Background 2 Single Layer

Kjellström, Hedvig

495

Criteria for stochastic pinning control of networks of chaotic maps  

SciTech Connect

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

496

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

497

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

498

Design and implementation of a five-hp, switched reluctance, fuel-lube, pump motor drive for a gas turbine engine  

SciTech Connect

A new switched reluctance (SR) fuel/lube (F/L) pump system has been developed for a gas turbine engine application. The system is rated at 5 hp, 270 Vdc, 12.5 krpm maximum operating speed, and consists of a SR machine mounted on the F/L pump shaft, an inverter, and an electronic controller. This paper focuses on the design, implementation, and performance of the system. The system can use one of two methods for rotor position sensing, either a resolver or electronic position sensing (EPS). The F/L pump system has undergone extensive performance testing with the resolver. Currently, testing is underway using electronic position sensing. Test results are given to validate the system design and compare the performance using both approaches to position sensing. System efficiency is about 82% at full load.

Ferreira, C.A.; Jones, S.R.; Drager, B.T.; Heglund, W.S. (Sundstrand Aerospace, Rockford, IL (United States))

1995-01-01T23:59:59.000Z

499

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

500

On cost-effective communication network designing  

E-Print Network (OSTI)

How to efficiently design a communication network is a paramount task for network designing and engineering. It is, however, not a single objective optimization process as perceived by most previous researches, i.e., to maximize its transmission capacity, but a multi-objective optimization process, with lowering its cost to be another important objective. These two objectives are often contradictive in that optimizing one objective may deteriorate the other. After a deep investigation of the impact that network topology, node capability scheme and routing algorithm as well as their interplays have on the two objectives, this letter presents a systematic approach to achieve a cost-effective design by carefully choosing the three designing aspects. Only when routing algorithm and node capability scheme are elegantly chosen can BA-like scale-free networks have the potential of achieving good tradeoff between the two objectives. Random networks, on the other hand, have the built-in character for a cost-effective design, especially when other aspects cannot be determined beforehand.

Guoqiang Zhang

2009-10-12T23:59:59.000Z