Sample records for hp network node

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

    Broader source: Energy.gov [DOE]

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

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

    Broader source: Energy.gov [DOE]

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

  3. Reconfigureable network node

    DOE Patents [OSTI]

    Vanderveen, Keith B. (Tracy, CA); Talbot, Edward B. (Livermore, CA); Mayer, Laurence E. (Davis, CA)

    2008-04-08T23:59:59.000Z

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

  4. Modular sensor network node

    DOE Patents [OSTI]

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

    2008-06-10T23:59:59.000Z

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

  5. Detecting Phantom Nodes in Wireless Sensor Networks

    E-Print Network [OSTI]

    Kim, Dae-Shik

    Detecting Phantom Nodes in Wireless Sensor Networks Joengmin Hwang, Tian He and Yongdae Kim With thousands of tiny devices, Wireless Sensor Networks (WSNs) can support ubiquitous surveillance with a very number of phantom nodes. Key words: Sensor networks, localization, secure localization, location

  6. Intelligent Management of Misbehaving Nodes In Wireless Sensor Networks

    E-Print Network [OSTI]

    Gesbert, David

    Intelligent Management of Misbehaving Nodes In Wireless Sensor Networks Using Blackhole@eurecom.fr Abstract--Misbehaving nodes in wireless sensor networks and ad hoc networks often disrupt the operation delivery and erroneous data outputs for wireless sensor networks. Existing literatures have addressed

  7. Optimized Node Selection for Compressive Sleeping Wireless Sensor Networks

    E-Print Network [OSTI]

    Chen, Wei; Wassell, Ian J.

    2015-02-05T23:59:59.000Z

    1Optimized Node Selection for Compressive Sleeping Wireless Sensor Networks Wei Chen, Member, IEEE, and Ian J. Wassell Abstract—In this paper, we propose an active node selection framework for compressive sleeping wireless sensor networks (WSNs... development oftechnologies in sensing, computing and communication has made it possible to employ wireless sensor networks (WSNs) to continuously monitor physical phenomena in a variety of applications, for example air quality monitoring, wildlife tracking...

  8. IEEE 342 Node Low Voltage Networked Test System

    SciTech Connect (OSTI)

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

    2014-07-31T23:59:59.000Z

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

  9. ZIGBEE WIRELESS SENSOR NETWORK NODES DEPLOYMENT STRATEGY FOR

    E-Print Network [OSTI]

    ZIGBEE WIRELESS SENSOR NETWORK NODES DEPLOYMENT STRATEGY FOR DIGITAL AGRICULTURAL DATA ACQUISITIONBee-based wireless sensor network for digital agricultural data acquisition is one of the best ways to build the system. In this paper, based on ZigBee wireless sensor network deployment planning principles

  10. Performance of Wireless Sensor Networks Under Random Node Failures

    E-Print Network [OSTI]

    Hagberg, Aric

    Performance of Wireless Sensor Networks Under Random Node Failures Milan Bradonji´c Bell range wireless sensor network applications with sensors distributed in the field using decentralized distribution. RGGs have been a standard tool to model and study wireless ad-hoc and wireless sensor networks [4

  11. Aggregate Node Placements in Sensor Networks Weifa Liang

    E-Print Network [OSTI]

    Liang, Weifa

    help prolong the lifetime of a sensor network substantially. Therefore, energy efficient data gatherAggregate Node Placements in Sensor Networks Weifa Liang DCS ANU Canberra, Australia Guanjun Ma DCS into a region of interest to form a sensor network and building a routing tree for data gathering at the same

  12. Performance of wireless sensor networks under random node failures

    SciTech Connect (OSTI)

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

    2011-01-28T23:59:59.000Z

    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.

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

    Broader source: Energy.gov [DOE]

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

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

    DOE Patents [OSTI]

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

    1995-01-01T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    1995-12-26T23:59:59.000Z

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

  16. Assessing node risk and vulnerability in epidemics on networks

    E-Print Network [OSTI]

    Rogers, Tim

    2015-01-01T23:59:59.000Z

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

  17. Training a 3-Node Neural Network is NP-Complete

    E-Print Network [OSTI]

    Rivest, Ronald L.

    . A good discussion of the theory of NP-completeness, as well as a description of several hundreds of NPTraining a 3-Node Neural Network is NP-Complete Avrim L. Blum and Ronald L. Rivest* MIT Laboratory-propagation algorithm promises just that. In practice, however, the back-propagation algorithm often runs very slowly

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

    Broader source: Energy.gov [DOE]

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

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

    SciTech Connect (OSTI)

    Kim, M; Leskovec, J

    2011-11-14T23:59:59.000Z

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

  20. Malicious Node Detection in Wireless Sensor Networks using Weighted Trust Evaluation

    E-Print Network [OSTI]

    Chen, Yu

    Malicious Node Detection in Wireless Sensor Networks using Weighted Trust Evaluation Idris M Tokyo 169-8555, Japan zhousu@asagi.waseda.jp Keywords: Wireless sensor networks, network security through compromised nodes. However, it is challenging to secure the flat topology networks efficiently

  1. On Cooperation in Energy Efficient Wireless Networks: The Role of Altruistic Nodes

    E-Print Network [OSTI]

    El-Gamal, Hesham

    1 On Cooperation in Energy Efficient Wireless Networks: The Role of Altruistic Nodes Lifeng Lai and Hesham El Gamal {lail,helgamal}@ece.osu.edu Abstract In wireless networks with energy limited nodes, multi-hop forwarding is usually exploited to reduce the network energy consumption. In many practical

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

    DOE Patents [OSTI]

    Faraj, Ahmad A. (Rochester, MN)

    2010-01-26T23:59:59.000Z

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

  3. Node Localisation in Wireless Ad Hoc Networks Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roughan

    E-Print Network [OSTI]

    Roughan, Matthew

    Node Localisation in Wireless Ad Hoc Networks Jon Arnold, Nigel Bean, Miro Kraetzl, Matthew Roughan, Australia Email:{nigel.bean,matthew.roughan}@adelaide.edu.au Abstract-- Wireless ad hoc networks often

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

    DOE Patents [OSTI]

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

    1995-01-01T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Golbeck, Jennifer

    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

  6. An Artificial Hormone System for Self-organization of Networked Nodes

    E-Print Network [OSTI]

    Ungerer, Theo

    An Artificial Hormone System for Self-organization of Networked Nodes Wolfgang Trumler, Tobias) as a general approach to build self-organizing systems based on networked nodes. The Artificial Hormone System an abstract point of view with focus on the mechanisms that were transferred to the Artificial Hormone System

  7. Modeling and Analysis of Energy Harvesting Nodes in Body Sensor Networks

    E-Print Network [OSTI]

    Sikdar, Biplab

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

  8. Efficient Energy Management Policies for Networks with Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

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

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

    E-Print Network [OSTI]

    Karjee, Jyotirmoy

    2011-01-01T23:59:59.000Z

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

  10. angiofollicular lymph node: Topics by E-print Network

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

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

  11. axillary lymph node: Topics by E-print Network

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

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

  12. axillary lymph nodes: Topics by E-print Network

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

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

  13. Optimal Node Placement in Underwater Wireless Sensor Networks

    E-Print Network [OSTI]

    Shihada, Basem

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

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

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

    Derr, Kurt; Manic, Milos

    2015-01-01T23:59:59.000Z

    Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothingmore »(AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.« less

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

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

    Derr, Kurt; Manic, Milos

    2015-01-01T23:59:59.000Z

    Fast, effective monitoring following airborne releases of toxic substances is critical to mitigate risks to threatened population areas. Wireless sensor nodes at fixed predetermined locations may monitor such airborne releases and provide early warnings to the public. A challenging algorithmic problem is determining the locations to place these sensor nodes while meeting several criteria: 1) provide complete coverage of the domain, and 2) create a topology with problem dependent node densities, while 3) minimizing the number of sensor nodes. This manuscript presents a novel approach to determining optimal sensor placement, Advancing Front mEsh generation with Constrained dElaunay Triangulation and Smoothing (AFECETS) that addresses these criteria. A unique aspect of AFECETS is the ability to determine wireless sensor node locations for areas of high interest (hospitals, schools, high population density areas) that require higher density of nodes for monitoring environmental conditions, a feature that is difficult to find in other research work. The AFECETS algorithm was tested on several arbitrary shaped domains. AFECETS simulation results show that the algorithm 1) provides significant reduction in the number of nodes, in some cases over 40%, compared to an advancing front mesh generation algorithm, 2) maintains and improves optimal spacing between nodes, and 3) produces simulation run times suitable for real-time applications.

  16. Modeling and Analysis of Energy Harvesting Nodes in Wireless Sensor Networks

    E-Print Network [OSTI]

    Sikdar, Biplab

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

  17. Design under Constraints of Availability and Energy for Sensor Node in Wireless Sensor Network

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Design under Constraints of Availability and Energy for Sensor Node in Wireless Sensor Network Van by designers are availability and power/energy management for WSN. This paper presents a design for a wireless sensor node, which provides automated reconfiguration for both availability and energy-efficient use

  18. Critical Node Identification of Smart Power System Using Complex Network Framework Based

    E-Print Network [OSTI]

    Pota, Himanshu Roy

    transmission networks, in which a DC power flow model and overloading of lines is embedded into the traditional or node removal can cause serious impact on normal system operation. Removal of transmission lines from characteristics and complex network theory together. Particularly, electric power networks are quite different

  19. On the Effects of Node Density and Duty Cycle on Energy Efficiency in Underwater Networks

    E-Print Network [OSTI]

    Stojanovic, Milica

    networks, with low or high traffic, call for the development of flexible networking solutions. Because in the design of underwater acoustic networks is energy efficiency, since the nodes are of- ten powered in [5], taking into account the relationship between distance, frequency, and transmission power [6

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

    E-Print Network [OSTI]

    Vokkarane, Vinod M.

    1 Node-Replacement Policies to Maintain Threshold-Coverage in Wireless Sensor Networks Sachin consider the problem of maintaining a minimum threshold-coverage in a wireless sensor network, while to maintain threshold-coverage in wireless sensor networks. These policies assess the candidature of each

  1. Macroscopic description of complex adaptive networks co-evolving with dynamic node states

    E-Print Network [OSTI]

    Wiedermann, Marc; Heitzig, Jobst; Lucht, Wolfgang; Kurths, Jürgen

    2015-01-01T23:59:59.000Z

    In many real-world complex systems, the time-evolution of the network's structure and the dynamic state of its nodes are closely entangled. Here, we study opinion formation and imitation on an adaptive complex network which is dependent on the individual dynamic state of each node and vice versa to model the co-evolution of renewable resources with the dynamics of harvesting agents on a social network. The adaptive voter model is coupled to a set of identical logistic growth models and we show that in such systems, the rate of interactions between nodes as well as the adaptive rewiring probability play a crucial role for the sustainability of the system's equilibrium state. We derive a macroscopic description of the system which provides a general framework to model and quantify the influence of single node dynamics on the macroscopic state of the network and is applicable to many fields of study, such as epidemic spreading or social modeling.

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

    SciTech Connect (OSTI)

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

    2014-07-15T23:59:59.000Z

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

  3. Cluster synchronization induced by one-node clusters in networks with asymmetric negative couplings

    SciTech Connect (OSTI)

    Zhang, Jianbao [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China)] [School of Science, Hangzhou Dianzi University, Hangzhou 310018 (China); Ma, Zhongjun, E-mail: mzj1234402@163.com [School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China)] [School of Mathematics and Computing Science, Guilin University of Electronic Technology, Guilin 541004 (China); Zhang, Gang [College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024 (China)] [College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024 (China)

    2013-12-15T23:59:59.000Z

    This paper deals with the problem of cluster synchronization in networks with asymmetric negative couplings. By decomposing the coupling matrix into three matrices, and employing Lyapunov function method, sufficient conditions are derived for cluster synchronization. The conditions show that the couplings of multi-node clusters from one-node clusters have beneficial effects on cluster synchronization. Based on the effects of the one-node clusters, an effective and universal control scheme is put forward for the first time. The obtained results may help us better understand the relation between cluster synchronization and cluster structures of the networks. The validity of the control scheme is confirmed through two numerical simulations, in a network with no cluster structure and in a scale-free network.

  4. Comparing Trust Mechanisms for Monitoring Aggregator Nodes in Sensor Networks

    E-Print Network [OSTI]

    Sen, Sandip

    The University of Tulsa Tulsa, OK oly-mistry@utulsa.edu Anil Gürsel The University of Tulsa Tulsa, OK anil-gursel@utulsa.edu Sandip Sen The University of Tulsa Tulsa, OK sandip@utulsa.edu ABSTRACT Sensor nodes are often used

  5. On the performance management of heterogeneous networks using SNMP

    E-Print Network [OSTI]

    Kunapareddy, Padmaja

    1998-01-01T23:59:59.000Z

    Platform, which provides basic plat- form services and developer's environment. HP Network Node Manager is commonly Courtesy-Omnes, A Schlumberger/ Cahle 6 Wireless Company referred to as "HP Open View" which includes the SNMP platform and in addi- tion... CHAPTER Page INTRODUCTION . A B C D Network Management . 1. Network Management Architecture . 2. Network Management Entities Simple Network Management Protocol - SNMP 1. Management Information Base . 2. Operations 3. Message Format 4. Data...

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

    DOE Patents [OSTI]

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

    2013-04-16T23:59:59.000Z

    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.

  7. Outage Analysis of Multi-node Amplify-and-Forward Relay Networks

    E-Print Network [OSTI]

    Liu, K. J. Ray

    Outage Analysis of Multi-node Amplify-and-Forward Relay Networks Karim G. Seddik, Ahmed K. Sadek, Weifeng Su , and K. J. Ray Liu Department of Electrical and Computer Engineering, and Institute}@eng.umd.edu Department of Electrical Engineering, State University of New York (SUNY) at Buffalo, Buffalo, NY 14260, USA

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

    E-Print Network [OSTI]

    Varvarigo, Emmanouel "Manos"

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

  9. Node Placement for Connected Coverage in Sensor Networks Koushik Kar, Suman Banerjee

    E-Print Network [OSTI]

    Boyer, Edmond

    materials at ventilation points. The problem of providing coverage to a given region, or a given set--We address the problem of optimal node placement for ensuring connected coverage in sensor networks. We. Such a deployment mechanism is possible in friendly and accessible environments. We focus on the problem of optimal

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

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

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

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

    E-Print Network [OSTI]

    Treuille, Adrien

    )-approximate with O(log4 n) congestion. This translates back to a O(log4+3 n)-approximation for the multicast energy-minimization)-approximate with O(log12 n) congestion, which translates back to a O(log12+5 n)-approximation for the unicast energy-minimizationCluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient

  12. Energy Efficient Software-Based Self-Test for Wireless Sensor Network Nodes Rong Zhang, Zeljko Zilic Katarzyna Radecka

    E-Print Network [OSTI]

    Zilic, Zeljko

    programming. The increasingly essential FLASH memory is tested by a March-type algorithm implemented in energyEnergy Efficient Software-Based Self-Test for Wireless Sensor Network Nodes Rong Zhang, Zeljko@ece.concordia.ca Abstract We consider self-testing of complete wireless nodes in the field through a low-energy software

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

    E-Print Network [OSTI]

    Chen, Min

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

  14. HP Steam Trap Monitoring

    E-Print Network [OSTI]

    Pascone, S.

    2011-01-01T23:59:59.000Z

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

  15. Abstract--We propose RACE, a report-based payment scheme for multihop wireless networks to stimulate node cooperation,

    E-Print Network [OSTI]

    Shen, Xuemin "Sherman"

    in one area (residential neighborhood, university campus, etc) having different wireless-enabled devices re- sources, such as battery energy, CPU cycles, and available network bandwidth, to relay others of the cooperative nodes to relay their packets, which degrades the network connectivity and fairness. The fairness

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

    E-Print Network [OSTI]

    Keshav, Srinivasan

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

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

    DOE Patents [OSTI]

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

    2011-09-20T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

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

    2013-01-01T23:59:59.000Z

    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.

  19. Nodes self-deployment for coverage maximization in mobile robot networks using an evolving neural network

    E-Print Network [OSTI]

    Boyer, Edmond

    such as energy consumption, throughput, delay, coverage, etc. Also many schemes have been proposed in order. In fact, it is sufficient to consider a different input for the neural network to aim to a different monitoring and smart agriculture [1]. One of the fundamental issue in such a network is coverage. It is used

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

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

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

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

    DOE Patents [OSTI]

    Budampati, Ramakrishna S. (Maple Grove, MN); Gonia, Patrick S. (Maplewood, MN); Kolavennu, Soumitri N. (Blaine, MN); Mahasenan, Arun V. (Kerala, IN)

    2012-05-29T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    2013-08-27T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Isler, Ibrahim Volkan

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

  4. Multiple node remote messaging

    DOE Patents [OSTI]

    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

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

  5. Scalable Node Monitoring

    SciTech Connect (OSTI)

    Drotar, Alexander P. [Los Alamos National Laboratory; Quinn, Erin E. [Los Alamos National Laboratory; Sutherland, Landon D. [Los Alamos National Laboratory

    2012-07-30T23:59:59.000Z

    Project description is: (1) Build a high performance computer; and (2) Create a tool to monitor node applications in Component Based Tool Framework (CBTF) using code from Lightweight Data Metric Service (LDMS). The importance of this project is that: (1) there is a need a scalable, parallel tool to monitor nodes on clusters; and (2) New LDMS plugins need to be able to be easily added to tool. CBTF stands for Component Based Tool Framework. It's scalable and adjusts to different topologies automatically. It uses MRNet (Multicast/Reduction Network) mechanism for information transport. CBTF is flexible and general enough to be used for any tool that needs to do a task on many nodes. Its components are reusable and 'EASILY' added to a new tool. There are three levels of CBTF: (1) frontend node - interacts with users; (2) filter nodes - filters or concatenates information from backend nodes; and (3) backend nodes - where the actual work of the tool is done. LDMS stands for lightweight data metric servies. It's a tool used for monitoring nodes. Ltool is the name of the tool we derived from LDMS. It's dynamically linked and includes the following components: Vmstat, Meminfo, Procinterrupts and more. It works by: Ltool command is run on the frontend node; Ltool collects information from the backend nodes; backend nodes send information to the filter nodes; and filter nodes concatenate information and send to a database on the front end node. Ltool is a useful tool when it comes to monitoring nodes on a cluster because the overhead involved with running the tool is not particularly high and it will automatically scale to any size cluster.

  6. Timing Synchronization at the Relay Node in Physical Layer Network Coding

    E-Print Network [OSTI]

    Basireddy, Ashish

    2012-07-16T23:59:59.000Z

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

  7. Everything is on the Move: The "Mamluk Empire" as a Node in (Trans-)Regional Networks

    E-Print Network [OSTI]

    Kersting, Kristian

    -by-side and at the same time. In our opinion, these networks constitute to a great extent the core of the so-called Mamluk,linkagesandmovementsofasomewhat globalized region. It investigates the production and transformation of socio-cultural, economic, political and religious linkages and networks, focusing on the movements, transport and transfers of human beings

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

    Tang, Jian "Neil"

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

  10. On Relay Nodes Deployment for Distributed Detection in Wireless Sensor Networks

    E-Print Network [OSTI]

    Liu, K. J. Ray

    Engineering, Alexandria University, Alexandria 21544, Egypt. and Institute for Systems Research kseddik considered the use of relaying to improve the energy-efficiency of the sensor network. The work in [8] also proposed a consensus protocol and analyzed its energy consumption if cooperation is present to improve

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

    E-Print Network [OSTI]

    Zhang, Wensheng

    of energy that a solar cell can harvest is proportional to its surface area, but it is infeasible to equip a tiny sensor node with a large-size solar cell. The amount of available solar energy also depends sensor nodes to take over sensor nodes running out of energy. However, this approach is costly because

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

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

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

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

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

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

  14. Node Reclamation and Replacement for Long-lived Sensor Networks Bin Tong, Guiling Wang, Wensheng Zhang, and Chuang Wang

    E-Print Network [OSTI]

    Zhang, Wensheng

    surveillance, road condition monitoring, and so on. Hence, many energy conservation schemes [1] were proposed. In particular, the amount of energy that a solar cell can harvest is proportional to its surface area, but it is infeasible to equip a tiny sensor node with a large-size solar cell. The amount of available solar energy

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

    Broader source: Energy.gov [DOE]

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

  16. Synchronizing compute node time bases in a parallel computer

    DOE Patents [OSTI]

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

    2014-12-30T23:59:59.000Z

    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.

  17. PDSF Interactive Nodes

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

    Interactive (login) Nodes Interactive (login) Nodes There are 3 interactive nodes at PDSF, pdsf6-8.nersc.gov, that should be accessed via ssh to pdsf.nersc.gov. These are the...

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

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

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

  19. HP-41 Calculates Dykstra-Parsons permeability

    SciTech Connect (OSTI)

    Bixler, B.

    1983-07-01T23:59:59.000Z

    A new program for the HP-41 programmable calculator has been written which will calculate the often used Dykstra-Parsons permeability variation factor, V. No longer must numerous individual permeability values be plotted on log probability paper as a first step in determining V. Input is simply these same permeability values selected at equal spacing along the interval in question. For most core analysis this spacing will be 1 ft. This program is labeled ''KVAR'' (for permeability variation) and is listed here, along with its bar code for those with optical wands. It requires only nine registers for program storage (since it uses HP built-in statistical functions) and eight registers for data storage. Also, it can be stored on one track of the standard two-track magnetic card. Data entry is terminated by entering ''O''. Lastly, it will run with or without a printer.

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

    Broader source: Energy.gov [DOE]

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

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

    DOE Patents [OSTI]

    Archer, Charles J. (Rochester, MN); Hardwick, Camesha R. (Fayetteville, NC); McCarthy, Patrick J. (Rochester, MN); Wallenfelt, Brian P. (Eden Prairie, MN)

    2009-06-23T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    2010-11-16T23:59:59.000Z

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

  3. HP-41C helps predict oil production

    SciTech Connect (OSTI)

    Bixler, B.

    1982-04-01T23:59:59.000Z

    A new program for the HP-41C hand-held programable computer predicts yearly oil production and water-oil ratios (WOR) given the following: (1) barrels original oil-in-place; (2) barrels cumulative oil production at start of the flood or at the beginning of the study if the flood is in progress; (3) percent of original oil-in-place ultimately recovered; (4) WOR at the beginning of the study; (5) WOR at abandonment; and (6) barrels total fluid produced per day. This method assumes that the plot of log WOR vs. CUM oil (cumulative oil to the end of the given year) is linear and that the combined production (withdrawal) rate of oil and water is constant for the life of the flood. Details of the program are given, along with a program listing, an example problem, and a bar code listing.

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

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

    9.21, 9.30 ABSTRACT: Cross-site scripting (XSS) vulnerability in HP Service Manager Web Tier 7.11, 9.21, and 9.30, and HP Service Center Web Tier 6.28, allows remote attackers...

  5. SiNode Systems

    Broader source: Energy.gov [DOE]

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

  6. Overhearing in 802.11 mesh networks

    E-Print Network [OSTI]

    Afanasyev, Mikhail

    2009-01-01T23:59:59.000Z

    through a port on an HP 2626-PWR switch. There are sevenuplink, but no neighbors in the mesh. ) CDF of nodes Pwr5 Pwr 10 Pwr 15 Pwr 20 Pwr 30 Pwr 40 Pwr 50 Pwr 60

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

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2009-05-15T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2008-10-10T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2008-10-10T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Cobb, Jeffrey Lee

    2009-05-15T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

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

    1994-08-01T23:59:59.000Z

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

  12. Robust Clock Synchronization in Wireless Sensor Networks

    E-Print Network [OSTI]

    Saibua, Sawin

    2010-10-12T23:59:59.000Z

    Clock synchronization between any two nodes in a Wireless Sensor Network (WSNs) is generally accomplished through exchanging messages and adjusting clock offset and skew parameters of each node’s clock. To cope with unknown network message delays...

  13. Approximation Algorithms for Constrained Relay Node Placement in Energy Harvesting Wireless

    E-Print Network [OSTI]

    Misra, Satyajayant

    Sensor Networks Satyajayant Misra, Member, IEEE, Nahid Ebrahimi Majd and Hong Huang, Member, IEEE Abstract--The constrained relay node placement problem in a wireless sensor network seeks the deployment of a minimum number of relay nodes (RNs) in a set of candidate locations in the network to satisfy specific

  14. A parallel textured algorithm for optimal routing in data networks

    E-Print Network [OSTI]

    Hsieh, Wen-Lin

    1991-01-01T23:59:59.000Z

    40 40 59 65 66 66 69 74 75 75 84 84 85 85 90 101 105 107 APPENDIX A APPENDIX B 110 115 APPENDIX C . . 123 VITA 150 vnl LIST OF TABLES TABLE Page I Routing methodology for some existing networks II Network F with traflic 30... from node 1 to node 4 III Network F with traflic 30 from node 1 to node 3 IV Network F' with traflic 30 from node 1 to node 4 V Network Z with trafflc 30 from node 2 to node 7 VI Commodities for twenty nodes network Y 45 46 47 64 92 VII...

  15. Vulnerability of critical infrastructures : identifying critical nodes.

    SciTech Connect (OSTI)

    Cox, Roger Gary; Robinson, David Gerald

    2004-06-01T23:59:59.000Z

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

  16. ad converter system: Topics by E-print Network

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

    based on a PROFIBUS network and standard industrial components (HP-UNIX, Siemens S7 PLC, Siemens Industrial PC, door locks), guarantees reliability, safety and optimal...

  17. Dynamic Power Management at HP Tajana Simunic Mark Smith

    E-Print Network [OSTI]

    Simunic, Tajana

    Dynamic Power Management at HP Tajana Simunic Mark Smith Hewlett-Packard Laboratory Palo Alto performance for power. The transitions between states are controlled by commands issued by a power manager to the power management policy. The most common power management policy is a timeout policy. Predictive

  18. Distributed downhole drilling network

    DOE Patents [OSTI]

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

    2006-11-21T23:59:59.000Z

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

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

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

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

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

    Broader source: Energy.gov [DOE]

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

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

    Broader source: Energy.gov [DOE]

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

  2. Optimizations enabling transformations and code generation for th HP V class

    E-Print Network [OSTI]

    Carvallo de Ochoa, Julio Antonio

    2000-01-01T23:59:59.000Z

    and unique issues involved in the implementation of the code generation back-end for the HP V class multiprocessor....

  3. Hopper Compute Nodes

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC) EnvironmentalGyroSolé(tm) HarmonicbetandEnergy 2010 A selection ofCompute Nodes

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

    E-Print Network [OSTI]

    Istrail, Sorin

    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

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

    E-Print Network [OSTI]

    Newman, Alantha

    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

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

    E-Print Network [OSTI]

    Hoos, Holger H.

    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

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

    E-Print Network [OSTI]

    Hoos, Holger H.

    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

  8. When Network Coding improves the Performances of Clustered Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    When Network Coding improves the Performances of Clustered Wireless Networks that significantly increases the performances of clustering algorithms in wireless multi-hop networks-XOR coding; wireless multi-hop networks; clustering I. INTRODUCTION Partitioning nodes

  9. NEURAL NETWORK BASED CLASSIFIER FOR ULTRASONIC RESONANCE SPECTRA Tadeusz Stepinski, Lars Ericsson, Bengt Vagnhammar and Mats Gustafsson

    E-Print Network [OSTI]

    , Sweden (To appear in Proceedings of the 7 th ECNDT 6i+#...hp# In this paper we present a neural network

  10. Critical Infrastructure Networks and Supernetworks: New Tools for Dynamics,

    E-Print Network [OSTI]

    Nagurney, Anna

    Critical Infrastructure Networks and Supernetworks: New Tools for Dynamics, Network Efficiency Variational Inequalities · A New Network Performance/Efficiency Measure with Applications to Critical, Communication, and Energy Networks #12;Components of Common Physical Networks Network System Nodes Links Flows

  11. Improving the performance of distributed simulations of wireless sensor networks

    E-Print Network [OSTI]

    Jin, Zhong-Yi

    2010-01-01T23:59:59.000Z

    Overview of Wireless Sensor Networks . . 2.1.2 Difficultiesin parallel a wireless sensor network with two duty cycledin parallel a wireless sensor network with three nodes that

  12. Bridge-Node Selection and Loss Recovery in Island Multicast

    E-Print Network [OSTI]

    Chan, Shueng-Han Gary

    With the availability and penetration of multicast-capable routers, the local networks in the Internet nowadays are generally multicast-capable. These multicast domains or so- called "islands" are interconnected by routers-points (bridge- nodes), namely, Closest to Neighbor's Centroid (CNC), Clos- est to Neighbor's Leader (CNL

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

    DOE Patents [OSTI]

    Jones, Terry R. (Livermore, CA); Watson, Pythagoras C. (Livermore, CA); Tuel, William (Kingston, NY); Brenner, Larry (Austin, TX); ,Caffrey, Patrick (Saugerties, NY); Fier, Jeffrey (Livermore, CA)

    2010-10-05T23:59:59.000Z

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

  14. Semantic associative network for text analysis (SANTA)

    E-Print Network [OSTI]

    Airhart, Robert William

    2000-01-01T23:59:59.000Z

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

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

    Broader source: Energy.gov [DOE]

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

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

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

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

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

    Broader source: Energy.gov [DOE]

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

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

    Broader source: Energy.gov [DOE]

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

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

    SciTech Connect (OSTI)

    Not Available

    1989-01-01T23:59:59.000Z

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

  20. "apsched: request exceeds max nodes, alloc"

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

    "apsched: request exceeds max nodes, alloc" runtime error message: "apsched: request exceeds max nodes, alloc" September 12, 2014 (0 Comments) Symptom: User jobs with single or...

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

    Broader source: Energy.gov [DOE]

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

  2. Tetrahedral hp finite elements: Algorithms and flow simulations

    SciTech Connect (OSTI)

    Sherwin, S.J.; Karniadakis, G.E. [Brown Univ., Providence RI (United States)] [Brown Univ., Providence RI (United States)

    1996-03-01T23:59:59.000Z

    We present a new discretisation for the incompressible Navier-Stokes equations that extends spectral methods to three-dimensional complex domains consisting of tetrahedral subdomains. The algorithm is based on standard concepts of hp finite elements as well as tensorial spectral elements. This new formulation employs a hierarchical/modal basis constructed from a new apex co-ordinate system which retains a generalised tensor product. These properties enable the development of computationally efficienct algorithms for use on standard finite volume unstructed meshes. A detailed analysis is presented that documents the stability and exponential convergence of the method and several flow cases are simulated and compared with analytical and experimental results. 34 refs., 28 figs., 1 tab.

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

    E-Print Network [OSTI]

    Badrinath, B. R.

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

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

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

    E-Print Network [OSTI]

    Istrail, Sorin

    , 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

  6. Simulation of borehole-eccentered triaxial induction measurements using a Fourier hp finite-element method

    E-Print Network [OSTI]

    Torres-Verdín, Carlos

    Simulation of borehole-eccentered triaxial induction measurements using a Fourier hp finite-element with a 2D, goal-oriented, high-order, and self- adaptive hp finite-element refinement strategy three mutually orthogonal transmitter coils located at the same vertical position and three collocated

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

    Broader source: Energy.gov [DOE]

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

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

    E-Print Network [OSTI]

    Istrail, Sorin

    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

  9. Dynamics of the folded and unfolded villin headpiece (HP35) measured with ultrafast

    E-Print Network [OSTI]

    Fayer, Michael D.

    Dynamics of the folded and unfolded villin headpiece (HP35) measured with ultrafast 2D IR in the folded configuration. The dynamics of the folded HP35-ðCNÞ2 are compared to that of the guanidine to differentiate the peptide dynamic contributions to the observables from those of the water solvent. Because

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

    E-Print Network [OSTI]

    Istrail, Sorin

    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

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

    E-Print Network [OSTI]

    Emmerich, Michael

    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

  12. A Biologically Inspired Networking Model for Wireless Sensor Networks 

    E-Print Network [OSTI]

    Charalambous, Charalambos

    2011-02-22T23:59:59.000Z

    in sensor nodes demand energy-aware network control. In this thesis, we propose an energy- efficient topology management model inspired by biological inter-cellular signaling schemes. The model allows sensor nodes to cluster around imminent targets in a...

  13. Collaborative Firewalling in Wireless Networks Mahmoud Taghizadeh

    E-Print Network [OSTI]

    Liu, Alex X.

    Collaborative Firewalling in Wireless Networks Mahmoud Taghizadeh Department of ECE Michigan State elements to enforce access policies in computer networks. Open network architecture, shared wireless medium for wireless networks in which nodes collaboratively perform packet filtering to address resource squandering

  14. Community consistency determines the stability transition window of power-grid nodes

    E-Print Network [OSTI]

    Kim, Heetae; Holme, Petter

    2015-01-01T23:59:59.000Z

    The synchrony of electric power systems is important in order to maintain stable electricity supply. Recently, the measure basin stability was introduced to quantify a node's ability to recover its synchronization when perturbed. In this work, we focus on how basin stability depends on the coupling strength between nodes. We use the Chilean power grid as a case study. In general, the basin stability goes from zero to one as the coupling strength increases. However, this transition does happen for the same values for different nodes. By understanding the transition for individual nodes, we can further characterize their role in the power-transmission dynamics. We find that nodes with an exceptionally large transition window also have a low community consistency. In other words, they are hard to classify into one community when applying a community detection algorithm to the network. This also gives an efficient way to identify nodes with a long transition window (which is a computationally time-consuming task)...

  15. Dynamic resource allocation in WDM networks with optical bypass and waveband switching

    E-Print Network [OSTI]

    Chen, Li-Wei, Ph. D. Massachusetts Institute of Technology

    2005-01-01T23:59:59.000Z

    In this thesis, we investigate network architecture from the twin perspectives of link resource allocation and node complexity in WDM optical networks Chapter 2 considers networks where the nodes have full wavelength ...

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

    E-Print Network [OSTI]

    Beretta, Giordano

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

  17. E-Print Network 3.0 - average beam power Sample Search Results

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

    Radio Network Collection: Computer Technologies and Information Sciences 7 Edge Node to Remote Node Topology Optimization in the Summary: by optimally deciding the number radio...

  18. Seven health physics calculator programs for the HP-41CV

    SciTech Connect (OSTI)

    Rittmann, P.D.

    1984-08-01T23:59:59.000Z

    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.

  19. UNBC Access Grid Node Instructions Access Grid Node

    E-Print Network [OSTI]

    Northern British Columbia, University of

    packages have been installed on the system: Windows 7 IG client software called IGMeeting Microsoft Office.ace-net.ca" then right-click the green "IG" icon in the left-hand side of the screen to open "IG Node Configuration the meeting. Click OK to save the settings. 6. Right-click the blue "IG" icon in the bottom right-hand corner

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

    DOE Patents [OSTI]

    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

    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.

  1. SiNode Systems | Department of Energy

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

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

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

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

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

  3. Trust and Independence Aware Decision Fusion in Distributed Networks

    E-Print Network [OSTI]

    California at Davis, University of

    -hop network scenario: a set of mobile or stationary nodes trying to monitor certain targets (objects, people

  4. HP ScanJet 8350 Generalized scanning instructions

    E-Print Network [OSTI]

    Bardsley, John

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

  5. Enhancing video transmission in MANETs utilizing multiple interfaces and multiple channels per node

    E-Print Network [OSTI]

    Bouras, Christos

    . Simulation results indicate that the mechanism improves the networks capacity for video transmissionEnhancing video transmission in MANETs utilizing multiple interfaces and multiple channels per node}@cti.gr, gkamas@aeavellas.gr {politaki, tsanai}@ceid.upatras.gr Abstract. Mobile Ad hoc NETworks (MANETs

  6. advocates network wepan: Topics by E-print Network

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

    characteristics because the nodes that contribute to the least-time consumption of free energy preferably attach to each other. Network evolution is a path-dependent and...

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

    DOE Patents [OSTI]

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

    2010-01-19T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    2010-11-16T23:59:59.000Z

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

  9. Data Transfer Nodes Yield Results!

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

    AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645 3,625govInstrumentstdmadapInactiveVisitingContract Management Fermi SitePARTOfficeOctoberDanielDTN Data Transfer Nodes

  10. Dedicated heterogeneous node scheduling including backfill scheduling

    DOE Patents [OSTI]

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

    2006-07-25T23:59:59.000Z

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

  11. Transportation Science and the Dynamics of Critical Infrastructure Networks with

    E-Print Network [OSTI]

    Nagurney, Anna

    Inequalities · A New Network Performance/Efficiency Measure with Applications to Critical Infrastructure, and Energy Networks #12;Components of Common Physical Networks Network System Nodes Links Flows Transportation Intersections, Homes, Workplaces, Airports, Railyards Roads, Airline Routes, Railroad Track

  12. Dynamic Networks: Recent Results and Applications

    E-Print Network [OSTI]

    Nagurney, Anna

    . #12;Duke Energy Gas Pipeline Network #12;Components of Common Physical Networks Network System Nodes, Railroad Track Automobiles, Trains, and Planes, Manufacturing and logistics Workstations, Distribution Exchanges Fiber Optic Cables Radio Links Voice, Data, Video Energy Pumping Stations, Plants Pipelines

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

    E-Print Network [OSTI]

    Beretta, Giordano

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

  14. Nodes, modes and flow codes

    SciTech Connect (OSTI)

    Karniadakis, G.E.; Orszag, S.A. (Princeton Univ., NJ (United States))

    1993-03-01T23:59:59.000Z

    Computational fluid dynamics and the numerical prediction of fluid flow in the understanding and modeling of turbulence is discussed with emphasis on the development of direct numerical simulation (DNS) of high-Reynolds number turbulent flows. Recent advances in computer systems and their use in turbulence simulation are reviewed and the need for parallel processing to achieve teraflop speeds necessary for DNS is discussed. Computer system architectures, nodes, and parallel computers currently in use are reviewed. Spectral, spectral-element, particle, and hybrid difference methods of solving incompressible- and compressible-flow problems are examined. Four applications of parallel computers to turbulent flow problems are presented and future developments in computer systems are discussed. 24 refs.

  15. HP Laboratories 5/22/97 Hiro:Documents:Giordano Beretta:Research:AIC97:aic97ohp.doc

    E-Print Network [OSTI]

    Beretta, Giordano

    k l,[ ] var Y k l,[ ]( ) 1 B ---- Yi k l,[ ] My k l[ , ]­( )2 i 1= B = = #12;w w w HP Laboratories 5w w w HP Laboratories 5/22/97 Hiro:Documents:Giordano Beretta:Research:AIC97:aic97ohp.doc 0Encoding://www.hpl.hp.com/personal/Giordano_Beretta #12;w w w HP Laboratories 5/22/97 Hiro:Documents:Giordano Beretta:Research:AIC97:aic97ohp.doc 1The

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

    DOE Patents [OSTI]

    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

    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.

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

    DOE Patents [OSTI]

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

    2008-01-01T23:59:59.000Z

    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.

  18. Random Walks and Electrical Networks Electrical Network

    E-Print Network [OSTI]

    Jonathon Peterson

    2008-01-30T23:59:59.000Z

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

  19. Resetting Bounding Nodes in Acquiring Spanish

    E-Print Network [OSTI]

    Cebreiros, Ramiro

    1996-01-01T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

    Samuel James Miller

    2006-08-09T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Istrail, Sorin

    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

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

    E-Print Network [OSTI]

    Torres-Verdín, Carlos

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

  3. An hp adaptive strategy to compute the vibration modes of a fluid-solid coupled system

    E-Print Network [OSTI]

    Rodríguez, Rodolfo

    )], for the operational state, the fuel assembly in nuclear plants should be designed so that they cannot be unacceptablyAn hp adaptive strategy to compute the vibration modes of a fluid-solid coupled system M element method to solve a two- dimensional fluid-structure vibration problem. This problem arises from

  4. Higher-Order Spectral/HP Finite Element Technology for Structures and Fluid Flows

    E-Print Network [OSTI]

    Vallala, Venkat Pradeep

    2013-06-20T23:59:59.000Z

    This study deals with the use of high-order spectral/hp approximation functions in the ?nite element models of various nonlinear boundary-value and initial-value problems arising in the ?elds of structural mechanics and ?ows of viscous...

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

    SciTech Connect (OSTI)

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

    1997-06-01T23:59:59.000Z

    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.

  6. Power-Efficient Adaptable Wireless Sensor Networks , David Evans2

    E-Print Network [OSTI]

    Evans, David

    with the unpredictable network topologies that result from sensor node scatters and to manage resources (energy the flexibility necessary for the adaptations required of wireless sensor networks without the penalties network operation. · Nodes often fail during network operation, due to depleted energy, destruction

  7. Hybrid Sensor Networks: A Small World Gaurav Sharma

    E-Print Network [OSTI]

    Mazumdar, Ravi R.

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

  8. Dense LU Factorization on Multicore Supercomputer Nodes

    SciTech Connect (OSTI)

    Lifflander, Jonathan [University of Illinois, Urbana-Champaign] [University of Illinois, Urbana-Champaign; Miller, Phil [University of Illinois, Urbana-Champaign] [University of Illinois, Urbana-Champaign; Venkataraman, Ramprasad [University of Illinois, Urbana-Champaign] [University of Illinois, Urbana-Champaign; Arya, Anshu [University of Illinois, Urbana-Champaign] [University of Illinois, Urbana-Champaign; Jones, Terry R [ORNL] [ORNL; Kale, Laxmikant V [University of Illinois, Urbana-Champaign] [University of Illinois, Urbana-Champaign

    2012-01-01T23:59:59.000Z

    Dense LU factorization is a prominent benchmark used to rank the performance of supercomputers. Many implementations, including the reference code HPL, use block-cyclic distributions of matrix blocks onto a two-dimensional process grid. The process grid dimensions drive a trade-off between communication and computation and are architecture- and implementation-sensitive. We show how the critical panel factorization steps can be made less communication-bound by overlapping asynchronous collectives for pivot identification and exchange with the computation of rank-k updates. By shifting this trade-off, a modified block-cyclic distribution can beneficially exploit more available parallelism on the critical path, and reduce panel factorization's memory hierarchy contention on now-ubiquitous multi-core architectures. The missed parallelism in traditional block-cyclic distributions arises because active panel factorization, triangular solves, and subsequent broadcasts are spread over single process columns or rows (respectively) of the process grid. Increasing one dimension of the process grid decreases the number of distinct processes in the other dimension. To increase parallelism in both dimensions, periodic 'rotation' is applied to the process grid to recover the row-parallelism lost by a tall process grid. During active panel factorization, rank-1 updates stream through memory with minimal reuse. In a column-major process grid, the performance of this access pattern degrades as too many streaming processors contend for access to memory. A block-cyclic mapping in the more popular row-major order does not encounter this problem, but consequently sacrifices node and network locality in the critical pivoting steps. We introduce 'striding' to vary between the two extremes of row- and column-major process grids. As a test-bed for further mapping experiments, we describe a dense LU implementation that allows a block distribution to be defined as a general function of block to processor. Other mappings can be tested with only small, local changes to the code.

  9. Node discovery and replacement using mobile Kalypso Magklara1

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

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

  10. Organization of growing random networks

    SciTech Connect (OSTI)

    Krapivsky, P. L.; Redner, S.

    2001-06-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Lateef, Mohammed Afroz

    1993-01-01T23:59:59.000Z

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

  12. EXPERIMENTAL EVALUATION OF SIMULTANEOUS 3D LOCALIZATION OF SENSOR NODES AND TRACKING MOVING TARGETS

    E-Print Network [OSTI]

    Instituto de Sistemas e Robotica

    EXPERIMENTAL EVALUATION OF SIMULTANEOUS 3D LOCALIZATION OF SENSOR NODES AND TRACKING MOVING TARGETS sensor/target localization) which rely on infrared (IR), radio frequency/received signal strength (RF of a simultaneous localization and track- ing (SLAT) algorithm for sensor networks, whose aim is to determine

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

    E-Print Network [OSTI]

    Tentzeris, Manos

    shortage risk. (2) Adaptive optimal operation point tracking considering harvested energy variability. (3Ambient-RF-Energy-Harvesting Sensor Node with Capacitor-Leakage-Aware Duty Cycle Control Ryo-- In this paper, we present a software control method that maximizes the sensing rate of wireless sensor networks

  14. Social Network Analysis Plugin (SNAP) for Mesh Networks

    E-Print Network [OSTI]

    Kotz, David

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

  15. INTERACTING WITH SOCIAL NETWORKS TO IMPROVE HEALTHCARE BODY SENSOR NETWORKS

    E-Print Network [OSTI]

    Miles, Will

    INTERACTING WITH SOCIAL NETWORKS TO IMPROVE HEALTHCARE BODY SENSOR NETWORKS by DAVID BAUSCHLICHER monitor and record data while minimizing the energy expenditure of nodes in the BSN. Social networking to a social network creates the unique ability to share health related data with other users through social

  16. Privacy-enhanced social network routing in opportunistic networks Iain Parris, Greg Bigwood and Tristan Henderson

    E-Print Network [OSTI]

    Henderson, Tristan

    Privacy-enhanced social network routing in opportunistic networks Iain Parris, Greg Bigwood. Forwarding messages in such a network often involves the use of social network routing-- sending messages via nodes in the sender or recipient's social network. Simple social network routing, however, may broadcast

  17. Capacity and scale-free dynamics of evolving wireless networks 

    E-Print Network [OSTI]

    Iyer, Bharat Vishwanathan

    2005-02-17T23:59:59.000Z

    Many large-scale random graphs (e.g., the Internet) exhibit complex topology, nonhomogeneous spatial node distribution, and preferential attachment of new nodes. Current topology models for ad-hoc networks mostly consider a uniform spatial...

  18. A generative model for feedback networks Douglas R. White

    E-Print Network [OSTI]

    White, Douglas R.

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

  19. Generative model for feedback networks Douglas R. White*

    E-Print Network [OSTI]

    White, Douglas R.

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

  20. Opportunistic scheduling in large-scale wireless networks

    E-Print Network [OSTI]

    Modiano, Eytan H.

    In this paper, we consider a distributed one-hop wireless network with n pairs of transmitters and receivers. It is assumed that each transmitter/receiver node is only connected to k receiver/transmitter nodes which are ...

  1. Localization and sensing applications in the Pushpin Computer Network

    E-Print Network [OSTI]

    Broxton, Michael Joseph

    2005-01-01T23:59:59.000Z

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

  2. A congestion control scheme for wireless sensor networks

    E-Print Network [OSTI]

    Xiong, Yunli

    2005-08-29T23:59:59.000Z

    In wireless sensor networks (WSN), nodes have very limited power due to hardware constraints. Packet losses and retransmissions resulting from congestion cost precious energy and shorten the lifetime of sensor nodes. This problem motivates the need...

  3. Capacity and scale-free dynamics of evolving wireless networks

    E-Print Network [OSTI]

    Iyer, Bharat Vishwanathan

    2005-02-17T23:59:59.000Z

    Many large-scale random graphs (e.g., the Internet) exhibit complex topology, nonhomogeneous spatial node distribution, and preferential attachment of new nodes. Current topology models for ad-hoc networks mostly consider a uniform spatial...

  4. Percutaneous Vertebroplasty in Painful Schmorl Nodes

    SciTech Connect (OSTI)

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

    2006-02-15T23:59:59.000Z

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

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

    DOE Patents [OSTI]

    Blocksome, Michael A. (Rochester, MN)

    2011-02-15T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    2011-05-24T23:59:59.000Z

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

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

    DOE Patents [OSTI]

    Budnik, Thomas A. (Rochester, MN); Knudson, Brant L. (Rochester, MN); Megerian, Mark G. (Rochester, MN); Miller, Samuel J. (Rochester, MN); Stockdell, William M. (Byron, MN)

    2012-03-20T23:59:59.000Z

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

  8. Stable Throughput in a Cognitive Wireless Network

    E-Print Network [OSTI]

    Fanous, Anthony

    2012-01-01T23:59:59.000Z

    We study, from a network layer perspective, the effect of an Ad-Hoc secondary network with N nodes randomly accessing the spectrum licensed to a primary node during the idle slots of the primary user. If the sensing is perfect, then the secondary nodes do not interfere with the primary node and hence do not affect its stable throughput. In case of imperfect sensing, it is shown that if the primary user's arrival rate is less than some calculated finite value, cognitive nodes can employ any transmission power or probabilities without affecting the primary user's stability; otherwise, the secondary nodes should control their transmission parameters to reduce the interference on the primary. It is also shown that in contrast with the primary's maximum stable throughput which strictly decreases with increased sensing errors, the throughput of the secondary nodes might increase with sensing errors as more transmission opportunities become available to them. Finally, we explore the use of the secondary nodes as rel...

  9. Community consistency determines the stability transition window of power-grid nodes

    E-Print Network [OSTI]

    Heetae Kim; Sang Hoon Lee; Petter Holme

    2015-04-28T23:59:59.000Z

    The synchrony of electric power systems is important in order to maintain stable electricity supply. Recently, the measure basin stability was introduced to quantify a node's ability to recover its synchronization when perturbed. In this work, we focus on how basin stability depends on the coupling strength between nodes. We use the Chilean power grid as a case study. In general, basin stability goes from zero to one as coupling strength increases. However, this transition does not happen at the same value for different nodes. By understanding the transition for individual nodes, we can further characterize their role in the power-transmission dynamics. We find that nodes with an exceptionally large transition window also have a low community consistency. In other words, they are hard to classify to one community when applying a community detection algorithm. This also gives an efficient way to identify nodes with a long transition window (which is computationally time consuming). Finally, to corroborate these results, we present a stylized example network with prescribed community structures that captures the mentioned characteristics of basin stability transition and recreates our observations.

  10. hp-Cloud Approximation Of The Dirac Eigenvalue Problem: The Way Of Stability

    E-Print Network [OSTI]

    Hasan Almanasreh

    2013-04-05T23:59:59.000Z

    We apply $hp$-cloud method to the radial Dirac eigenvalue problem. The difficulty of occurrence of spurious eigenvalues among the genuine ones in the computation is resolved. The method of treatment is based on assuming $hp$-cloud Petrov-Galerkin scheme to construct the weak formulation of the problem which adds a consistent diffusivity to the variational formulation. The size of the artificially added diffusion term is controlled by a stability parameter ($\\tau$). The derivation of $\\tau$ assumes the limit behavior of the eigenvalues at infinity. The parameter $\\tau$ is applicable for generic basis functions. This is combined with the choice of appropriate intrinsic enrichments in the construction of the cloud shape functions.

  11. Election in complete asynchronous networks with intermittent link failures 

    E-Print Network [OSTI]

    Lokre, Jahnavi V.

    1991-01-01T23:59:59.000Z

    . Initially, no node knows the identifier of any other node. Each node u knows the number of nodes n in the distributed system, the maximum number f of faulty links incident on u, and that the network is complete. A distributed algorithm on a network is a.... The algorithm uses O(n + nf ) messages. We assume that there are at most f faulty links incident on each node, where f & [ "s J. Let I be a link between nodes u and v. By the definition of link failure, link I is considered faulty if I loses at least one...

  12. Extending Participatory Fuzzy Cognitive Mapping with a Control Nodes Methodology: a case study of the development bio-based economy in the

    E-Print Network [OSTI]

    Lloyd, David

    . Keywords Fuzzy cognitive mapping, network analysis, control nodes, partici- patory modelling, steering configurations for the system, from their perspective. Models/Outcomes: Six possible control configurations used to focus decision making and future modelling work. Challenges: Control configurations

  13. Epidemic Propagation In Overlaid Wireless Networks

    SciTech Connect (OSTI)

    Yanmaz, Evsen [Los Alamos National Laboratory

    2008-01-01T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

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

    1984-09-01T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

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

    2010-01-12T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Beretta, Giordano

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

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

    E-Print Network [OSTI]

    Johnson, Eric E.

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

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

    E-Print Network [OSTI]

    Calamoneri, Tiziana

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

  19. Collective network for computer structures

    DOE Patents [OSTI]

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

    2014-01-07T23:59:59.000Z

    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.

  20. Clock Agreement Among Parallel Supercomputer Nodes

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

    Jones, Terry R.; Koenig, Gregory A.

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

  1. Clock Agreement Among Parallel Supercomputer Nodes

    SciTech Connect (OSTI)

    Jones, Terry R.; Koenig, Gregory A.

    2014-04-30T23:59:59.000Z

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

  2. Distributed services for mobile ad hoc networks

    E-Print Network [OSTI]

    Cao, Guangtong

    2005-11-01T23:59:59.000Z

    A mobile ad hoc network consists of certain nodes that communicate only through wireless medium and can move arbitrarily. The key feature of a mobile ad hoc network is the mobility of the nodes. Because of the mobility, communication links form...

  3. Co-Simulation Tools for Networked Control Systems

    E-Print Network [OSTI]

    Branicky, Michael S.

    /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

  4. Electricity generation with looped transmission networks: Bidding to an ISO

    E-Print Network [OSTI]

    Ferris, Michael C.

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

  5. Position Estimation With Moving Beacons in Wireless Sensor Networks

    E-Print Network [OSTI]

    Dong, Liang

    Position Estimation With Moving Beacons in Wireless Sensor Networks Liang Dong and Frank L nodes in a wireless sensor network. Without GPS capability on any of the sensors, the position issue in wireless sensor networks. Accurate positions of sensor nodes improve the routing efficiency

  6. On the Throughput Capacity of Heterogeneous Wireless Networks

    E-Print Network [OSTI]

    Latchman, Haniph A.

    On the Throughput Capacity of Heterogeneous Wireless Networks Pan Li, Member, IEEE, and Yuguang of wireless networks. However, it is commonly assumed that all nodes in the network are identical. The issue of heterogeneous wireless networks with general network settings. Specifically, we consider an extended network

  7. The two faces of network dynamics Evolving network models describe the dynamics (assembly, evolution)

    E-Print Network [OSTI]

    Albert, Réka

    with a random network with a given degree distribution P(k). Mark edges with probability T. DisregardThe two faces of network dynamics Evolving network models describe the dynamics (assembly, evolution) OF networks by the addition/removal of nodes and edges. It is possible to have network dynamics

  8. A Mesh-based Robust Topology Discovery Algorithm for Hybrid Wireless Networks

    E-Print Network [OSTI]

    Birman, Kenneth P.

    A Mesh-based Robust Topology Discovery Algorithm for Hybrid Wireless Networks Ranveer CHANDRA¢ @research.att.com Abstract Wireless networks in home, office and sensor applications consist of nodes by a wireline network. Topology information of the wireless network at these powerful nodes can be used

  9. Fault-tolerant Sensor Network based on Fault Evaluation Matrix and Compensation for Intermittent Observation

    E-Print Network [OSTI]

    Fault-tolerant Sensor Network based on Fault Evaluation Matrix and Compensation for Intermittent-tolerant sensor network configuration problem for a target navigation. A sensor network system consists of many sensor nodes and its network connections. Each sensor node can exchange information by wireless

  10. Information Capacity of Energy Harvesting Sensor Nodes

    E-Print Network [OSTI]

    Sharma, Vinod

    energy. Harvesting solar energy through photo- voltaic effect seems to have emerged as a technology device may be such that the energy cannot be generated at all times (e.g., a solar cell). Furthermore powers the sensor node and when sufficient energy This work is partially supported by a grant from ANRC

  11. Robust Critical Node Selection by Benders Decomposition

    E-Print Network [OSTI]

    2014-01-28T23:59:59.000Z

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

  12. Designing Satellite Communication Networks by Zero-One Quadratic Programming

    E-Print Network [OSTI]

    Helme, Marcia P.

    In satellite communications networks, distinctive facilities called homing stations perform special transmission functions. Local demand nodes clustered around each homing station communicate with each other via a local ...

  13. access design considerations: Topics by E-print Network

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

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

  14. A No-go theorem for Poincaré-invariant networks

    E-Print Network [OSTI]

    Sabine Hossenfelder

    2015-04-23T23:59:59.000Z

    I explain why there are no Poincar\\'e-invariant networks with a locally finite distribution of nodes in Minkowski-spacetime of any dimension.

  15. Towards Data-Driven Declarative Networking in Delay Tolerant Networks

    E-Print Network [OSTI]

    Tucci, Sara

    .lastname}@cl.cam.ac.uk ABSTRACT A Delay Tolerant Network (DTN) provides content storage as a core network service across The Internet has transformed the way we seek information, but it requires strong connectivity with no tolerance are sparsely distributed so that networks are often partitioned due to geographical separation or node movement

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

    DOE Patents [OSTI]

    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

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

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

    DOE Patents [OSTI]

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

    2010-06-08T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

    2011-01-01T23:59:59.000Z

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

  19. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, Dario B. (DeSoto, TX)

    1994-01-01T23:59:59.000Z

    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.

  20. Switch for serial or parallel communication networks

    DOE Patents [OSTI]

    Crosette, D.B.

    1994-07-19T23:59:59.000Z

    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.

  1. Open Rigging Through XML: Character Setup Utilizing Metadata and Node Based Editing

    E-Print Network [OSTI]

    Kelly, Logan Scott

    2014-02-19T23:59:59.000Z

    Editor. . . . . . . . . . . . . . . . . . . . 15 5 An example MetaDataManagerNode connected to two MetaRootNodes in Maya. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 6 The drop down menu provided for accessing the Rig... for the node are displayed in the Node Details Panel. . . . . 28 13 A Geometry Node attached to a Rig Node. . . . . . . . . . . . . . . . 29 14 A Global Node attached to a Rig Node. . . . . . . . . . . . . . . . . . 30 15 A Spine Node added to the node graph...

  2. Dual Power Management for Network Connectivity in Wireless Sensor Networks Yanxia Rong

    E-Print Network [OSTI]

    Choi, Hyeong-Ah

    larger than the lower power level that is used to connect the nodes in the neighborhood. Hence, the dualDual Power Management for Network Connectivity in Wireless Sensor Networks Yanxia Rong , Hongsik@vcu.edu, hchoi@gwu.edu Abstract As the energy consumption in wireless sensor nodes is dominated by the radio

  3. Dynamic Optimization in Gas Pipeline Networks EWO MEETING, Spring 2012

    E-Print Network [OSTI]

    Grossmann, Ignacio E.

    (z,t) and q(z,t) Momentum Balance: Material Balance: Network Inventory: Node equations Flow balance-based ROMeo platform. ROMeo: Rigorous On-line Modeling and Equation-based Optimization Model will provide: no accumulation at nodes. Pressure balance: pressure at a node is equal to the pressure either into or out

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

    DOE Patents [OSTI]

    Crosetto, Dario B. (DeSoto, TX)

    1996-01-01T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    2012-10-16T23:59:59.000Z

    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.

  6. Estimation of clock parameters and performance benchmarks for synchronization in wireless sensor networks

    E-Print Network [OSTI]

    Chaudhari, Qasim Mahmood

    2009-05-15T23:59:59.000Z

    . This dissertation focuses on deriving e±cient estimators for the clock parameters of the network nodes for synchronization with the reference node and the estimators variance thresholds are obtained to lower bound the maximum achievable performance. For any general...

  7. Localized Bridging Centrality for Distributed Network Analysis

    E-Print Network [OSTI]

    Kotz, David

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

  8. Network Coding for Large Scale Content Distribution

    E-Print Network [OSTI]

    Keinan, Alon

    Network Coding for Large Scale Content Distribution IEEE Infocom 2005 Christos Gkantsidis College propose a new scheme for content distribution of large files that is based on network coding. With network coding, each node of the distribution network is able to generate and transmit encoded blocks

  9. Integrating Correlated Bayesian Networks Using Maximum Entropy

    SciTech Connect (OSTI)

    Jarman, Kenneth D.; Whitney, Paul D.

    2011-08-30T23:59:59.000Z

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

  10. Zone routing in a torus network

    DOE Patents [OSTI]

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29T23:59:59.000Z

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

  11. atrioventricular node ablation: Topics by E-print Network

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

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

  12. The normalization of meshes and nodes in electrical networks

    E-Print Network [OSTI]

    Johnson, Allen Forrest

    1951-01-01T23:59:59.000Z

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

  13. Analyzing and Modeling Encryption Overhead for Sensor Network Nodes

    E-Print Network [OSTI]

    Mueller, Frank

    devices in the field. Limitations in processing power, battery life, communication bandwidth and memory

  14. anchor nodes mission: Topics by E-print Network

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

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

  15. Connectivity of confined 3D Networks with Anisotropically Radiating Nodes

    E-Print Network [OSTI]

    Goussev, Arseni O.

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

  16. Relative Span Weighted Localization of Uncooperative Nodes in Wireless Networks

    E-Print Network [OSTI]

    Barbeau, Michel

    911) provisions [1] as the Federal Communications Commission (FCC) in the U.S. [2] Under Phase II Radio- television Telecommunications Commission (CRTC) to regulate the same wireless En- hanced 911 (E

  17. Information extraction with network centralities : finding rumor sources, measuring influence, and learning community structure

    E-Print Network [OSTI]

    Zaman, Tauhid R

    2011-01-01T23:59:59.000Z

    Network centrality is a function that takes a network graph as input and assigns a score to each node. In this thesis, we investigate the potential of network centralities for addressing inference questions arising in the ...

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

    E-Print Network [OSTI]

    Oh, Eunseuk

    2004-11-15T23:59:59.000Z

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

  19. Information Capacity of an Energy Harvesting Sensor Node

    E-Print Network [OSTI]

    Viswanath, Pramod

    practical architectures. Our main result is the characterization of the Shannon capacity. INTRODUCTION Sensor nodes are often deployed for monitoring a random field. These nodes are characterized by limited battery power, computational resources and storage space. Once deployed, the battery

  20. Node Control System A Cluster Management Tool for

    E-Print Network [OSTI]

    Fedosov, Alexey

    Node Control System A Cluster Management Tool for Teaching and Research Alex Fedosov Keck Cluster returned to the user e.g. PBS (OpenPBS) Our main goal is interactive development Batch system have very .machines file #12;Features (cont.) Node Domains Users may want to have a specific operating system or node

  1. Resource Management for Fading Wireless Channels with Energy Harvesting Nodes

    E-Print Network [OSTI]

    Ulukus, Sennur

    Resource Management for Fading Wireless Channels with Energy Harvesting Nodes Omur Ozel1 , Kaya of these systems is the fact that the nodes can harvest energy throughout the duration in which communication takes place. As such, transmission policies of the nodes need to adapt to these harvested energy arrivals

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

    DOE Patents [OSTI]

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

    2013-10-22T23:59:59.000Z

    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.

  3. Efficient and Fair Routing for Mesh Networks - Optimization Online

    E-Print Network [OSTI]

    2010-02-08T23:59:59.000Z

    Apr 16, 2009 ... its destination. The energy that a laptop spends in retransmissions does not benefit it directly. ... the center of the network are more likely to retransmit while nodes close to the periphery will most ...... Data Networks. Prentice ...

  4. An energy efficient RF transceiver for wireless microsensor networks

    E-Print Network [OSTI]

    Daly, Denis Clarke

    2005-01-01T23:59:59.000Z

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

  5. Dynamic address allocation protocols for Mobile ad hoc networks

    E-Print Network [OSTI]

    Patchipulusu, Praveena

    2001-01-01T23:59:59.000Z

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

  6. Truthful resource management in wireless ad hoc networks

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01T23:59:59.000Z

    In wireless mobile ad hoc networks (MANETs), cooperation cannot be an im- plicit assumption anymore. Each profit-oriented network node has the intention to be selfish due to limited resource possession. In this dissertation, we investigate...

  7. Analysis of HP2 nozzle assembly failure of a gas turbine

    SciTech Connect (OSTI)

    Anto, P.F.; Singh, S.K. [Oil and Natural Gas Corp. Ltd., Maharashtra (India). Inst. of Engineering and Ocean Technology

    1998-12-31T23:59:59.000Z

    The HP2 nozzle assembly of one of the process platform failed by plastic deformation of the vanes after an operating life of 20,000 hours. The vanes were made of alloy 31. The failed vanes were subjected to detailed failure analysis by conducting metallography, hardness testing, energy dispersive spectroscopy, x-ray diffraction and electron probe micro analysis. The phenomenon of sulfidation and catastrophic oxidation was not observed in the material. It was found that the material had undergone high temperature oxidation. The material did not show any signs of creep damage and phase growth preferential attack of carbides was identified. The alloy exhibited loss of hardness at the aerofoil surface which aided material erosion and degradation of alloy strength properties. Various thermal barrier coatings to prevent high temperature oxidation were studied.

  8. Orbital HP-Clouds for Solving Schr?dinger Equation inQuantum Mechanics

    SciTech Connect (OSTI)

    Chen, J; Hu, W; Puso, M

    2006-10-19T23:59:59.000Z

    Solving Schroedinger equation in quantum mechanics presents a challenging task in numerical methods due to the high order behavior and high dimension characteristics in the wave functions, in addition to the highly coupled nature between wave functions. This work introduces orbital and polynomial enrichment functions to the partition of unity for solution of Schroedinger equation under the framework of HP-Clouds. An intrinsic enrichment of orbital function and extrinsic enrichment of monomial functions are proposed. Due to the employment of higher order basis functions, a higher order stabilized conforming nodal integration is developed. The proposed methods are implemented using the density functional theory for solution of Schroedinger equation. Analysis of several single and multi-electron/nucleus structures demonstrates the effectiveness of the proposed method.

  9. Progressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks

    E-Print Network [OSTI]

    Chen, Yuanzhu Peter

    . This paper considers the multi-hop transmission prob- lem in wireless ad-hoc networks. In a three-node sce of multi- hop transmission. The new framework, exploiting the technology of progressive network codingProgressive Network Coding for Message-Forwarding in Ad-Hoc Wireless Networks Xingkai Bao and Jing

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

    E-Print Network [OSTI]

    Lui, John C.S.

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

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

    DOE Patents [OSTI]

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

    2010-08-24T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

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

    1997-12-01T23:59:59.000Z

    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.

  13. Comparative analysis of the folding dynamics and kinetics of an engineered knotted protein and its variants derived from HP0242 of Helicobacter pylori

    E-Print Network [OSTI]

    Wang, Liang-Wei; Liu, Yu-Nan; Lyu, Ping-Chiang; Jackson, Sophie E.; Hsu, Shang-Te Danny

    2015-01-01T23:59:59.000Z

    spontaneously to attain a knotted conformation has been a major challenge in the field of protein folding. HP0242 is a homodimeric protein from Helicobacter pylori with intertwined helices to form a unique pseudo-knotted folding topology. A tandem HP0242 repeat...

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

    E-Print Network [OSTI]

    Fang, Shiaofen

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

  15. DIFS: A Distributed Index for Features in Sensor Networks

    E-Print Network [OSTI]

    Govindan, Ramesh

    of nodes in such networks is energy. Nodes are expected to be long­lived (deployed not for hours minimize energy use. The primary energy consumer in such systems is radio transmission. For one scenario and amount of data produced increase. Consequently, in energy­constrained sensor networks it may be necessary

  16. Wormhole-Resilient Secure Neighbor Discovery in Underwater Acoustic Networks

    E-Print Network [OSTI]

    Zhang, Rui

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

  17. Visual Matrix Clustering of Social Networks

    SciTech Connect (OSTI)

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

    2013-07-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Madhow, Upamanyu

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

  19. Antenna-based "Smart Skin" Sensors for Sustainable, Wireless Sensor Networks

    E-Print Network [OSTI]

    Tentzeris, Manos

    Antenna-based "Smart Skin" Sensors for Sustainable, Wireless Sensor Networks Hoseon Leet, George-less, or sustainable, wireless sensor networks with "smart skin" sensor nodes. These sensors are highly applicable a wireless sensor network with smart sensors requires a lot of power due to the mass number of sensor nodes

  20. Efficient Algorithms for the p-Self-Protection Problem in Static Wireless Sensor Networks

    E-Print Network [OSTI]

    Wang, Yu

    Efficient Algorithms for the p-Self-Protection Problem in Static Wireless Sensor Networks Yu Wang for static wireless sensor networks in this paper. The self-protection problem focuses on using sensor nodes nodes can resist the attacks targeting them directly. A wireless sensor network is p

  1. Fuzzy Trust Recommendation Based on Collaborative Filtering for Mobile Ad-hoc Networks

    E-Print Network [OSTI]

    Zhang, Yi

    Fuzzy Trust Recommendation Based on Collaborative Filtering for Mobile Ad-hoc Networks Junhai Luo1--Mobile ad-hoc networks (MANETs) are based on the cooperative and trust characteristic of the mobile nodes focused on building up trust among distributed network nodes to simulate cooperation and improving

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

    E-Print Network [OSTI]

    Torres-Verdín, Carlos

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

  3. Comparing the memory system performance of DSS commercial workload in HP V-class and SGI Origin 2000 multiprocessors

    E-Print Network [OSTI]

    Yu, Rong

    2000-01-01T23:59:59.000Z

    in the public domain due to their complexity and high cost. In this thesis, we present a detailed and in-depth memory system performance analysis and comparison of TPC-H benchmark characteristics on SGI Origin 2000 and HP V-Class multiprocessors. The DSS...

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

    E-Print Network [OSTI]

    Oak Ridge National Laboratory

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

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

    E-Print Network [OSTI]

    Uppsala Universitet

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

  6. End-to-End Monitoring of Network Traffic and Congestion Events on the Planet-Lab Network with

    E-Print Network [OSTI]

    Kansas, University of

    .3.2.2.2 ­ Lost Packet Log: MMDDYY_forward_losses.txt 17 3.4 ­ Running the Programs 17 3.4.1 ­ Starting given nodes on the Planet-Lab network. By running the pmclient program on a Planet-Lab node determined, or if network events such as route changes or packet loss are detected, the probing rate

  7. MTX data acquisition and analysis computer network

    SciTech Connect (OSTI)

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

    1990-10-01T23:59:59.000Z

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

  8. Optimal redundancy against disjoint vulnerabilities in networks

    E-Print Network [OSTI]

    Krause, Sebastian M; Zlati?, Vinko

    2015-01-01T23:59:59.000Z

    Redundancy is commonly used to guarantee continued functionality in networked systems. However, often many nodes are vulnerable to the same failure or adversary. A "backup" path is not sufficient if both paths depend on nodes which share a vulnerability.For example, if two nodes of the Internet cannot be connected without using routers belonging to a given untrusted entity, then all of their communication-regardless of the specific paths utilized-will be intercepted by the controlling entity.In this and many other cases, the vulnerabilities affecting the network are disjoint: each node has exactly one vulnerability but the same vulnerability can affect many nodes. To discover optimal redundancy in this scenario, we describe each vulnerability as a color and develop a "color-avoiding percolation" which uncovers a hidden color-avoiding connectivity. We present algorithms for color-avoiding percolation of general networks and an analytic theory for random graphs with uniformly distributed colors including critic...

  9. Pinning impulsive control algorithms for complex network

    SciTech Connect (OSTI)

    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

    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.

  10. Multicommodity Flows and Cuts in Polymatroidal Networks

    E-Print Network [OSTI]

    Chekuri, Chandra; Raja, Adnan; Viswanath, Pramod

    2011-01-01T23:59:59.000Z

    We consider multicommodity flow and cut problems in {\\em polymatroidal} networks where there are submodular capacity constraints on the edges incident to a node. Polymatroidal networks were introduced by Lawler and Martel and Hassin in the single-commodity setting and are closely related to the submodular flow model of Edmonds and Giles; the well-known maxflow-mincut theorem holds in this more general setting. Polymatroidal networks for the multicommodity case have not, as far as the authors are aware, been previously explored. Our work is primarily motivated by applications to information flow in wireless networks. We also consider the notion of undirected polymatroidal networks and observe that they provide a natural way to generalize flows and cuts in edge and node capacitated undirected networks. We establish poly-logarithmic flow-cut gap results in several scenarios that have been previously considered in the standard network flow models where capacities are on the edges or nodes. Our results have alread...

  11. An Extended Network Coding Opportunity Discovery Scheme in Wireless Networks

    E-Print Network [OSTI]

    Zhao, Yunlong; Iwai, Masayuki; Sezaki, Kaoru; Tobe, Yoshito; 10.5121/ijcnc.2012.4106

    2012-01-01T23:59:59.000Z

    Network coding is known as a promising approach to improve wireless network performance. How to discover the coding opportunity in relay nodes is really important for it. There are more coding chances, there are more times it can improve network throughput by network coding operation. In this paper, an extended network coding opportunity discovery scheme (ExCODE) is proposed, which is realized by appending the current node ID and all its 1-hop neighbors' IDs to the packet. ExCODE enables the next hop relay node to know which nodes else have already overheard the packet, so it can discover the potential coding opportunities as much as possible. ExCODE expands the region of discovering coding chance to n-hops, and have more opportunities to execute network coding operation in each relay node. At last, we implement ExCODE over the AODV protocol, and efficiency of the proposed mechanism is demonstrated with NS2 simulations, compared to the existing coding opportunity discovery scheme.

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

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

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

  13. Bayesian networks: maths problems March 31, 2009

    E-Print Network [OSTI]

    Barker, Jon

    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

  14. Managing Power Consumption in Networks on Chips Tajana Simunic

    E-Print Network [OSTI]

    Simunic, Tajana

    Managing Power Consumption in Networks on Chips Tajana Simunic HP Labs & Stanford University 1501 power consumption for NOCs. Power management problem is formulated using closed-loop control concepts, with the estimator tracking changes in the system parameters and recalculating the new power management policy

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

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

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

  16. Radioactive Target Detection Using Wireless Sensor Network

    E-Print Network [OSTI]

    Zhang, Tonglin

    Chapter 31 Radioactive Target Detection Using Wireless Sensor Network Tonglin Zhang Abstract for wireless sensor network data to detect and locate a hidden nuclear target in a large study area. The method assumes multiple radiation detectors have been used as sensor nodes in a wireless sensor network

  17. Gradient Clock Synchronization in Wireless Sensor Networks

    E-Print Network [OSTI]

    Gradient Clock Synchronization in Wireless Sensor Networks Philipp Sommer Computer Engineering- olution. Without doubt, time is a first-class citizen in wireless sensor networks. Without accurate time if the nodes in the wireless sensor network manage to have an adequate agreement of time. Indeed

  18. Modeling Social Networks with Sampled Data 1

    E-Print Network [OSTI]

    Washington at Seattle, University of

    Modeling Social Networks with Sampled Data 1 Technical Report no. 523 Department of Statistics of these relations. Recently, social network studies have focused a great deal of attention on random graph models of networks whose nodes represent individual social actors and whose edges represent a specified relationship

  19. Properties of real networks: degree distribution

    E-Print Network [OSTI]

    Albert, Réka

    Properties of real networks: degree distribution Nodes with small degrees are most frequent;Degree distributions in networks of science collaborations Coauthor, neurosci. 21. )( kkP Coauthor, HEP (2001) )(kP #12;Metabolic networks have a power-law degree distribution H. Jeong et al., Nature 407, 651

  20. Class network routing

    DOE Patents [OSTI]

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

    2009-09-08T23:59:59.000Z

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

  1. Branch and cut algorithms for detecting critical nodes in undirected ...

    E-Print Network [OSTI]

    2011-11-28T23:59:59.000Z

    a “smart” attacker has damaged K ? |V | nodes. With this aim in mind, similar problems have been studied in the literature. The problem can be seen as a ...

  2. DETECTING CRITICAL NODES IN SPARSE GRAPHS Given a ...

    E-Print Network [OSTI]

    2008-08-21T23:59:59.000Z

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

  3. Enhancing the B+ -tree by Dynamic Node Popularity Caching

    E-Print Network [OSTI]

    Zhang, Rui

    that the typical utilization rate of internal B+ -tree nodes is around 67% [11]. We propose a variant of the B

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

    DOE Patents [OSTI]

    Almasi, Gheorghe (Ardsley, NY); Archer, Charles J. (Rochester, MN)

    2011-07-19T23:59:59.000Z

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

  5. New approach for calibration the efficiency of HpGe detectors

    SciTech Connect (OSTI)

    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

    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.

  6. Storageflow: An SDN Approach to Storage Networks

    E-Print Network [OSTI]

    Bose, Pradipta

    2014-08-04T23:59:59.000Z

    and support for experimentation. Additionally, there is a significant potential to improve the performance of the system by leveraging regenerative coding techniques and by allowing the intermediate network nodes to perform encoding operations. OpenFlow (OF...

  7. Energy Management in Wireless Sensor Network Operations 

    E-Print Network [OSTI]

    Mohapatra, Arupa Kumar

    2013-07-26T23:59:59.000Z

    problem (Case I), we consider minimizing energy and node replacement costs in underwater wireless sensor networks for seismic monitoring application. In this case, we introduce mixed-integer programming (MIP) formulations based on a combined routing...

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

    DOE Patents [OSTI]

    Gonia, Patrick S. (Maplewood, MN); Kolavennu, Soumitri N. (Blaine, MN); Mahasenan, Arun V. (Kerala, IN); Budampati, Ramakrishna S. (Maple Grove, MN)

    2010-03-30T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Calamoneri, Tiziana

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

  10. Mobile Node Rostering In Intermittently Connected

    E-Print Network [OSTI]

    Wu, Hongyi

    network and GPS technologies have been explored for wildlife research #12;What we do in field experiments under very harsh environments (underwater, underground tunnels, and extreme temperatures) #12;POSSIBLE occasionally. A special DTN with unique communication and storage constraints. Intermittent computation

  11. tinyMoBot: A Platform for Mobile Sensor Networks Torsten Stremlau, Christoph Weyer, and Volker Turau

    E-Print Network [OSTI]

    Turau, Volker

    tinyMoBot: A Platform for Mobile Sensor Networks Torsten Stremlau, Christoph Weyer, and Volker or the whole network consist of mobile sen- sor nodes. Currently, no common platform is available. This paper are able to communicate with static nodes. Since a general mobile sensor network platform is not available

  12. Toward Resilient Security in Wireless Sensor Networks # Hao Yang # , Fan Ye + , Yuan Yuan # , Songwu Lu # , William Arbaugh #

    E-Print Network [OSTI]

    Lu, Songwu

    networks, location­based security, resiliency, node compromise, en­route filtering, key distributionToward Resilient Security in Wireless Sensor Networks # Hao Yang # , Fan Ye + , Yuan Yuan@us.ibm.com {yuanyuan,waa}@cs.umd.edu ABSTRACT Node compromise poses severe security threats in wireless sensor networks

  13. Mobile Networks and Applications 10, 985995, 2005 C 2005 Springer Science + Business Media, Inc. Manufactured in The Netherlands.

    E-Print Network [OSTI]

    Ramkumar, Mahalingam

    : collaborative trust-based routing, secure communication, colluding malicious nodes, mobile ad hoc networks 1 of the network changes dynamically. Thus, any security model, based on a fixed architecture cannot be used security and low trust levels among nodes in an ad hoc network demands a secure end-to-end route free

  14. IEEE INFOCOM 2002 1 Application of Network Calculus to General

    E-Print Network [OSTI]

    Starobinski, David

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

  15. Design and Analysis of Low Complexity Network Coding Schemes

    E-Print Network [OSTI]

    Tabatabaei-Yazdi, Seyed

    2012-02-20T23:59:59.000Z

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

  16. A Framework for the Capacity Evaluation of Multihop Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A Framework for the Capacity Evaluation of Multihop Wireless Networks Herv´e Rivano CNRS - INRIA and localized CDS. Index Terms--network capacity, multihop wireless networks, upper and lower bounds, linear programing I. INTRODUCTION Ad hoc networks are spontaneous multihop topologies of wireless nodes

  17. Key Predistribution Techniques for Grid-Based Wireless Sensor Networks

    E-Print Network [OSTI]

    Key Predistribution Techniques for Grid-Based Wireless Sensor Networks Simon R. Blackburn1 , Tuvi sensor networks. Networks consisting of wireless sensor nodes ar- ranged in a grid pattern have many for the instantiation of these schemes. Key words: Key predistribution, wireless sensor networks; symmetric key

  18. Downhole drilling network using burst modulation techniques

    DOE Patents [OSTI]

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

    2007-04-03T23:59:59.000Z

    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.

  19. Truthful resource management in wireless ad hoc networks 

    E-Print Network [OSTI]

    Cai, Jianfeng

    2005-11-01T23:59:59.000Z

    for the public afiairs. This is reasonable because the network-wide energy saving is beneflcial for each node. Then, Pfvj = ^Pvi;vk + ^Pvk;vi+1 (3.1) vj is the winner of an auction and vk is the node of the second best bid. . After a redirection ends, another.... As an overhearing node vj competes to be the redirector within a hop, it needs to report to upstream node, vi, the minimum power Pvi;vj and listen to the downstream node, vi+1, to get the minimum power Pvj;vi+1. Since the payofi for a redirector is equal...

  20. 1928 IEEE COMMUNICATIONS LETTERS, VOL. 17, NO. 10, OCTOBER 2013 A Small World Network Model for Energy Efficient Wireless Networks

    E-Print Network [OSTI]

    Elkashlan, Maged

    for Energy Efficient Wireless Networks Tiankui Zhang, Jinlong Cao, Yue Chen, Laurie Cuthbert, and Maged Elkashlan Abstract--Wireless ad hoc networks can be modeled as small world networks based on the complex of the wireless links, and 2) the impact of a wireless node on the entire network. By adopting the proposed metric

  1. Automatic Clustering of Grid Nodes Department of Electrical and

    E-Print Network [OSTI]

    Subhlok, Jaspal

    Automatic Clustering of Grid Nodes Qiang Xu Department of Electrical and Computer Engineering Science University of Houston Houston, Texas 77204 Email: jaspal@uh.edu Abstract-- In a grid to an efficient, scalable and portable method of clustering grid nodes and building a distance map among clusters

  2. Maximizing Service Reliability in Distributed Computing Systems with Random Node

    E-Print Network [OSTI]

    Hayat, Majeed M.

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

  3. Caching in wireless networks

    E-Print Network [OSTI]

    Niesen, Urs

    We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. In the most general form, this can be analyzed by considering the 2[superscript n] timesn-dimensional ...

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

    DOE Patents [OSTI]

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

    2011-01-25T23:59:59.000Z

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

  5. Energy savings in wireless ad hoc sensor networks as a result of network synchronisation

    E-Print Network [OSTI]

    Haddadi, Hamed

    Energy savings in wireless ad hoc sensor networks as a result of network synchronisation Antonio of oceanographic monitoring using a collegiate-managed autonomous network of energy-conscious wireless sensors. We-to-node synchronised transmissions in order to reduce overhearing and therefore reduce energy expenses. SSSNP (Self

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

    SciTech Connect (OSTI)

    Kopczewski, M.R.

    1987-10-01T23:59:59.000Z

    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.

  7. Network topology analysis.

    SciTech Connect (OSTI)

    Kalb, Jeffrey L.; Lee, David S.

    2008-01-01T23:59:59.000Z

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

  8. Sensor Wars: Detecting and Defending Against Spam Attacks in Wireless Sensor Networks

    E-Print Network [OSTI]

    Levi, Albert

    network are discussed in [7]. Security, network bandwidth and power consumption in sensor networksSensor Wars: Detecting and Defending Against Spam Attacks in Wireless Sensor Networks Serdar Sancak@sabanciuniv.edu Abstract--Anti-nodes deployed inside a wireless sensor network can frequently generate dummy data packets

  9. Controlling Complex Networks with Compensatory Perturbations

    E-Print Network [OSTI]

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

    2011-05-18T23:59:59.000Z

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

  10. Flexible network wireless transceiver and flexible network telemetry transceiver

    DOE Patents [OSTI]

    Brown, Kenneth D. (Grain Valley, MO)

    2008-08-05T23:59:59.000Z

    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.

  11. A Dual-Based Algorithm for Multi-Level Network Design

    E-Print Network [OSTI]

    Balakrishnan, Anantaram

    Given an undirected network with L possible facility types for each edge, and a partition of the nodes into L levels, the Multi-level Network Design (MLND) problem seeks a fixed cost minimizing design that spans all the ...

  12. Predicting Turbulence using Partial Least Squares Regression and an Artificial Neural Network

    E-Print Network [OSTI]

    Lakshmanan, Valliappa

    Predicting Turbulence using Partial Least Squares Regression and an Artificial Neural Network in the dataset. Then, the transformed data are pre- sented to a neural network whose output node has a sigmoid

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

    E-Print Network [OSTI]

    Celik, Guner Dincer

    2012-01-01T23:59:59.000Z

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

  14. TDROP: A routing protocol for physically hierarchical ad hoc mobile networks

    E-Print Network [OSTI]

    Ahmed, Zaheer

    2000-01-01T23:59:59.000Z

    Many protocols for routing in mobile ad hoc networks have been proposed. None of these protocols differentiates mobile nodes based on their physical characteristics and also there is only one proposal for connecting ad hoc networks together to form...

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

    E-Print Network [OSTI]

    Kwon, Ji Heon

    2008-05-27T23:59:59.000Z

    Connectivity in sensor networks is an important metric that describes 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...

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

    DOE Patents [OSTI]

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

    2013-01-29T23:59:59.000Z

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

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

    Simunic, Tajana

    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

  18. Network Upgrade for the SLC: PEP II Network

    SciTech Connect (OSTI)

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

    2011-09-09T23:59:59.000Z

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

  19. An analysis of the lifetime of OLSR networks Jan-Maarten Verbree, Maurits de Graaf and Johann Hurink

    E-Print Network [OSTI]

    Al Hanbali, Ahmad

    our results describe the structure of connected sets dominating the 2-hop neighborhood of a node. Key describe the structure of connected dominating sets covering the 2-hop neighborhood of a node. This paper of Service or to maximize the network lifetime (the time until the first node runs out of energy

  20. Routing based Roles Assignment for Monitoring 6LowPAN Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    frequently its connectivity with its neighborhood nodes. In addition, link layer frames are constrained of the routing protocol when dynamic changes occur due to connectivity or nodes movement. The simulation results. Monitoring low power and lossy networks is challenging. Firstly, the main concern in those networks is energy

  1. Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search

    E-Print Network [OSTI]

    Santoro, Nicola

    Cycling Through a Dangerous Network: A Simple Efficient Strategy for Black Hole Search Stefan@scs.carleton.ca Abstract In this paper we consider a dangerous process located at a node of a network (called Black Hole ) and a team of mobile agents deployed to locate that node. The nature of the danger is such that when an agent

  2. Map Construction and Exploration by Mobile Agents Scattered in a Dangerous Network

    E-Print Network [OSTI]

    Santoro, Nicola

    Map Construction and Exploration by Mobile Agents Scattered in a Dangerous Network Paola Flocchini throughout the graph. The problem is further complicated by dangerous elements, nodes and links, in the graph of the network, nodes and links, are unsafe [5­8, 11­19, 23, 24]. The danger is considerable: any agent arriving

  3. Wireless Sensor Networks : the hardware challenge and the cross-layering opportunity

    E-Print Network [OSTI]

    Ingrand, François

    #12;Target applications for wireless sensor networks Flight test instrumentation Pilot ­ crew;Target applications for wireless sensor networks Wireless flight test instrumentation Long term Low or medium data rate, low power nodes High number of nodes, different kind of sensors

  4. SecSens -Security Architecture for Wireless Sensor Networks Faruk Bagci, Theo Ungerer

    E-Print Network [OSTI]

    Ungerer, Theo

    of sensor boards. Keywords: wireless sensor network, security architec- ture, energy efficiency, multi between nodes enhances communication flexibility. Generally, sensor nodes have limited energy and re not be transferred to sensor networks. In recent years, the research was mainly focused on issues related to energy

  5. Percolation of secret correlations in a network

    SciTech Connect (OSTI)

    Leverrier, Anthony; Garcia-Patron, Raul [ICFO-Institut de Ciencies Fotoniques, 08860 Castelldefels (Barcelona) (Spain); Research Laboratory of Electronics, MIT, Cambridge, MA 02139 (United States) and Max-Planck Institut fur Quantenoptik, Hans-Kopfermann Str. 1, D-85748 Garching (Germany)

    2011-09-15T23:59:59.000Z

    In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks--more precisely, the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.

  6. Uttara Sawant, Grid-based Coordinated Routing in Wireless Sensor Networks Master of Science (Computer Science and Engineering), December 2006, 63 pp., 7 tables, 41

    E-Print Network [OSTI]

    Akl, Robert

    networks are battery-powered ad-hoc networks in which sensor nodes that are scattered over a region connect for analysis. However, since they are battery operated, care has to be taken so that these nodes use energy in the network over time for different grid sizes. A test area is divided into square-shaped grids of certain

  7. TRANSPORTATION NODES, REAL ESTATE AND URBAN DEVELOPMENT The Metamorphosis Project

    E-Print Network [OSTI]

    Malinnikova, Eugenia

    1 TRANSPORTATION NODES, REAL ESTATE AND URBAN DEVELOPMENT The Metamorphosis Project Norwegian ON SPEEDBOATS, ALONG THE LEBANESE COAST. THEN EACH PORT OF CALL WOULD BECOME A TRANSPORTATION HUB · 4 ­ 5

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

    SciTech Connect (OSTI)

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

    1990-06-01T23:59:59.000Z

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

  9. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-06-01T23:59:59.000Z

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

  10. Thermal network reduction

    SciTech Connect (OSTI)

    Balcomb, J.D.

    1983-01-01T23:59:59.000Z

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

  11. Sequential Defense Against Random and Intentional Attacks in Complex Networks

    E-Print Network [OSTI]

    Chen, Pin-Yu

    2015-01-01T23:59:59.000Z

    Network robustness against attacks is one of the most fundamental researches in network science as it is closely associated with the reliability and functionality of various networking paradigms. However, despite the study on intrinsic topological vulnerabilities to node removals, little is known on the network robustness when network defense mechanisms are implemented, especially for networked engineering systems equipped with detection capabilities. In this paper, a sequential defense mechanism is firstly proposed in complex networks for attack inference and vulnerability assessment, where the data fusion center sequentially infers the presence of an attack based on the binary attack status reported from the nodes in the network. The network robustness is evaluated in terms of the ability to identify the attack prior to network disruption under two major attack schemes, i.e., random and intentional attacks. We provide a parametric plug-in model for performance evaluation on the proposed mechanism and valida...

  12. A quantum access network

    E-Print Network [OSTI]

    Bernd Fröhlich; James F. Dynes; Marco Lucamarini; Andrew W. Sharpe; Zhiliang Yuan; Andrew J. Shields

    2014-09-02T23:59:59.000Z

    The theoretically proven security of quantum key distribution (QKD) could revolutionise how information exchange is protected in the future. Several field tests of QKD have proven it to be a reliable technology for cryptographic key exchange and have demonstrated nodal networks of point-to-point links. However, so far no convincing answer has been given to the question of how to extend the scope of QKD beyond niche applications in dedicated high security networks. Here we show that adopting simple and cost-effective telecommunication technologies to form a quantum access network can greatly expand the number of users in quantum networks and therefore vastly broaden their appeal. We are able to demonstrate that a high-speed single-photon detector positioned at a network node can be shared between up to 64 users for exchanging secret keys with the node, thereby significantly reducing the hardware requirements for each user added to the network. This point-to-multipoint architecture removes one of the main obstacles restricting the widespread application of QKD. It presents a viable method for realising multi-user QKD networks with resource efficiency and brings QKD closer to becoming the first widespread technology based on quantum physics.

  13. Distributed Dynamic Clustering Algorithm in Uneven Distributed Wireless Sensor Network

    E-Print Network [OSTI]

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

  14. Distributed Mobility Transparent Broadcast in Mobile Ad Hoc Networks

    E-Print Network [OSTI]

    Sikdar, Biplab

    and highly adaptive to node mobility. It does not demand any neighborhood information and incurs little£ciency and alleviated interference; on the other hand, the proposed protocol achieves network energy balance by randomly- mum Connected Dominating Set (MCDS) should be elected as relay nodes, and identifying the MCDS

  15. Energy-Efficient Data Gathering in Heterogeneous Wireless Sensor Networks

    E-Print Network [OSTI]

    Cardei, Mihaela

    1 Energy-Efficient Data Gathering in Heterogeneous Wireless Sensor Networks Wael Awada and Mihaela of energy constrained wireless sensor nodes. Sensor nodes are deployed randomly to monitor a number of targets. Since targets are redundantly covered by more sensors, in order to conserve energy resources, we

  16. Adaptive Power Controlled Routing for Underwater Sensor Networks

    E-Print Network [OSTI]

    Zhou, Shengli

    Adaptive Power Controlled Routing for Underwater Sensor Networks Manal Al-Bzoor, Yibo Zhu, Jun Liu of an in- terest packet sent by sink nodes. We use adaptive power control to send at high power level the sink nodes using shortest end to end paths. By using adaptive power control over concentric layered

  17. Resource Allocation in Sensor Networks with Renewable Energy

    E-Print Network [OSTI]

    Koksal, Can Emre

    Resource Allocation in Sensor Networks with Renewable Energy (Invited Paper) Zhoujia Mao Department@ece.osu.edu Abstract--Renewable energy sources can be attached to sensor nodes to provide energy replenishment of the deployment challenges. These renewable sources of energy could be attached to the nodes and would typically

  18. Online Calibration of Path Loss Exponent in Wireless Sensor Networks

    E-Print Network [OSTI]

    Mao, Guoqiang

    Australia Limited[1], Sydney, Australia §National ICT Australia Limited, Canberra, Australia Abstract power measurements and the geometric constraints associated with planarity in a sensor network. This may[dBm] is the received power at a receiving node j from a transmitting node i in dB milliwatts, Pij[dBm] is the mean

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

    SciTech Connect (OSTI)

    Lin, Ying [University of Tennessee, Knoxville (UTK); Wu, Qishi [ORNL; Zhu, Mengxia [ORNL; Rao, Nageswara S [ORNL

    2009-04-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Thomas Wüst; David P. Landau

    2012-07-17T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Wüst, Thomas

    2012-01-01T23:59:59.000Z

    Coarse-grained (lattice-) models have a long tradition in aiding efforts to decipher the physical or biological complexity of proteins. Despite the simplicity of these models, however, numerical simulations are often computationally very demanding and the quest for efficient algorithms is as old as the models themselves. Expanding on our previous work [T. W\\"ust and D. P. Landau, Phys. Rev. Lett. 102, 178101 (2009)], we present a complete picture of a Monte Carlo method based on Wang-Landau sampling in combination with efficient trial moves (pull, bond-rebridging and pivot moves) which is particularly suited to the study of models such as the hydrophobic-polar (HP) lattice model of protein folding. With this generic and fully blind Monte Carlo procedure, all currently known putative ground states for the most difficult benchmark HP sequences could be found. For most sequences we could also determine the entire energy density of states and, together with suitably designed structural observables, explore the th...

  2. A Retasking Framework For Wireless Sensor Networks

    E-Print Network [OSTI]

    Weigle, Michele

    , built upon Deluge [1], is a wireless network code distribution protocol enabling node group management it affords. Deluge [1] is one of the approaches used to realize this concept. Deluge is a reliable and robust several limitations. First, Deluge is limited only to network-wide dissemination of program binaries

  3. Optimize Storage Placement in Sensor Networks

    E-Print Network [OSTI]

    Li, Qun

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

  4. Dynamic Networks: Recent Results and Applications

    E-Print Network [OSTI]

    Nagurney, Anna

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

  5. Mobility in Wireless Networks Christian Schindelhauer

    E-Print Network [OSTI]

    Schindelhauer, Christian

    hoc networks, and sensor networks regarding mobility. Then, we present the most important mobility sensor nodes with radio transceiver and micro-controller in the size of a small coin (and within- men, Entwurfsmethoden, Anwendungen." and by the EU within the 6th Framework Programme under contract

  6. Observability of Neuronal Network Motifs (Invited Paper)

    E-Print Network [OSTI]

    Brennan, Sean

    Observability of Neuronal Network Motifs (Invited Paper) Andrew J. Whalen*t, Sean N. Brennan Engineering, + Engineering Science and Mechanics, Neurosurgery, and Physics, Penn State University, University) neuronal networks as a function of 1) the connection topology and sym metry, 2) the measured nodes, and 3

  7. Structure and modeling of the network of two-Chinese-character compound words in the Japanese language

    E-Print Network [OSTI]

    Yamamoto, Ken

    2014-01-01T23:59:59.000Z

    This paper proposes a numerical model of the network of two-Chinese-character compound words (two-character network, for short). In this network, a Chinese character is a node and a two-Chinese-character compound word links two nodes. The basic framework of the model is that an important character gets many edges. As the importance of a character, we use the frequency of each character appearing in publications. The direction of edge is given according to a random number assigned to nodes. The network generated by the model is small-world and scale-free, and reproduces statistical properties in the actual two-character network quantitatively.

  8. Duty-Cycle-Aware Broadcast in Wireless Sensor Networks

    E-Print Network [OSTI]

    Liu, Jiangchuan (JC)

    active and dormant states, so as to conserve energy and extend the network lifetime. Unfortunately fails to capture the uniqueness of energy-constrained wireless sensor networks. The sensor nodesDuty-Cycle-Aware Broadcast in Wireless Sensor Networks Feng Wang Jiangchuan Liu School of Computing

  9. A Study of Approximate Data Management Techniques for Sensor Networks

    E-Print Network [OSTI]

    Martin, Ralph R.

    the monitoring operation of sensor nodes by efficiently using their limited energy, bandwidth and computation. The network can therefore be treated as a distributed sensor data management system. Sensor networks differA Study of Approximate Data Management Techniques for Sensor Networks Adonis Skordylis, Niki

  10. On the Capacity of Hybrid Wireless Networks Benyuan Liu

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

    On the Capacity of Hybrid Wireless Networks Benyuan Liu , Zhen Liu + , Don Towsley Department 704 Yorktown Heights, NY 10598 Abstract-- We study the throughput capacity of hybrid wireless networks stations are assumed to be connected by a high-bandwidth wired network and act as relays for wireless nodes

  11. Assessment and Event Based Analysis of Dynamic Wireless Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Assessment and Event Based Analysis of Dynamic Wireless Networks Denis Carvin1,2, Guillaume Kremer1 of mobile nodes in networks is significantly changing the way they are managed. Indeed, these wireless-estimation algorithm for wireless mobile networks. We then provide events' collection and distributed mining methods

  12. Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks

    E-Print Network [OSTI]

    Bystroff, Chris

    Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks Seyit A. C¸amtepe1 of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered-chain sizes. 1 Introduction and Problem Definition In this work, we consider a sensor network in which sensor

  13. Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks

    E-Print Network [OSTI]

    Bystroff, Chris

    Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks Seyit A. C� amtepe of the most challenging security issues in wireless sensor networks where sensor nodes are randomly scattered­chain sizes. 1 Introduction and Problem Definition In this work, we consider a sensor network in which sensor

  14. Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks

    E-Print Network [OSTI]

    Kim, Dae-Shik

    Exploring In-Situ Sensing Irregularity in Wireless Sensor Networks Joengmin Hwang, Tian He Introduction Wireless sensor networks are envisioned to support vari- ety of applications such as military network systems. Compared to the diversified solutions pro- duced for communication among sensor nodes

  15. A realistic testing of a shipboard wireless sensor network

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A realistic testing of a shipboard wireless sensor network H. Kdouh1,* , C. Brousseau2 , G. Zaharia-mail : hussein.kdouh@insa-rennes.fr Abstract--Wireless Sensor Networks (WSN) may be a very useful technology by the topology evolution of the network and the analysis of RSSI levels of links between sensor nodes. Keywords-Wireless

  16. Threshold-Controlled Global Cascading in Wireless Sensor Networks

    E-Print Network [OSTI]

    Varela, Carlos

    Threshold-Controlled Global Cascading in Wireless Sensor Networks Qiming Lu and G. Korniss is a challenging task. Wireless Sensor Networks (WSNs) provide an example where understanding dynamical processes and other wireless ad- hoc networks. First, sensor nodes are often densely deployed (typically 20 sensor per

  17. Simulating Challenges to Communication Networks for Evaluation of Resilience

    E-Print Network [OSTI]

    Mahmood, Rabat Anam

    2009-07-31T23:59:59.000Z

    Simulating Challenges to Communication Networks for Evaluation of Resilience ? 2009 Rabat Anam Mahmood Submitted to the Graduate Degree Program in Electrical Engineering & Computer Science... of various faults and challenges to normal operation" [8]. A resilient network detects, remediates, and recovers from outages and periods of degraded performance within as little time as possible. This so happens that each node in the network continuously...

  18. Securely Computing an Approximate Median in Wireless Sensor Networks

    E-Print Network [OSTI]

    Setia, Sanjeev

    Securely Computing an Approximate Median in Wireless Sensor Networks Sankardas Roy 1 sroy1@gmu and the unattended nature of sensor nodes, sensor network protocols need to be designed with security in mind and efficient. Categories and Subject Descriptors C.2.0 [Computer-Communication Networks]: General- Security

  19. Energy efficient sensor network implementations

    SciTech Connect (OSTI)

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

    2009-01-01T23:59:59.000Z

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

  20. Abstract--A mobile ad hoc network is a wireless communication network which does not rely on a fixed

    E-Print Network [OSTI]

    Lyu, Michael R.

    hoc networks. We propose a secure public key authentication service based on a trust model nodes in the networks. We perform an overall evaluation of our proposed approach by simulations distributed systems, security in ad hoc networks is based on the use of a key management system

  1. Competing contact processes on homogeneous networks with tunable clusterization

    E-Print Network [OSTI]

    Rybak, Marcin

    2012-01-01T23:59:59.000Z

    We investigate two homogeneous networks: the Watts-Strogatz network and the random Erdos-Renyi network, the latter with tunable clustering coefficient $C$. The network is an area of two competing contact processes, where nodes can be in two states, S or D. A node S becomes D with probability 1 if at least two its mutually linked neighbours are D. A node D becomes S with a given probability $p$ if at least one of its neighbours is S. The competition between the processes is described by a phase diagram, where the critical probability $p_c$ depends on the clustering coefficient $C$. For $p>p_c$ the rate of state S increases in time, seemingly to dominate in the whole system. Below $p_c$, the contribution of D-nodes remains finite. The numerical results, supported by mean field approach, indicate that the transition is discontinuous.

  2. The flux measure of influence in engineering networks

    E-Print Network [OSTI]

    Schwing, Kyle Michael

    2009-01-01T23:59:59.000Z

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

  3. The multicast capacity region of large wireless networks

    E-Print Network [OSTI]

    Shah, Devavrat

    We study the problem of determining the multicast capacity region of a wireless network of n nodes randomly located in an extended area and communicating with each other over Gaussian fading channels. We obtain an explicit ...

  4. Computing the Capacity Region of a Wireless Network

    E-Print Network [OSTI]

    Gummadi, Ramakrishna

    We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient and distributed algorithm to determine the ...

  5. Topology management protocols in ad hoc wireless sensor networks

    E-Print Network [OSTI]

    Kim, Hogil

    2009-05-15T23:59:59.000Z

    A wireless sensor network (WSN) is comprised of a few hundred or thousand au-tonomous sensor nodes spatially distributed over a particular region. Each sensornode is equipped with a wireless communication device, a small microprocessor, anda battery...

  6. An Evaluation of Sensing Platforms Used for Sensor Network Research

    E-Print Network [OSTI]

    Kansas, University of

    An Evaluation of Sensing Platforms Used for Sensor Network Research Daniel T. Fokum, Dr. Victor S to complex sensor nodes; which include fully configured computers. Several of these platforms were evaluated ................................................................................................................. 2 3 Evaluation of Sensor Platforms

  7. Homophily and Triadic Closure in Evolving Social Networks

    E-Print Network [OSTI]

    Crimaldi, Irene; Morrison, Greg; Quattrociocchi, Walter; Riccaboni, Massimo

    2015-01-01T23:59:59.000Z

    We present a new network model accounting for homophily and triadic closure in the evolution of social networks. In particular, in our model, each node is characterized by a number of features and the probability of a link between two nodes depends on common features. The bipartite network of the actors and features evolves according to a dynamics that depends on three parameters that respectively regulate the preferential attachment in the transmission of the features to the nodes, the number of new features per node, and the power-law behavior of the total number of observed features. We provide theoretical results and statistical estimators for the parameters of the model. We validate our approach by means of simulations and an empirical analysis of a network of scientific collaborations.

  8. Decentralized detection in resource-limited sensor network architectures

    E-Print Network [OSTI]

    Tay, Wee Peng

    2008-01-01T23:59:59.000Z

    We consider the problem of decentralized binary detection in a network consisting of a large number of nodes arranged as a tree of bounded height. We show that the error probability decays exponentially fast with the number ...

  9. Cooperative Network Coding Next Generation Technology for Today's Warfighter

    E-Print Network [OSTI]

    Haas, Zygmunt J.

    Communications to produce superior network reliability and provide inherent security features, while improving it towards the next cluster. 3.Nodes, in cluster 2 through K, receive the combination packets and act as MISO

  10. Interference management techniques in large-scale wireless networks 

    E-Print Network [OSTI]

    Luo, Yi

    2015-06-29T23:59:59.000Z

    In this thesis, advanced interference management techniques are designed and evaluated for large-scale wireless networks with realistic assumptions, such as signal propagation loss, random node distribution and ...

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

    E-Print Network [OSTI]

    Mao, Weizhen

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

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

    SciTech Connect (OSTI)

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

    2013-06-05T23:59:59.000Z

    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.

  13. Broadcast Capacity in Multihop Wireless Networks Alireza Keshavarz-Haddad Vinay Ribeiro Rudolf Riedi

    E-Print Network [OSTI]

    Riedi, Rudolf H.

    Broadcast Capacity in Multihop Wireless Networks Alireza Keshavarz-Haddad Vinay Ribeiro Rudolf of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated of source nodes or the dimension of the network. 1. INTRODUCTION In wireless networks, broadcast plays

  14. Local Solutions for Global Problems in Wireless Networks May 1, 2006

    E-Print Network [OSTI]

    Urrutia, Jorge

    Local Solutions for Global Problems in Wireless Networks J. Urrutia May 1, 2006 Abstract wireless networks by means of local algorithms. A local algorithm is one in which any node of a network a unit distance wireless network N, we want to obtain a planar subnetwork of N by means of an algorithm

  15. Energy-aware Geographic Forwarding of Prioritized Messages in Wireless Sensor Networks

    E-Print Network [OSTI]

    Marques, Antonio Garcia

    Energy-aware Geographic Forwarding of Prioritized Messages in Wireless Sensor Networks Roc-- Energy is a valuable resource in wireless sensor networks since it constitutes a limiting factor for the network lifetime. In order to make an efficient use of its own energy resources, each node in the network

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

    SciTech Connect (OSTI)

    None

    1980-10-01T23:59:59.000Z

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

  17. Fixed-Node Diffusion Monte Carlo of Lithium Systems

    E-Print Network [OSTI]

    Rasch, Kevin

    2015-01-01T23:59:59.000Z

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

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

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-02-12T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

    Faraj, Ahmad

    2013-07-09T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

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

    2014-05-20T23:59:59.000Z

    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.

  1. Structure-Preserving Sparsification of Social Networks

    E-Print Network [OSTI]

    Lindner, Gerd; Hamann, Michael; Meyerhenke, Henning; Wagner, Dorothea

    2015-01-01T23:59:59.000Z

    Sparsification reduces the size of networks while preserving structural and statistical properties of interest. Various sparsifying algorithms have been proposed in different contexts. We contribute the first systematic conceptual and experimental comparison of \\textit{edge sparsification} methods on a diverse set of network properties. It is shown that they can be understood as methods for rating edges by importance and then filtering globally by these scores. In addition, we propose a new sparsification method (\\textit{Local Degree}) which preserves edges leading to local hub nodes. All methods are evaluated on a set of 100 Facebook social networks with respect to network properties including diameter, connected components, community structure, and multiple node centrality measures. Experiments with our implementations of the sparsification methods (using the open-source network analysis tool suite NetworKit) show that many network properties can be preserved down to about 20\\% of the original set of edges....

  2. Network support for system initiated checkpoints

    SciTech Connect (OSTI)

    Chen, Dong; Heidelberger, Philip

    2013-01-29T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

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

    2011-04-29T23:59:59.000Z

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

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

    E-Print Network [OSTI]

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

    2011-01-01T23:59:59.000Z

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

  6. Edge Direction and the Structure of Networks

    E-Print Network [OSTI]

    Foster, Jacob G; Grassberger, Peter; Paczuski, Maya

    2009-01-01T23:59:59.000Z

    Directed networks are ubiquitous, from food webs to the World Wide Web, but the directionality of their interactions has been disregarded in most studies of global network structure. One important global property is the tendency of nodes with similar numbers of edges to be connected. This tendency, called assortativity, affects crucial structural and dynamic properties of real-world networks. Here we demonstrate the importance of edge direction by studying assortativity in directed networks. We define a set of four directed assortativity measures. By comparison to randomized networks, we discover significant features of three network classes: online/social networks, food webs, and word-adjacency networks. The full set of measures is needed to reveal patterns common to the class or to separate networks that have been previously classified together. Our measures expose limitations of existing theoretical models, and show that many networks are not purely assortative or disassortative but a mixture of the two.

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

    SciTech Connect (OSTI)

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

    2008-09-01T23:59:59.000Z

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

  8. Multipole corrections to perihelion and node line precession

    E-Print Network [OSTI]

    L. Fernández-Jambrina

    2009-06-10T23:59:59.000Z

    In this talk relativistic corrections due to Geroch-Hansen multipoles for perihelion precession and node line precession of orbits in a stationary axially symmetric vacuum spacetime endowed with a plane of symmetry will be shown. Patterns of regularity will be discussed.

  9. Benefits of Multiple TX Powers Robustness to Beacon Node Failure

    E-Print Network [OSTI]

    Chen, Yiling

    the partial failure of the infrastructure. Our system, called MoteTrack, is based on low-power radios coupledAccuracy Benefits of Multiple TX Powers Robustness to Beacon Node Failure Introduction to a wide range of applications. For some, the location tracking system must continue to operate despite

  10. Prediction and Management in Energy Harvested Wireless Sensor Nodes

    E-Print Network [OSTI]

    Simunic, Tajana

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

  11. AN ENERGY BENCHMARK FOR SOFTWARE UPDATES ON WIRELESS SENSOR NODES

    E-Print Network [OSTI]

    Sreenan, Cormac J.

    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

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

    E-Print Network [OSTI]

    Chou, Pai H.

    -circuit solar voltage method for maximum power point tracking, enabling the solar cell to efficiently charge and possibly solar cells to replenish the energy regularly. At the same time, large-scale de- ployment will demand lower cost per node. Among the ultra low-power, low-cost radios with 1kbps data rate and a range

  13. Beyond Pure Axioms: Node Creating Rules in Hybrid Tableaux

    E-Print Network [OSTI]

    ten Cate, Balder

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

  14. Lifetime Prediction for Supercapacitor-powered Wireless Sensor Nodes

    E-Print Network [OSTI]

    Turau, Volker

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

  15. Applying Quadrature Rules with Multiple Nodes to Solving Integral Equations

    SciTech Connect (OSTI)

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

    2008-09-01T23:59:59.000Z

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

  16. Annual Mass Balance Of Blue Glacier, U.S.A.: 1955-97 H. CONWAY, L. A. RASMUSSEN, and H.-P. MARSHALL

    E-Print Network [OSTI]

    Rasmussen, L.A.

    Annual Mass Balance Of Blue Glacier, U.S.A.: 1955-97 H. CONWAY, L. A. RASMUSSEN, and H.-P. MARSHALL changes of Blue Glacier, U.S.A. are calculated from topographic maps made from vertical aerial photography was adjusted for snow thickness and glacier motion to estimate topography of 1 October 1995. The mass of Blue

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

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

    Chen, .Dake

    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

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

    E-Print Network [OSTI]

    Gan, K. K.

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

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

    DOE Patents [OSTI]

    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

    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.

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

    DOE Patents [OSTI]

    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

    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.

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

    DOE Patents [OSTI]

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

    2014-07-08T23:59:59.000Z

    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.

  3. Network Management Network Management

    E-Print Network [OSTI]

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

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

    E-Print Network [OSTI]

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

    2010-01-01T23:59:59.000Z

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

  5. Minimal paths between communities induced by geographical networks

    E-Print Network [OSTI]

    de Arruda, Henrique Ferraz; Costa, Luciano da Fontoura

    2015-01-01T23:59:59.000Z

    In this work we investigate the betweenness centrality in geographical networks and its relationship with network communities. We show that nodes with large betweenness define what we call characteristic betweenness paths in both modeled and real-world geographical networks. We define a geographical network model that possess a simple topology while still being able to present such betweenness paths. Using this model, we show that such paths represent pathways between entry and exit points of highly connected regions, or communities, of geographical networks. By defining a new network, containing information about community adjacencies in the original network, we describe a means to characterize the mesoscale connectivity provided by such characteristic betweenness paths.

  6. The Cost of Attack in Competing Networks

    E-Print Network [OSTI]

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

    2015-01-01T23:59:59.000Z

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

  7. Global Scientific Information and Computing Center, Tokyo Institute of Technology Large-Scale GPU-Equipped High-Performance Compute Nodes

    E-Print Network [OSTI]

    Furui, Sadaoki

    -Equipped High-Performance Compute Nodes High-Speed Network Interconnect High-Speed and Highly Reliable Storage Systems Low Power Consumption and Green Operation System and Application Software HARDWARE AND SOFTWARE 2 USB Internal Micro SD DIMM6CDIMM6C DIMM5FDIMM5F DIMM4BDIMM4B DIMM3EDIMM3E DIMM2ADIMM2A DIMM1DDIMM1

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

    DOE Patents [OSTI]

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

    2010-03-02T23:59:59.000Z

    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.

  9. Engineering Weyl nodes in Dirac semimetals by a magnetic field

    E-Print Network [OSTI]

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

    2013-10-07T23:59:59.000Z

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

  10. Dynamic Conjectures in Random Access Networks Using Bio-inspired Learning

    E-Print Network [OSTI]

    Su, Yi

    2009-01-01T23:59:59.000Z

    This paper considers a conjecture-based distributed learning approach that enables autonomous nodes to independently optimize their transmission probabilities in random access networks. We model the interaction among multiple self-interested nodes as a game. It is well-known that the Nash equilibria in this game result in zero throughput for all the nodes if they take myopic best-response, thereby leading to a network collapse. This paper enables nodes to behave as intelligent entities which can proactively gather information, form internal conjectures on how their competitors would react to their actions, and update their beliefs according to their local observations. In this way, nodes are capable to autonomously "learn" the behavior of their competitors, optimize their own actions, and eventually cultivate reciprocity in the random access network. To characterize the steady-state outcome, the conjectural equilibrium is introduced. Inspired by the biological phenomena of "derivative action" and "gradient dy...

  11. Social Network Analysis: A case study of the Islamist terrorist network

    SciTech Connect (OSTI)

    Medina, Richard M [ORNL

    2012-01-01T23:59:59.000Z

    Social Network Analysis is a compilation of methods used to identify and analyze patterns in social network systems. This article serves as a primer on foundational social network concepts and analyses and builds a case study on the global Islamist terrorist network to illustrate the use and usefulness of these methods. The Islamist terrorist network is a system composed of multiple terrorist organizations that are socially connected and work toward the same goals. This research utilizes traditional social network, as well as small-world, and scale-free analyses to characterize this system on individual, network and systemic levels. Leaders in the network are identified based on their positions in the social network and the network structure is categorized. Finally, two vital nodes in the network are removed and this version of the network is compared with the previous version to make implications of strengths, weaknesses and vulnerabilities. The Islamist terrorist network structure is found to be a resilient and efficient structure, even with important social nodes removed. Implications for counterterrorism are given from the results of each analysis.

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

    E-Print Network [OSTI]

    Bellingeri, Michele; Vincenzi, Simone

    2013-01-01T23:59:59.000Z

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

  13. SRC burn test in 700-hp oil-designed boiler. Annex Volume A. Southern Research Institute report. Final technical report

    SciTech Connect (OSTI)

    Not Available

    1983-09-01T23:59:59.000Z

    Combustion tests were performed using three forms of Solvent Refined Coal (SRC) as the fuel for a 700 hp oil-designed water-tube boiler at the U.S. Department of Energy (DOE) Pittsburgh Energy Technology Center (PETC). This report contains the results from a program of measurements and analyses performed by Southern Research Institute (SoRI) under contract to the International Coal Refining Company (ICRC). The major objectives of the work performed by Southern Research Institute were: (1) to characterize the particulate matter resulting from the combustion of Solvent Refined Coal (SRC) and its fuel forms, and (2) to develop estimates of the specific collection areas required for varying levels of collection of fly ash from SRC combustion in electrostatic precipitators. The report contains physical and chemical characterizations of particles collected during the combustion experiments, and a discussion of electrostatic precipitation of SRC fly ash based on performance measurements with a small-scale precipitator and on simulations using a mathematical model. 9 references, 90 figures, 14 tables.

  14. Lightweight Detection and Classification for Wireless Sensor Networks in Realistic Environments

    E-Print Network [OSTI]

    Batson, Alan

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

  15. Rate Allocation with Lifetime Maximization and Fairness for Data Aggregation in Sensor Networks

    E-Print Network [OSTI]

    Ravindran, Binoy

    for surveillance -- e.g., tracking intruding targets [5]. Some nodes in the network generate physical measurements of an intruding target after sensing the presence of a target. A common operation on such tracking applications one hop or multi-hop towards the cluster head. Generally, sensor nodes are battery-powered and consume

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

    E-Print Network [OSTI]

    Nasipuri, Asis

    EPIC-RoofNet: An Experimental Testbed for Solar-powered Wireless Sensor Networks Amitangshu Pal experiments on solar-powered sensor nodes. Due to constraints in cost and size, the solar panels of solar energy available at such solar-powered sensor nodes can be highly unpredictable and at times

  17. PERFORMANCE ANALYSIS OF POWER-AWARE ROUTE SELECTION PROTOCOLS IN MOBILE AD HOC NETWORKS

    E-Print Network [OSTI]

    California at Santa Cruz, University of

    , a hybrid protocol like the CMMBCR (Conditional Max-Min Battery Capacity Routing) mechanism has been devised-Max Battery Cost Routing) scheme tries to consider the remaining battery power of nodes to prolong- gardless of the remaining battery power of nodes. Since the transmission network2002: submitted to World

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

    E-Print Network [OSTI]

    Magdon-Ismail, Malik

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

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

    E-Print Network [OSTI]

    Hou, Y. Thomas

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

  20. How Many Down? Toward Understanding Systematic Risk in Networks

    E-Print Network [OSTI]

    Bencsáth, Boldizsár

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

  1. Power Management for Wireless Sensor Networks Based on Energy Budgets

    E-Print Network [OSTI]

    Turau, Volker

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

  2. DAG-based Multipath Routing for Mobile Sensor Networks

    E-Print Network [OSTI]

    Choi, Lynn

    DAG-based Multipath Routing for Mobile Sensor Networks Ki-Sup Hong and Lynn Choi School of Electrical Engineering Korea University Seoul, Korea {mastaks, lchoi@korea.ac.kr} Abstract--We propose a new multipath routing protocol called DMR for mobile sensor networks, where any node can move anytime. DMR

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

    E-Print Network [OSTI]

    Leung, Kin K.

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

  4. Self-organized topology of recurrence-based complex networks

    SciTech Connect (OSTI)

    Yang, Hui, E-mail: huiyang@usf.edu; Liu, Gang [Complex Systems Monitoring, Modeling and Analysis Laboratory, University of South Florida, Tampa, Florida 33620 (United States)] [Complex Systems Monitoring, Modeling and Analysis Laboratory, University of South Florida, Tampa, Florida 33620 (United States)

    2013-12-15T23:59:59.000Z

    With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

  5. Non-Uniform Entropy Compression for Uniform Energy Distribution in Wireless Sensor Networks

    E-Print Network [OSTI]

    California at Davis, University of

    -non-homogeneity in the network. Bottleneck nodes trade computation energy for transmission energy, which extends and normalizesNon-Uniform Entropy Compression for Uniform Energy Distribution in Wireless Sensor Networks to increase the network's lifetime and to normalize the energy use per unit time, but they each have

  6. Application of Network Calculus to General Topologies using TurnProhibition

    E-Print Network [OSTI]

    Karpovsky, Mark

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

  7. Combining LT codes and XOR network coding for reliable and energy efficient transmissions in

    E-Print Network [OSTI]

    Jaffrès-Runser, Katia

    Combining LT codes and XOR network coding for reliable and energy efficient transmissions the problem of providing end to end reliable transmissions in a randomly deployed wireless sensor network or several sink nodes. Due to the large scale of such networks, the transmission is multi-hop between

  8. Structuring Measurements for Modeling and the Deployment of Industrial Wireless Networks

    E-Print Network [OSTI]

    Zilic, Zeljko

    . Replacing wired units with wireless sensor network (WSN) nodes offers more flexibility, and ultimately coverage during its deployment. Wireless networking devices are inherently power-limited, which limits1 Structuring Measurements for Modeling and the Deployment of Industrial Wireless Networks Rong

  9. Wireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale

    E-Print Network [OSTI]

    Gao, Jie

    are not flexible. ­ Vulnerable to attacks. · Ad hoc networks· Ad hoc networks ­ Flexible, easy to deploy, cheaper · Optimal power assignment /transmission range · Optimal scheduling & multi-hop routing · Node are staticWireless ad hoc networks Acknowledgement: Slides borrowed from Richard Y. Yang @ Yale #12

  10. 1. Introduction Wireless networked systems arise in various communication contexts, and are becoming

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    cooperative networks multiple radios are deployed in a neighborhood. The radios connect to each other via networks, in terms of both energy efficiency and throughput (Ho et al., 2003). However, besides the many wireless links to form a multi-hop wireless network, with a few nodes acting as gateways that connect

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

    E-Print Network [OSTI]

    Savazzi, Stefano

    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

  12. Energy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks

    E-Print Network [OSTI]

    Prasanna, Viktor K.

    on energy efficiency in ad hoc networks. In this paper, we assume a more practical model for power controlEnergy Efficient Adaptation of Multicast Protocols in Power Controlled Wireless Ad Hoc Networks to power controlled networks is presented. Wireless nodes are assumed to have transmis- sion power control

  13. Studying the Feasibility of Energy Harvesting in a Mobile Sensor Network

    E-Print Network [OSTI]

    Sukhatme, Gaurav S.

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

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

    E-Print Network [OSTI]

    de Veciana, Gustavo

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

  15. Beamforming-Based Broadcast Scheme for Multihop Wireless Networks with Transmission

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    Beamforming-Based Broadcast Scheme for Multihop Wireless Networks with Transmission Range transmission power for a beamforming-based broadcast scheme in multihop wireless networks? To address wireless network, and demonstrated in terms of implicated nodes'ratio, power transmission gain

  16. On optimizing energy consumption: An adaptative authentication level in wireless sensor networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    On optimizing energy consumption: An adaptative authentication level in wireless sensor networks-hungry. As energy is a scarce resource in wireless sensor networks, we propose a new approach that consists or third-party nodes. I. INTRODUCTION Wireless sensor networks (WSNs) are used in several fields

  17. A near optimal algorithm for lifetime optimization in wireless sensor networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    A near optimal algorithm for lifetime optimization in wireless sensor networks Karine Deschinkel1.deschinkel, mourad.hakem}@univ-fcomte.fr Keywords: target coverage, wireless sensor networks, centralized method in wireless sensor networks (WSN) is lifetime optimization. Indeed, in WSN each sensor node is battery powered

  18. A wireless sensor network (WSN) may run different applications for different

    E-Print Network [OSTI]

    Braun, Torsten

    A wireless sensor network (WSN) may run different applications for different tasks, such as event Wireless Sensor Networks, which sup- ports common management tasks such as visualization, monitoring, (re the communication gateway between these sensor sub-networks, the WSN and the Internet. Wireless mesh nodes perform

  19. Heterogeneous Wireless Sensor Network Deployment and Topology Control Based on Irregular Sensor Model

    E-Print Network [OSTI]

    Chung, Yeh-Ching

    Heterogeneous Wireless Sensor Network Deployment and Topology Control Based on Irregular Sensor Introduction Wireless sensor network (WSN) is a key element of the pervasive/ubiquitous computing sensor network (heterogeneous WSN) consists of sensor nodes with different ability, such as different

  20. ENERGY-EFFICIENT MULTIMEDIA COMMUNICATIONS IN LOSSY MULTI-HOP WIRELESS NETWORKS

    E-Print Network [OSTI]

    Kravets, Robin

    ENERGY-EFFICIENT MULTIMEDIA COMMUNICATIONS IN LOSSY MULTI-HOP WIRELESS NETWORKS Al Harris, Cigdem is energy-efficiency due to battery- power constrained mobile nodes. The network interface is a significant to reduce the energy wasted by sending such useless data in lossy networks. Keywords: Energy-efficient

  1. Clique relaxation models in social network Jeffrey Pattillo, Nataly Youssef, and Sergiy Butenko

    E-Print Network [OSTI]

    Butenko, Sergiy

    Clique relaxation models in social network analysis Jeffrey Pattillo, Nataly Youssef, and Sergiy-life applications of the models of interest. 1 Introduction Social networks represent certain types of social that are referred to as actors. In social networks, vertices (nodes, dots) usually stand for actors, and edges (arcs

  2. Efficient Aggregation of Delay-Constrained Data in Wireless Sensor Networks Kemal Akkaya and Mohamed Younis

    E-Print Network [OSTI]

    Younis, Mohamed

    energy saving mechanism for sensor nodes is to exploit in-network data aggregation. In wireless sensor of in-network data aggregation is to eliminate unnecessary packet transmission by filtering out conditions data are routed in a best- effort manner with flexible latency bounds. Contemporary in-network

  3. A Hardware Platform for Network Intrusion Detection and Prevention Chris Clark1

    E-Print Network [OSTI]

    Lee, Wenke

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

  4. CAR: Context-aware Adaptive Routing for Delay Tolerant Mobile Networks

    E-Print Network [OSTI]

    Mascolo, Cecilia

    are evaluated using simulations based on a social network founded mobility model, a purely random one and real of the existing research work in mobile ad hoc networking is based on the assumption that a path exists between mobile ad hoc networks. The protocol is based on the idea of exploiting nodes as carriers of messages

  5. Multiple-Objective Metric for Placing Multiple Base Stations in Wireless Sensor Networks

    E-Print Network [OSTI]

    Liblit, Ben

    positioning in sensor networks based on directional antennas [6], but it addresses secure positioningMultiple-Objective Metric for Placing Multiple Base Stations in Wireless Sensor Networks Soo Kim in wireless sensor networks. First, the ratio of sensor nodes which can communicate with a base station via

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

    E-Print Network [OSTI]

    Vouyioukas, Demosthenes

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

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

    E-Print Network [OSTI]

    Beretta, Giordano

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

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

    DOE Patents [OSTI]

    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

    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.

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

    DOE Patents [OSTI]

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

    2012-08-21T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

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

    2013-09-17T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Zhang, Xiaolan "Ellen"

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

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

    E-Print Network [OSTI]

    Massachusetts at Amherst, University of

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

  13. BATON: A Balanced Tree Structure for Peer-to-Peer Networks

    E-Print Network [OSTI]

    Jagadish, H.V.

    We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure causing distinctions to be made between nodes ...

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

    E-Print Network [OSTI]

    Liu, Mingyan

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

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

    E-Print Network [OSTI]

    Liblit, Ben

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

  16. The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks

    E-Print Network [OSTI]

    Niesen, Urs

    We consider the question of determining the scaling of the n[superscript n] -dimensional balanced unicast and the n 2[superscript n]-dimensional balanced multicast capacity regions of a wireless network with n nodes placed ...

  17. Multimedia Content Delivery for Remote Patient Monitoring using Cognitive Radio Networks

    E-Print Network [OSTI]

    Paris-Sud XI, Université de

    and required network resources to all relay nodes for a best decision-making. I. Introduction Assistive and the primary user protection. In this paper, we propose a best effort on-the-fly resource reservation, carrying

  18. Towards Realizing the Performance and Availability Benefits of a Global Overlay Network

    E-Print Network [OSTI]

    Rahul, Hariharan

    2005-11-01T23:59:59.000Z

    Prior analyses of the benefits of routing overlays are based onplatforms consisting of nodes located primarily in North America, onthe academic Internet, and at the edge of the network. This paper isthe first global study ...

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

    E-Print Network [OSTI]

    Wen, Yonggang

    2008-01-01T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Eagle, Nathan N.

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

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

    E-Print Network [OSTI]

    Como, Giacomo

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

  2. Asynchronous Bypass Channels Improving Performance for Multi-synchronous Network-on-chips

    E-Print Network [OSTI]

    Jain, Tushar Naveen Kumar

    2011-10-21T23:59:59.000Z

    microarchitecture which offers superior performance versus typical synchroniz- ing router designs. Our approach features Asynchronous Bypass Channels (ABCs) at intermediate nodes thus avoiding synchronization delay. We also propose a new network topology and routing...

  3. Energy Aware Self-Organizing Density Management in Wireless Sensor Networks

    E-Print Network [OSTI]

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

    2008-01-01T23:59:59.000Z

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

  4. Phantom cascades: The effect of hidden nodes on information diffusion

    E-Print Network [OSTI]

    Belák, Václav; Sala, Alessandra; Morrison, Donn

    2015-01-01T23:59:59.000Z

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

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

    DOE Patents [OSTI]

    Blocksome, Michael A. (Rochester, MN)

    2011-09-13T23:59:59.000Z

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

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

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-01T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

    Blocksome, Michael A

    2014-04-22T23:59:59.000Z

    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.

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

    DOE Patents [OSTI]

    Faraj, Ahmad (Rochester, MN)

    2012-04-17T23:59:59.000Z

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

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

    DOE Patents [OSTI]

    Blocksome, Michael A

    2013-07-02T23:59:59.000Z

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

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

    DOE Patents [OSTI]

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

    2010-09-28T23:59:59.000Z

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

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

    E-Print Network [OSTI]

    Szalay, Kristof Z

    2013-01-01T23:59:59.000Z

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

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

    SciTech Connect (OSTI)

    Not Available

    1983-09-01T23:59:59.000Z

    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.

  13. Hardware demonstration of high-speed networks for satellite applications.

    SciTech Connect (OSTI)

    Donaldson, Jonathon W.; Lee, David S.

    2008-09-01T23:59:59.000Z

    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.

  14. In the networked society people, knowledge, devices,

    E-Print Network [OSTI]

    Zhao, Yuxiao

    devices to their benefit. Thesis - Development and evaluation of Multi-RAT simulator-00072198 Description, there is a need of modeling WiFi networks and developing a simulator capable of modeling both these RATs. The goal a current Matlab-based time-dynamic LTE simulator to include capabilities to simulate WiFi nodes

  15. Lagrangian Relaxation Applied to Sparse Global Network Alignment

    E-Print Network [OSTI]

    El-Kebir, Mohammed; Klau, Gunnar W

    2011-01-01T23:59:59.000Z

    Data on molecular interactions is increasing at a tremendous pace, while the development of solid methods for analyzing this network data is lagging behind. This holds in particular for the field of comparative network analysis, where one wants to identify commonalities between biological networks. Since biological functionality primarily operates at the network level, there is a clear need for topology-aware comparison methods. In this paper we present a method for global network alignment that is fast and robust, and can flexibly deal with various scoring schemes taking both node-to-node correspondences as well as network topologies into account. It is based on an integer linear programming formulation, generalizing the well-studied quadratic assignment problem. We obtain strong upper and lower bounds for the problem by improving a Lagrangian relaxation approach and introduce the software tool natalie 2.0, a publicly available implementation of our method. In an extensive computational study on protein inte...

  16. Information Theoretic Approach to Social Networks

    E-Print Network [OSTI]

    Kafri, Oded

    2014-01-01T23:59:59.000Z

    We propose an information theoretic model for sociological networks. The model is a microcanonical ensemble of states and particles. The states are the possible pairs of nodes (i.e. people, sites and alike) which exchange information. The particles are the energetic information bits. With analogy to bosons gas, we define for these networks model: entropy, volume, pressure and temperature. We show that these definitions are consistent with Carnot efficiency (the second law) and ideal gas law. Therefore, if we have two large networks: hot and cold having temperatures TH and TC and we remove Q energetic bits from the hot network to the cold network we can save W profit bits. The profit will be calculated from W equal or smaller than Q (1-TH/TC), namely, Carnot formula. In addition it is shown that when two of these networks are merged the entropy increases. This explains the tendency of economic and social networks to merge.

  17. Peer to Peer Networks Management Survey

    E-Print Network [OSTI]

    Amad, Mourad; Aïssani, Djamil

    2012-01-01T23:59:59.000Z

    Peer-to-Peer systems are based on the concept of resources localization and mutualisation in dynamic context. In specific environment such as mobile networks, characterized by high variability and dynamicity of network conditions and performances, where nodes can join and leave the network dynamically, resources reliability and availability constitute a critical issue. The resource discovery problem arises in the context of peer to peer (P2P) networks, where at any point of time a peer may be placed at or removed from any location over a general purpose network. Locating a resource or service efficiently is one of the most important issues related to peer-to-peer networks. The objective of a search mechanism is to successfully locate resources while incurring low overhead and low delay. This paper presents a survey on P2P networks management: classification, applications, platforms, simulators and security.

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

    E-Print Network [OSTI]

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

    2009-06-24T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Turgut, Damla

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

  20. A saddle-node bifurcation model of magnetic reconnection onset

    SciTech Connect (OSTI)

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

    2010-06-15T23:59:59.000Z

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

  1. Network model of human language

    E-Print Network [OSTI]

    Markosova, Maria

    2007-01-01T23:59:59.000Z

    The phenomenon of human language is widely studied from various points of view. It is interesting not only for social scientists, antropologists or philosophers, but also for those, interesting in the network dynamics. In several recent papers word web, or language as a graph has been investigated. In this paper I revise recent studies of syntactical word web. I present a model of growing network in which such processes as node addition, edge rewiring and new link creation are taken into account. I argue, that this model is a satisfactory minimal model explaining measured data.

  2. Design Considerations for a Wireless Sensor Network for Locating Parking Spaces Vamsee K. Boda, Asis Nasipuri, and Ivan Howitt

    E-Print Network [OSTI]

    Nasipuri, Asis

    Design Considerations for a Wireless Sensor Network for Locating Parking Spaces Vamsee K. Boda the design of a real time parking space locating system using a network of wireless sensor nodes and implementation considerations for a wireless sensor network that can track available parking spaces in public

  3. Consensus Filters for Sensor Networks and Distributed Sensor Fusion Reza Olfati-Saber and Jeff S. Shamma

    E-Print Network [OSTI]

    Shamma, Jeff S.

    Consensus Filters for Sensor Networks and Distributed Sensor Fusion Reza Olfati-Saber and Jeff S for sensor fusion in sensor networks. This paper introduces a distributed filter that allows the nodes of a sensor network to track the average of n sensor measurements using an average consensus based distributed

  4. Accurate Estimation of the Degree Distribution of Private Networks Michael Hay, Chao Li, Gerome Miklau, and David Jensen

    E-Print Network [OSTI]

    Keinan, Alon

    Accurate Estimation of the Degree Distribution of Private Networks Michael Hay, Chao Li, Gerome private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differential privacy, and is also extremely efficient, running on networks of 100 million nodes in a few

  5. Complete multiplatform networking integration in a petroleum research environment

    SciTech Connect (OSTI)

    Jefferson, L.L.; Brill, J.P. (Univ. of Tulsa, OK (US))

    1991-07-01T23:59:59.000Z

    The Tulsa U. Fluid Flow Projects (TUFFP) is an industry/university research consortium established in 1973 to investigate multiphase flow in pipes for the petroleum industry. Currently, TUFFP maintains three types of computing power: HP/Apollo UNIX-based workstations, Apple Macintoshes, and AT-class IBM PC's and compatibles. The PC's, and more recently the Macintoshes, are used for data acquisition in experimental research facilities. The data are then transferred to HP/Apollo workstations for analysis and future simulation. The results from the workstation analysis are then ported to the Macintosh system for further graphical analysis in the form of plots and for report generation. This paper describes the current TUFFP computer network is a state-of-the-art and user-friendly system. Users require no prior knowledge of networking protocol and can transfer files among many computers in the network. Researchers can then concentrate on their research without checking hardware connections and learning software communication commands. Moreover, the new network can accommodate growth and change as new needs are introduced and the user population increases.

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

    DOE Patents [OSTI]

    Archer, Charles J; Inglett, Todd A

    2012-10-23T23:59:59.000Z

    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.

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

    SciTech Connect (OSTI)

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

    2013-02-05T23:59:59.000Z

    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.

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

    E-Print Network [OSTI]

    Zhang, Xiaolan "Ellen"

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

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

    E-Print Network [OSTI]

    Zhang, Xiaolan "Ellen"

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

  10. Network Chimera Network Chimera

    E-Print Network [OSTI]

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

  11. Social Networking? Secure Networking?

    E-Print Network [OSTI]

    Chapman, Michael S.

    Social Networking? Secure Networking? Teaching & Learning Technology Roundtable February 2010 #12 ­ The intent behind the current security measures in place at OHSU ­ The OHSU Social Networking Guidelines 2. To begin a campus wide dialogue exploring the changing world of online social networking and it

  12. Networking Issues in Wireless Sensor Networks Deepak Ganesan , Alberto Cerpa , Wei Ye , Yan Yu ,

    E-Print Network [OSTI]

    Cerpa, Alberto E.

    autonomously, and in many cases, without access to renewable energy resources. Cost constraints and the need such as climate monitoring in the canopies, sensor nodes may not be able to renew their energy resources. A major trends in the com- ing decades [1] has posed numerous unique challenges to researchers. These networks

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

    E-Print Network [OSTI]

    T. J. Davidge

    1999-09-23T23:59:59.000Z

    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.

  14. Modularity of Directed Networks: Cycle Decomposition Approach

    E-Print Network [OSTI]

    Natasa Djurdjevac Conrad; Ralf Banisch; Christof Schütte

    2014-07-31T23:59:59.000Z

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

  15. Flow networks: A characterization of geophysical fluid transport

    E-Print Network [OSTI]

    Enrico Ser-Giacomi; Vincent Rossi; Cristobal Lopez; Emilio Hernandez-Garcia

    2015-03-05T23:59:59.000Z

    We represent transport between different regions of a fluid domain by flow networks, constructed from the discrete representation of the Perron-Frobenius or transfer operator associated to the fluid advection dynamics. The procedure is useful to analyze fluid dynamics in geophysical contexts, as illustrated by the construction of a flow network associated to the surface circulation in the Mediterranean sea. We use network-theory tools to analyze the flow network and gain insights into transport processes. In particular we quantitatively relate dispersion and mixing characteristics, classically quantified by Lyapunov exponents, to the degree of the network nodes. A family of network entropies is defined from the network adjacency matrix, and related to the statistics of stretching in the fluid, in particular to the Lyapunov exponent field. Finally we use a network community detection algorithm, Infomap, to partition the Mediterranean network into coherent regions, i.e. areas internally well mixed, but with little fluid interchange between them.

  16. Self-organized network design by link survivals and shortcuts

    E-Print Network [OSTI]

    Hayashi, Yukio

    2011-01-01T23:59:59.000Z

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

  17. Multimedia Traffic Routing in Multilayer WDM Networks

    E-Print Network [OSTI]

    Amphawan, Angela; Hasan, Hassanuddin

    2012-01-01T23:59:59.000Z

    The advent of real-time multimedia services over the Internet has stimulated new technologies for expanding the information carrying capacity of optical network backbones. Multilayer wavelength division multiplexing (WDM) packet switching is an emerging technology for increasing the bandwidth of optical networks. Two algorithms for the routing of the multimedia traffic flows were applied: (i) Capacitated Shortest Path First (CSPF) routing, which minimizes the distance of each flow linking the given source and destination nodes and satisfying capacity constraints; and (ii) Flow Deviation Algorithm (FDA) routing, which minimizes the network?wide average packet delay.

  18. Control of Multi-Node Mobile Communications Networks with Time Varying Channels via

    E-Print Network [OSTI]

    Methods Harold J. Kushner Applied Mathematics Dept. Brown University Providence RI 02912 USA hjk@dam if the links are subject to failure. Comments on the few changes needed for the non-unique route case

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

    E-Print Network [OSTI]

    Dettmann, Carl

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

  20. Defeating Network Node Subversion on SCADA Systems Using Probabilistic Packet Observation

    E-Print Network [OSTI]

    Sheldon, Nathan D.

    on SCADA systems was first proposed in [2]. It is assumed an operator has a model of a control system are manipulated. If no such manipulation takes place and the control signal is still anomalous, we can assume Supervisory control and data acquisition (SCADA) systems form a vital part of the critical infrastructure