Path Network Recovery Using Remote Sensing Data and Geospatial-Temporal Semantic Graphs

Energy Technology Data Exchange (ETDEWEB)

McLendon, William C.,; Brost, Randolph

2016-05-01

Remote sensing systems produce large volumes of high-resolution images that are difficult to search. The GeoGraphy (pronounced Geo-Graph-y) framework [2, 20] encodes remote sensing imagery into a geospatial-temporal semantic graph representation to enable high level semantic searches to be performed. Typically scene objects such as buildings and trees tend to be shaped like blocks with few holes, but other shapes generated from path networks tend to have a large number of holes and can span a large geographic region due to their connectedness. For example, we have a dataset covering the city of Philadelphia in which there is a single road network node spanning a 6 mile x 8 mile region. Even a simple question such as "find two houses near the same street" might give unexpected results. More generally, nodes arising from networks of paths (roads, sidewalks, trails, etc.) require additional processing to make them useful for searches in GeoGraphy. We have assigned the term Path Network Recovery to this process. Path Network Recovery is a three-step process involving (1) partitioning the network node into segments, (2) repairing broken path segments interrupted by occlusions or sensor noise, and (3) adding path-aware search semantics into GeoQuestions. This report covers the path network recovery process, how it is used, and some example use cases of the current capabilities.

Ranking paths in stochastic time-dependent networks

DEFF Research Database (Denmark)

Nielsen, Lars Relund; Andersen, Kim Allan; Pretolani, Daniele D.

2014-01-01

In this paper we address optimal routing problems in networks where travel times are both stochastic and time-dependent. In these networks, the best route choice is not necessarily a path, but rather a time-adaptive strategy that assigns successors to nodes as a function of time. Nevertheless, in...

Experimental demonstration of spectrum-sliced elastic optical path network (SLICE).

Science.gov (United States)

Kozicki, Bartłomiej; Takara, Hidehiko; Tsukishima, Yukio; Yoshimatsu, Toshihide; Yonenaga, Kazushige; Jinno, Masahiko

2010-10-11

We describe experimental demonstration of spectrum-sliced elastic optical path network (SLICE) architecture. We employ optical orthogonal frequency-division multiplexing (OFDM) modulation format and bandwidth-variable optical cross-connects (OXC) to generate, transmit and receive optical paths with bandwidths of up to 1 Tb/s. We experimentally demonstrate elastic optical path setup and spectrally-efficient transmission of multiple channels with bit rates ranging from 40 to 140 Gb/s between six nodes of a mesh network. We show dynamic bandwidth scalability for optical paths with bit rates of 40 to 440 Gb/s. Moreover, we demonstrate multihop transmission of a 1 Tb/s optical path over 400 km of standard single-mode fiber (SMF). Finally, we investigate the filtering properties and the required guard band width for spectrally-efficient allocation of optical paths in SLICE.

Spreading paths in partially observed social networks

OpenAIRE

Onnela, Jukka-Pekka; Christakis, Nicholas A.

2012-01-01

Understanding how and how far information, behaviors, or pathogens spread in social networks is an important problem, having implications for both predicting the size of epidemics, as well as for planning effective interventions. There are, however, two main challenges for inferring spreading paths in real-world networks. One is the practical difficulty of observing a dynamic process on a network, and the other is the typical constraint of only partially observing a network. Using a static, s...

Algorithms for finding optimal paths in network games with p players

Directory of Open Access Journals (Sweden)

R. Boliac

1997-08-01

Full Text Available We study the problem of finding optimal paths in network games with p players. Some polynomial-time algorithms for finding optimal paths and optimal by Nash strategies of the players in network games with p players are proposed.

Architecture and design of optical path networks utilizing waveband virtual links

Science.gov (United States)

Ito, Yusaku; Mori, Yojiro; Hasegawa, Hiroshi; Sato, Ken-ichi

2016-02-01

We propose a novel optical network architecture that uses waveband virtual links, each of which can carry several optical paths, to directly bridge distant node pairs. Future photonic networks should not only transparently cover extended areas but also expand fiber capacity. However, the traversal of many ROADM nodes impairs the optical signal due to spectrum narrowing. To suppress the degradation, the bandwidth of guard bands needs to be increased, which degrades fiber frequency utilization. Waveband granular switching allows us to apply broader pass-band filtering at ROADMs and to insert sufficient guard bands between wavebands with minimum frequency utilization offset. The scheme resolves the severe spectrum narrowing effect. Moreover, the guard band between optical channels in a waveband can be minimized, which increases the number of paths that can be accommodated per fiber. In the network, wavelength path granular routing is done without utilizing waveband virtual links, and it still suffers from spectrum narrowing. A novel network design algorithm that can bound the spectrum narrowing effect by limiting the number of hops (traversed nodes that need wavelength path level routing) is proposed in this paper. This algorithm dynamically changes the waveband virtual link configuration according to the traffic distribution variation, where optical paths that need many node hops are effectively carried by virtual links. Numerical experiments demonstrate that the number of necessary fibers is reduced by 23% compared with conventional optical path networks.

Low Complexity Transmission Scheme with Full Diversity for Two-Path Relay Networks

KAUST Repository

Fareed, Muhammad Mehboob

2014-01-06

In this work, we present a new low complexity scheme for two-path relay network to harvest maximum achievable diversity. We analyze the performance of the newly proposed two-path relay network by calculating the symbol error rate (SER) for arbitrary location of relays. It is shown that with this newly proposed scheme, two-path relay networks can mimic a 2x2 multiple-input mulitple-output (MIMO) system and achieve full diversity order of four. Simulations results are provided to verify and illustrate the analytical results.

Low Complexity Transmission Scheme with Full Diversity for Two-Path Relay Networks

KAUST Repository

Fareed, Muhammad Mehboob; Yang, Hong-Chuan; Alouini, Mohamed-Slim

2014-01-01

In this work, we present a new low complexity scheme for two-path relay network to harvest maximum achievable diversity. We analyze the performance of the newly proposed two-path relay network by calculating the symbol error rate (SER) for arbitrary location of relays. It is shown that with this newly proposed scheme, two-path relay networks can mimic a 2x2 multiple-input mulitple-output (MIMO) system and achieve full diversity order of four. Simulations results are provided to verify and illustrate the analytical results.

Meta-path based heterogeneous combat network link prediction

Science.gov (United States)

Li, Jichao; Ge, Bingfeng; Yang, Kewei; Chen, Yingwu; Tan, Yuejin

2017-09-01

The combat system-of-systems in high-tech informative warfare, composed of many interconnected combat systems of different types, can be regarded as a type of complex heterogeneous network. Link prediction for heterogeneous combat networks (HCNs) is of significant military value, as it facilitates reconfiguring combat networks to represent the complex real-world network topology as appropriate with observed information. This paper proposes a novel integrated methodology framework called HCNMP (HCN link prediction based on meta-path) to predict multiple types of links simultaneously for an HCN. More specifically, the concept of HCN meta-paths is introduced, through which the HCNMP can accumulate information by extracting different features of HCN links for all the six defined types. Next, an HCN link prediction model, based on meta-path features, is built to predict all types of links of the HCN simultaneously. Then, the solution algorithm for the HCN link prediction model is proposed, in which the prediction results are obtained by iteratively updating with the newly predicted results until the results in the HCN converge or reach a certain maximum iteration number. Finally, numerical experiments on the dataset of a real HCN are conducted to demonstrate the feasibility and effectiveness of the proposed HCNMP, in comparison with 30 baseline methods. The results show that the performance of the HCNMP is superior to those of the baseline methods.

AN IMPROVEMENT ON GEOMETRY-BASED METHODS FOR GENERATION OF NETWORK PATHS FROM POINTS

Directory of Open Access Journals (Sweden)

Z. Akbari

2014-10-01

Full Text Available Determining network path is important for different purposes such as determination of road traffic, the average speed of vehicles, and other network analysis. One of the required input data is information about network path. Nevertheless, the data collected by the positioning systems often lead to the discrete points. Conversion of these points to the network path have become one of the challenges which different researchers, presents many ways for solving it. This study aims at investigating geometry-based methods to estimate the network paths from the obtained points and improve an existing point to curve method. To this end, some geometry-based methods have been studied and an improved method has been proposed by applying conditions on the best method after describing and illustrating weaknesses of them.

Self-organizing path integration using a linked continuous attractor and competitive network: path integration of head direction.

Science.gov (United States)

Stringer, Simon M; Rolls, Edmund T

2006-12-01

A key issue is how networks in the brain learn to perform path integration, that is update a represented position using a velocity signal. Using head direction cells as an example, we show that a competitive network could self-organize to learn to respond to combinations of head direction and angular head rotation velocity. These combination cells can then be used to drive a continuous attractor network to the next head direction based on the incoming rotation signal. An associative synaptic modification rule with a short term memory trace enables preceding combination cell activity during training to be associated with the next position in the continuous attractor network. The network accounts for the presence of neurons found in the brain that respond to combinations of head direction and angular head rotation velocity. Analogous networks in the hippocampal system could self-organize to perform path integration of place and spatial view representations.

An improved algorithm for finding all minimal paths in a network

International Nuclear Information System (INIS)

Bai, Guanghan; Tian, Zhigang; Zuo, Ming J.

2016-01-01

Minimal paths (MPs) play an important role in network reliability evaluation. In this paper, we report an efficient recursive algorithm for finding all MPs in two-terminal networks, which consist of a source node and a sink node. A linked path structure indexed by nodes is introduced, which accepts both directed and undirected form of networks. The distance between each node and the sink node is defined, and a simple recursive algorithm is presented for labeling the distance for each node. Based on the distance between each node and the sink node, additional conditions for backtracking are incorporated to reduce the number of search branches. With the newly introduced linked node structure, the distances between each node and the sink node, and the additional backtracking conditions, an improved backtracking algorithm for searching for all MPs is developed. In addition, the proposed algorithm can be adapted to search for all minimal paths for each source–sink pair in networks consisting of multiple source nodes and/or multiple sink nodes. Through computational experiments, it is demonstrated that the proposed algorithm is more efficient than existing algorithms when the network size is not too small. The proposed algorithm becomes more advantageous as the size of the network grows. - Highlights: • A linked path structure indexed by nodes is introduced to represent networks. • Additional conditions for backtracking are proposed based on the distance of each node. • An efficient algorithm is developed to find all MPs for two-terminal networks. • The computational efficiency of the algorithm for two-terminal networks is investigated. • The computational efficiency of the algorithm for multi-terminal networks is investigated.

Reliable Path Selection Problem in Uncertain Traffic Network after Natural Disaster

Directory of Open Access Journals (Sweden)

Jing Wang

2013-01-01

Full Text Available After natural disaster, especially for large-scale disasters and affected areas, vast relief materials are often needed. In the meantime, the traffic networks are always of uncertainty because of the disaster. In this paper, we assume that the edges in the network are either connected or blocked, and the connection probability of each edge is known. In order to ensure the arrival of these supplies at the affected areas, it is important to select a reliable path. A reliable path selection model is formulated, and two algorithms for solving this model are presented. Then, adjustable reliable path selection model is proposed when the edge of the selected reliable path is broken. And the corresponding algorithms are shown to be efficient both theoretically and numerically.

A Novel Dual Separate Paths (DSP) Algorithm Providing Fault-Tolerant Communication for Wireless Sensor Networks.

Science.gov (United States)

Tien, Nguyen Xuan; Kim, Semog; Rhee, Jong Myung; Park, Sang Yoon

2017-07-25

Fault tolerance has long been a major concern for sensor communications in fault-tolerant cyber physical systems (CPSs). Network failure problems often occur in wireless sensor networks (WSNs) due to various factors such as the insufficient power of sensor nodes, the dislocation of sensor nodes, the unstable state of wireless links, and unpredictable environmental interference. Fault tolerance is thus one of the key requirements for data communications in WSN applications. This paper proposes a novel path redundancy-based algorithm, called dual separate paths (DSP), that provides fault-tolerant communication with the improvement of the network traffic performance for WSN applications, such as fault-tolerant CPSs. The proposed DSP algorithm establishes two separate paths between a source and a destination in a network based on the network topology information. These paths are node-disjoint paths and have optimal path distances. Unicast frames are delivered from the source to the destination in the network through the dual paths, providing fault-tolerant communication and reducing redundant unicast traffic for the network. The DSP algorithm can be applied to wired and wireless networks, such as WSNs, to provide seamless fault-tolerant communication for mission-critical and life-critical applications such as fault-tolerant CPSs. The analyzed and simulated results show that the DSP-based approach not only provides fault-tolerant communication, but also improves network traffic performance. For the case study in this paper, when the DSP algorithm was applied to high-availability seamless redundancy (HSR) networks, the proposed DSP-based approach reduced the network traffic by 80% to 88% compared with the standard HSR protocol, thus improving network traffic performance.

Optimal Path Choice in Railway Passenger Travel Network Based on Residual Train Capacity

Directory of Open Access Journals (Sweden)

Fei Dou

2014-01-01

Full Text Available Passenger’s optimal path choice is one of the prominent research topics in the field of railway passenger transport organization. More and more different train types are available, increasing path choices from departure to destination for travelers are unstoppable. However, travelers cannot avoid being confused when they hope to choose a perfect travel plan based on various travel time and cost constraints before departure. In this study, railway passenger travel network is constructed based on train timetable. Both the generalized cost function we developed and the residual train capacity are considered to be the foundation of path searching procedure. The railway passenger travel network topology is analyzed based on residual train capacity. Considering the total travel time, the total travel cost, and the total number of passengers, we propose an optimal path searching algorithm based on residual train capacity in railway passenger travel network. Finally, the rationale of the railway passenger travel network and the optimal path generation algorithm are verified positively by case study.

Search for minimal paths in modified networks

International Nuclear Information System (INIS)

Yeh, W.-C.

2002-01-01

The problem of searching for all minimal paths (MPs) in a network obtained by modifying the original network, e.g. for network expansion or reinforcement, is discussed and solved in this study. The existing best-known method to solve this problem was a straightforward approach. It needed extensive comparison and verification, and failed to solve some special but important cases. Therefore, a more efficient, intuitive and generalized method to search for all MPs without an extensive research procedure is proposed. In this presentation, first we develop an intuitive algorithm based upon the reformation of all MPs in the original network to search for all MPs in a modified network. Next, the computational complexity of the proposed algorithm is analyzed and compared with the existing methods. Finally, examples illustrate how all MPs are generated in a modified network based upon the reformation of all of the MPs in the corresponding original network

Teleconnection Paths via Climate Network Direct Link Detection.

Science.gov (United States)

Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

2015-12-31

Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

Alternative Path Communication in Wide-Scale Cluster-Tree Wireless Sensor Networks Using Inactive Periods.

Science.gov (United States)

Leão, Erico; Montez, Carlos; Moraes, Ricardo; Portugal, Paulo; Vasques, Francisco

2017-05-06

The IEEE 802.15.4/ZigBee cluster-tree topology is a suitable technology to deploy wide-scale Wireless Sensor Networks (WSNs). These networks are usually designed to support convergecast traffic, where all communication paths go through the PAN (Personal Area Network) coordinator. Nevertheless, peer-to-peer communication relationships may be also required for different types of WSN applications. That is the typical case of sensor and actuator networks, where local control loops must be closed using a reduced number of communication hops. The use of communication schemes optimised just for the support of convergecast traffic may result in higher network congestion and in a potentially higher number of communication hops. Within this context, this paper proposes an Alternative-Route Definition (ARounD) communication scheme for WSNs. The underlying idea of ARounD is to setup alternative communication paths between specific source and destination nodes, avoiding congested cluster-tree paths. These alternative paths consider shorter inter-cluster paths, using a set of intermediate nodes to relay messages during their inactive periods in the cluster-tree network. Simulation results show that the ARounD communication scheme can significantly decrease the end-to-end communication delay, when compared to the use of standard cluster-tree communication schemes. Moreover, the ARounD communication scheme is able to reduce the network congestion around the PAN coordinator, enabling the reduction of the number of message drops due to queue overflows in the cluster-tree network.

Evaluation of Shortest Paths in Road Network

Directory of Open Access Journals (Sweden)

Farrukh Shehzad

2009-06-01

Full Text Available Optimization is a key factor in almost all the topics of operations research / management science and economics.The road networks can be optimized within different constraints like time, distance, cost and traffic running onthe roads.This study is based on optimization of real road network by means of distances. Two main objectives arepursued in this research: 1 road distances among different routes are composed in detail; 2 two standardalgorithms (Dijkstra and Floyd-Warshall algoritms are applied to optimize/minimize these distances for bothsingle-source and all-pairs shortest path problems.

Software complex for finding the path routings in synchronous digital hierarchy networks

Directory of Open Access Journals (Sweden)

V. A. Bulanov

2014-01-01

Full Text Available Communication network constructions based on the synchronous digital hierarchy (SDH are widely used in design and operation of telephone networks and data transfer ones on the basis of dedicated links. The providing the link for data transmission from one node to another one is a nontrivial objective. The network equipment vendors, as a rule, may provide also a network system control. However, these systems can be used only with the manufacturer's equipment, but are not intended for finding the optimal paths for the current network operation. They serve for examination to choose a network structure at the stage of its development or modernization for the known in advance matrix of connections. From the practice it is seen that the real networks structures use diverse equipment. Therefore to develop a complex to find the paths in SDH-based network is a challenge.Dijkstra algorithm is implemented to find the shortest network path routings in the complex. The use of the classical algorithm is impossible because of the restrictions in providing main and reserve links. There are multiplex sections with no routes to be expected. Such restriction is due to real arrangement of some multiplex sections in the same cables, but in different fibres. When providing the main link, the appropriate structuring sections should be preferable. For example, the link E3 (34 Mbit/s can pass only across the section of relevant configuration. The reserve link cannot pass across those multiplex sections where the main link has passed. This rule is not 'extra' considering the first restriction since the main and reserve link sections cannot crisscross the node. At the dead ends reserving has no sense, and the reserve link has to coincide with the main one to save a multiplex section resource of terminal switching. In implementation all these restrictions have been taken into consideration.In addition to the path routings, complex enables saving information on the network

The shortest path algorithm performance comparison in graph and relational database on a transportation network

Directory of Open Access Journals (Sweden)

Mario Miler

2014-02-01

Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.

Path selection rules for droplet trains in single-lane microfluidic networks

Science.gov (United States)

Amon, A.; Schmit, A.; Salkin, L.; Courbin, L.; Panizza, P.

2013-07-01

We investigate the transport of periodic trains of droplets through microfluidic networks having one inlet, one outlet, and nodes consisting of T junctions. Variations of the dilution of the trains, i.e., the distance between drops, reveal the existence of various hydrodynamic regimes characterized by the number of preferential paths taken by the drops. As the dilution increases, this number continuously decreases until only one path remains explored. Building on a continuous approach used to treat droplet traffic through a single asymmetric loop, we determine selection rules for the paths taken by the drops and we predict the variations of the fraction of droplets taking these paths with the parameters at play including the dilution. Our results show that as dilution decreases, the paths are selected according to the ascending order of their hydrodynamic resistance in the absence of droplets. The dynamics of these systems controlled by time-delayed feedback is complex: We observe a succession of periodic regimes separated by a wealth of bifurcations as the dilution is varied. In contrast to droplet traffic in single asymmetric loops, the dynamical behavior in networks of loops is sensitive to initial conditions because of extra degrees of freedom.

Using Smoke Injection in Drains to Identify Potential Preferential Pathways in a Drained Arable Field

Science.gov (United States)

Nielsen, M. H.; Petersen, C. T.; Hansen, S.

2014-12-01

Macropores forming a continuous pathway between the soil surface and subsurface drains favour the transport of many contaminants from agricultural fields to surface waters. The smoke injection method presented by Shipitalo and Gibbs (2000) used for demonstrating and quantifying such pathways has been further developed and used on a drained Danish sandy loam. In order to identify the preferential pathways to drains, smoke was injected in three 1.15 m deep tile drains (total drain length 93 m), and smoke emitting macropores (SEMP) at the soil surface were counted and characterized as producing either strong or weak plumes compared to reference plumes from 3 and 6 mm wide tubes. In the two situations investigated in the present study - an early spring and an autumn situation, smoke only penetrated the soil surface layer via earthworm burrows located in a 1.0 m wide belt directly above the drain lines. However, it is known from previous studies that desiccation fractures in a dry summer situation also can contribute to the smoke pattern. The distance between SEMP measured along the drain lines was on average 0.46 m whereas the average spacing between SEMP with strong plumes was 2.3 m. Ponded water was applied in 6 cm wide rings placed above 52 burrows including 17 reference burrows which did not emit smoke. Thirteen pathways in the soil were examined using dye tracer and profile excavation. SEMP with strong plumes marked the entrance of highly efficient transport pathways conducting surface applied water and dye tracer into the drain. However, no single burrow was traced all the way from the surface into the drain, the dye patterns branched off in a network of other macropores. Water infiltration rates were significantly higher (P drains and surface waters, pathways being associated primarily with unevenly distributed SEMP producing strong smoke plumes.

Identifying uncertainty of the mean of some water quality variables along water quality monitoring network of Bahr El Baqar drain

Directory of Open Access Journals (Sweden)

Hussein G. Karaman

2013-10-01

Full Text Available Assigning objectives to the environmental monitoring network is the pillar of the design to these kinds of networks. Conflicting network objectives may affect the adequacy of the design in terms of sampling frequency and the spatial distribution of the monitoring stations which in turn affect the accuracy of the data and the information extracted. The first step in resolving this problem is to identify the uncertainty inherent in the network as the result of the vagueness of the design objective. Entropy has been utilized and adopted over the past decades to identify uncertainty in similar water data sets. Therefore it is used to identify the uncertainties inherent in the water quality monitoring network of Bahr El-Baqar drain located in the Eastern Delta. Toward investigating the applicability of the Entropy methodology, comprehensive analysis at the selected drain as well as their data sets is carried out. Furthermore, the uncertainty calculated by the entropy function will be presented by the means of the geographical information system to give the decision maker a global view to these uncertainties and to open the door to other researchers to find out innovative approaches to lower these uncertainties reaching optimal monitoring network in terms of the spatial distribution of the monitoring stations.

A new approach to shortest paths on networks based on the quantum bosonic mechanism

Energy Technology Data Exchange (ETDEWEB)

Jiang Xin; Wang Hailong; Tang Shaoting; Ma Lili; Zhang Zhanli; Zheng Zhiming, E-mail: jiangxin@ss.buaa.edu.cn [Key Laboratory of Mathematics, Informatics and Behavioral Semantics, Ministry of Education, Beijing University of Aeronautics and Astronautics, 100191 Beijing (China)

2011-01-15

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O({mu}(N) ln ln N) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

Shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity.

Directory of Open Access Journals (Sweden)

J R Managbanag

Full Text Available BACKGROUND: Identification of genes that modulate longevity is a major focus of aging-related research and an area of intense public interest. In addition to facilitating an improved understanding of the basic mechanisms of aging, such genes represent potential targets for therapeutic intervention in multiple age-associated diseases, including cancer, heart disease, diabetes, and neurodegenerative disorders. To date, however, targeted efforts at identifying longevity-associated genes have been limited by a lack of predictive power, and useful algorithms for candidate gene-identification have also been lacking. METHODOLOGY/PRINCIPAL FINDINGS: We have utilized a shortest-path network analysis to identify novel genes that modulate longevity in Saccharomyces cerevisiae. Based on a set of previously reported genes associated with increased life span, we applied a shortest-path network algorithm to a pre-existing protein-protein interaction dataset in order to construct a shortest-path longevity network. To validate this network, the replicative aging potential of 88 single-gene deletion strains corresponding to predicted components of the shortest-path longevity network was determined. Here we report that the single-gene deletion strains identified by our shortest-path longevity analysis are significantly enriched for mutations conferring either increased or decreased replicative life span, relative to a randomly selected set of 564 single-gene deletion strains or to the current data set available for the entire haploid deletion collection. Further, we report the identification of previously unknown longevity genes, several of which function in a conserved longevity pathway believed to mediate life span extension in response to dietary restriction. CONCLUSIONS/SIGNIFICANCE: This work demonstrates that shortest-path network analysis is a useful approach toward identifying genetic determinants of longevity and represents the first application of

Lambda Station: Alternate network path forwarding for production SciDAC applications

International Nuclear Information System (INIS)

Grigoriev, Maxim; Bobyshev, Andrey; Crawford, Matt; DeMar, Phil; Grigaliunas, Vyto; Moibenko, Alexander; Petravick, Don; Newman, Harvey; Steenberg, Conrad; Thomas, Michael

2007-01-01

The LHC era will start very soon, creating immense data volumes capable of demanding allocation of an entire network circuit for task-driven applications. Circuit-based alternate network paths are one solution to meeting the LHC high bandwidth network requirements. The Lambda Station project is aimed at addressing growing requirements for dynamic allocation of alternate network paths. Lambda Station facilitates the rerouting of designated traffic through site LAN infrastructure onto so-called 'high-impact' wide-area networks. The prototype Lambda Station developed with Service Oriented Architecture (SOA) approach in mind will be presented. Lambda Station has been successfully integrated into the production version of the Storage Resource Manager (SRM), and deployed at US CMS Tier1 center at Fermilab, as well as at US-CMS Tier-2 site at Caltech. This paper will discuss experiences using the prototype system with production SciDAC applications for data movement between Fermilab and Caltech. The architecture and design principles of the production version Lambda Station software, currently being implemented as Java based web services, will also be presented in this paper

Applying self-organizing map and modified radial based neural network for clustering and routing optimal path in wireless network

Science.gov (United States)

Hoomod, Haider K.; Kareem Jebur, Tuka

2018-05-01

Mobile ad hoc networks (MANETs) play a critical role in today’s wireless ad hoc network research and consist of active nodes that can be in motion freely. Because it consider very important problem in this network, we suggested proposed method based on modified radial basis function networks RBFN and Self-Organizing Map SOM. These networks can be improved by the use of clusters because of huge congestion in the whole network. In such a system, the performance of MANET is improved by splitting the whole network into various clusters using SOM. The performance of clustering is improved by the cluster head selection and number of clusters. Modified Radial Based Neural Network is very simple, adaptable and efficient method to increase the life time of nodes, packet delivery ratio and the throughput of the network will increase and connection become more useful because the optimal path has the best parameters from other paths including the best bitrate and best life link with minimum delays. Proposed routing algorithm depends on the group of factors and parameters to select the path between two points in the wireless network. The SOM clustering average time (1-10 msec for stall nodes) and (8-75 msec for mobile nodes). While the routing time range (92-510 msec).The proposed system is faster than the Dijkstra by 150-300%, and faster from the RBFNN (without modify) by 145-180%.

Lambdastation: a forwarding and admission control service to interface production network facilities with advanced research network paths

Energy Technology Data Exchange (ETDEWEB)

DeMar, Philip; Petravick, Don; /Fermilab

2004-12-01

Over the past several years, there has been a great deal of research effort and funding put into the deployment of optical-based, advanced technology wide-area networks. Fermilab and CalTech have initiated a project to enable our production network facilities to exploit these advanced research network facilities. Our objective is to forward designated data transfers across these advanced wide area networks on a per-flow basis, making use our capacious production-use storage systems connected to the local campus network. To accomplish this, we intend to develop a dynamically provisioned forwarding service that would provide alternate path forwarding onto available wide area advanced research networks. The service would dynamically reconfigure forwarding of specific flows within our local production-use network facilities, as well as provide an interface to enable applications to utilize the service. We call this service LambdaStation. If one envisions wide area optical network paths as high bandwidth data railways, then LambdaStation would functionally be the railroad terminal that regulates which flows at the local site get directed onto the high bandwidth data railways. LambdaStation is a DOE-funded SciDac research project in its very early stage of development.

Low-complexity full-rate transmission scheme with full diversity for two-path relay networks

KAUST Repository

Fareed, Muhammad Mehboob; Yang, Hongchuan; Alouini, Mohamed-Slim

2015-01-01

Existing full-rate transmission schemes for two-path relay networks typically cannot achieve full diversity while demanding high decoding complexity. In this paper, we present a novel low-complexity full-rate transmission scheme for two-path relay networks to harvest maximum achievable diversity. The proposed scheme adopts block transmission with small block size of four symbols, which greatly reduces the decoding complexity at the receiver. Through the performance analysis of the resulting two-path relay network in terms of the symbol error rate (SER) and diversity order, we show the proposed scheme can achieve full diversity order of four and mimic a 2 \\times 2 multiple-input multiple-output system. Simulations results are provided to validate the mathematical formulation. © 1967-2012 IEEE.

Low-complexity full-rate transmission scheme with full diversity for two-path relay networks

KAUST Repository

Fareed, Muhammad Mehboob

2015-04-01

Existing full-rate transmission schemes for two-path relay networks typically cannot achieve full diversity while demanding high decoding complexity. In this paper, we present a novel low-complexity full-rate transmission scheme for two-path relay networks to harvest maximum achievable diversity. The proposed scheme adopts block transmission with small block size of four symbols, which greatly reduces the decoding complexity at the receiver. Through the performance analysis of the resulting two-path relay network in terms of the symbol error rate (SER) and diversity order, we show the proposed scheme can achieve full diversity order of four and mimic a 2 \\\\times 2 multiple-input multiple-output system. Simulations results are provided to validate the mathematical formulation. © 1967-2012 IEEE.

A MODIFIED GENETIC ALGORITHM FOR FINDING FUZZY SHORTEST PATHS IN UNCERTAIN NETWORKS

Directory of Open Access Journals (Sweden)

A. A. Heidari

2016-06-01

Full Text Available In realistic network analysis, there are several uncertainties in the measurements and computation of the arcs and vertices. These uncertainties should also be considered in realizing the shortest path problem (SPP due to the inherent fuzziness in the body of expert's knowledge. In this paper, we investigated the SPP under uncertainty to evaluate our modified genetic strategy. We improved the performance of genetic algorithm (GA to investigate a class of shortest path problems on networks with vague arc weights. The solutions of the uncertain SPP with considering fuzzy path lengths are examined and compared in detail. As a robust metaheuristic, GA algorithm is modified and evaluated to tackle the fuzzy SPP (FSPP with uncertain arcs. For this purpose, first, a dynamic operation is implemented to enrich the exploration/exploitation patterns of the conventional procedure and mitigate the premature convergence of GA technique. Then, the modified GA (MGA strategy is used to resolve the FSPP. The attained results of the proposed strategy are compared to those of GA with regard to the cost, quality of paths and CPU times. Numerical instances are provided to demonstrate the success of the proposed MGA-FSPP strategy in comparison with GA. The simulations affirm that not only the proposed technique can outperform GA, but also the qualities of the paths are effectively improved. The results clarify that the competence of the proposed GA is preferred in view of quality quantities. The results also demonstrate that the proposed method can efficiently be utilized to handle FSPP in uncertain networks.

Novel Congestion-Free Alternate Routing Path Scheme using Stackelberg Game Theory Model in Wireless Networks

Directory of Open Access Journals (Sweden)

P. Chitra

2017-04-01

Full Text Available Recently, wireless network technologies were designed for most of the applications. Congestion raised in the wireless network degrades the performance and reduces the throughput. Congestion-free network is quit essen- tial in the transport layer to prevent performance degradation in a wireless network. Game theory is a branch of applied mathematics and applied sciences that used in wireless network, political science, biology, computer science, philosophy and economics. e great challenges of wireless network are their congestion by various factors. E ective congestion-free alternate path routing is pretty essential to increase network performance. Stackelberg game theory model is currently employed as an e ective tool to design and formulate conges- tion issues in wireless networks. is work uses a Stackelberg game to design alternate path model to avoid congestion. In this game, leaders and followers are selected to select an alternate routing path. e correlated equilibrium is used in Stackelberg game for making better decision between non-cooperation and cooperation. Congestion was continuously monitored to increase the throughput in the network. Simulation results show that the proposed scheme could extensively improve the network performance by reducing congestion with the help of Stackelberg game and thereby enhance throughput.

Modified multiblock partial least squares path modeling algorithm with backpropagation neural networks approach

Science.gov (United States)

Yuniarto, Budi; Kurniawan, Robert

2017-03-01

PLS Path Modeling (PLS-PM) is different from covariance based SEM, where PLS-PM use an approach based on variance or component, therefore, PLS-PM is also known as a component based SEM. Multiblock Partial Least Squares (MBPLS) is a method in PLS regression which can be used in PLS Path Modeling which known as Multiblock PLS Path Modeling (MBPLS-PM). This method uses an iterative procedure in its algorithm. This research aims to modify MBPLS-PM with Back Propagation Neural Network approach. The result is MBPLS-PM algorithm can be modified using the Back Propagation Neural Network approach to replace the iterative process in backward and forward step to get the matrix t and the matrix u in the algorithm. By modifying the MBPLS-PM algorithm using Back Propagation Neural Network approach, the model parameters obtained are relatively not significantly different compared to model parameters obtained by original MBPLS-PM algorithm.

Information spread of emergency events: path searching on social networks.

Science.gov (United States)

Dai, Weihui; Hu, Hongzhi; Wu, Tunan; Dai, Yonghui

2014-01-01

Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

Information Spread of Emergency Events: Path Searching on Social Networks

Directory of Open Access Journals (Sweden)

Weihui Dai

2014-01-01

Full Text Available Emergency has attracted global attentions of government and the public, and it will easily trigger a series of serious social problems if it is not supervised effectively in the dissemination process. In the Internet world, people communicate with each other and form various virtual communities based on social networks, which lead to a complex and fast information spread pattern of emergency events. This paper collects Internet data based on data acquisition and topic detection technology, analyzes the process of information spread on social networks, describes the diffusions and impacts of that information from the perspective of random graph, and finally seeks the key paths through an improved IBF algorithm. Application cases have shown that this algorithm can search the shortest spread paths efficiently, which may help us to guide and control the information dissemination of emergency events on early warning.

Enabling Advanced Path-Finding on Terrains and in Spatial Networks

DEFF Research Database (Denmark)

Kaul, Manohar

traffic updates. The solution assumes that the dynamic real-valued edge weights are bounded in a manner consistent with real-world data, which enables a theoretical guarantee on the travel time. Comprehensive experiments suggest that the proposed methods are accurate, efficient, robust, and scalable....... into the effectiveness and efficiency of the two approaches. Finally, we propose a scalable distributed system that maintains a large number of continuous fastest-path queries on a large spatial network, providing users with guaranteed approximate fastest paths to their destinations, while facing heavy real- time....... The first scans the 3D point-cloud in a single pass and constructs the 3D road network on the fly, while the second approach reads the 3D points as disk blocks in accordance to a locality-preserving space-filling curve. Results from empirical studies with real- world data offer insight...

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

Bai, Weigang; Wang, Haiyan; He, Ke; Zhao, Ruiqin

2018-04-23

The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS) and position random candidates selection (PRCS). PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

Full Text Available The packets carried along a pre-defined route in underwater sensor networks are very vulnerble. Node mobility or intermittent channel availability easily leads to unreachable routing. Opportunistic routing has been proven to be a promising paradigm to design routing protocols for underwater sensor networks. It takes advantage of the broadcast nature of the wireless medium to combat packet losses and selects potential paths on the fly. Finding an appropriate forwarding candidate set is a key issue in opportunistic routing. Many existing solutions ignore the impact of candidates location distribution on packet forwarding. In this paper, a path diversity improved candidate selection strategy is applied in opportunistic routing to improve packet forwarding efficiency. It not only maximizes the packet forwarding advancements but also takes the candidate’s location distribution into account. Based on this strategy, we propose two effective routing protocols: position improved candidates selection (PICS and position random candidates selection (PRCS. PICS employs two-hop neighbor information to make routing decisions. PRCS only uses one-hop neighbor information. Simulation results show that both PICS and PRCS can significantly improve network performance when compared with the previous solutions, in terms of packet delivery ratio, average energy consumption and end-to-end delay.

Eco-reliable path finding in time-variant and stochastic networks

International Nuclear Information System (INIS)

Li, Wenjie; Yang, Lixing; Wang, Li; Zhou, Xuesong; Liu, Ronghui; Gao, Ziyou

2017-01-01

This paper addresses a route guidance problem for finding the most eco-reliable path in time-variant and stochastic networks such that travelers can arrive at the destination with the maximum on-time probability while meeting vehicle emission standards imposed by government regulators. To characterize the dynamics and randomness of transportation networks, the link travel times and emissions are assumed to be time-variant random variables correlated over the entire network. A 0–1 integer mathematical programming model is formulated to minimize the probability of late arrival by simultaneously considering the least expected emission constraint. Using the Lagrangian relaxation approach, the primal model is relaxed into a dualized model which is further decomposed into two simple sub-problems. A sub-gradient method is developed to reduce gaps between upper and lower bounds. Three sets of numerical experiments are tested to demonstrate the efficiency and performance of our proposed model and algorithm. - Highlights: • The most eco-reliable path is defined in time-variant and stochastic networks. • The model is developed with on-time arrival probability and emission constraints. • The sub-gradient and label correcting algorithm are integrated to solve the model. • Numerical experiments demonstrate the effectiveness of developed approaches.

Graph Regularized Meta-path Based Transductive Regression in Heterogeneous Information Network.

Science.gov (United States)

Wan, Mengting; Ouyang, Yunbo; Kaplan, Lance; Han, Jiawei

2015-01-01

A number of real-world networks are heterogeneous information networks, which are composed of different types of nodes and links. Numerical prediction in heterogeneous information networks is a challenging but significant area because network based information for unlabeled objects is usually limited to make precise estimations. In this paper, we consider a graph regularized meta-path based transductive regression model ( Grempt ), which combines the principal philosophies of typical graph-based transductive classification methods and transductive regression models designed for homogeneous networks. The computation of our method is time and space efficient and the precision of our model can be verified by numerical experiments.

Path selection and bandwidth allocation in MPLS networks: a nonlinear programming approach

Science.gov (United States)

Burns, J. E.; Ott, Teunis J.; de Kock, Johan M.; Krzesinski, Anthony E.

2001-07-01

Multi-protocol Label Switching extends the IPv4 destination-based routing protocols to provide new and scalable routing capabilities in connectionless networks using relatively simple packet forwarding mechanisms. MPLS networks carry traffic on virtual connections called label switched paths. This paper considers path selection and bandwidth allocation in MPLS networks in order to optimize the network quality of service. The optimization is based upon the minimization of a non-linear objective function which under light load simplifies to OSPF routing with link metrics equal to the link propagation delays. The behavior under heavy load depends on the choice of certain parameters: It can essentially be made to minimize maximal expected utilization, or to maximize minimal expected weighted slacks (both over all links). Under certain circumstances it can be made to minimize the probability that a link has an instantaneous offered load larger than its transmission capacity. We present a model of an MPLS network and an algorithm to find and capacitate optimal LSPs. The algorithm is an improvement of the well-known flow deviation non-linear programming method. The algorithm is applied to compute optimal LSPs for several test networks carrying a single traffic class.

Identifying influential spreaders in complex networks through local effective spreading paths

Science.gov (United States)

Wang, Xiaojie; Zhang, Xue; Yi, Dongyun; Zhao, Chengli

2017-05-01

How to effectively identify a set of influential spreaders in complex networks is of great theoretical and practical value, which can help to inhibit the rapid spread of epidemics, promote the sales of products by word-of-mouth advertising, and so on. A naive strategy is to select the top ranked nodes as identified by some centrality indices, and other strategies are mainly based on greedy methods and heuristic methods. However, most of those approaches did not concern the connections between nodes. Usually, the distances between the selected spreaders are very close, leading to a serious overlapping of their influence. As a consequence, the global influence of the spreaders in networks will be greatly reduced, which largely restricts the performance of those methods. In this paper, a simple and efficient method is proposed to identify a set of discrete yet influential spreaders. By analyzing the spreading paths in the network, we present the concept of effective spreading paths and measure the influence of nodes via expectation calculation. The numerical analysis in undirected and directed networks all show that our proposed method outperforms many other centrality-based and heuristic benchmarks, especially in large-scale networks. Besides, experimental results on different spreading models and parameters demonstrates the stability and wide applicability of our method.

Risk assessment of K basin twelve-inch drain valve failure from a postulated seismic initiating event

International Nuclear Information System (INIS)

MORGAN, R.G.

1999-01-01

The Spent Nuclear Fuel (SNF) Project will transfer metallic SNF from the Hanford 105 K-East and 105 K-West Basins to safe interim storage in the Canister Storage Building in the 200 Area. The initial basis for design, fabrication, installation, and operation of the fuel removal systems was that the basin leak rates which could result from a postulated accident condition would not be excessive relative to reasonable recovery operations. However, an additional potential K Basin water leak path is through the K Basin drain valves. Three twelve-inch drain valves are located in the main basin bays along the north wall. The sumps containing the valves are filled with concrete which covers the drain valve body. Visual observations suggest that only the valve's bonnet and stem are exposed above the basin concrete floor. It was recognized, however, that damage of the drain valve bonnet or stem during a seismic initiating event could provide a potential K Basin water leak path. The objectives of this activity are to: (1) evaluate the risk of damaging the three twelve-inch drain valves located along the north wall of the main basin from a seismic initiating event, and (2) determine the associated potential leak rate from a damaged valve

Risk assessment of K basin twelve-inch drain valve failure from a postulated seismic initiating event

Energy Technology Data Exchange (ETDEWEB)

MORGAN, R.G.

1999-04-06

The Spent Nuclear Fuel (SNF) Project will transfer metallic SNF from the Hanford 105 K-East and 105 K-West Basins to safe interim storage in the Canister Storage Building in the 200 Area. The initial basis for design, fabrication, installation, and operation of the fuel removal systems was that the basin leak rates which could result from a postulated accident condition would not be excessive relative to reasonable recovery operations. However, an additional potential K Basin water leak path is through the K Basin drain valves. Three twelve-inch drain valves are located in the main basin bays along the north wall. The sumps containing the valves are filled with concrete which covers the drain valve body. Visual observations suggest that only the valve's bonnet and stem are exposed above the basin concrete floor. It was recognized, however, that damage of the drain valve bonnet or stem during a seismic initiating event could provide a potential K Basin water leak path. The objectives of this activity are to: (1) evaluate the risk of damaging the three twelve-inch drain valves located along the north wall of the main basin from a seismic initiating event, and (2) determine the associated potential leak rate from a damaged valve.

Benefit of adaptive FEC in shared backup path protected elastic optical network.

Science.gov (United States)

Guo, Hong; Dai, Hua; Wang, Chao; Li, Yongcheng; Bose, Sanjay K; Shen, Gangxiang

2015-07-27

We apply an adaptive forward error correction (FEC) allocation strategy to an Elastic Optical Network (EON) operated with shared backup path protection (SBPP). To maximize the protected network capacity that can be carried, an Integer Linear Programing (ILP) model and a spectrum window plane (SWP)-based heuristic algorithm are developed. Simulation results show that the FEC coding overhead required by the adaptive FEC scheme is significantly lower than that needed by a fixed FEC allocation strategy resulting in higher network capacity for the adaptive strategy. The adaptive FEC allocation strategy can also significantly outperform the fixed FEC allocation strategy both in terms of the spare capacity redundancy and the average FEC coding overhead needed per optical channel. The proposed heuristic algorithm is efficient and not only performs closer to the ILP model but also does much better than the shortest-path algorithm.

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

Advanced path sampling of the kinetic network of small proteins

NARCIS (Netherlands)

Du, W.

2014-01-01

This thesis is focused on developing advanced path sampling simulation methods to study protein folding and unfolding, and to build kinetic equilibrium networks describing these processes. In Chapter 1 the basic knowledge of protein structure and folding theories were introduced and a brief overview

Virtual Fiber Networking and Impact of Optical Path Grooming on Creating Efficient Layer One Services

Science.gov (United States)

Naruse, Fumisato; Yamada, Yoshiyuki; Hasegawa, Hiroshi; Sato, Ken-Ichi

This paper presents a novel “virtual fiber” network service that exploits wavebands. This service provides virtual direct tunnels that directly convey wavelength paths to connect customer facilities. To improve the resource utilization efficiency of the service, a network design algorithm is developed that can allow intermediate path grooming at limited nodes and can determine the best node location. Numerical experiments demonstrate the effectiveness of the proposed service architecture.

How partnership behaviour evolves in networks : path dependency, social figuration and life events

NARCIS (Netherlands)

Romme, A.G.L.; Akkermans, H.A.

2008-01-01

Networks have become the dominant life form in many organizational settings. Most studies of relationships in networks focus on the dyadic interaction between two agents. However, work on enactment, sensemaking, path dependency, and social figuration processes (e.g. by Weick and Elias) suggests

Drained Triaxial Tests on Eastern Scheldt Sand

DEFF Research Database (Denmark)

Praastrup, U.; Jakobsen, Kim Parsberg

In the process of understanding and developing models for geomaterials, the stress-strain behaviour is commonly studied by performing triaxial tests. In the present study static triaxial tests have been performed to gain knowledge of the stress-strain behaviour of frictional materials during...... monotonic loading. The tests reported herein are all drained tests, starting from different initial states of stress and following various stress paths. AIl the tests are performed on reconstituted medium dense specimens of Eastern Scheldt Sand....

The European Politics of Brain Drain

DEFF Research Database (Denmark)

Hasselbalch, Jacob

This qualitative multi-method studymaps the politics of brain drain at the level of the European Union and follows the evolution of the issue over the last four parliamentary periods. By utilizing a novel combination of interviews with a content and network analysis of parliamentary questions...

A minimum resource neural network framework for solving multiconstraint shortest path problems.

Science.gov (United States)

Zhang, Junying; Zhao, Xiaoxue; He, Xiaotao

2014-08-01

Characterized by using minimum hard (structural) and soft (computational) resources, a novel parameter-free minimal resource neural network (MRNN) framework is proposed for solving a wide range of single-source shortest path (SP) problems for various graph types. The problems are the k-shortest time path problems with any combination of three constraints: time, hop, and label constraints, and the graphs can be directed, undirected, or bidirected with symmetric and/or asymmetric traversal time, which can be real and time dependent. Isomorphic to the graph where the SP is to be sought, the network is activated by generating autowave at source neuron and the autowave travels automatically along the paths with the speed of a hop in an iteration. Properties of the network are studied, algorithms are presented, and computation complexity is analyzed. The framework guarantees globally optimal solutions of a series of problems during the iteration process of the network, which provides insight into why even the SP is still too long to be satisfied. The network facilitates very large scale integrated circuit implementation and adapt to very large scale problems due to its massively parallel processing and minimum resource utilization. When implemented in a sequentially processing computer, experiments on synthetic graphs, road maps of cities of the USA, and vehicle routing with time windows indicate that the MRNN is especially efficient for large scale sparse graphs and even dense graphs with some constraints, e.g., the CPU time taken and the iteration number used for the road maps of cities of the USA is even less than  ∼ 2% and 0.5% that of the Dijkstra's algorithm.

Shortest path problem on a grid network with unordered intermediate points

Science.gov (United States)

Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

2017-10-01

We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

Drains and Drainage Capabilities: Quantitative Analysis of Drain Efficiencies

Directory of Open Access Journals (Sweden)

Andaç Aykan

2016-03-01

Full Text Available Objective: In this study, it was aimed to compare the efficiency of the same type of but different-sized silicone drains at different surgical procedures. Material and Methods: Twenty-four patients, who had different diagnoses and were operated between 2011 and 2013, were included. In all patients, 7- and 10-mm silicone-ended, Jackson–Pratt drains were used. Drains that were under 30 cc/day removed. The connection tube and perforated silicone end were examined due to the clot content. All drain efficiencies were calculated, and the results were statistically analyzed. Results: Seven of the 24 patients (29.2% were males and 17 (70.8% were females; the mean age was 39.0±11.4 years. Totally, 49 drains were used, of which 25 (51% were 7 mm and 24 (49% were 10 mm in size. Median removal time was the 5th day (2–12 for the 7-mm drains and the 6th day (3–14 for the 10-mm drains. There was no statistically significant difference between the groups for drain removal time (p=0.268. Further, there was no difference at the connection tube and silicone end for clot content between the 7- and 10-mm drains (p=0.58. For the drainage volume and efficiency, no difference was observed between the groups (p=0.146. Conclusion: In this study it was observed that there is no difference in the drainage volume and efficiency between different-sized Jackson–Pratt drains.

Path dependence and the geography of infrastructure networks: the case of the European fibre-optic network

NARCIS (Netherlands)

Vinciguerra, S.; Frenken, K.

2015-01-01

We analyse the path dependent dynamics in the formation of new infrastructure using an augmented gravity model. We observe that the formation of the pan-European telecommunication backbone has been dependent on pre-existent European transportation networks, particularly, the maritime and railway

On the theoretical–numerical study of the ITER Upper Port Plug structure hydraulic behaviour under steady state and draining and drying transient conditions

International Nuclear Information System (INIS)

Di Maio, P.A.; Paradiso, D.; Dell’Orco, G.; Pitcher, C.S.; Kalish, M.

2011-01-01

Highlights: ► UPP TS hydraulic behaviour has been investigated under steady state and D and D transient conditions. ► A thermal–hydraulic system code has been adopted and a UPP TS model has been set-up and validated against results of steady state CFD analyses. ► The TS steady state hydraulic characteristic functions have been derived for two coolant flow paths showing that right plate inlet one is the most promising. ► Draining simulations indicate that the 4 MPa injection pressure is high enough to drain almost completely the circuit in a reasonable time (∼6 s). ► Results indicate that right plate inlet flow path allows the TS complete draining, eliminating the need for the drying procedure. - Abstract: The ITER diagnostic Upper Port Plug (UPP) is a water-cooled stainless steel structure aimed to integrate within vacuum vessel the plasma diagnostic systems, shielding them from neutron and photon irradiation. Due to the very intense heat loads expected, a proper cooling circuit has been designed to ensure an adequate UPP cooling with an acceptable thermal rise and an unduly high pumping power and to perform its draining and drying procedure by injection of pressurized nitrogen. A theoretical research activity has been launched at the Department of Nuclear Engineering of the University of Palermo aiming to investigate the hydraulic behaviour of the UPP Trapezoid Section cooling circuit under steady state conditions and during its draining and drying transient procedure. The research activity has been performed following a theoretical–computational approach and adopting the RELAP5 thermal–hydraulic system code. The Trapezoid Section cooling circuit characteristic functions have been derived under steady state conditions at various coolant temperatures for both the coolant flow paths at the present under consideration for this circuit. The distributions of coolant mass flow rates along the channels of the cooling circuit have been calculated too

Path searching in switching networks using cellular algorithm

Energy Technology Data Exchange (ETDEWEB)

Koczy, L T; Langer, J; Legendi, T

1981-01-01

After a survey of the important statements in the paper A Mathematical Model of Path Searching in General Type Switching Networks (see IBID., vol.25, no.1, p.31-43, 1981) the authors consider the possible implementation for cellular automata of the algorithm introduced there. The cellular field used consists of 5 neighbour 8 state cells. Running times required by a traditional serial processor and by the cellular field, respectively, are compared. By parallel processing this running time can be reduced. 5 references.

Demonstration of Single-Mode Multicore Fiber Transport Network with Crosstalk-Aware In-Service Optical Path Control

DEFF Research Database (Denmark)

Tanaka, Takafumi; Pulverer, Klaus; Häbel, Ulrich

2017-01-01

transport network testbed and demonstrate an XT-aware traffic engineering scenario. With the help of a software-defined network (SDN) controller, the modulation format and optical path route are adaptively changed based on the monitored XT values by using programmable devices such as a real-time transponder......-capacity transmission, because inter-core crosstalk (XT) could be the main limiting factor for MCF transmission. In a real MCF network, the inter-core XT in a particular core is likely to change continuously as the optical paths in the adjacent cores are dynamically assigned to match the dynamic nature of the data...

Accurate path integration in continuous attractor network models of grid cells.

Science.gov (United States)

Burak, Yoram; Fiete, Ila R

2009-02-01

Grid cells in the rat entorhinal cortex display strikingly regular firing responses to the animal's position in 2-D space and have been hypothesized to form the neural substrate for dead-reckoning. However, errors accumulate rapidly when velocity inputs are integrated in existing models of grid cell activity. To produce grid-cell-like responses, these models would require frequent resets triggered by external sensory cues. Such inadequacies, shared by various models, cast doubt on the dead-reckoning potential of the grid cell system. Here we focus on the question of accurate path integration, specifically in continuous attractor models of grid cell activity. We show, in contrast to previous models, that continuous attractor models can generate regular triangular grid responses, based on inputs that encode only the rat's velocity and heading direction. We consider the role of the network boundary in the integration performance of the network and show that both periodic and aperiodic networks are capable of accurate path integration, despite important differences in their attractor manifolds. We quantify the rate at which errors in the velocity integration accumulate as a function of network size and intrinsic noise within the network. With a plausible range of parameters and the inclusion of spike variability, our model networks can accurately integrate velocity inputs over a maximum of approximately 10-100 meters and approximately 1-10 minutes. These findings form a proof-of-concept that continuous attractor dynamics may underlie velocity integration in the dorsolateral medial entorhinal cortex. The simulations also generate pertinent upper bounds on the accuracy of integration that may be achieved by continuous attractor dynamics in the grid cell network. We suggest experiments to test the continuous attractor model and differentiate it from models in which single cells establish their responses independently of each other.

Estimation of network path segment delays

Science.gov (United States)

Nichols, Kathleen Marie

2018-05-01

A method for estimation of a network path segment delay includes determining a scaled time stamp for each packet of a plurality of packets by scaling a time stamp for each respective packet to minimize a difference of at least one of a frequency and a frequency drift between a transport protocol clock of a host and a monitoring point. The time stamp for each packet is provided by the transport protocol clock of the host. A corrected time stamp for each packet is determined by removing from the scaled time stamp for each respective packet, a temporal offset between the transport protocol clock and the monitoring clock by minimizing a temporal delay variation of the plurality of packets traversing a segment between the host and the monitoring point.

An efficient hybrid protection scheme with shared/dedicated backup paths on elastic optical networks

Directory of Open Access Journals (Sweden)

Nogbou G. Anoh

2017-02-01

Full Text Available Fast recovery and minimum utilization of resources are the two main criteria for determining the protection scheme quality. We address the problem of providing a hybrid protection approach on elastic optical networks under contiguity and continuity of available spectrum constraints. Two main hypotheses are used in this paper for backup paths computation. In the first case, it is assumed that backup paths resources are dedicated. In the second case, the assumption is that backup paths resources are available shared resources. The objective of the study is to minimize spectrum utilization to reduce blocking probability on a network. For this purpose, an efficient survivable Hybrid Protection Lightpath (HybPL algorithm is proposed for providing shared or dedicated backup path protection based on the efficient energy calculation and resource availability. Traditional First-Fit and Best-Fit schemes are employed to search and assign the available spectrum resources. The simulation results show that HybPL presents better performance in terms of blocking probability, compared with the Minimum Resources Utilization Dedicated Protection (MRU-DP algorithm which offers better performance than the Dedicated Protection (DP algorithm.

Predicting artificailly drained areas by means of selective model ensemble

DEFF Research Database (Denmark)

Møller, Anders Bjørn; Beucher, Amélie; Iversen, Bo Vangsø

. The approaches employed include decision trees, discriminant analysis, regression models, neural networks and support vector machines amongst others. Several models are trained with each method, using variously the original soil covariates and principal components of the covariates. With a large ensemble...... out since the mid-19th century, and it has been estimated that half of the cultivated area is artificially drained (Olesen, 2009). A number of machine learning approaches can be used to predict artificially drained areas in geographic space. However, instead of choosing the most accurate model....... The study aims firstly to train a large number of models to predict the extent of artificially drained areas using various machine learning approaches. Secondly, the study will develop a method for selecting the models, which give a good prediction of artificially drained areas, when used in conjunction...

A Path Based Model for a Green Liner Shipping Network Design

DEFF Research Database (Denmark)

Brouer, Berit Dangaard; Jepsen, Mads Kehlet; Plum, Christian Edinger Munk

Liner shipping networks are the backbone of international trade providing low transportation cost, which is a major driver of globalization. These networks are under constant pressure to deliver capacity, cost eectiveness and environmentally conscious transport solutions. This article proposes...... a new path based MIP model for the Liner shipping Network Design Problem minimizing the cost of vessels and their fuel consumption facilitating a green network. The proposed model reduces problem size using a novel aggregation of demands. A decomposition method enabling delayed column generation...... is presented. The subproblems have similar structure to Vehicle Routing Problems, which can be solved using dynamic programming. An algorithm has been implemented for this model, unfortunately with discouraging results due to the structure of the subproblem and the lack of proper dominance criteria...

Calibration of neural networks using genetic algorithms, with application to optimal path planning

Science.gov (United States)

Smith, Terence R.; Pitney, Gilbert A.; Greenwood, Daniel

1987-01-01

Genetic algorithms (GA) are used to search the synaptic weight space of artificial neural systems (ANS) for weight vectors that optimize some network performance function. GAs do not suffer from some of the architectural constraints involved with other techniques and it is straightforward to incorporate terms into the performance function concerning the metastructure of the ANS. Hence GAs offer a remarkably general approach to calibrating ANS. GAs are applied to the problem of calibrating an ANS that finds optimal paths over a given surface. This problem involves training an ANS on a relatively small set of paths and then examining whether the calibrated ANS is able to find good paths between arbitrary start and end points on the surface.

A hybrid path-oriented code assignment CDMA-based MAC protocol for underwater acoustic sensor networks.

Science.gov (United States)

Chen, Huifang; Fan, Guangyu; Xie, Lei; Cui, Jun-Hong

2013-11-04

Due to the characteristics of underwater acoustic channel, media access control (MAC) protocols designed for underwater acoustic sensor networks (UWASNs) are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA) CDMA MAC (POCA-CDMA-MAC), is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA) or receiver-oriented code assignment (ROCA). Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

A Hybrid Path-Oriented Code Assignment CDMA-Based MAC Protocol for Underwater Acoustic Sensor Networks

Directory of Open Access Journals (Sweden)

Huifang Chen

2013-11-01

Full Text Available Due to the characteristics of underwater acoustic channel, media access control (MAC protocols designed for underwater acoustic sensor networks (UWASNs are quite different from those for terrestrial wireless sensor networks. Moreover, in a sink-oriented network with event information generation in a sensor field and message forwarding to the sink hop-by-hop, the sensors near the sink have to transmit more packets than those far from the sink, and then a funneling effect occurs, which leads to packet congestion, collisions and losses, especially in UWASNs with long propagation delays. An improved CDMA-based MAC protocol, named path-oriented code assignment (POCA CDMA MAC (POCA-CDMA-MAC, is proposed for UWASNs in this paper. In the proposed MAC protocol, both the round-robin method and CDMA technology are adopted to make the sink receive packets from multiple paths simultaneously. Since the number of paths for information gathering is much less than that of nodes, the length of the spreading code used in the POCA-CDMA-MAC protocol is shorter greatly than that used in the CDMA-based protocols with transmitter-oriented code assignment (TOCA or receiver-oriented code assignment (ROCA. Simulation results show that the proposed POCA-CDMA-MAC protocol achieves a higher network throughput and a lower end-to-end delay compared to other CDMA-based MAC protocols.

Modelling cointegration and Granger causality network to detect long-term equilibrium and diffusion paths in the financial system.

Science.gov (United States)

Gao, Xiangyun; Huang, Shupei; Sun, Xiaoqi; Hao, Xiaoqing; An, Feng

2018-03-01

Microscopic factors are the basis of macroscopic phenomena. We proposed a network analysis paradigm to study the macroscopic financial system from a microstructure perspective. We built the cointegration network model and the Granger causality network model based on econometrics and complex network theory and chose stock price time series of the real estate industry and its upstream and downstream industries as empirical sample data. Then, we analysed the cointegration network for understanding the steady long-term equilibrium relationships and analysed the Granger causality network for identifying the diffusion paths of the potential risks in the system. The results showed that the influence from a few key stocks can spread conveniently in the system. The cointegration network and Granger causality network are helpful to detect the diffusion path between the industries. We can also identify and intervene in the transmission medium to curb risk diffusion.

A mathematical model to optimize the drain phase in gravity-based peritoneal dialysis systems.

Science.gov (United States)

Akonur, Alp; Lo, Ying-Cheng; Cizman, Borut

2010-01-01

Use of patient-specific drain-phase parameters has previously been suggested to improve peritoneal dialysis (PD) adequacy. Improving management of the drain period may also help to minimize intraperitoneal volume (IPV). A typical gravity-based drain profile consists of a relatively constant initial fast-flow period, followed by a transition period and a decaying slow-flow period. That profile was modeled using the equation VD(t) = (V(D0) - Q(MAX) x t) xphi + (V(D0) x e(-alphat)) x (1 - phi), where V(D)(t) is the time-dependent dialysate volume; V(D0), the dialysate volume at the start of the drain; Q(MAX), the maximum drain flow rate; alpha, the exponential drain constant; and phi, the unit step function with respect to the flow transition. We simulated the effects of the assumed patient-specific maximum drain flow (Q(MAX)) and transition volume (psi), and the peritoneal volume percentage when transition occurs,for fixed device-specific drain parameters. Average patient transport parameters were assumed during 5-exchange therapy with 10 L of PD solution. Changes in therapy performance strongly depended on the drain parameters. Comparing 400 mL/85% with 200 mL/65% (Q(MAX/psi), drain time (7.5 min vs. 13.5 min) and IPV (2769 mL vs. 2355 mL) increased when the initial drain flow was low and the transition quick. Ultrafiltration and solute clearances remained relatively similar. Such differences were augmented up to a drain time of 22 minutes and an IPV of more than 3 L when Q(MAX) was 100 mL/min. The ability to model individual drain conditions together with water and solute transport may help to prevent patient discomfort with gravity-based PD. However, it is essential to note that practical difficulties such as displaced catheters and obstructed flow paths cause variability in drain characteristics even for the same patient, limiting the clinical applicability of this model.

Degree distribution of shortest path trees and bias of network sampling algorithms

NARCIS (Netherlands)

Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

2013-01-01

In this article, we explicitly derive the limiting distribution of the degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the power-law exponent of the degree distribution of this tree and compare it to the degree

Degree distribution of shortest path trees and bias of network sampling algorithms

NARCIS (Netherlands)

Bhamidi, S.; Goodman, J.A.; Hofstad, van der R.W.; Komjáthy, J.

2015-01-01

In this article, we explicitly derive the limiting degree distribution of the shortest path tree from a single source on various random network models with edge weights. We determine the asymptotics of the degree distribution for large degrees of this tree and compare it to the degree distribution

Zero-Slack, Noncritical Paths

Science.gov (United States)

Simons, Jacob V., Jr.

2017-01-01

The critical path method/program evaluation and review technique method of project scheduling is based on the importance of managing a project's critical path(s). Although a critical path is the longest path through a network, its location in large projects is facilitated by the computation of activity slack. However, logical fallacies in…

Task Allocation and Path Planning for Collaborative Autonomous Underwater Vehicles Operating through an Underwater Acoustic Network

Directory of Open Access Journals (Sweden)

Yueyue Deng

2013-01-01

Full Text Available Dynamic and unstructured multiple cooperative autonomous underwater vehicle (AUV missions are highly complex operations, and task allocation and path planning are made significantly more challenging under realistic underwater acoustic communication constraints. This paper presents a solution for the task allocation and path planning for multiple AUVs under marginal acoustic communication conditions: a location-aided task allocation framework (LAAF algorithm for multitarget task assignment and the grid-based multiobjective optimal programming (GMOOP mathematical model for finding an optimal vehicle command decision given a set of objectives and constraints. Both the LAAF and GMOOP algorithms are well suited in poor acoustic network condition and dynamic environment. Our research is based on an existing mobile ad hoc network underwater acoustic simulator and blind flooding routing protocol. Simulation results demonstrate that the location-aided auction strategy performs significantly better than the well-accepted auction algorithm developed by Bertsekas in terms of task-allocation time and network bandwidth consumption. We also demonstrate that the GMOOP path-planning technique provides an efficient method for executing multiobjective tasks by cooperative agents with limited communication capabilities. This is in contrast to existing multiobjective action selection methods that are limited to networks where constant, reliable communication is assumed to be available.

Optimization of the Critical Diameter and Average Path Length of Social Networks

Directory of Open Access Journals (Sweden)

Haifeng Du

2017-01-01

Full Text Available Optimizing average path length (APL by adding shortcut edges has been widely discussed in connection with social networks, but the relationship between network diameter and APL is generally ignored in the dynamic optimization of APL. In this paper, we analyze this relationship and transform the problem of optimizing APL into the problem of decreasing diameter to 2. We propose a mathematic model based on a memetic algorithm. Experimental results show that our algorithm can efficiently solve this problem as well as optimize APL.

Stability of Intelligent Transportation Network Dynamics: A Daily Path Flow Adjustment considering Travel Time Differentiation

Directory of Open Access Journals (Sweden)

Ming-Chorng Hwang

2015-01-01

Full Text Available A theoretic formulation on how traffic time information distributed by ITS operations influences the trajectory of network flows is presented in this paper. The interactions between users and ITS operator are decomposed into three parts: (i travel time induced path flow dynamics (PFDTT; (ii demand induced path flow dynamics (PFDD; and (iii predicted travel time dynamics for an origin-destination (OD pair (PTTDOD. PFDTT describes the collective results of user’s daily route selection by pairwise comparison of path travel time provided by ITS services. The other two components, PTTDOD and PFDD, are concentrated on the evolutions of system variables which are predicted and observed, respectively, by ITS operators to act as a benchmark in guiding the target system towards an expected status faster. In addition to the delivered modelings, the stability theorem of the equilibrium solution in the sense of Lyapunov stability is also provided. A Lyapunov function is developed and employed to the proof of stability theorem to show the asymptotic behavior of the aimed system. The information of network flow dynamics plays a key role in traffic control policy-making. The evaluation of ITS-based strategies will not be reasonable without a well-established modeling of network flow evolutions.

Energy-aware path selection metric for IEEE 802.11s wireless mesh networking

CSIR Research Space (South Africa)

Mhlanga, MM

2009-01-01

Full Text Available The IEEE 802.11s working group has commenced activities, which would lead to the development of a standard for wireless mesh networks (WMNs). The draft of 802.11s introduces a new path selection metric called airtime link metric. However...

Energy-aware path selection metric for IEEE 802.11s wireless mesh networking

CSIR Research Space (South Africa)

Mhlanga, MM

2009-08-01

Full Text Available The IEEE 802.11s working group has commenced activities, which would lead to the development of a standard for wireless mesh networks (WMNs). The draft of 802.11s introduces a new path selection metric called airtime link metric. However...

Containment vessel drain system

Science.gov (United States)

Harris, Scott G.

2018-01-30

A system for draining a containment vessel may include a drain inlet located in a lower portion of the containment vessel. The containment vessel may be at least partially filled with a liquid, and the drain inlet may be located below a surface of the liquid. The system may further comprise an inlet located in an upper portion of the containment vessel. The inlet may be configured to insert pressurized gas into the containment vessel to form a pressurized region above the surface of the liquid, and the pressurized region may operate to apply a surface pressure that forces the liquid into the drain inlet. Additionally, a fluid separation device may be operatively connected to the drain inlet. The fluid separation device may be configured to separate the liquid from the pressurized gas that enters the drain inlet after the surface of the liquid falls below the drain inlet.

A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

Science.gov (United States)

Mao, Yuxin; Wei, Guiyi

2010-01-01

The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose. PMID:22163424

A feedback-based secure path approach for wireless sensor network data collection.

Science.gov (United States)

Mao, Yuxin; Wei, Guiyi

2010-01-01

The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

A Feedback-Based Secure Path Approach for Wireless Sensor Network Data Collection

Directory of Open Access Journals (Sweden)

Guiyi Wei

2010-10-01

Full Text Available The unattended nature of wireless sensor networks makes them very vulnerable to malicious attacks. Therefore, how to preserve secure data collection is an important issue to wireless sensor networks. In this paper, we propose a novel approach of secure data collection for wireless sensor networks. We explore secret sharing and multipath routing to achieve secure data collection in wireless sensor network with compromised nodes. We present a novel tracing-feedback mechanism, which makes full use of the routing functionality of wireless sensor networks, to improve the quality of data collection. The major advantage of the approach is that the secure paths are constructed as a by-product of data collection. The process of secure routing causes little overhead to the sensor nodes in the network. Compared with existing works, the algorithms of the proposed approach are easy to implement and execute in resource-constrained wireless sensor networks. According to the result of a simulation experiment, the performance of the approach is better than the recent approaches with a similar purpose.

A Path-Based Gradient Projection Algorithm for the Cost-Based System Optimum Problem in Networks with Continuously Distributed Value of Time

Directory of Open Access Journals (Sweden)

Wen-Xiang Wu

2014-01-01

Full Text Available The cost-based system optimum problem in networks with continuously distributed value of time is formulated as a path-based form, which cannot be solved by the Frank-Wolfe algorithm. In light of magnitude improvement in the availability of computer memory in recent years, path-based algorithms have been regarded as a viable approach for traffic assignment problems with reasonably large network sizes. We develop a path-based gradient projection algorithm for solving the cost-based system optimum model, based on Goldstein-Levitin-Polyak method which has been successfully applied to solve standard user equilibrium and system optimum problems. The Sioux Falls network tested is used to verify the effectiveness of the algorithm.

Impact of Beamforming on the Path Connectivity in Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Le The Dung

2017-03-01

Full Text Available This paper investigates the impact of using directional antennas and beamforming schemes on the connectivity of cognitive radio ad hoc networks (CRAHNs. Specifically, considering that secondary users use two kinds of directional antennas, i.e., uniform linear array (ULA and uniform circular array (UCA antennas, and two different beamforming schemes, i.e., randomized beamforming and center-directed to communicate with each other, we study the connectivity of all combination pairs of directional antennas and beamforming schemes and compare their performances to those of omnidirectional antennas. The results obtained in this paper show that, compared with omnidirectional transmission, beamforming transmission only benefits the connectivity when the density of secondary user is moderate. Moreover, the combination of UCA and randomized beamforming scheme gives the highest path connectivity in all evaluating scenarios. Finally, the number of antenna elements and degree of path loss greatly affect path connectivity in CRAHNs.

A novel communication mechanism based on node potential multi-path routing

Science.gov (United States)

Bu, Youjun; Zhang, Chuanhao; Jiang, YiMing; Zhang, Zhen

2016-10-01

With the network scales rapidly and new network applications emerge frequently, bandwidth supply for today's Internet could not catch up with the rapid increasing requirements. Unfortunately, irrational using of network sources makes things worse. Actual network deploys single-next-hop optimization paths for data transmission, but such "best effort" model leads to the imbalance use of network resources and usually leads to local congestion. On the other hand Multi-path routing can use the aggregation bandwidth of multi paths efficiently and improve the robustness of network, security, load balancing and quality of service. As a result, multi-path has attracted much attention in the routing and switching research fields and many important ideas and solutions have been proposed. This paper focuses on implementing the parallel transmission of multi next-hop data, balancing the network traffic and reducing the congestion. It aimed at exploring the key technologies of the multi-path communication network, which could provide a feasible academic support for subsequent applications of multi-path communication networking. It proposed a novel multi-path algorithm based on node potential in the network. And the algorithm can fully use of the network link resource and effectively balance network link resource utilization.

DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System

Directory of Open Access Journals (Sweden)

Mihui Kim

2010-04-01

Full Text Available To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector, and a conventional JAM (Jammed Area Mapping service with one reroute.

DMP: detouring using multiple paths against jamming attack for ubiquitous networking system.

Science.gov (United States)

Kim, Mihui; Chae, Kijoon

2010-01-01

To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we present a method of jamming attack tolerant routing using multiple paths based on zones. The proposed scheme divides the network into zones, and manages the candidate forward nodes of neighbor zones. After detecting an attack, detour nodes decide zones for rerouting, and detour packets destined for victim nodes through forward nodes in the decided zones. Simulation results show that our scheme increases the PDR (Packet Delivery Ratio) and decreases the delay significantly in comparison with rerouting by a general routing protocol on sensor networks, AODV (Ad hoc On Demand Distance Vector), and a conventional JAM (Jammed Area Mapping) service with one reroute.

A multilevel path analysis of contact frequency between social network members

Science.gov (United States)

van den Berg, Pauline; Arentze, Theo; Timmermans, Harry

2012-04-01

Recently, there has been an increasing interest in the role of social networks in spatial-choice and travel behavior. It has been acknowledged that social activities and the travel for these activities can emerge from individuals' social networks and that social activities are responsible for an important portion of travel demand. The influence of information and communication technologies (ICT's) is also important in this respect. The purpose of the paper is to examine the effects of characteristics of egos and ego-alter relationships on the frequency of social interaction by different communication modes, using multilevel path analysis. The analyses are based on social network data collected in 2008 in the Eindhoven region in the Netherlands among 116 respondents. The results indicate a complementary relationship between contact frequencies by different modes. The contact frequencies of the different modes, especially face-to-face and telephone, can also be largely explained by the ego's personal characteristics and the type of relationship and the distance between ego and alter.

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead. PMID:26426701

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN) presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD) technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow) into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

A note on "Multicriteria adaptive paths in stochastic, time-varying networks"

DEFF Research Database (Denmark)

Pretolani, Daniele; Nielsen, Lars Relund; Andersen, Kim Allan

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property...... that does not hold in general. Opasanon and Miller-Hooks also propose an algorithm for solving a parametric problem. We give a simplified algorithm which is linear in the input size....

Structural equation models from paths to networks

CERN Document Server

Westland, J Christopher

2015-01-01

This compact reference surveys the full range of available structural equation modeling (SEM) methodologies.  It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable.  This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method.  This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future.  SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists.  Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data.  Tables of software, methodologies and fit st...

UMDR: Multi-Path Routing Protocol for Underwater Ad Hoc Networks with Directional Antenna

Science.gov (United States)

Yang, Jianmin; Liu, Songzuo; Liu, Qipei; Qiao, Gang

2018-01-01

This paper presents a new routing scheme for underwater ad hoc networks based on directional antennas. Ad hoc networks with directional antennas have become a hot research topic because of space reuse may increase networks capacity. At present, researchers have applied traditional self-organizing routing protocols (such as DSR, AODV) [1] [2] on this type of networks, and the routing scheme is based on the shortest path metric. However, such routing schemes often suffer from long transmission delays and frequent link fragmentation along the intermediate nodes of the selected route. This is caused by a unique feature of directional transmission, often called as “deafness”. In this paper, we take a different approach to explore the advantages of space reuse through multipath routing. This paper introduces the validity of the conventional routing scheme in underwater ad hoc networks with directional antennas, and presents a special design of multipath routing algorithm for directional transmission. The experimental results show a significant performance improvement in throughput and latency.

Motif Penggunaan dan Kepuasan Menggunakan Path (Studi Korelasional Tentang Pengaruh Motif Penggunaan dan Kepuasan Menggunakan Jejaring sosial Path di Kalangan Masyarakat Pasar VI Kelurahan Padang Bulan Medan)

OpenAIRE

Dipta, Anna Mira

2015-01-01

This study entitled Effect of using and gratification of using social networking Path among the people in Padang Bulan Medan (CorrelationalEffect of using and gratification of using social networking Path among the people in Padang Bulan Medan). Path is a social network similar to its predecessor facebook. Path exclusive can only be used with smartphones based on IOS and android operating system. Path is a private social networking service application designed to bring users closer to family....

Should I stay or should I go? An institutional approach to brain drain

OpenAIRE

Cassar, Lea; Frey, Bruno S

2010-01-01

This paper suggests that institutional factors which reward social net- works at the expenses of productivity can play an important role in ex- plaining brain drain. The e€ects of social networks on brain drain are analyzed in a decision theory framework with asymmetric information. We distinguish between the role of insidership and personal connections. The larger the cost of being an outsider, the smaller is the number and the average ability of researchers working in the domestic job mar...

MEDICAL BRAIN DRAIN - A THEORETICAL APPROACH

Directory of Open Access Journals (Sweden)

Boncea Irina

2013-07-01

Full Text Available Medical brain drain is defined as the migration of health personnel from developing countries to developed countries and between industrialized nations in search for better opportunities. This phenomenon became a global growing concern due to its impact on both the donor and the destination countries. This article aims to present the main theoretical contributions starting from 1950 until today and the historical evolution, in the attempt of correlating the particular case of medical brain drain with the theory and evolution of the brain drain in general. This article raises questions and offers answers, identifies the main issues and looks for possible solutions in order to reduce the emigration of medical doctors. Factors of influence include push (low level of income, poor working conditions, the absence of job openings and social recognition, oppressive political climate and pull (better remuneration and working conditions, prospects for career development, job satisfaction, security factors. Developing countries are confronting with the loss of their most valuable intellectuals and the investment in their education, at the benefit of developed nations. An ethical debate arises as the disparities between countries increases, industrialized nations filling in the gaps in health systems with professionals from countries already facing shortages. However, recent literature emphasizes the possibility of a “beneficial brain drain” through education incentives offered by the emigration prospects. Other sources of “brain gain” for donor country are the remittances, the scientific networks and return migration. Measures to stem the medical brain drain involve the common effort and collaboration between developing and developed countries and international organizations. Measures adopted by donor countries include higher salaries, better working conditions, security, career opportunities, incentives to stimulate return migration. Destination

Validation of Tilt Gain under Realistic Path Loss Model and Network Scenario

DEFF Research Database (Denmark)

Nguyen, Huan Cong; Rodriguez, Ignacio; Sørensen, Troels Bundgaard

2013-01-01

Despite being a simple and commonly-applied radio optimization technique, the impact on practical network performance from base station antenna downtilt is not well understood. Most published studies based on empirical path loss models report tilt angles and performance gains that are far higher...... than practical experience suggests. We motivate in this paper, based on a practical LTE scenario, that the discrepancy partly lies in the path loss model, and shows that a more detailed semi-deterministic model leads to both lower gains in terms of SINR, outage probability and downlink throughput...... settings, including the use of electrical and/or mechanical antenna downtilt, and therefore it is possible to find multiple optimum tilt profiles in a practical case. A broader implication of this study is that care must be taken when using the 3GPP model to evaluate advanced adaptive antenna techniques...

A low on-resistance SOI LDMOS using a trench gate and a recessed drain

International Nuclear Information System (INIS)

Ge Rui; Luo Xiaorong; Jiang Yongheng; Zhou Kun; Wang Pei; Wang Qi; Wang Yuangang; Zhang Bo; Li Zhaoji

2012-01-01

An integrable silicon-on-insulator (SOI) power lateral MOSFET with a trench gate and a recessed drain (TGRD MOSFET) is proposed to reduce the on-resistance. Both of the trench gate extended to the buried oxide (BOX) and the recessed drain reduce the specific on-resistance (R on,sp ) by widening the vertical conduction area and shortening the extra current path. The trench gate is extended as a field plate improves the electric field distribution. Breakdown voltage (BV) of 97 V and R on,sp of 0.985 mΩ·cm 2 (V GS = 5 V) are obtained for a TGRD MOSFET with 6.5 μm half-cell pitch. Compared with the trench gate SOI MOSFET (TG MOSFET) and the conventional MOSFET, R on,sp of the TGRD MOSFET decreases by 46% and 83% at the same BV, respectively. Compared with the SOI MOSFET with a trench gate and a trench drain (TGTD MOSFET), BV of the TGRD MOSFET increases by 37% at the same R on,sp . (semiconductor devices)

Oral tolerance is determined at the level of draining lymph nodes

NARCIS (Netherlands)

Wilsem, van E.G.; BrevÃ, J.; Savelkoul, H.; Claessen, A.; Scheper, R.J.; Kraal, G.

1995-01-01

In the skin and in the epithelium of the oral mucosa a comparable network of Langerhans cells can be found. Antigen application on either epithelium leads to rapid emigration of Langerhans cells to the draining lymph nodes. Application on the oral mucosa leads to tolerance induction while

Human capital in European peripheral regions: brain - drain and brain - gain

NARCIS (Netherlands)

Coenen, Franciscus H.J.M.

2004-01-01

Project goal - The overall goal of the project is to build a legitimate transnational network to transfer ideas and experiences and implement measures to reduce brain drain and foster brain gain while reinforcing the economical and spatial development of peripheral regions in NWE. This means a

End-to-End Key Exchange through Disjoint Paths in P2P Networks

Directory of Open Access Journals (Sweden)

Daouda Ahmat

2015-01-01

Full Text Available Due to their inherent features, P2P networks have proven to be effective in the exchange of data between autonomous peers. Unfortunately, these networks are subject to various security threats that cannot be addressed readily since traditional security infrastructures, which are centralized, cannot be applied to them. Furthermore, communication reliability across the Internet is threatened by various attacks, including usurpation of identity, eavesdropping or traffic modification. Thus, in order to overcome these security issues and allow peers to securely exchange data, we propose a new key management scheme over P2P networks. Our approach introduces a new method that enables a secret key exchange through disjoint paths in the absence of a trusted central coordination point which would be required in traditional centralized security systems.

Path diversity improves the identification of influential spreaders

Science.gov (United States)

Chen, Duan-Bing; Xiao, Rui; Zeng, An; Zhang, Yi-Cheng

2013-12-01

Identifying influential spreaders in complex networks is a crucial problem which relates to wide applications. Many methods based on the global information such as K-shell and PageRank have been applied to rank spreaders. However, most of the related previous works overwhelmingly focus on the number of paths for propagation, while whether the paths are diverse enough is usually overlooked. Generally, the spreading ability of a node might not be strong if its propagation depends on one or two paths while the other paths are dead ends. In this letter, we introduced the concept of path diversity and find that it can largely improve the ranking accuracy. We further propose a local method combining the information of path number and path diversity to identify influential nodes in complex networks. This method is shown to outperform many well-known methods in both undirected and directed networks. Moreover, the efficiency of our method makes it possible to apply it to very large systems.

Globalization, Brain Drain, and Development

OpenAIRE

Docquier, Frédéric; Rapoport, Hillel

2012-01-01

This paper reviews four decades of economics research on the brain drain, with a focus on recent contributions and on development issues. We first assess the magnitude, intensity, and determinants of the brain drain, showing that brain drain (or high-skill) migration is becoming a dominant pattern of international migration and a major aspect of globalization. We then use a stylized growth model to analyze the various channels through which a brain drain affects the sending countries and revi...

On/off ratio enhancement in single-walled carbon nanotube field-effect transistor by controlling network density via sonication

Science.gov (United States)

Jang, Ho-Kyun; Choi, Jun Hee; Kim, Do-Hyun; Kim, Gyu Tae

2018-06-01

Single-walled carbon nanotube (SWCNT) is generally used as a networked structure in the fabrication of a field-effect transistor (FET) since it is known that one-third of SWCNT is electrically metallic and the remains are semiconducting. In this case, the presence of metallic paths by metallic SWCNT (m-SWCNT) becomes a significant technical barrier which hinders the networks from achieving a semiconducting behavior, resulting in a low on/off ratio. Here, we report on an easy method of controlling the on/off ratio of a FET where semiconducting SWCNT (s-SWCNT) and m-SWCNT constitute networks between source and drain electrodes. A FET with SWCNT networks was simply sonicated under water to control the on/off ratio and network density. As a result, the FET having an almost metallic behavior due to the metallic paths by m-SWCNT exhibited a p-type semiconducting behavior. The on/off ratio ranged from 1 to 9.0 × 104 along sonication time. In addition, theoretical calculations based on Monte-Carlo method and circuit simulation were performed to understand and explain the phenomenon of a change in the on/off ratio and network density by sonication. On the basis of experimental and theoretical results, we found that metallic paths contributed to a high off-state current which leads to a low on/off ratio and that sonication formed sparse SWCNT networks where metallic paths of m-SWCNT were removed, resulting in a high on/off ratio. This method can open a chance to save the device which has been considered as a failed one due to a metallic behavior by a high network density leading to a low on/off ratio.

SDN-based path hopping communication against eavesdropping attack

Science.gov (United States)

Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

2016-10-01

Network eavesdropping is one of the most popular means used by cyber attackers, which has been a severe threat to network communication security. Adversaries could capture and analyze network communication data from network nodes or links, monitor network status and steal sensitive data such as username and password etc. Traditional network usually uses static network configuration, and existing defense methods, including firewall, IDS, IPS etc., cannot prevent eavesdropping, which has no distinguishing characteristic. Network eavesdropping become silent during most of the time of the attacking process, which is why it is difficult to discover and to defend. But A successful eavesdropping attack also has its' precondition, which is the target path should be relatively stable and has enough time of duration. So, In order to resolve this problem, it has to work on the network architecture. In this paper, a path hopping communication(PHC) mechanism based on Software Define Network (SDN) was proposed to solve this problem. In PHC, Ends in communication packets as well as the routing paths were changed dynamically. Therefore, the traffic would be distributed to multiple flows and transmitted along different paths. so that Network eavesdropping attack could be prevented effectively. It was concluded that PHC was able to increase the overhead of Network eavesdropping, as well as the difficulty of communication data recovery.

Bayes Node Energy Polynomial Distribution to Improve Routing in Wireless Sensor Network.

Directory of Open Access Journals (Sweden)

Thirumoorthy Palanisamy

Full Text Available Wireless Sensor Network monitor and control the physical world via large number of small, low-priced sensor nodes. Existing method on Wireless Sensor Network (WSN presented sensed data communication through continuous data collection resulting in higher delay and energy consumption. To conquer the routing issue and reduce energy drain rate, Bayes Node Energy and Polynomial Distribution (BNEPD technique is introduced with energy aware routing in the wireless sensor network. The Bayes Node Energy Distribution initially distributes the sensor nodes that detect an object of similar event (i.e., temperature, pressure, flow into specific regions with the application of Bayes rule. The object detection of similar events is accomplished based on the bayes probabilities and is sent to the sink node resulting in minimizing the energy consumption. Next, the Polynomial Regression Function is applied to the target object of similar events considered for different sensors are combined. They are based on the minimum and maximum value of object events and are transferred to the sink node. Finally, the Poly Distribute algorithm effectively distributes the sensor nodes. The energy efficient routing path for each sensor nodes are created by data aggregation at the sink based on polynomial regression function which reduces the energy drain rate with minimum communication overhead. Experimental performance is evaluated using Dodgers Loop Sensor Data Set from UCI repository. Simulation results show that the proposed distribution algorithm significantly reduce the node energy drain rate and ensure fairness among different users reducing the communication overhead.

Risk assessment of K Basin twelve-inch and four-inch drain valve failure from a postulated seismic initiating event

Energy Technology Data Exchange (ETDEWEB)

MORGAN, R.G.

1999-06-23

The Spent Nuclear Fuel (SNF) Project will transfer metallic SNF from the Hanford 105 K-East and 105 K-West Basins to safe interim storage in the Canister Storage Building in the 200 Area. The initial basis for design, fabrication, installation, and operation of the fuel removal systems was that the basin leak rate which could result from a postulated accident condition would not be excessive relative to reasonable recovery operations. However, an additional potential K Basin water leak path is through the K Basin drain valves. Three twelve-inch drain valves are located in the main basin bays along the north wall. Five four-inch drain valves are located in the north and south loadout pits (NLOP and SLOP), the weasel pit, the technical viewing pit, and the discharge chute pit. The sumps containing the valves are filled with concrete which covers the drain valve body. Visual observations indicate that only the valve's bonnet and stem are exposed above the basin concrete floor for the twelve-inch drain valve and that much less of the valve's bonnet and stem are exposed above the basin concrete floor for the five four-inch drain valves. It was recognized, however, that damage of the drain valve bonnet or stem during a seismic initiating event could provide a potential K Basin water leak path. The objectives of this analysis are to: (1) evaluate the likelihood of damaging the three twelve-inch drain valves located along the north wall of the main basin and the five four-inch drain valves located in the pits from a seismic initiating event, and (2) determine the likelihood of exceeding a specific consequence (initial leak rate) from a damaged valve. The analysis process is a risk-based uncertainty analysis where each variable is modeled using available information and engineering judgement. The uncertainty associated with each variable is represented by a probability distribution (probability density function). Uncertainty exists because of the inherent

Distribution of shortest path lengths in a class of node duplication network models

Science.gov (United States)

Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

2017-09-01

We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

Path Planning and Navigation for Mobile Robots in a Hybrid Sensor Network without Prior Location Information

Directory of Open Access Journals (Sweden)

Zheng Zhang

2013-03-01

Full Text Available In a hybrid wireless sensor network with mobile and static nodes, which have no prior geographical knowledge, successful navigation for mobile robots is one of the main challenges. In this paper, we propose two novel navigation algorithms for outdoor environments, which permit robots to travel from one static node to another along a planned path in the sensor field, namely the RAC and the IMAP algorithms. Using this, the robot can navigate without the help of a map, GPS or extra sensor modules, only using the received signal strength indication (RSSI and odometry. Therefore, our algorithms have the advantage of being cost-effective. In addition, a path planning algorithm to schedule mobile robots' travelling paths is presented, which focuses on shorter distances and robust paths for robots by considering the RSSI-Distance characteristics. The simulations and experiments conducted with an autonomous mobile robot show the effectiveness of the proposed algorithms in an outdoor environment.

Sampling and analysis plan (SAP) for WESF drains and TK-100 sump

International Nuclear Information System (INIS)

Simmons, F.M.

1998-01-01

The intent of this project is to determine whether the Waste Encapsulation and Storage Facility (WESF) floor drain piping and the TK-100 sump are free from contamination. TK-100 is currently used as a catch tank to transfer low level liquid waste from WESF to Tank Farms via B Plant. This system is being modified as part of the WESF decoupling since B Plant is being deactivated. As a result of the 1,1,1-trichloroethane (TCA) discovery in TK-100, the associated WESF floor drains and the pit sump need to be sampled. Breakdown constituents have been reviewed and found to be non-hazardous. There are 29 floor drains that tie into a common header leading into the tank. To prevent high exposure during sampling of the drains, TK-100 will be removed into the B Plant canyon and a new tank will be placed in the pit before any floor drain samples are taken. The sump will be sampled prior to TK-100 removal. A sample of the sludge and any liquid in the sump will be taken and analyzed for TCA and polychlorinated biphenyl (PCB). After the sump has been sampled, the vault floor will be flushed. The flush will be transferred from the sump into TK-100. TK-100 will be moved into B Plant. The vault will then be cleaned of debris and visually inspected. If there is no visual indication of TCA or PCB staining, the vault will be painted and a new tank installed. If there is an indication of TCA or PCB from laboratory analysis or staining, further negotiations will be required to determine a path forward. A total of 8 sets of three 40ml samples will be required for all of the floor drains and sump. The sump set will include one 125ml solid sample. The only analysis required will be for TCA in liquids. PCBs will be checked in sump solids only. The Sampling and Analysis Plan (SAP) is written to provide direction for the sampling and analytical activities of the 29 WESF floor drains and the TK-100 sump. The intent of this plan is to define the responsibilities of the various organizations

MinePath: Mining for Phenotype Differential Sub-paths in Molecular Pathways

Science.gov (United States)

Koumakis, Lefteris; Kartsaki, Evgenia; Chatzimina, Maria; Zervakis, Michalis; Vassou, Despoina; Marias, Kostas; Moustakis, Vassilis; Potamias, George

2016-01-01

Pathway analysis methodologies couple traditional gene expression analysis with knowledge encoded in established molecular pathway networks, offering a promising approach towards the biological interpretation of phenotype differentiating genes. Early pathway analysis methodologies, named as gene set analysis (GSA), view pathways just as plain lists of genes without taking into account either the underlying pathway network topology or the involved gene regulatory relations. These approaches, even if they achieve computational efficiency and simplicity, consider pathways that involve the same genes as equivalent in terms of their gene enrichment characteristics. Most recent pathway analysis approaches take into account the underlying gene regulatory relations by examining their consistency with gene expression profiles and computing a score for each profile. Even with this approach, assessing and scoring single-relations limits the ability to reveal key gene regulation mechanisms hidden in longer pathway sub-paths. We introduce MinePath, a pathway analysis methodology that addresses and overcomes the aforementioned problems. MinePath facilitates the decomposition of pathways into their constituent sub-paths. Decomposition leads to the transformation of single-relations to complex regulation sub-paths. Regulation sub-paths are then matched with gene expression sample profiles in order to evaluate their functional status and to assess phenotype differential power. Assessment of differential power supports the identification of the most discriminant profiles. In addition, MinePath assess the significance of the pathways as a whole, ranking them by their p-values. Comparison results with state-of-the-art pathway analysis systems are indicative for the soundness and reliability of the MinePath approach. In contrast with many pathway analysis tools, MinePath is a web-based system (www.minepath.org) offering dynamic and rich pathway visualization functionality, with the

Capturing cognitive causal paths in human reliability analysis with Bayesian network models

International Nuclear Information System (INIS)

Zwirglmaier, Kilian; Straub, Daniel; Groth, Katrina M.

2017-01-01

reIn the last decade, Bayesian networks (BNs) have been identified as a powerful tool for human reliability analysis (HRA), with multiple advantages over traditional HRA methods. In this paper we illustrate how BNs can be used to include additional, qualitative causal paths to provide traceability. The proposed framework provides the foundation to resolve several needs frequently expressed by the HRA community. First, the developed extended BN structure reflects the causal paths found in cognitive psychology literature, thereby addressing the need for causal traceability and strong scientific basis in HRA. Secondly, the use of node reduction algorithms allows the BN to be condensed to a level of detail at which quantification is as straightforward as the techniques used in existing HRA. We illustrate the framework by developing a BN version of the critical data misperceived crew failure mode in the IDHEAS HRA method, which is currently under development at the US NRC . We illustrate how the model could be quantified with a combination of expert-probabilities and information from operator performance databases such as SACADA. This paper lays the foundations necessary to expand the cognitive and quantitative foundations of HRA. - Highlights: • A framework for building traceable BNs for HRA, based on cognitive causal paths. • A qualitative BN structure, directly showing these causal paths is developed. • Node reduction algorithms are used for making the BN structure quantifiable. • BN quantified through expert estimates and observed data (Bayesian updating). • The framework is illustrated for a crew failure mode of IDHEAS.

Two path transport measurements on a triple quantum dot

Energy Technology Data Exchange (ETDEWEB)

Rogge, Maximilian C.; Haug, Rolf J. [Institut fuer Festkoerperphysik, Leibniz Universitaet Hannover, Appelstr. 2, 30167 Hannover (Germany)

2008-07-01

We present a novel triple quantum dot device made with local anodic oxidation on a GaAs/AlGaAs heterostructure. The geometry provides two path transport via a three lead setup with each lead connected to one of the three quantum dots. In addition charge detection is implemented via a quantum point contact. One lead is used as a common source contact, the other two are used as two separate drain contacts with independent current measurement. Thus two paths are formed with two dots in each path. Along both paths serial transport is observed at the triple points of the two corresponding dots. With four side gates a wide tunability is given. Thus the system can be tuned in and out of triple dot resonances. When all three dots come into resonance, quadruple points are formed with simultaneous transport along both paths. The data are analysed in combined two colour plots and compared to the charge detection showing sets of three different lines, one for each dot. This way the two path setup allows to investigate the transition from double dot physics to triple dot physics.

A prospective randomized study of use of drain versus no drain after burr-hole evacuation of chronic subdural hematoma.

Science.gov (United States)

Singh, Amit Kumar; Suryanarayanan, Bhaskar; Choudhary, Ajay; Prasad, Akhila; Singh, Sachin; Gupta, Laxmi Narayan

2014-01-01

Chronic subdural hematoma (CSDH) recurs after surgical evacuation in 5-30% of patients. Inserting subdural drain might reduce the recurrence rate, but is not commonly practiced. There are few prospective studies to evaluate the effect of subdural drains. A prospective randomized study to investigate the effect of subdural drains in the on recurrence rates and clinical outcome following burr-hole drainage (BHD) of CSDH was undertaken. During the study period, 246 patients with CSDH were assessed for eligibility. Among 200 patients fulfilling the eligibility criteria, 100 each were assigned to "drain group" (drain inserted into the subdural space following BHD) and "without drain group" (subdural drain was not inserted following BHD) using random allocation software. The primary end point was recurrence needing re-drainage up to a period of 6 months from surgery. Recurrence occurred in 9 of 100 patients with a drain, and 26 of 100 patients in without drain group (P = 0.002). The mortality was 5% in patients with drain and 4% in patients without drain group (P = 0.744). The medical and surgical complications were comparable between the two study groups. Use of a subdural drain after burr-hole evacuation of a CSDH reduces the recurrence rate and is not associated with increased complications.

A Velocity-Level Bi-Criteria Optimization Scheme for Coordinated Path Tracking of Dual Robot Manipulators Using Recurrent Neural Network.

Science.gov (United States)

Xiao, Lin; Zhang, Yongsheng; Liao, Bolin; Zhang, Zhijun; Ding, Lei; Jin, Long

2017-01-01

A dual-robot system is a robotic device composed of two robot arms. To eliminate the joint-angle drift and prevent the occurrence of high joint velocity, a velocity-level bi-criteria optimization scheme, which includes two criteria (i.e., the minimum velocity norm and the repetitive motion), is proposed and investigated for coordinated path tracking of dual robot manipulators. Specifically, to realize the coordinated path tracking of dual robot manipulators, two subschemes are first presented for the left and right robot manipulators. After that, such two subschemes are reformulated as two general quadratic programs (QPs), which can be formulated as one unified QP. A recurrent neural network (RNN) is thus presented to solve effectively the unified QP problem. At last, computer simulation results based on a dual three-link planar manipulator further validate the feasibility and the efficacy of the velocity-level optimization scheme for coordinated path tracking using the recurrent neural network.

Americium/curium bushing melter drain tests

International Nuclear Information System (INIS)

Smith, M.E.; Hardy, B.J.; Smith, M.E.

1997-01-01

Americium and curium were produced in the past at the Savannah River Site (SRS) for research, medical, and radiological applications. They have been stored in a nitric acid solution in an SRS reprocessing facility for a number of years. Vitrification of the americium/curium (Am/Cm) solution will allow the material to be safely stored or transported to the DOE Oak Ridge Reservation. Oak Ridge is responsible for marketing radionuclides for research and medical applications. The bushing melter technology being used in the Am/Cm vitrification research work is also under consideration for the stabilization of other actinides such as neptunium and plutonium. A series of melter drain tests were conducted at the Savannah River Technology Center to determine the relationship between the drain tube assembly operating variables and the resulting pour initiation times, glass flowrates, drain tube temperatures, and stop pour times. Performance criteria such as ability to start and stop pours in a controlled manner were also evaluated. The tests were also intended to provide support of oil modeling of drain tube performance predictions and thermal modeling of the drain tube and drain tube heater assembly. These drain tests were instrumental in the design of subsequent melter drain tube and drain tube heaters for the Am/Cm bushing melter, and therefore in the success of the Am/Cm vitrification and plutonium immobilization programs

Modeling the Liquid Water Transport in the Gas Diffusion Layer for Polymer Electrolyte Membrane Fuel Cells Using a Water Path Network

Directory of Open Access Journals (Sweden)

Dietmar Gerteisen

2013-09-01

Full Text Available In order to model the liquid water transport in the porous materials used in polymer electrolyte membrane (PEM fuel cells, the pore network models are often applied. The presented model is a novel approach to further develop these models towards a percolation model that is based on the fiber structure rather than the pore structure. The developed algorithm determines the stable liquid water paths in the gas diffusion layer (GDL structure and the transitions from the paths to the subsequent paths. The obtained water path network represents the basis for the calculation of the percolation process with low calculation efforts. A good agreement with experimental capillary pressure-saturation curves and synchrotron liquid water visualization data from other literature sources is found. The oxygen diffusivity for the GDL with liquid water saturation at breakthrough reveals that the porosity is not a crucial factor for the limiting current density. An algorithm for condensation is included into the model, which shows that condensing water is redirecting the water path in the GDL, leading to an improved oxygen diffusion by a decreased breakthrough pressure and changed saturation distribution at breakthrough.

Path-Length and the Misperception of Speech: Insights from Network Science and Psycholinguistics

Science.gov (United States)

Vitevitch, Michael S.; Goldstein, Rutherford; Johnson, Elizabeth

Using the analytical methods of network science we examined what could be retrieved from the lexicon when a spoken word is misperceived. To simulate misperceptions in the laboratory, we used a variant of the semantic associates task—the phonological associate task—in which participants heard an English word and responded with the first word that came to mind that sounded like the word they heard, to examine what people actually do retrieve from the lexicon when a spoken word is misperceived. Most responses were 1 link away from the stimulus word in the lexical network. Distant neighbors (words >1 link) were provided more often as responses when the stimulus word had low rather than high degree. Finally, even very distant neighbors tended to be connected to the stimulus word by a path in the lexical network. These findings have implications for the processing of spoken words, and highlight the valuable insights that can be obtained by combining the analytic tools of network science with the experimental tasks of psycholinguistics.

Social network analysis using k-Path centrality method

Science.gov (United States)

Taniarza, Natya; Adiwijaya; Maharani, Warih

2018-03-01

k-Path centrality is deemed as one of the effective methods to be applied in centrality measurement in which the influential node is estimated as the node that is being passed by information path frequently. Regarding this, k-Path centrality has been employed in the analysis of this paper specifically by adapting random-algorithm approach in order to: (1) determine the influential user’s ranking in a social media Twitter; and (2) ascertain the influence of parameter α in the numeration of k-Path centrality. According to the analysis, the findings showed that the method of k-Path centrality with random-algorithm approach can be used to determine user’s ranking which influences in the dissemination of information in Twitter. Furthermore, the findings also showed that parameter α influenced the duration and the ranking results: the less the α value, the longer the duration, yet the ranking results were more stable.

Path scanning for the detection of anomalous subgraphs and use of DNS requests and host agents for anomaly/change detection and network situational awareness

Science.gov (United States)

Neil, Joshua Charles; Fisk, Michael Edward; Brugh, Alexander William; Hash, Curtis Lee; Storlie, Curtis Byron; Uphoff, Benjamin; Kent, Alexander

2017-11-21

A system, apparatus, computer-readable medium, and computer-implemented method are provided for detecting anomalous behavior in a network. Historical parameters of the network are determined in order to determine normal activity levels. A plurality of paths in the network are enumerated as part of a graph representing the network, where each computing system in the network may be a node in the graph and the sequence of connections between two computing systems may be a directed edge in the graph. A statistical model is applied to the plurality of paths in the graph on a sliding window basis to detect anomalous behavior. Data collected by a Unified Host Collection Agent ("UHCA") may also be used to detect anomalous behavior.

A Dynamic Bioinspired Neural Network Based Real-Time Path Planning Method for Autonomous Underwater Vehicles.

Science.gov (United States)

Ni, Jianjun; Wu, Liuying; Shi, Pengfei; Yang, Simon X

2017-01-01

Real-time path planning for autonomous underwater vehicle (AUV) is a very difficult and challenging task. Bioinspired neural network (BINN) has been used to deal with this problem for its many distinct advantages: that is, no learning process is needed and realization is also easy. However, there are some shortcomings when BINN is applied to AUV path planning in a three-dimensional (3D) unknown environment, including complex computing problem when the environment is very large and repeated path problem when the size of obstacles is bigger than the detection range of sensors. To deal with these problems, an improved dynamic BINN is proposed in this paper. In this proposed method, the AUV is regarded as the core of the BINN and the size of the BINN is based on the detection range of sensors. Then the BINN will move with the AUV and the computing could be reduced. A virtual target is proposed in the path planning method to ensure that the AUV can move to the real target effectively and avoid big-size obstacles automatically. Furthermore, a target attractor concept is introduced to improve the computing efficiency of neural activities. Finally, some experiments are conducted under various 3D underwater environments. The experimental results show that the proposed BINN based method can deal with the real-time path planning problem for AUV efficiently.

Mathematical modeling of a radio-frequency path for IEEE 802.11ah based wireless sensor networks

Science.gov (United States)

Tyshchenko, Igor; Cherepanov, Alexander; Dmitrii, Vakhnin; Popova, Mariia

2017-09-01

This article discusses the process of creating the mathematical model of a radio-frequency path for an IEEE 802.11ah based wireless sensor networks using M atLab Simulink CAD tools. In addition, it describes occurring perturbing effects and determining the presence of a useful signal in the received mixture.

Managing erosion, sediment transport and water quality in drained peatland catchments

Energy Technology Data Exchange (ETDEWEB)

Marttila, H.

2010-07-01

Peatland drainage changes catchment conditions and increases the transport of suspended solids (SS) and nutrients. New knowledge and management methods are needed to reduce SS loading from these areas. This thesis examines sediment delivery and erosion processes in a number of peatland drainage areas and catchments in order to determine the effects of drainage on sediment and erosion dynamics and mechanics. Results from studies performed in peat mining, peatland forestry and disturbed headwater catchments in Finland are presented and potential sediment load management methods are discussed for drainage areas and headwater brooks. Particular attention is devoted to erosion of organic peat, sediment transport and methods to reduce the impacts of peatland drainage in boreal headwaters. This thesis consists of six articles. The first and second papers focus on the erosion and sediment transport processes at peat harvesting and peatland forestry drainage networks. The results indicate that in-channel processes are important in drained peatland, since the drainage network often constitutes temporary inter-storm storage for eroding and transporting material. Sediment properties determine the bed sediment erosion sensitivity, as fluffy organic peat sediment consolidates over time. As flashiness and peak runoff control sediment entrainment and transport from drained peatland areas, water quality management should include peak runoff management. The third, fourth and fifth papers studies use and application of peak runoff control (PRC) method to the peat harvesting and peatland forestry conditions for water protection. Results indicate that effective water quality management in drained peatland areas can be achieved using this method. Installation of the PRC structures is a useful and cost-effective way of storing storm runoff waters temporarily in the ditch system and providing a retention time for eroded sediment to settle to the ditch bed and drainage network. The main

Metabolic Network Discovery by Top-Down and Bottom-Up Approaches and Paths for Reconciliation

Energy Technology Data Exchange (ETDEWEB)

Çakır, Tunahan, E-mail: tcakir@gyte.edu.tr [Computational Systems Biology Group, Department of Bioengineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey); Khatibipour, Mohammad Jafar [Computational Systems Biology Group, Department of Bioengineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey); Department of Chemical Engineering, Gebze Technical University (formerly known as Gebze Institute of Technology), Gebze (Turkey)

2014-12-03

The primary focus in the network-centric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the condition-specific metabolic networks. One approach starts from genome-scale metabolic networks, which cover all possible reactions known to occur in the related organism in a condition-independent manner, and applies methods such as the optimization-based Flux-Balance Analysis to elucidate the active network. The other approach starts from the condition-specific metabolome data, and processes the data with statistical or optimization-based methods to extract information content of the data such that the active network is inferred. These approaches, termed bottom-up and top-down, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data- and flux-analysis approaches in the post-genomic era. This study reviews the strengths of constraint-based analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.

Metabolic Network Discovery by Top-Down and Bottom-Up Approaches and Paths for Reconciliation

International Nuclear Information System (INIS)

Çakır, Tunahan; Khatibipour, Mohammad Jafar

2014-01-01

The primary focus in the network-centric analysis of cellular metabolism by systems biology approaches is to identify the active metabolic network for the condition of interest. Two major approaches are available for the discovery of the condition-specific metabolic networks. One approach starts from genome-scale metabolic networks, which cover all possible reactions known to occur in the related organism in a condition-independent manner, and applies methods such as the optimization-based Flux-Balance Analysis to elucidate the active network. The other approach starts from the condition-specific metabolome data, and processes the data with statistical or optimization-based methods to extract information content of the data such that the active network is inferred. These approaches, termed bottom-up and top-down, respectively, are currently employed independently. However, considering that both approaches have the same goal, they can both benefit from each other paving the way for the novel integrative analysis methods of metabolome data- and flux-analysis approaches in the post-genomic era. This study reviews the strengths of constraint-based analysis and network inference methods reported in the metabolic systems biology field; then elaborates on the potential paths to reconcile the two approaches to shed better light on how the metabolism functions.

MultiPaths Revisited - A novel approach using OpenFlow-enabled devices

CERN Document Server

Al-Shabibi, Ali; Martin, Brian

2011-06-11

This thesis presents novel approaches enhancing the performance of computer networks using multipaths. Our enhancements take the form of congestion-aware routing protocols. We present three protocols called MultiRoute, Step-Route, and finally PathRoute. Each of these protocols leverage both local and remote congestion statistics and build different representations (or views) of the network congestion by using an innovative representation of congestion for router-router links. These congestion statistics are then distributed via an aggregation protocol to other routers in the network. For many years, multipath routing protocols have only been used in simple situations, such as Link Aggregation and/or networks where paths of equal cost (and therefore equal delay) exist. But, paths of unequal costs are often discarded to the benefit of shortest path only routing because it is known that paths of unequal length present different delays and therefore cause out of order packets which cause catastrophic network per...

Path planning in GPS-denied environments via collective intelligence of distributed sensor networks

Science.gov (United States)

Jha, Devesh K.; Chattopadhyay, Pritthi; Sarkar, Soumik; Ray, Asok

2016-05-01

This paper proposes a framework for reactive goal-directed navigation without global positioning facilities in unknown dynamic environments. A mobile sensor network is used for localising regions of interest for path planning of an autonomous mobile robot. The underlying theory is an extension of a generalised gossip algorithm that has been recently developed in a language-measure-theoretic setting. The algorithm has been used to propagate local decisions of target detection over a mobile sensor network and thus, it generates a belief map for the detected target over the network. In this setting, an autonomous mobile robot may communicate only with a few mobile sensing nodes in its own neighbourhood and localise itself relative to the communicating nodes with bounded uncertainties. The robot makes use of the knowledge based on the belief of the mobile sensors to generate a sequence of way-points, leading to a possible goal. The estimated way-points are used by a sampling-based motion planning algorithm to generate feasible trajectories for the robot. The proposed concept has been validated by numerical simulation on a mobile sensor network test-bed and a Dubin's car-like robot.

Drain Current Modulation of a Single Drain MOSFET by Lorentz Force for Magnetic Sensing Application.

Science.gov (United States)

Chatterjee, Prasenjit; Chow, Hwang-Cherng; Feng, Wu-Shiung

2016-08-30

This paper reports a detailed analysis of the drain current modulation of a single-drain normal-gate n channel metal-oxide semiconductor field effect transistor (n-MOSFET) under an on-chip magnetic field. A single-drain n-MOSFET has been fabricated and placed in the center of a square-shaped metal loop which generates the on-chip magnetic field. The proposed device designed is much smaller in size with respect to the metal loop, which ensures that the generated magnetic field is approximately uniform. The change of drain current and change of bulk current per micron device width has been measured. The result shows that the difference drain current is about 145 µA for the maximum applied magnetic field. Such changes occur from the applied Lorentz force to push out the carriers from the channel. Based on the drain current difference, the change in effective mobility has been detected up to 4.227%. Furthermore, a detailed investigation reveals that the device behavior is quite different in subthreshold and saturation region. A change of 50.24 µA bulk current has also been measured. Finally, the device has been verified for use as a magnetic sensor with sensitivity 4.084% (29.6 T(-1)), which is very effective as compared to other previously reported works for a single device.

Path-based Queries on Trajectory Data

DEFF Research Database (Denmark)

Krogh, Benjamin Bjerre; Pelekis, Nikos; Theodoridis, Yannis

2014-01-01

In traffic research, management, and planning a number of path-based analyses are heavily used, e.g., for computing turn-times, evaluating green waves, or studying traffic flow. These analyses require retrieving the trajectories that follow the full path being analyzed. Existing path queries cannot...... sufficiently support such path-based analyses because they retrieve all trajectories that touch any edge in the path. In this paper, we define and formalize the strict path query. This is a novel query type tailored to support path-based analysis, where trajectories must follow all edges in the path...... a specific path by only retrieving data from the first and last edge in the path. To correctly answer strict path queries existing network-constrained trajectory indexes must retrieve data from all edges in the path. An extensive performance study of NETTRA using a very large real-world trajectory data set...

Space weather and HF propagation along different paths of the Russian chirp sounders network

Science.gov (United States)

Kurkin, V. I.; Litovkin, G. I.; Matyushonok, S. M.; Vertogradov, G. G.; Ivanov, V. A.; Poddelsky, I. N.; Rozanov, S. V.; Uryadov, V. P.

This paper presents experimental data obtained on long paths (from 2200 km to 5700 km range) of Russian frequency modulated continues wave (chirp) sounders network for the period from 1998 to 2003. Four transmitters (near Magadan, Khabarovsk, Irkutsk, Norilsk) and four receivers (near Irkutsk, Yoshkar-Ola, Nizhny Novgorod, Rostov-on-Don) were combined into single network to investigate a influence of geomagnetic storms and substorms on HF propagation in Asian region of Russia. In this region the geographic latitudes are in greatest excess of magnetic latitudes. As a consequence, elements of the large-scale structure, such as the main ionospheric trough, and the zone of auroral ionization, are produced in the ionosphere at the background of a low electron ionization. Coordinated experiments were carried out using 3-day Solar-Geophysical activity forecast presented by NOAA Space Environment Center in Internet. Sounding operations were conducted in the frequency band 4 -- 30 MHz on a round-the-clock basis at 15-min intervals. Oblique-incidence sounding (OIS) ionograms were recorded during 5-7 days every season for some years. The comparison between experimental data and simulation of OIS ionograms using International Reference Ionospheric model (IRI-2001) allowed to estimate the forecast of HF propagation errors both under quiet condition and during geomagnetic disturbances. Strong deviations from median values of maximum observed frequencies on mid-latitude paths in daytime present a real challenge to ionospheric forecast. Subauroral and mid-latitude chirp-sounding paths run, respectively, near the northward and southward walls of the main ionospheric trough. This make sit possible to study the dynamics of the trough's boundaries under different geophysical conditions and assess the influence of ionization gradients and small-scale turbulence on HF signal characteristics. The signals off-great circle propagation were registered over a wide frequency range and for

A Rare Complication of Abdominal Drain: Fallopian Tube Herniation Through the Drain Site

OpenAIRE

Dilek Uygur; Seval Erdinç; Hülya Dede; Ümit Taşdemir; Oktay Kaymak; Nuri Danışman

2016-01-01

Prophylactic drainage of the peritoneal cavity after obstetrical and gynecological surgery is widely practiced. The idea of “when in doubt, drain” is accepted and applied clinically by many surgeons. However, surgically placed drains are not without risk. The present case describes herniation of fallopian tube during the removal of a surgical drain placed after a cesarean section.

The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

Directory of Open Access Journals (Sweden)

Liang Shen

2017-01-01

Full Text Available There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.

PathSys: integrating molecular interaction graphs for systems biology

Directory of Open Access Journals (Sweden)

Raval Alpan

2006-02-01

Full Text Available Abstract Background The goal of information integration in systems biology is to combine information from a number of databases and data sets, which are obtained from both high and low throughput experiments, under one data management scheme such that the cumulative information provides greater biological insight than is possible with individual information sources considered separately. Results Here we present PathSys, a graph-based system for creating a combined database of networks of interaction for generating integrated view of biological mechanisms. We used PathSys to integrate over 14 curated and publicly contributed data sources for the budding yeast (S. cerevisiae and Gene Ontology. A number of exploratory questions were formulated as a combination of relational and graph-based queries to the integrated database. Thus, PathSys is a general-purpose, scalable, graph-data warehouse of biological information, complete with a graph manipulation and a query language, a storage mechanism and a generic data-importing mechanism through schema-mapping. Conclusion Results from several test studies demonstrate the effectiveness of the approach in retrieving biologically interesting relations between genes and proteins, the networks connecting them, and of the utility of PathSys as a scalable graph-based warehouse for interaction-network integration and a hypothesis generator system. The PathSys's client software, named BiologicalNetworks, developed for navigation and analyses of molecular networks, is available as a Java Web Start application at http://brak.sdsc.edu/pub/BiologicalNetworks.

Testing and Micromechanical Modelling of Rockfill Materials Considering the Effect of Stress Path

Directory of Open Access Journals (Sweden)

Wang Feng

2016-01-01

Full Text Available We have extended the micromechanics-based analytical (M-A model to make it capable of simulating Nuozhadu rockfill material (NRFM under different stress paths. Two types of drained triaxial tests on NRFM were conducted, namely, the stress paths of constant stress ratio (CSR and the complex stress paths with transitional features. The model was improved by considering the interparticle parameter variation with the unloading-reloading cycles and the effect of the stress transition path. The evolution of local dilatancy at interparticle planes due to an externally applied load is also discussed. Compared with Duncan-Chang’s E-u and E-B models, the improved model could not only better describe the deformation properties of NRFM under the stress path loading, but also present the volumetric strain changing from dilatancy to contractancy with increasing transitional confining pressures. All simulations have demonstrated that the proposed M-A model is capable of modelling the mechanical behaviour of NRFM in the dam.

Effect of Post Treatment For Cu-Cr Source/Drain Electrodes on a-IGZO TFTs

OpenAIRE

Hu, Shiben; Fang, Zhiqiang; Ning, Honglong; Tao, Ruiqiang; Liu, Xianzhe; Zeng, Yong; Yao, Rihui; Huang, Fuxiang; Li, Zhengcao; Xu, Miao; Wang, Lei; Lan, Linfeng; Peng, Junbiao

2016-01-01

We report a high-performance amorphous Indium-Gallium-Zinc-Oxide (a-IGZO) thin-film transistor (TFT) with new copper-chromium (Cu-Cr) alloy source/drain electrodes. The TFT shows a high mobility of 39.4 cm 2 ?V ? 1 ?s ? 1 a turn-on voltage of ?0.8 V and a low subthreshold swing of 0.47 V/decade. Cu diffusion is suppressed because pre-annealing can protect a-IGZO from damage during the electrode sputtering and reduce the copper diffusion paths by making film denser. Due to the interaction of C...

A Rare Complication of Abdominal Drain: Fallopian Tube Herniation Through the Drain Site

Directory of Open Access Journals (Sweden)

Dilek Uygur

2016-05-01

Full Text Available Prophylactic drainage of the peritoneal cavity after obstetrical and gynecological surgery is widely practiced. The idea of “when in doubt, drain” is accepted and applied clinically by many surgeons. However, surgically placed drains are not without risk. The present case describes herniation of fallopian tube during the removal of a surgical drain placed after a cesarean section.

Necessity of suction drains in gynecomastia surgery.

Science.gov (United States)

Keskin, Mustafa; Sutcu, Mustafa; Cigsar, Bulent; Karacaoglan, Naci

2014-05-01

The aim of gynecomastia surgery is to restore a normal chest contour with minimal signs of breast surgery. The authors examine the rate of complications in gynecomastia surgery when no closed-suction drains are placed. One hundred thirty-eight consecutive male patients who underwent gynecomastia surgery without drains were retrospectively analyzed to determine whether the absence of drains adversely affected patient outcomes. Patients were managed by ultrasonic-assisted liposuction both with and without the pull-through technique. The mean age of the patients was 29 years, and the mean volume of breast tissue aspirated was 350 mL per beast. Pull-through was needed in 23 cases. There was only 1 postoperative hematoma. These results are comparable with previously published data for gynecomastia surgery in which drains were placed, suggesting that the absence of drains does not adversely affect postoperative recovery. Routine closed-suction drainage after gynecomastia surgery is unnecessary, and it may be appropriate to omit drains after gynecomastia surgery.

21 CFR 868.5995 - Tee drain (water trap).

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Tee drain (water trap). 868.5995 Section 868.5995...) MEDICAL DEVICES ANESTHESIOLOGY DEVICES Therapeutic Devices § 868.5995 Tee drain (water trap). (a) Identification. A tee drain (water trap) is a device intended to trap and drain water that collects in ventilator...

Development of rationalized system treating floor drain

International Nuclear Information System (INIS)

Nakamura, Yasuyuki; Serizawa, Kenichi; Komatsu, Akihiro; Shimizu, Takayuki

1998-01-01

Radioactive liquid wastes generated at BWR plants are collected and treated as required. These days, however, generation of floor drain has deceased and HFF (Hollow Fiber Filter) has experienced a wide applicability to several kinds of liquid wastes. We should consider that the floor drain can be mixed and diluted with equipment drain and be purified by HFF. That enables some of the sumps and long priming pipes to be combined. From this point of view, we have developed a highly rationalized waste liquid system. We have evaluated the applicability of this system after an investigation into the generation and properties of floor drain and equipment drain at the latest BWR'S and an on-site test at a typical BWR. (author)

Breakthrough of two pesticides into tile drain and shallow groundwater: comparison of tile drain reaction and soil profiles within a field scale irrigation experiment

Science.gov (United States)

Klaus, Julian; Zehe, Erwin; Elsner, Martin; Palm, Juliane; Schneider, Dorothee; Schröder, Boris; Steinbeiss, Sibylle; West, Stephanie

2010-05-01

and bromide. The tile drain water showed traces of bromide and both pesticides within a few minutes. IPU showed highest concentration before the hydrograph started to increase, while bromide and FLU are strongly correlated to the hydrograph. Although IPU is less sorptive than FLU the concentrations and total transported mass of FLU were significantly higher then for IPU. The hydrograph reacted with two peaks on the three block irrigation; the two peaks can be attributed to the second and third irrigation block. Analysis of the water isotopes showed that during the experiment the event water mainly consisted of soil water. While the tile drain showed significant reaction in pesticides transport the picture deriving from soil profiles were different. Especially FLU was found mainly in the upper soil parts, so the bypassing might occurred so fast that it was only marginally absorbed in deeper soil party, but transported to the drain or shallow groundwater. As preferential flow paths earthworm burrows of different species could be identified, although the area density and species number of anecic earthworms was quite low compared to other field sites.

Analysis of construction dynamic plan using fuzzy critical path method

Directory of Open Access Journals (Sweden)

Kurij Kazimir V.

2014-01-01

Full Text Available Critical Path Method (CPM technique has become widely recognized as valuable tool for the planning and scheduling large construction projects. The aim of this paper is to present an analytical method for finding the Critical Path in the precedence network diagram where the duration of each activity is represented by a trapezoidal fuzzy number. This Fuzzy Critical Path Method (FCPM uses a defuzzification formula for trapezoidal fuzzy number and applies it on the total float (slack time for each activity in the fuzzy precedence network to find the critical path. The method presented in this paper is very effective in determining the critical activities and finding the critical paths.

How to remove a chest drain.

Science.gov (United States)

Allibone, Elizabeth

2015-10-07

RATIONALE AND KEY POINTS: This article aims to help nurses to undertake the removal of a chest drain in a safe, effective and patient-centred manner. This procedure requires two practitioners. The chest drain will have been inserted aseptically to remove air, blood, fluid or pus from the pleural cavity. ▶ Chest drains may be small or wide bore depending on the underlying condition and clinical setting. They may be secured with a mattress suture and/or an anchor suture. ▶ Chest drains are usually removed under medical instructions when the patient's lung has inflated, the underlying condition has resolved, there is no evidence of respiratory compromise or failure, and their anticoagulation status has been assessed as satisfactory. ▶ Chest drains secured with a mattress suture should be removed by two practitioners. One practitioner is required to remove the tube and the other to tie the mattress suture (if present) and secure the site. REFLECTIVE ACTIVITY: Clinical skills articles can help update your practice and ensure it remains evidence based. Apply this article to your practice. Reflect on and write a short account of: 1. How reading this article will change your practice. 2. How this article could be used to educate patients with chest drains. Subscribers can upload their reflective accounts at: rcni.com/portfolio .

216-Z-8 French drain characterization study

International Nuclear Information System (INIS)

Marratt, M.C.; Kasper, R.B.; Van Luik, A.E.

1984-09-01

The 216-Z-8 French drain study is one of a series of studies examining historical transuranic waste facilities no longer in use at the Hanford Site. The 216-Z-8 French drain underground disposal system consisted of a large settling tank that overflowed into a French drain. The French drain consisted of two large-diameter, gravel filled, vitrified clay pipes placed on end, end-to-end, over a gravel-filled excavation. The top of the drain was sealed with concrete to prevent the upward flow of waste solution. The waste solution discharged to the 216-Z-8 waste disposal system was a neutralized, transuranic recovery process, filter cake, backflush slurry. The primary objective of this study was to determine the distribution of plutonium and americium beneath the French drain. Transuranic activity under the French drain did not exceed 5 nCi/g in the soil samples obtained from a well within 1 m of the drain structure. Conservative estimates indicated that 4 to 5 m 3 of radioactive contaminated sediments, 10 nCi/g may lie directly under the 216-Z-8 French drain. The secondary objective of the study was to evaluate the possibility of a leak in the settling tank. Results from the analysis of soil samples from wells drilled around the settling tank indicated the presence of low-level transuranic contamination (on the order of 0.001 nci/g) in the soil surrounding the tank. However, the distribution of the contamination does not support a leak as a plausible mechanism to account for the observed activity surrounding the tank. The bulk of the plutonium was confirmed to be in the sludge that remained in the tank; thus, no significant environmental impact would be expected even if there has been a leak

Drain site evisceration of fallopian tube, another reason to discourage abdominal drain: report of a case and brief review of literature.

Science.gov (United States)

Saini, Pradeep; Faridi, M S; Agarwal, Nitin; Gupta, Arun; Kaur, Navneet

2012-04-01

Placement of a drain following abdominal surgery is common despite a lack of convincing evidence in the current literature to support this practice. The use of intra-abdominal drain is associated with many potential and serious complications. We report a drain site evisceration of the right fallopian tube after the removal of an intra-abdominal drain. The drain was placed in the right iliac fossa in a patient who underwent a lower segment Caesarean section (LSCS) for meconium liquor with fetal distress. The Pfannenstiel incision made for LSCS was reopened and the protruding inflamed fimbrial end of the right fallopian tube was excised. The patient made an uneventful recovery. Routine intra-abdominal prophylactic drain following an abdominal surgery including LSCS should be discouraged.

Networks in Buildings: Which Path Forward?

Energy Technology Data Exchange (ETDEWEB)

Nordman, Bruce

2008-08-17

To date, digital networks have principally been installed for connecting information technology devices, with more modest use in consumer electronics, security, and large building control systems. The next 20 years will see much greater deployment of networks in buildings of all types, and across all end uses. Most of these are likely to be introduced primarily for reasons other than energy efficiency, and add energy use for network interfaces and network products. Widespread networking could easily lead to increased energy use, and experience with IT and CE networks suggests this may be likely. Active engagement by energy efficiency professionals in the architecture and design of future networks could lead to their being a large and highly cost-effective tool for efficiency. However, network standards are complex and take many years to develop and negotiate so that lack of action on this in the near term may foreclose important opportunities for years or decades to come. Digital networks need to be common globally, providing another challenge to building systems and elements that are more commonly designed only for national or regional markets. Key future networks are lighting, climate control, and security/presence. This paper reviews some examples of past network designs and use and the lessons they hold for future building networks. It also highlights key needed areas for research, policy, and standards development.

Quantity and quality of phosphorus losses from an artificially drained lowland catchment

Science.gov (United States)

Nausch, Monika; Woelk, Jana; Kahle, Petra; Nausch, Günther; Leipe, Thomas; Lennartz, Bernd

2017-04-01

Currently, agricultural diffuse sources constitute the major portion of phosphorus (P) fluxes to the Baltic Sea and have to reach the good ecological status aimed by the Baltic Sea Action Plan and the Marine Strategy Framework Directive. The objective of this study was to uncover the change in phosphorus loading as well as in P fractions along the flow path of a mid-size river basin in order to derive risk assessment and management strategies for a sustainable P reduction. P-fractions and the mineral composition of particulate P were investigated in a sub-basin of the river Warnow, the second largest German catchment discharging to the Baltic Sea. Samples were collected from the sources (tile drain, ditch) and along the subsequent brook up to the river Warnow representing spatial scales of a few hectars up to 3300 km2. The investigations were performed during the discharge season from November 1th 2013 until April 30th 2014 covering a relative dry and mild winter period. We observed an increase of total phosphorus (TP) concentrations from 15.5 ± 3.9 µg L-1 in the drain outlet to 72.0 ± 7.2 µg L-1 in the river Warnow emphasizing the importance of sediment-bound P mobilization along the flow path. Particulate phosphorus (PP) of 36.6 - 61.2% accounted for the largest share of TP in the streams. Clay minerals and Fe(hydr)oxides were the main carrier of particle bound P followed by apatite. A transformation of dissolved inorganic phosphorus (DIP) into particulate organic P was observed in the river Warnow with the beginning of the growth season in February. Our investigations indicate that the overall P load could be reduced by half when PP is removed.

Penrose Drain Migration After Laparoscopic Surgery

Directory of Open Access Journals (Sweden)

Pazouki AbdolReza

2009-05-01

Full Text Available Laparoscopy has made a revolution in surgical procedures and treatment of various diseases but its complications are still under investigation. Intra-abdominal visceral and vessel injuries, trocar site hernia, and leaving foreign bodies into the peritoneal cavity are among some laparoscopic surgery complications. This is a rare report of Penrose drain migration following incomplete laparoscopic Fundoplication surgery. The patient was a 47- year- old woman, who was a candidate for Touplet Fundoplication via laparoscopic approach due to refractory gastro-esophageal reflux disease (GERD. While wrapping a Penrose drain around the esophagus, the patient had a cardiorespiratory arrest. Attempts to remove the Penrose drain were unsuccessful and the surgical procedure was terminated due to patient's condition. Four months later, after a long period of dysphagia and abdominal pain, the Penrose drain was defecated via rectum.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-01-01

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio. PMID:29562628

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks.

Science.gov (United States)

Wu, Shaobo; Chou, Wusheng; Niu, Jianwei; Guizani, Mohsen

2018-03-18

Wireless sensor networks (WSNs) involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector) path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Delay-Aware Energy-Efficient Routing towards a Path-Fixed Mobile Sink in Industrial Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shaobo Wu

2018-03-01

Full Text Available Wireless sensor networks (WSNs involve more mobile elements with their widespread development in industries. Exploiting mobility present in WSNs for data collection can effectively improve the network performance. However, when the sink (i.e., data collector path is fixed and the movement is uncontrollable, existing schemes fail to guarantee delay requirements while achieving high energy efficiency. This paper proposes a delay-aware energy-efficient routing algorithm for WSNs with a path-fixed mobile sink, named DERM, which can strike a desirable balance between the delivery latency and energy conservation. We characterize the object of DERM as realizing the energy-optimal anycast to time-varying destination regions, and introduce a location-based forwarding technique tailored for this problem. To reduce the control overhead, a lightweight sink location calibration method is devised, which cooperates with the rough estimation based on the mobility pattern to determine the sink location. We also design a fault-tolerant mechanism called track routing to tackle location errors for ensuring reliable and on-time data delivery. We comprehensively evaluate DERM by comparing it with two canonical routing schemes and a baseline solution presented in this work. Extensive evaluation results demonstrate that DERM can provide considerable energy savings while meeting the delay constraint and maintaining a high delivery ratio.

Computing paths and cycles in biological interaction graphs

Directory of Open Access Journals (Sweden)

von Kamp Axel

2009-06-01

Full Text Available Abstract Background Interaction graphs (signed directed graphs provide an important qualitative modeling approach for Systems Biology. They enable the analysis of causal relationships in cellular networks and can even be useful for predicting qualitative aspects of systems dynamics. Fundamental issues in the analysis of interaction graphs are the enumeration of paths and cycles (feedback loops and the calculation of shortest positive/negative paths. These computational problems have been discussed only to a minor extent in the context of Systems Biology and in particular the shortest signed paths problem requires algorithmic developments. Results We first review algorithms for the enumeration of paths and cycles and show that these algorithms are superior to a recently proposed enumeration approach based on elementary-modes computation. The main part of this work deals with the computation of shortest positive/negative paths, an NP-complete problem for which only very few algorithms are described in the literature. We propose extensions and several new algorithm variants for computing either exact results or approximations. Benchmarks with various concrete biological networks show that exact results can sometimes be obtained in networks with several hundred nodes. A class of even larger graphs can still be treated exactly by a new algorithm combining exhaustive and simple search strategies. For graphs, where the computation of exact solutions becomes time-consuming or infeasible, we devised an approximative algorithm with polynomial complexity. Strikingly, in realistic networks (where a comparison with exact results was possible this algorithm delivered results that are very close or equal to the exact values. This phenomenon can probably be attributed to the particular topology of cellular signaling and regulatory networks which contain a relatively low number of negative feedback loops. Conclusion The calculation of shortest positive

Shortest Path Problems in a Stochastic and Dynamic Environment

National Research Council Canada - National Science Library

Cho, Jae

2003-01-01

.... Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network...

The health workforce crisis: the brain drain scourge.

Science.gov (United States)

Ike, Samuel O

2007-01-01

The magnitude of the health workforce crisis engendered by brain drain particularly in Africa, and nay more especially Nigeria, has been assuming increasingly alarming proportions in the past three decades. The challenge it poses in meeting the manpower needs in the healthcare sector as well as in the larger economy of the sending countries is enormous. This paper thus sets out to highlight the scope of this brain drain, its effects and the reasons sustaining it, as well as makes concrete suggestions to help stern the tide. A review of the literature on brain drain with particular emphasis on the health workforce sector was done, with focus on Africa, and specifically Nigeria. Literature search was done using mainly the Medline, as well as local journals. The historical perspectives, with the scope of external and internal brain drain are explored. The glaring effects of brain drain both in the global workforce terrain and specifically in the health sectors are portrayed. The countries affected most and the reasons for brain drain are outlined. Strategic steps to redress the brain drain crisis are proffered in this paper. The health workforce crisis resulting from brain drain must be brought to the front-burner of strategic policy decisions leading to paradigm shift in political, social and economic conditions that would serve as incentives to curb the scourge.

A new specifically designed forceps for chest drain insertion.

LENUS (Irish Health Repository)

Andrews, Emmet

2012-02-03

Insertion of a chest drain can be associated with serious complications. It is recommended that the drain is inserted with blunt dissection through the chest wall but there is no specific instrument to aid this task. We describe a new reusable forceps that has been designed specifically to facilitate the insertion of chest drains.A feasibility study of its use in patients who required a chest drain as part of elective cardiothoracic operations was undertaken. The primary end-point was successful and accurate placement of the drain. The operators also completed a questionnaire rating defined aspects of the procedure. The new instrument was used to insert the chest drain in 30 patients (19 male, 11 female; median age 61.5 years (range 16-81 years)). The drain was inserted successfully without the trocar in all cases and there were no complications. Use of the instrument rated as significantly easier relative to experience of previous techniques in all specified aspects. The new device can be used to insert intercostal chest drains safely and efficiently without using the trocar or any other instrument.

Device for discharging drain in a control rod driving apparatus

International Nuclear Information System (INIS)

Ikeda, Tadasu; Ikuta, Takuzo; Yoshida, Tomiji; Tsukahara, Katsumi.

1975-01-01

Object: To efficiently and safely collect and discharge drain by a simple construction in which a drain cover and a drain tank in a control rod driving apparatus are integrally formed, and an overhauling wrench of said apparatus and a drain hose are mounted on the drain tank. Structure: When a mounting bolt is untightened by a torque wrench so as to be removed from a flange surface of the control rod driving apparatus in a nuclear reactor, axial movement of said apparatus is absorbed by a spring so that drain containing a radioactive material is discharged into a drain tank through the flange surface of said apparatus and is then guided into a collecting tank through a drain hose. (Kamimura, M.)

Does the suction drain diameter matter? Bleeding analysis after total knee replacement comparing different suction drain gauges

Directory of Open Access Journals (Sweden)

Marcos George de Souza Leao

Full Text Available ABSTRACT OBJECTIVES: To evaluate bleeding and the estimated blood loss in patients who underwent total knee replacement (TKR with different closed suction drains (3.2-mm and 4.8-mm gauge. METHODS: This was a randomized controlled trial with 22 patients who underwent TKR and were divided into two groups: Group I, with 11 patients in whom the 3.2-mm suction drain was used, and Group II, with 11 patients in whom the 4.8-mm suction drain was used. The hematocrit was measured after 24, 48 and 72 h after surgery in order to calculate the estimated blood loss. The drained volume was measured 3, 6, 12, 24, and 48 h after TKR, and thereafter both groups were compared. RESULTS: Regarding the hematocrit, there were no differences between groups in measured periods (24, 48, and 72 h after surgery. The total bleeding measured at the suction drains within 48 h was higher in Group II, with a statistically significant difference (p = 0.005; in the first 24 h, there was major bleeding in Group II (mean 893 mL, with a significant difference (p = 0.004. Between 24 and 48 h, there was no statistically significant difference in both groups (p = 0.710. The total estimated bleeding was higher in Group I, with mean of 463 mL, versus 409 mL in Group II, with no statistical significance (p = 0.394. CONCLUSIONS: Bleeding was higher in the group that used the 4.8 mm gauge suction drain, with no differences in hematocrit and estimated blood loss.

Timing of Re-Transfusion Drain Removal Following Total Knee Replacement

Science.gov (United States)

Leeman, MF; Costa, ML; Costello, E; Edwards, D

2006-01-01

INTRODUCTION The use of postoperative drains following total knee replacement (TKR) has recently been modified by the use of re-transfusion drains. The aim of our study was to investigate the optimal time for removal of re-transfusion drains following TKR. PATIENTS AND METHODS The medical records of 66 patients who had a TKR performed between October 2003 and October 2004 were reviewed; blood drained before 6 h and the total volume of blood drained was recorded. RESULTS A total of 56 patients had complete records of postoperative drainage. The mean volume of blood collected in the drain in the first 6 h was 442 ml. The mean total volume of blood in the drain was 595 ml. Therefore, of the blood drained, 78% was available for transfusion. CONCLUSION Re-transfusion drains should be removed after 6 h, when no further re-transfusion is permissible. PMID:16551400

Laparoscopic radical prostatectomy: omitting a pelvic drain

Directory of Open Access Journals (Sweden)

David Canes

2008-03-01

Full Text Available PURPOSE: Our goal was to assess outcomes of a selective drain placement strategy during laparoscopic radical prostatectomy (LRP with a running urethrovesical anastomosis (RUVA using cystographic imaging in all patients. Materials and Methods: A retrospective chart review was performed for all patients undergoing LRP between January 2003 and December 2004. The anastomosis was performed using a modified van Velthoven technique. A drain was placed at the discretion of the senior surgeon when a urinary leak was demonstrated with bladder irrigation, clinical suspicion for a urinary leak was high, or a complex bladder neck reconstruction was performed. Routine postoperative cystograms were obtained. RESULTS: 208 patients underwent LRP with a RUVA. Data including cystogram was available for 206 patients. The overall rate of cystographic urine leak was 5.8%. A drain was placed in 51 patients. Of these, 8 (15.6% had a postoperative leak on cystogram. Of the 157 undrained patients, urine leak was radiographically visible in 4 (2.5%. The higher leak rate in the drained vs. undrained cohort was statistically significant (p = 0.002. Twenty-four patients underwent pelvic lymph node dissection (8 drained, 16 undrained. Three undrained patients developed lymphoceles, which presented clinically on average 3 weeks postoperatively. There were no urinomas or hematomas in either group. CONCLUSIONS: Routine placement of a pelvic drain after LRP with a RUVA is not necessary, unless the anastomotic integrity is suboptimal intraoperatively. Experienced clinical judgment is essential and accurate in identifying patients at risk for postoperative leakage. When suspicion is low, omitting a drain does not increase morbidity.

Exploring Embedded Path Capacity Estimation in TCP Receiver

NARCIS (Netherlands)

Marcondes, Cesar; Sanadidi, M.Y.; Gerla, Mario; Martinello, Magnos; de Souza Schwartz, Ramon

2007-01-01

Accurate estimation of network characteristics, such as capacity, based on non-intrusive measurements is a fundamental desire of several applications. For instance, P2P applications that build overlay networks can use path capacity for optimizing network performance. We present a simple technique to

46 CFR 45.157 - Scuppers and gravity drains.

Science.gov (United States)

2010-10-01

... 46 Shipping 2 2010-10-01 2010-10-01 false Scuppers and gravity drains. 45.157 Section 45.157 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) LOAD LINES GREAT LAKES LOAD LINES Conditions of Assignment § 45.157 Scuppers and gravity drains. Scuppers and gravity deck drains from spaces...

Current practice patterns of drain usage amongst UK and Irish surgeons performing bilateral breast reductions: Evidence down the drain.

Science.gov (United States)

Sugrue, Conor M; McInerney, Niall; Joyce, Cormac W; Jones, Deidre; Hussey, Alan J; Kelly, Jack L; Kerin, Michael J; Regan, Padraic J

2015-01-01

Bilateral breast reduction (BBR) is one of the most frequently performed female breast operations. Despite no evidence supporting efficacy of drain usage in BBRs, postoperative insertion is common. Recent high quality evidence demonstrating potential harm from drain use has subsequently challenged this traditional practice. The aim of this study is to assess the current practice patterns of drains usage by Plastic & Reconstructive and Breast Surgeons in UK and Ireland performing BBRs. An 18 question survey was created evaluating various aspects of BBR practice. UK and Irish Plastic & Reconstructive and Breast Surgeons were invited to participate by an email containing a link to a web-based survey. Statistical analysis was performed with student t-test and chi-square test. Two hundred and eleven responding surgeons were analysed, including 80.1% (171/211) Plastic Surgeons and 18.9% (40/211) Breast Surgeons. Of the responding surgeons, 71.6% (151/211) routinely inserted postoperative drains, for a mean of 1.32 days. Drains were used significantly less by surgeons performing ≥20 BBRs (p = 0.02). With the majority of BBRs performed as an inpatient procedure, there was a trend towards less drain usage in surgeons performing this procedure as an outpatient; however, this was not statistically significant (p = 0.07). Even with the high level of evidence demonstrating the safety of BBR without drains, they are still routinely utilised. In an era of evidence- based medicine, surgeons performing breast reductions must adopt the results from scientific research into their clinical practice.

QUALIFIED VERSION OF MIGRATION: BRAIN DRAIN

Directory of Open Access Journals (Sweden)

Ayhan GENCLER

2009-07-01

Full Text Available Though globalization suggests an international exchange of people besides goods and capital, developed countries often tended to put forward some restrictions on the migration of workers from developed countries. However, there has been an increase in skilled international migration especially during the last two decades. Skilled international migration or brain drain points out the emigration of educated and highly skilled workers. It seems that, in general, developing or underdeveloped countries experience the negative consequences of the brain drain and suffer from the decreases in their human capital. The paper explains the phenomenon of skilled international migration, or brain drain, and summarizes the main global trends in this area.

The management of vacuum neck drains in head and neck surgery and the comparison of two different practice protocols for drain removal.

Science.gov (United States)

Kasbekar, A V; Davies, F; Upile, N; Ho, M W; Roland, N J

2016-01-01

Introduction The management of vacuum neck drains in head and neck surgery is varied. We aimed to improve early drain removal and therefore patient discharge in a safe and effective manner. Methods The postoperative management of head and neck surgical patients with vacuum neck drains was reviewed retrospectively. A new policy was then implemented to measure drainage three times daily (midnight, 6am, midday). The decision for drain removal was based on the most recent drainage period (at Measuring drainage volumes three times daily allows for more accurate assessment of wound drainage, and this can lead to earlier removal of neck drains and safe discharge.

Generation of airborne Listeria innocua from model floor drains.

Science.gov (United States)

Berrang, Mark E; Frank, Joseph F

2012-07-01

Listeria monocytogenes can colonize floor drains in poultry processing and further processing facilities, remaining present even after cleaning and disinfection. Therefore, during wash down, workers exercise caution to avoid spraying hoses directly into drains in an effort to prevent the escape and transfer of drain microflora to food contact surfaces. The objective of this study was to examine the extent to which an inadvertent water spray into a colonized floor drain can cause the spread of airborne Listeria. Listeria innocua was used to inoculate a polyvinyl chloride model floor drain, resulting in approximately 10(8) cells per ml of phosphate-buffered saline and 10(4) attached cells per square centimeter of inner surface. Each model drain was subjected to a 2-s spray of tap water at 68.9 kPa from a distance of 1 m. Drains were sprayed while filled and again after emptying. Airborne cells were collected by using sedimentation plates containing Listeria selective agar which were placed on the floor and walls of a contained room at incremental horizontal and vertical distances of 0.6, 1.2, 2.4, or 4.0 m from the drain. Sedimentation plates were exposed for 10 min. A mechanical sampler was used to also collect air by impaction on the surface of Listeria selective agar to determine the number of cells per liter of air. The experiment was conducted in triplicate rooms for each of four replications. L. innocua was detected on sedimentation plates on the floor as far as 4.0 m from the drain and on walls as high as 2.4 m above the floor and 4 m from the drain. A 2-s spray with a water hose into a contaminated drain can cause airborne spread of Listeria, resulting in the potential for cross-contamination of food contact surfaces, equipment, and exposed product.

Effect of Post Treatment For Cu-Cr Source/Drain Electrodes on a-IGZO TFTs.

Science.gov (United States)

Hu, Shiben; Fang, Zhiqiang; Ning, Honglong; Tao, Ruiqiang; Liu, Xianzhe; Zeng, Yong; Yao, Rihui; Huang, Fuxiang; Li, Zhengcao; Xu, Miao; Wang, Lei; Lan, Linfeng; Peng, Junbiao

2016-07-27

We report a high-performance amorphous Indium-Gallium-Zinc-Oxide (a-IGZO) thin-film transistor (TFT) with new copper-chromium (Cu-Cr) alloy source/drain electrodes. The TFT shows a high mobility of 39.4 cm 2 ·V - 1 ·s - 1 a turn-on voltage of -0.8 V and a low subthreshold swing of 0.47 V/decade. Cu diffusion is suppressed because pre-annealing can protect a-IGZO from damage during the electrode sputtering and reduce the copper diffusion paths by making film denser. Due to the interaction of Cr with a-IGZO, the carrier concentration of a-IGZO, which is responsible for high mobility, rises.

Optical network control plane for multi-domain networking

DEFF Research Database (Denmark)

Manolova, Anna Vasileva

This thesis focuses on multi-domain routing for traffice engineering and survivability support in optical transport networks under the Generalized Multi-Protocol Label Switching (GMPLS) control framework. First, different extensions to the Border Gateway Protocol for multi-domain Traffic...... process are not enough for efficient TE in mesh multi-domain networks. Enhancing the protocol with multi-path dissemination capability, combined with the employment of an end-to-end TE metric proves to be a highly efficient solution. Simulation results show good performance characteristics of the proposed...... is not as essential for improved network performance as the length of the provided paths. Second, the issue of multi-domain survivability support is analyzed. An AS-disjoint paths is beneficial not only for resilience support, but also for facilitating adequate network reactions to changes in the network, which...

A Simplified Network Model for Travel Time Reliability Analysis in a Road Network

Directory of Open Access Journals (Sweden)

Kenetsu Uchida

2017-01-01

Full Text Available This paper proposes a simplified network model which analyzes travel time reliability in a road network. A risk-averse driver is assumed in the simplified model. The risk-averse driver chooses a path by taking into account both a path travel time variance and a mean path travel time. The uncertainty addressed in this model is that of traffic flows (i.e., stochastic demand flows. In the simplified network model, the path travel time variance is not calculated by considering all travel time covariance between two links in the network. The path travel time variance is calculated by considering all travel time covariance between two adjacent links in the network. Numerical experiments are carried out to illustrate the applicability and validity of the proposed model. The experiments introduce the path choice behavior of a risk-neutral driver and several types of risk-averse drivers. It is shown that the mean link flows calculated by introducing the risk-neutral driver differ as a whole from those calculated by introducing several types of risk-averse drivers. It is also shown that the mean link flows calculated by the simplified network model are almost the same as the flows calculated by using the exact path travel time variance.

Fallopian Tube Herniation through Left Sided Abdominal Drain Site.

Science.gov (United States)

Hussain, Khalid; Masood, Jovaria

2016-06-01

Intra-abdominal drains have been used since long to prevent intra-abdominal collection, and detect any anastomotic leaks. We report a case of left sided fallopian tube herniation from a left lower abdominal drain site in a 27-year female who underwent caesarian section for breach presentation. Several complications related to drain usage has been described but left sided fallopian tube prolapse through drain site has not been reported in literature.

Refugee flow or brain-drain? The humanitarian policy and post-Tiananmen mainland Chinese immigration to Canada.

Science.gov (United States)

Liu X-f

1997-03-01

"The humanitarian policy that the Canadian government implemented in response to the 1989 Tiananmen Square crackdown changed a migration system primarily based on personal networks into a brain drain. Post-Tiananmen mainland Chinese immigrants (MCIs) were better educated than those arriving in Canada previously. Among the post-Tiananmen MCIs, those who landed under the policy were better educated than those landing in other categories. The analysis suggests that post-Tiananmen MCIs represented a brain-drain rather than a refugee flow, that the humanitarian policy implicitly contained ideological and human capital concerns in addition to humanitarian concerns, and that Canada benefited from the policy by obtaining human capital as well as satisfying its humanitarian obligations and ideological aspirations." excerpt

Nutrient Concentrations and Stable Isotopes of Runoff from a Midwest Tile-Drained Corn Field

Science.gov (United States)

Wilkins, B. P.; Woo, D.; Li, J.; Michalski, G. M.; Kumar, P.; Conroy, J. L.; Keefer, D. A.; Keefer, L. L.; Hodson, T. O.

2017-12-01

Tile drains are a common crop drainage device used in Midwest agroecosystems. While efficient at drainage, the tiles provide a quick path for nutrient runoff, reducing the time available for microbes to use nutrients (e.g., NO3- and PO43-) and reduce export to riverine systems. Thus, understanding the effects of tile drains on nutrient runoff is critical to achieve nutrient reduction goals. Here we present isotopic and concentration data collected from tile drain runoff of a corn field located near Monticello, IL. Tile flow samples were measured for anion concentrations and stable isotopes of H2O and NO3-, while precipitation was measured for dual isotopes of H2O. Results demonstrate early tile flow from rain events have a low Cl- concentration (60% contribution) in the beginning of the hydrograph. As flow continues H2O isotopic values reflect pre-event water (ground and soil water), and Cl- concentrations increase representing a greater influence by matrix flow (60-90% contribution). Nitrate concentrations change dramatically, especially during the growing season, and do not follow a similar trend as the conservative Cl-, often decreasing days before, which represents missing nitrate in the upper surface portion of the soil. Nitrate isotopic data shows significant changes in 15N (4‰) and 18O (4‰) during individual hydrological events, representing that in addition to plant uptake and leaching, considerate NO3- is lost through denitrification. It is notable, that throughout the season d15N and d18O of nitrate change significantly representing that seasonally, substantial denitrification occurs.

Fallopian Tube Herniation: An Unusual Complication of Surgical Drain

OpenAIRE

Sharma, Lipi; Singh, Alpana; Bhaskaran, Sruthi; Radhika, A. G.; Radhakrishnan, Gita

2012-01-01

Background. Surgical drains have been used since time immemorial, but their use is not without complications. By presenting this case we aim to describe an uncommon complication of herniation of fallopian tube following the simple procedure of surgical drain removal. Case Presentation. This case describes a 23-year G2P1L1 who underwent an emergency cesarean section for obstructed labor with intraperitoneal drain insertion. The patient had an uneventful postoperative period, drain was removed ...

A link prediction method for heterogeneous networks based on BP neural network

Science.gov (United States)

Li, Ji-chao; Zhao, Dan-ling; Ge, Bing-Feng; Yang, Ke-Wei; Chen, Ying-Wu

2018-04-01

Most real-world systems, composed of different types of objects connected via many interconnections, can be abstracted as various complex heterogeneous networks. Link prediction for heterogeneous networks is of great significance for mining missing links and reconfiguring networks according to observed information, with considerable applications in, for example, friend and location recommendations and disease-gene candidate detection. In this paper, we put forward a novel integrated framework, called MPBP (Meta-Path feature-based BP neural network model), to predict multiple types of links for heterogeneous networks. More specifically, the concept of meta-path is introduced, followed by the extraction of meta-path features for heterogeneous networks. Next, based on the extracted meta-path features, a supervised link prediction model is built with a three-layer BP neural network. Then, the solution algorithm of the proposed link prediction model is put forward to obtain predicted results by iteratively training the network. Last, numerical experiments on the dataset of examples of a gene-disease network and a combat network are conducted to verify the effectiveness and feasibility of the proposed MPBP. It shows that the MPBP with very good performance is superior to the baseline methods.

Thailand and brain drain

Directory of Open Access Journals (Sweden)

Terry Commins

2009-01-01

Full Text Available Brain drain has been the subject of research since the 1960s. This research has been hampered by a lack of accurate data from both source and receiving countries on migration and on the losses and gains to developing economies of skilled migration. However, despite these handicaps, research has been able to clearly show that trends are changing and the effect this is having is usually quite different for individual source countries.Thailand, as a developing economy, could be regarded as a source country. Fortunately, Thailand has never ranked highly in terms of brain drain when compared to other states in Asia and while it may not be a significant problem it nonetheless needs to be monitored. Thailand is also somewhat unique in that the migration that has occurred has been almost equally split between secondary and tertiary educated Thais. Thailand also ranks low in terms of tertiary educated population who have migrated when compared to other countries in the region. Globalisation is having a profound effect on the migration of skilled workers. As trade becomes increasingly free, barriers to the movement of services or people are also freed. As the better educated are encouraged to think globally, so too will they be inclined to move globally into the world community.This paper examines Thailand’s position with respect to brain drain, some of the lessons we have learned and some of the steps that are being taken to minimise the impact of the loss of skilled workers, with a particular focus on science and technology. The conclusion is that brain drain should not be viewed as an entirely negative development and that the positive outcomes should be recognised, encouraged and incorporated into policy.

Evolvable Neuronal Paths: A Novel Basis for Information and Search in the Brain

Science.gov (United States)

Fernando, Chrisantha; Vasas, Vera; Szathmáry, Eörs; Husbands, Phil

2011-01-01

We propose a previously unrecognized kind of informational entity in the brain that is capable of acting as the basis for unlimited hereditary variation in neuronal networks. This unit is a path of activity through a network of neurons, analogous to a path taken through a hidden Markov model. To prove in principle the capabilities of this new kind of informational substrate, we show how a population of paths can be used as the hereditary material for a neuronally implemented genetic algorithm, (the swiss-army knife of black-box optimization techniques) which we have proposed elsewhere could operate at somatic timescales in the brain. We compare this to the same genetic algorithm that uses a standard ‘genetic’ informational substrate, i.e. non-overlapping discrete genotypes, on a range of optimization problems. A path evolution algorithm (PEA) is defined as any algorithm that implements natural selection of paths in a network substrate. A PEA is a previously unrecognized type of natural selection that is well suited for implementation by biological neuronal networks with structural plasticity. The important similarities and differences between a standard genetic algorithm and a PEA are considered. Whilst most experiments are conducted on an abstract network model, at the conclusion of the paper a slightly more realistic neuronal implementation of a PEA is outlined based on Izhikevich spiking neurons. Finally, experimental predictions are made for the identification of such informational paths in the brain. PMID:21887266

On the reachability and observability of path and cycle graphs

OpenAIRE

Parlangeli, Gianfranco; Notarstefano, Giuseppe

2011-01-01

In this paper we investigate the reachability and observability properties of a network system, running a Laplacian based average consensus algorithm, when the communication graph is a path or a cycle. More in detail, we provide necessary and sufficient conditions, based on simple algebraic rules from number theory, to characterize all and only the nodes from which the network system is reachable (respectively observable). Interesting immediate corollaries of our results are: (i) a path graph...

A Dynamic Hidden Forwarding Path Planning Method Based on Improved Q-Learning in SDN Environments

Directory of Open Access Journals (Sweden)

Yun Chen

2018-01-01

Full Text Available Currently, many methods are available to improve the target network’s security. The vast majority of them cannot obtain an optimal attack path and interdict it dynamically and conveniently. Almost all defense strategies aim to repair known vulnerabilities or limit services in target network to improve security of network. These methods cannot response to the attacks in real-time because sometimes they need to wait for manufacturers releasing corresponding countermeasures to repair vulnerabilities. In this paper, we propose an improved Q-learning algorithm to plan an optimal attack path directly and automatically. Based on this path, we use software-defined network (SDN to adjust routing paths and create hidden forwarding paths dynamically to filter vicious attack requests. Compared to other machine learning algorithms, Q-learning only needs to input the target state to its agents, which can avoid early complex training process. We improve Q-learning algorithm in two aspects. First, a reward function based on the weights of hosts and attack success rates of vulnerabilities is proposed, which can adapt to different network topologies precisely. Second, we remove the actions and merge them into every state that reduces complexity from O(N3 to O(N2. In experiments, after deploying hidden forwarding paths, the security of target network is boosted significantly without having to repair network vulnerabilities immediately.

Drain Insertion in Chronic Subdural Hematoma: An International Survey of Practice.

Science.gov (United States)

Soleman, Jehuda; Kamenova, Maria; Lutz, Katharina; Guzman, Raphael; Fandino, Javier; Mariani, Luigi

2017-08-01

To investigate whether, after the publication of grade I evidence that it reduces recurrence rates, the practice of drain insertion after burr-hole drainage of chronic subdural hematoma has changed. Further, we aimed to document various practice modalities concerning the insertion of a drain adopted by neurosurgeons internationally. We administered a survey to neurosurgeons worldwide with questions relating to the surgical treatment of chronic subdural hematoma, with an emphasis on their practices concerning the use of a drain. The preferred surgical technique was burr-hole drainage (89%). Most surgeons prefer to place a drain (80%), whereas in 56% of the cases the reason for not placing a drain was brain expansion after evacuation. Subdural drains are placed by 50% and subperiosteal drains by 27% of the responders, whereas 23% place primarily a subdural drain if possible and otherwise a subperiosteal drain. Three quarters of the responders leave the drain for 48 hours and give prophylactic antibiotic treatment, mostly a single-shot dose intraoperatively (70%). Routine postoperative computed tomography is done by 59% mostly within 24-48 hours after surgery (94%). Adjunct treatment to surgery rarely is used (4%). The publication of grade I evidence in favor of drain use influenced positively this practice worldwide. Some surgeons are still reluctant to insert a drain, especially when the subdural space is narrow after drainage of the hematoma. The insertion of a subperiosteal drain could be a good alternative solution. However, its outcome and efficacy must be evaluated in larger studies. Copyright © 2017 Elsevier Inc. All rights reserved.

A synthesis of the impacts of ditch network maintenance on the quantity and quality of runoff from drained boreal peatland forests.

Science.gov (United States)

Nieminen, Mika; Palviainen, Marjo; Sarkkola, Sakari; Laurén, Ari; Marttila, Hannu; Finér, Leena

2017-10-29

Drained peatlands are an important source of forest biomass in boreal regions and ditch network maintenance (DNM) operations may be needed to restore the drainage functions of ditches. By reviewing the available literature, as well as utilizing an existing hydrological model and analyzing the characteristics of eroded sediments, we assessed the impacts of DNM on runoff and exports of suspended solids (SS), dissolved organic carbon (DOC), nitrogen (N), and phosphorus (P). In general, DNM had minor impact on runoff and dissolved N and P, and it decreased rather than increased DOC exports. To increase the understanding of the hydrochemical impacts of DNM, future research should focus on the characteristics of SS and particulate nutrient exports. A major gap in knowledge is also the very limited regional representativeness of the available studies. High erosion risk in the ditches reaching the mineral soil below peat should be acknowledged when planning mitigation measures.

A study of the complications of small bore 'Seldinger' intercostal chest drains.

Science.gov (United States)

Davies, Helen E; Merchant, Shairoz; McGown, Anne

2008-06-01

Use of small bore chest drains (drainage over a 12-month period. One hundred consecutive small bore Seldinger (12F) chest drain insertions were evaluated. Few serious complications occurred. However, 21% of the chest drains were displaced ('fell out') and 9% of the drains became blocked. This contributed to high morbidity rates, with 13% of patients requiring repeat pleural procedures. The frequency of drain blockage in pleural effusion was reduced by administration of regular normal saline drain flushes (odds ratio for blockage in flushed drains compared with non-flushed drains 0.04, 95% CI: 0.01-0.37, P < 0.001). Regular chest drain flushes are advocated in order to reduce rates of drain blockage, and further studies are needed to determine optimal fixation strategies that may reduce associated patient morbidity.

A NEURAL NETWORK BASED TRAFFIC-AWARE FORWARDING STRATEGY IN NAMED DATA NETWORKING

Directory of Open Access Journals (Sweden)

Parisa Bazmi

2016-11-01

Full Text Available Named Data Networking (NDN is a new Internet architecture which has been proposed to eliminate TCP/IP Internet architecture restrictions. This architecture is abstracting away the notion of host and working based on naming datagrams. However, one of the major challenges of NDN is supporting QoS-aware forwarding strategy so as to forward Interest packets intelligently over multiple paths based on the current network condition. In this paper, Neural Network (NN Based Traffic-aware Forwarding strategy (NNTF is introduced in order to determine an optimal path for Interest forwarding. NN is embedded in NDN routers to select next hop dynamically based on the path overload probability achieved from the NN. This solution is characterized by load balancing and QoS-awareness via monitoring the available path and forwarding data on the traffic-aware shortest path. The performance of NNTF is evaluated using ndnSIM which shows the efficiency of this scheme in terms of network QoS improvementof17.5% and 72% reduction in network delay and packet drop respectively.

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

Directory of Open Access Journals (Sweden)

Huanlin Liu

2014-01-01

Full Text Available Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the former K shortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

Drain Back, Low Flow Solar Combi Systems

DEFF Research Database (Denmark)

Perers, Bengt; Furbo, Simon; Fan, Jianhua

2014-01-01

Drain Back systems with ETC collectors are tested and analyzed in a Danish - Chinese cooperation project. Experiences from early work at DTU, with drain back, low flow systems, was used to design two systems: 1) One laboratory system at DTU and 2) One demonstration system in a single family house...... in Sorö Denmark. Detailed monitoring and modelling of the system in the DTU lab is done to be able to generalize the results, to other climates and loads and to make design optimizations. The advantage with drain back, low flow systems, is that the system can be made more simple with less components...... and that the performance can be enhanced. A combination of the drain back- and system expansion vessel was tested successfully. Small initial problems with installation and proposals for design improvements to avoid these in practice are described in the paper. Installer education and training is an important step to have...

Path Searching Based Fault Automated Recovery Scheme for Distribution Grid with DG

Science.gov (United States)

Xia, Lin; Qun, Wang; Hui, Xue; Simeng, Zhu

2016-12-01

Applying the method of path searching based on distribution network topology in setting software has a good effect, and the path searching method containing DG power source is also applicable to the automatic generation and division of planned islands after the fault. This paper applies path searching algorithm in the automatic division of planned islands after faults: starting from the switch of fault isolation, ending in each power source, and according to the line load that the searching path traverses and the load integrated by important optimized searching path, forming optimized division scheme of planned islands that uses each DG as power source and is balanced to local important load. Finally, COBASE software and distribution network automation software applied are used to illustrate the effectiveness of the realization of such automatic restoration program.

Circuital model for the spherical geodesic waveguide perfect drain

Science.gov (United States)

González, Juan C.; Grabovičkić, Dejan; Benítez, Pablo; Miñano, Juan C.

2012-08-01

The perfect drain for the Maxwell fish eye (MFE) is a non-magnetic dissipative region placed in the focal point to absorb all the incident radiation without reflection or scattering. The perfect drain was recently designed as a material with complex permittivity that depends on frequency. However, this material is only a theoretical material, so it cannot be used in practical devices. The perfect drain has been claimed as necessary for achieving super-resolution (Leonhardt 2009 New J. Phys. 11 093040), which has increased the interest in practical perfect drains suitable for manufacturing. Here, we present a practical perfect drain that is designed using a simple circuit (made of a resistance and a capacitor) connected to the coaxial line. Moreover, we analyze the super-resolution properties of a device equivalent to the MFE, known as a spherical geodesic waveguide, loaded with this perfect drain. The super-resolution analysis for this device is carried out using COMSOL Multiphysics. The results of simulations predict a super-resolution of up to λ/3000.

Circuital model for the spherical geodesic waveguide perfect drain

International Nuclear Information System (INIS)

González, Juan C; Grabovičkić, Dejan; Benítez, Pablo; Miñano, Juan C

2012-01-01

The perfect drain for the Maxwell fish eye (MFE) is a non-magnetic dissipative region placed in the focal point to absorb all the incident radiation without reflection or scattering. The perfect drain was recently designed as a material with complex permittivity that depends on frequency. However, this material is only a theoretical material, so it cannot be used in practical devices. The perfect drain has been claimed as necessary for achieving super-resolution (Leonhardt 2009 New J. Phys. 11 093040), which has increased the interest in practical perfect drains suitable for manufacturing. Here, we present a practical perfect drain that is designed using a simple circuit (made of a resistance and a capacitor) connected to the coaxial line. Moreover, we analyze the super-resolution properties of a device equivalent to the MFE, known as a spherical geodesic waveguide, loaded with this perfect drain. The super-resolution analysis for this device is carried out using COMSOL Multiphysics. The results of simulations predict a super-resolution of up to λ/3000. (paper)

Method of processing laundry drain

Energy Technology Data Exchange (ETDEWEB)

Sugimoto, Y; Oda, A; Yusa, H; Kitamura, M; Horiuchi, S

1979-09-28

Purpose: To subject the laundry drain to flocculation precipitation treatment in the prior stage of an inverse osmotic treatment, and subject only the supernatant to the inverse osmotic treatment and the precipitate directly to the condensation treatment, thereby decreasing the frequency of exchange of the inverse osmotic membranes, and reducing the quantity of purifying water. Method: The laundry drain is supplied to a flocculation precipitation tank, and added and mixed with a flocculant and a neutralizing agent, thus being subjected to a flocculation precipitation treatment. The supernatant is transported to a circulation tank through a transportation pipe, and is subjected to an inverse osmotic treatment in inverse osmotic module through the circulation tank, a filter and a high tension pump, and then returned to the circulation tank. The supernatant is thus concentrated to a predetermined concentration by repeating such operations. On the other hand, the precipitate at the bottom part of the flocculation precipitation tank is supplied through the transportation pipe to an evaporator supply tank together with the concentrate from the drain circulation tank, and evaporated and concentrated in the evaporator.

Evisceration of Appendix through the Drain Site: A Rare Case Report.

Science.gov (United States)

Ravishankaran, Praveen; Rajamani, A

2013-06-01

Placing a drain after surgery is a usual procedure in any emergency abdominal operation. The drain is removed as soon as its purpose of draining the intraabdominal collection in served. Evisceration of intraabdominal organs through the drain site is a rare occurance. This case report is about an 12 year old girl who was admitted with blunt trauma abdomen. After completion of emergency laparotomy a drain was placed in the right lower quadrant. When the drain was removed on the 6th post operative day, the appendix eviscerated out of the drain site. The wound was extended a little and an appendectomy was done. This case is presented for its rarity as only two similar instances have been reported in literature so far.

A NEW APPROACH ON SHORTEST PATH IN FUZZY ENVIRONMENT

OpenAIRE

A. Nagoorgani; A. Mumtaj Begam

2010-01-01

This paper introduces a new type of fuzzy shortest path network problem using triangular fuzzy number. To find the smallest edge by the fuzzy distance using graded mean integration representation of generalized fuzzy number for every node. Thus the optimum shortest path for the given problem is obtained.

Mechanical decontamination techniques for floor drain systems

International Nuclear Information System (INIS)

Palau, G.L.

1987-01-01

The unprecedented nature of cleanup activities at Three Mile Island Unit 2 (TMI-2) following the 1979 accident has necessitated the development of new techniques to deal with radiation and contamination in the plant. One of these problems was decontamination of floor drain systems, which had become highly contaminated with various forms of dirt and sludge containing high levels of fission products and fuel from the damaged reactor core. The bulk of this contamination is loosely adherent to the drain pipe walls; however, significant amounts of contamination have become incorporated into pipe wall oxide and corrosion layers and embedded in microscopic pits and fissures in the pipe wall material. The need to remove this contamination was recognized early in the TMI-2 cleanup effort. A program consisting of development and laboratory testing of floor drain decontamination techniques was undertaken early in the cleanup with support from the Electric Power Research Institute (EPRI). Based on this initial research, two techniques were judged to show promise for use at TMI-2: a rotating brush hone system and a high-pressure water mole nozzle system. Actual use of these devices to clean floor drains at TMI-2 has yielded mixed decontamination results. The decontamination effectiveness that has been obtained is highly dependent on the nature of the contamination in the drain pipe and the combination of decontamination techniques used

Brain drain of China and India

OpenAIRE

Li, Yuan

2012-01-01

Abstract Under the background of globalization, brain drain is a common phenomenon in many countries. Talents flow from developing countries to developed countries, and this phenomenon unavoidably exerts various and profound influences to both the source countries and the receiving countries. This thesis deals with the phenomenon of brain drain with the aim to investigate the phenomenon further and carry out two case studies of China and India. The research method is main...

The removal of blockage from a BWR bottom head drain line

International Nuclear Information System (INIS)

McGough, M.S.

1990-01-01

Low flow through the 2-inch schedule 160 bottom head drain line at Carolina Power and Light's Brunswick Unit 2 indicated that the line was probably plugged. Since this low flow condition had existed since startup, it was suspected that the plug consisted of construction debris. However, the makeup of the plug was unknown, and the suspected location was inaccessible for nondestructive examination techniques. Evaluation of techniques possible, both from the vessel ID and from outside the vessel resulted in the selection of a hot-tapping device and a self-propelled high-pressure water lance which was inserted in the trapped line from the undervessel area. Removal of the plug was complicated by undervessel space restrictions, dose rates, and the torturous path of elbows and horizontal and vertical pipe runs which had to be negotiated with the water lance. This paper describes the technique applied to this problem

Discovery of path nearby clusters in spatial networks

KAUST Repository

Shang, Shuo

2015-06-01

The discovery of regions of interest in large cities is an important challenge. We propose and investigate a novel query called the path nearby cluster (PNC) query that finds regions of potential interest (e.g., sightseeing places and commercial districts) with respect to a user-specified travel route. Given a set of spatial objects O (e.g., POIs, geo-tagged photos, or geo-tagged tweets) and a query route q , if a cluster c has high spatial-object density and is spatially close to q , it is returned by the query (a cluster is a circular region defined by a center and a radius). This query aims to bring important benefits to users in popular applications such as trip planning and location recommendation. Efficient computation of the PNC query faces two challenges: how to prune the search space during query processing, and how to identify clusters with high density effectively. To address these challenges, a novel collective search algorithm is developed. Conceptually, the search process is conducted in the spatial and density domains concurrently. In the spatial domain, network expansion is adopted, and a set of vertices are selected from the query route as expansion centers. In the density domain, clusters are sorted according to their density distributions and they are scanned from the maximum to the minimum. A pair of upper and lower bounds are defined to prune the search space in the two domains globally. The performance of the PNC query is studied in extensive experiments based on real and synthetic spatial data. © 2014 IEEE.

CSER 94-011: Use of glovebags for demister draining operations

International Nuclear Information System (INIS)

Hess, A.L.

1994-01-01

A criticality safety review is presented for the use of plastic-sheet glovebags for the operations of draining demisters on the 26-inch vacuum system headers. A criticality drain is required because of the possibility for spilling liquid of sufficient volume and fissile content for criticality. It is recommended that the glovebag design include a rigid, 2ft x 2ft floor with a central drain feeding a geometrically favorable spill-catch vessel, plus a screen grid above the bottom for drain protection

A Method of Forming the Optimal Set of Disjoint Path in Computer Networks

Directory of Open Access Journals (Sweden)

As'ad Mahmoud As'ad ALNASER

2017-04-01

Full Text Available This work provides a short analysis of algorithms of multipath routing. The modified algorithm of formation of the maximum set of not crossed paths taking into account their metrics is offered. Optimization of paths is carried out due to their reconfiguration with adjacent deadlock path. Reconfigurations are realized within the subgraphs including only peaks of the main and an adjacent deadlock path. It allows to reduce the field of formation of an optimum path and time complexity of its formation.

Draining after breast reduction: a randomised controlled inter-patient study

NARCIS (Netherlands)

Corion, Leonard U. M.; Smeulders, Mark J. C.; van Zuijlen, Paul P. M.; van der Horst, Chantal M. A. M.

2009-01-01

One hundred and seven bilateral breast reductions were prospectively randomised during surgery to receive or not receive wound drains. Fifty-five patients were randomised to have a drain and 52 to not have a drain. There was no statistical difference in the number of complications between the

Collectivism culture, HIV stigma and social network support in Anhui, China: a path analytic model.

Science.gov (United States)

Zang, Chunpeng; Guida, Jennifer; Sun, Yehuan; Liu, Hongjie

2014-08-01

HIV stigma is rooted in culture and, therefore, it is essential to investigate it within the context of culture. The objective of this study was to examine the interrelationships among individualism-collectivism, HIV stigma, and social network support. A social network study was conducted among 118 people living with HIVAIDS in China, who were infected by commercial plasma donation, a nonstigmatized behavior. The Individualism-Collectivism Interpersonal Assessment Inventory (ICIAI) was used to measure cultural norms and values in the context of three social groups, family members, friends, and neighbors. Path analyses revealed (1) a higher level of family ICIAI was significantly associated with a higher level of HIV self-stigma (β=0.32); (2) a higher level of friend ICIAI was associated with a lower level of self-stigma (β=-035); (3) neighbor ICIAI was associated with public stigma (β=-0.61); (4) self-stigman was associated with social support from neighbors (β=-0.27); and (5) public stigma was associated with social support from neighbors (β=-0.24). This study documents that HIV stigma may mediate the relationship between collectivist culture and social network support, providing an empirical basis for interventions to include aspects of culture into HIV intervention strategies.

Study of the patency of different peritoneal drains used prophylactically in bariatric surgery.

Science.gov (United States)

Salgado Júnior, Wilson; Macedo Neto, Marcelo Martins; dos Santos, José Sebastião; Sakarankutty, Ajith Kumar; Ceneviva, Reginaldo; de Castro e Silva, Orlando

2009-05-21

To compare the performance of different types of abdominal drains used in bariatric surgery. A vertical banded Roux-en-Y gastric bypass was performed in 33 morbidly obese patients. Drainage of the peritoneal cavity was performed in each case using three different types of drain selected in a randomized manner: a latex tubular drain, a Watterman tubulolaminar drain, and a silicone channeled drain. Drain permeability, contamination of the drained fluid, ease of handling, and patient discomfort were evaluated postoperatively over a period of 7 d. The patients with the silicone channeled drain had larger volumes of drainage compared to patients with tubular and tubulolaminar drains between the third and seventh postoperative days. In addition, a lower incidence of discomfort and of contamination with bacteria of a more pathogenic profile was observed in the patients with the silicone channeled drain. The silicone channeled drain was more comfortable and had less chance of occlusion, which is important in the detection of delayed dehiscence.

Tracing Technological Development Trajectories: A Genetic Knowledge Persistence-Based Main Path Approach.

Directory of Open Access Journals (Sweden)

Hyunseok Park

Full Text Available The aim of this paper is to propose a new method to identify main paths in a technological domain using patent citations. Previous approaches for using main path analysis have greatly improved our understanding of actual technological trajectories but nonetheless have some limitations. They have high potential to miss some dominant patents from the identified main paths; nonetheless, the high network complexity of their main paths makes qualitative tracing of trajectories problematic. The proposed method searches backward and forward paths from the high-persistence patents which are identified based on a standard genetic knowledge persistence algorithm. We tested the new method by applying it to the desalination and the solar photovoltaic domains and compared the results to output from the same domains using a prior method. The empirical results show that the proposed method can dramatically reduce network complexity without missing any dominantly important patents. The main paths identified by our approach for two test cases are almost 10x less complex than the main paths identified by the existing approach. The proposed approach identifies all dominantly important patents on the main paths, but the main paths identified by the existing approach miss about 20% of dominantly important patents.

A Comparison of the Cluster-Span Threshold and the Union of Shortest Paths as Objective Thresholds of EEG Functional Connectivity Networks from Beta Activity in Alzhaimer’s Disease

OpenAIRE

Smith, K; Abasolo, Daniel Emilio; Escudero, J

2016-01-01

The Cluster-Span Threshold (CST) is a recently introduced unbiased threshold for functional connectivity networks. This binarisation technique offers a natural trade-off of sparsity and density of information by balancing the ratio of closed to open triples in the network topology. Here we present findings comparing it with the Union of Shortest Paths (USP), another recently proposed objective method. We analyse standard network metrics of binarised networks for sensitivity to clinical Alzhei...

Intersection Recognition and Guide-Path Selection for a Vision-Based AGV in a Bidirectional Flow Network

Directory of Open Access Journals (Sweden)

Wu Xing

2014-03-01

Full Text Available Vision recognition and RFID perception are used to develop a smart AGV travelling on fixed paths while retaining low-cost, simplicity and reliability. Visible landmarks can describe features of shapes and geometric dimensions of lines and intersections, and RFID tags can directly record global locations on pathways and the local topological relations of crossroads. A topological map is convenient for building and editing without the need for accurate poses when establishing a priori knowledge of a workplace. To obtain the flexibility of bidirectional movement along guide-paths, a camera placed in the centre of the AGV looks downward vertically at landmarks on the floor. A small visual field presents many difficulties for vision guidance, especially for real-time, correct and reliable recognition of multi-branch crossroads. First, the region projection and contour scanning methods are both used to extract the features of shapes. Then LDA is used to reduce the number of the features' dimensions. Third, a hierarchical SVM classifier is proposed to classify their multi-branch patterns once the features of the shapes are complete. Our experiments in landmark recognition and navigation show that low-cost vision systems are insusceptible to visual noises, image breakages and floor changes, and a vision-based AGV can locate itself precisely on its paths, recognize different crossroads intelligently by verifying the conformance of vision and RFID information, and select its next pathway efficiently in a bidirectional flow network.

Minimum dose method for walking-path planning of nuclear facilities

International Nuclear Information System (INIS)

Liu, Yong-kuo; Li, Meng-kun; Xie, Chun-li; Peng, Min-jun; Wang, Shuang-yu; Chao, Nan; Liu, Zhong-kun

2015-01-01

Highlights: • For radiation environment, the environment model is proposed. • For the least dose walking path problem, a path-planning method is designed. • The path-planning virtual–real mixed simulation program is developed. • The program can plan walking path and simulate. - Abstract: A minimum dose method based on staff walking road network model was proposed for the walking-path planning in nuclear facilities. A virtual–reality simulation program was developed using C# programming language and Direct X engine. The simulation program was used in simulations dealing with virtual nuclear facilities. Simulation results indicated that the walking-path planning method was effective in providing safety for people walking in nuclear facilities

Current-Sensitive Path Planning for an Underactuated Free-Floating Ocean Sensorweb

Science.gov (United States)

Dahl, Kristen P.; Thompson, David R.; McLaren, David; Chao, Yi; Chien, Steve

2011-01-01

This work investigates multi-agent path planning in strong, dynamic currents using thousands of highly under-actuated vehicles. We address the specific task of path planning for a global network of ocean-observing floats. These submersibles are typified by the Argo global network consisting of over 3000 sensor platforms. They can control their buoyancy to float at depth for data collection or rise to the surface for satellite communications. Currently, floats drift at a constant depth regardless of the local currents. However, accurate current forecasts have become available which present the possibility of intentionally controlling floats' motion by dynamically commanding them to linger at different depths. This project explores the use of these current predictions to direct float networks to some desired final formation or position. It presents multiple algorithms for such path optimization and demonstrates their advantage over the standard approach of constant-depth drifting.

Modeling flow and solute transport at a tile drain field site by explicit representation of preferential flow structures: Equifinality and uncertainty

Science.gov (United States)

Zehe, E.; Klaus, J.

2011-12-01

Rapid flow in connected preferential flow paths is crucial for fast transport of water and solutes through soils, especially at tile drained field sites. The present study tests whether an explicit treatment of worm burrows is feasible for modeling water flow, bromide and pesticide transport in structured heterogeneous soils with a 2-dimensional Richards based model. The essence is to represent worm burrows as morphologically connected paths of low flow resistance and low retention capacity in the spatially highly resolved model domain. The underlying extensive database to test this approach was collected during an irrigation experiment, which investigated transport of bromide and the herbicide Isoproturon at a 900 sqm tile drained field site. In a first step we investigated whether the inherent uncertainty in key data causes equifinality i.e. whether there are several spatial model setups that reproduce tile drain event discharge in an acceptable manner. We found a considerable equifinality in the spatial setup of the model, when key parameters such as the area density of worm burrows and the maximum volumetric water flows inside these macropores were varied within the ranges of either our measurement errors or measurements reported in the literature. Thirteen model runs yielded a Nash-Sutcliffe coefficient of more than 0.9. Also, the flow volumes were in good accordance and peak timing errors where less than or equal to 20 min. In the second step we investigated thus whether this "equifinality" in spatial model setups may be reduced when including the bromide tracer data into the model falsification process. We simulated transport of bromide for the 13 spatial model setups, which performed best with respect to reproduce tile drain event discharge, without any further calibration. Four of this 13 model setups allowed to model bromide transport within fixed limits of acceptability. Parameter uncertainty and equifinality could thus be reduced. Thirdly, we selected

Discovery of path nearby clusters in spatial networks

KAUST Repository

Shang, Shuo; Zheng, Kai; Jensen, Christian S.; Yang, Bin; Kalnis, Panos; Li, Guohe; Wen, Ji Rong

2015-01-01

The discovery of regions of interest in large cities is an important challenge. We propose and investigate a novel query called the path nearby cluster (PNC) query that finds regions of potential interest (e.g., sightseeing places and commercial

Structural factoring approach for analyzing stochastic networks

Science.gov (United States)

Hayhurst, Kelly J.; Shier, Douglas R.

1991-01-01

The problem of finding the distribution of the shortest path length through a stochastic network is investigated. A general algorithm for determining the exact distribution of the shortest path length is developed based on the concept of conditional factoring, in which a directed, stochastic network is decomposed into an equivalent set of smaller, generally less complex subnetworks. Several network constructs are identified and exploited to reduce significantly the computational effort required to solve a network problem relative to complete enumeration. This algorithm can be applied to two important classes of stochastic path problems: determining the critical path distribution for acyclic networks and the exact two-terminal reliability for probabilistic networks. Computational experience with the algorithm was encouraging and allowed the exact solution of networks that have been previously analyzed only by approximation techniques.

Advances in chest drain management in thoracic disease

Science.gov (United States)

George, Robert S.

2016-01-01

An adequate chest drainage system aims to drain fluid and air and restore the negative pleural pressure facilitating lung expansion. In thoracic surgery the post-operative use of the conventional underwater seal chest drainage system fulfills these requirements, however they allow great variability amongst practices. In addition they do not offer accurate data and they are often inconvenient to both patients and hospital staff. This article aims to simplify the myths surrounding the management of chest drains following chest surgery, review current experience and explore the advantages of modern digital chest drain systems and address their disease-specific use. PMID:26941971

An Equal-Strain Analytical Solution for the Radial Consolidation of Unsaturated Soils by Vertical Drains considering Drain Resistance

Directory of Open Access Journals (Sweden)

Feng Zhou

2018-01-01

Full Text Available Developing an analytical solution for the consolidation of unsaturated soils remains a challenging task due to the complexity of coupled governing equations for air and water phases. This paper presents an equal-strain model for the radial consolidation of unsaturated soils by vertical drains, and the effect of drain resistance is also considered. Simplified governing equations are established, and an analytical solution to calculate the excess pore-air and pore-water pressures is derived by using the methods of matrix analysis and eigenfunction expansion. The average degrees of consolidation for air and water phases and the ground surface settlement are also given. The solutions of the equal-strain model are verified by comparing the proposed free-strain model with the equal-strain model, and reasonably good agreement is obtained. Moreover, parametric studies regarding the drain resistance effect are graphically presented.

Percutaneous Retrieval of a Retained Jackson-Pratt Drain Fragment

International Nuclear Information System (INIS)

Namyslowski, Jan; Halin, Neil J.; Greenfield, Alan J.

1996-01-01

A retained intraabdominal Jackson-Pratt drain fragment was percutaneously retrieved using an inflated angioplasty balloon that had been maneuvered inside of the drain lumen over a hydrophilic-coated steerable guidewire

Information communication on complex networks

International Nuclear Information System (INIS)

Igarashi, Akito; Kawamoto, Hiroki; Maruyama, Takahiro; Morioka, Atsushi; Naganuma, Yuki

2013-01-01

Since communication networks such as the Internet, which is regarded as a complex network, have recently become a huge scale and a lot of data pass through them, the improvement of packet routing strategies for transport is one of the most significant themes in the study of computer networks. It is especially important to find routing strategies which can bear as many traffic as possible without congestion in complex networks. First, using neural networks, we introduce a strategy for packet routing on complex networks, where path lengths and queue lengths in nodes are taken into account within a framework of statistical physics. Secondly, instead of using shortest paths, we propose efficient paths which avoid hubs, nodes with a great many degrees, on scale-free networks with a weight of each node. We improve the heuristic algorithm proposed by Danila et. al. which optimizes step by step routing properties on congestion by using the information of betweenness, the probability of paths passing through a node in all optimal paths which are defined according to a rule, and mitigates the congestion. We confirm the new heuristic algorithm which balances traffic on networks by achieving minimization of the maximum betweenness in much smaller number of iteration steps. Finally, We model virus spreading and data transfer on peer-to-peer (P2P) networks. Using mean-field approximation, we obtain an analytical formulation and emulate virus spreading on the network and compare the results with those of simulation. Moreover, we investigate the mitigation of information traffic congestion in the P2P networks.

Formal language constrained path problems

Energy Technology Data Exchange (ETDEWEB)

Barrett, C.; Jacob, R.; Marathe, M.

1997-07-08

In many path finding problems arising in practice, certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Motivated by such applications as intermodal transportation planning, the authors investigate the complexity of finding feasible paths in a labeled network, where the mode choice for each traveler is specified by a formal language. The main contributions of this paper include the following: (1) the authors show that the problem of finding a shortest path between a source and destination for a traveler whose mode choice is specified as a context free language is solvable efficiently in polynomial time, when the mode choice is specified as a regular language they provide algorithms with improved space and time bounds; (2) in contrast, they show that the problem of finding simple paths between a source and a given destination is NP-hard, even when restricted to very simple regular expressions and/or very simple graphs; (3) for the class of treewidth bounded graphs, they show that (i) the problem of finding a regular language constrained simple path between source and a destination is solvable in polynomial time and (ii) the extension to finding context free language constrained simple paths is NP-complete. Several extensions of these results are presented in the context of finding shortest paths with additional constraints. These results significantly extend the results in [MW95]. As a corollary of the results, they obtain a polynomial time algorithm for the BEST k-SIMILAR PATH problem studied in [SJB97]. The previous best algorithm was given by [SJB97] and takes exponential time in the worst case.

Dendritic Cell Migration to Skin-Draining Lymph Nodes Is Controlled by Dermatan Sulfate and Determines Adaptive Immunity Magnitude

Directory of Open Access Journals (Sweden)

Reza Nadafi

2018-02-01

Full Text Available For full activation of naïve adaptive lymphocytes in skin-draining lymph nodes (LNs, presentation of peptide:MHC complexes by LN-resident and skin-derived dendritic cells (DCs that encountered antigens (Ags is an absolute prerequisite. To get to the nearest draining LN upon intradermal immunization, DCs need to migrate from the infection site to the afferent lymphatics, which can only be reached by traversing a collagen-dense network located in the dermis of the skin through the activity of proteolytic enzymes. Here, we show that mice with altered collagen fibrillogenesis resulting in thicker collagen fibers in the skin display a reduced DC migration to the draining LN upon immune challenge. Consequently, the initiation of the cellular and humoral immune response was diminished. Ag-specific CD8+ and CD4+ T cells as well as Ag-specific germinal center B cells and serum immunoglobulin levels were significantly decreased. Hence, we postulate that alterations to the production of extracellular matrix, as seen in various connective tissue disorders, may in the end affect the qualitative outcome of adaptive immunity.

Laparoscopic elective cholecystectomy with and without drain: A controlled randomised trial

Directory of Open Access Journals (Sweden)

Gouda El-labban

2012-01-01

Full Text Available Background : Laparoscopic cholecystectomy is the main method of treatment of symptomatic gallstones. Routine drainage after laparoscopic cholecystectomy is an issue of considerable debate. Therefore, a controlled randomised trial was designed to assess the value of drains in elective laparoscopic cholecystectomy. Materials and Methods: During a two-year period (From April 2008 to January 2010, 80 patients were simply randomised to have a drain placed (group A, an 8-mm pentose tube drain was retained below the liver bed, whereas 80 patients were randomised not to have a drain (group B placed in the subhepatic space. End points of this trial were to detect any differences in morbidity, postoperative pain, wound infection and hospital stay between the two groups. Results : There was no mortality in either group and no statistically significant difference in postoperative pain, nausea and vomiting, wound infection or abdominal collection between the two groups. However, hospital stay was longer in the drain group than in group without drain and it is appearing that the use of drain delays hospital discharge. Conclusion : The routine use of a drain in non-complicated laparoscopic cholecystectomy has nothing to offer; in contrast, it is associated with longer hospital stay.

Which coordinate system for modelling path integration?

Science.gov (United States)

Vickerstaff, Robert J; Cheung, Allen

2010-03-21

Path integration is a navigation strategy widely observed in nature where an animal maintains a running estimate, called the home vector, of its location during an excursion. Evidence suggests it is both ancient and ubiquitous in nature, and has been studied for over a century. In that time, canonical and neural network models have flourished, based on a wide range of assumptions, justifications and supporting data. Despite the importance of the phenomenon, consensus and unifying principles appear lacking. A fundamental issue is the neural representation of space needed for biological path integration. This paper presents a scheme to classify path integration systems on the basis of the way the home vector records and updates the spatial relationship between the animal and its home location. Four extended classes of coordinate systems are used to unify and review both canonical and neural network models of path integration, from the arthropod and mammalian literature. This scheme demonstrates analytical equivalence between models which may otherwise appear unrelated, and distinguishes between models which may superficially appear similar. A thorough analysis is carried out of the equational forms of important facets of path integration including updating, steering, searching and systematic errors, using each of the four coordinate systems. The type of available directional cue, namely allothetic or idiothetic, is also considered. It is shown that on balance, the class of home vectors which includes the geocentric Cartesian coordinate system, appears to be the most robust for biological systems. A key conclusion is that deducing computational structure from behavioural data alone will be difficult or impossible, at least in the absence of an analysis of random errors. Consequently it is likely that further theoretical insights into path integration will require an in-depth study of the effect of noise on the four classes of home vectors. Copyright 2009 Elsevier Ltd

Powerful Software to Simulate Soil Consolidation Problems with Prefabricated Vertical Drains

OpenAIRE

Gonzalo García-Ros; Iván Alhama; Manuel Cánovas

2018-01-01

The present work describes the program Simulation of Consolidation with Vertical Drains (SICOMED_2018), a tool for the solution of consolidation processes in heterogeneous soils, with totally or partially penetrating prefabricated vertical drains (PVD) and considering both the effects of the smear zone, generated when introducing the drain into the ground, and the limitation in the discharge capacity of the drain. In order to provide a completely free program, the code Next-Generation Simulat...

Iatrogenic Perforation of the Left Ventricle during Insertion of a Chest Drain

OpenAIRE

Kim, Dongmin; Lim, Seong-Hoon; Seo, Pil Won

2013-01-01

Chest draining is a common procedure for treating pleural effusion. Perforation of the heart is a rare often fatal complication of chest drain insertion. We report a case of a 76-year-old female patient suffering from congestive heart failure. At presentation, unilateral opacity of the left chest observed on a chest X-ray was interpreted as massive pleural effusion, so an attempt was made to drain the left pleural space. Malposition of the chest drain was suspected because blood was draining ...

Horner's syndrome caused by an intercostal chest drain.

OpenAIRE

Campbell, P; Neil, T; Wake, P N

1989-01-01

Horner's syndrome occurred in a young woman as a complication of the treatment of a traumatic pneumothorax with an intercostal drain. The nerve damage probably occurred when the lung had fully re-expanded, pressing the tip of the intercostal drain, lying at the apex of the pleural cavity, on to the sympathetic chain.

Rethinking "Brain Drain" in the Era of Globalisation

Science.gov (United States)

Rizvi, Fazal

2005-01-01

This paper discusses a range of issues concerning the idea of "brain drain" within the context of recent thinking on transnational mobility. It argues that the traditional analyses of brain drain are not sufficient, and that we can usefully approach the topic from a postcolonial perspective concerned with issues of identity, national…

A low specific on-resistance SOI MOSFET with dual gates and a recessed drain

International Nuclear Information System (INIS)

Luo Xiao-Rong; Hu Gang-Yi; Zhang Zheng-Yuan; Luo Yin-Chun; Fan Ye; Wang Xiao-Wei; Fan Yuan-Hang; Cai Jin-Yong; Wang Pei; Zhou Kun

2013-01-01

A low specific on-resistance (R on,sp ) integrable silicon-on-insulator (SOI) metal-oxide semiconductor field-effect transistor (MOSFET) is proposed and investigated by simulation. The MOSFET features a recessed drain as well as dual gates, which consist of a planar gate and a trench gate extended to the buried oxide layer (BOX) (DGRD MOSFET). First, the dual gates form dual conduction channels, and the extended trench gate also acts as a field plate to improve the electric field distribution. Second, the combination of the trench gate and the recessed drain widens the vertical conduction area and shortens the current path. Third, the P-type top layer not only enhances the drift doping concentration but also modulates the surface electric field distributions. All of these sharply reduce R on,sp and maintain a high breakdown voltage (BV). The BV of 233 V and R on,sp of 4.151 mΩ·cm 2 (V GS = 15 V) are obtained for the DGRD MOSFET with 15-μm half-cell pitch. Compared with the trench gate SOI MOSFET and the conventional MOSFET, R on,sp of the DGRD MOSFET decreases by 36% and 33% with the same BV, respectively. The trench gate extended to the BOX synchronously acts as a dielectric isolation trench, simplifying the fabrication processes. (condensed matter: electronic structure, electrical, magnetic, and optical properties)

Comparison of a large and small-calibre tube drain for managing spontaneous pneumothoraces.

Science.gov (United States)

Benton, Ian J; Benfield, Grant F A

2009-10-01

To compare treatment success of large- and small-bore chest drains in the treatment of spontaneous pneumothoraces the case-notes were reviewed of those admitted to our hospital with a total of 73 pneumothoraces and who were treated by trainee doctors of varying experience. Both a large- and a small-bore intercostal tube drain system were in use during the two-year period reviewed. Similar pneumothorax profile and numbers treated with both drains were recorded, resulting in a similar drain time and numbers of successful and failed re-expansion of pneumothoraces. Successful pneumothorax resolution was the same for both drain types and the negligible tube drain complications observed with the small-bore drain reflected previously reported experiences. However the large-bore drain was associated with a high complication rate (32%) with more infectious complications (24%). The small-bore drain was prone to displacement (21%). There was generally no evidence of an increased failure and morbidity, reflecting poorer expertise, in the non-specialist trainees managing the pneumothoraces. A practical finding however was that in those large pneumothoraces where re-expansion failed, the tip of the drain had not been sited at the apex of the pleural cavity irrespective of the drain type inserted.

Settling Payments Fast and Private: Efficient Decentralized Routing for Path-Based Transactions

OpenAIRE

Roos, Stefanie; Moreno-Sanchez, Pedro; Kate, Aniket; Goldberg, Ian

2017-01-01

Path-based transaction (PBT) networks, which settle payments from one user to another via a path of intermediaries, are a growing area of research. They overcome the scalability and privacy issues in cryptocurrencies like Bitcoin and Ethereum by replacing expensive and slow on-chain blockchain operations with inexpensive and fast off-chain transfers. In the form of credit networks such as Ripple and Stellar, they also enable low-price real-time gross settlements across different currencies. F...

Quasi Path Restoration: A post-failure recovery scheme over pre-allocated backup resource for elastic optical networks

Science.gov (United States)

Yadav, Dharmendra Singh; Babu, Sarath; Manoj, B. S.

2018-03-01

Spectrum conflict during primary and backup routes assignment in elastic optical networks results in increased resource consumption as well as high Bandwidth Blocking Probability. In order to avoid such conflicts, we propose a new scheme, Quasi Path Restoration (QPR), where we divide the available spectrum into two: (1) primary spectrum (for primary routes allocation) and (2) backup spectrum (for rerouting the data on link failures). QPR exhibits three advantages over existing survivable strategies such as Shared Path Protection (SPP), Primary First Fit Backup Last Fit (PFFBLF), Jointly Releasing and re-establishment Defragmentation SPP (JRDSSPP), and Path Restoration (PR): (1) the conflict between primary and backup spectrum during route assignment is completely eliminated, (2) upon a link failure, connection recovery requires less backup resources compared to SPP, PFFBLF, and PR, and (3) availability of the same backup spectrum on each link improves the recovery guarantee. The performance of our scheme is analyzed with different primary backup spectrum partitions on varying connection-request demands and number of frequency slots. Our results show that QPR provides better connection recovery guarantee and Backup Resources Utilization (BRU) compared to bandwidth recovery of PR strategy. In addition, we compare QPR with Shared Path Protection and Primary First-Fit Backup Last Fit strategies in terms of Bandwidth Blocking Probability (BBP) and average frequency slots per connection request. Simulation results show that BBP of SPP, PFFBLF, and JRDSPP varies between 18.59% and 14.42%, while in QPR, BBP ranges from 2.55% to 17.76% for Cost239, NSFNET, and ARPANET topologies. Also, QPR provides bandwidth recovery between 93.61% and 100%, while in PR, the recovery ranges from 86.81% to 98.99%. It is evident from our analysis that QPR provides a reasonable trade-off between bandwidth blocking probability and connection recoverability.

A Worldwide Assessment of Greenhouse Gas Emissions from Drained Organic Soils

Directory of Open Access Journals (Sweden)

Francesco Nicola Tubiello

2016-04-01

Full Text Available Despite the importance of organic soils, including peatlands, in the global carbon cycle, detailed information on regional and global emissions is scarce. This is due to the difficulty to map, measure, and assess the complex dynamics of land, soil, and water interactions needed to assess the human-driven degradation of organic soils. We produced a new methodology for the comprehensive assessment of drained organic soils in agriculture and the estimation of the associated greenhouse gas emissions. Results indicated that over 25 million hectares of organic soils were drained worldwide for agriculture use, of which about 60% were in boreal and temperate cool areas, 34% in tropical areas, and 5% in warm temperate areas. Total emissions from the drainage were globally significant, totaling nearly one billion tonnes CO2eq annually. Of this, the CO2 component, about 780 million tonnes, represented more than one-fourth of total net CO2 emissions from agriculture, forestry, and land use. The bulk of these emissions came from a few tropical countries in Southeast Asia, and was linked to land clearing and drainage for crop cultivation. Geospatial data relative to this work were disseminated via the FAO geospatial server GeoNetwork, while the national aggregated statistics were disseminated via the FAOSTAT database.

Carbon accumulation in pristine and drained mires

Energy Technology Data Exchange (ETDEWEB)

Maekilae, M.

2011-07-01

The carbon accumulation of 73 peat columns from 48 pristine and drained mires was investigated using a total of 367 dates and age-depth models derived from bulk density measurements. Peat columns were collected from mires of varying depth, age, degree of natural state and nutrient conditions in aapa mire and raised bog regions and coastal mires from southern and central Finland and Russian Karelia. Particular attention was paid to the accumulation of carbon over the last 300 years, as this period encompasses the best estimates of the oxic layer (acrotelm) age across the range of sites investigated. In general, drained mires are initially more nutrient-rich than pristine mires. Organic matter decomposes more rapidly at drained sites than at pristine sites, resulting in thinner peat layers and carbon accumulation but a higher dry bulk density and carbon content. The average carbon accumulation was calculated as 24.0 g m-2 yr-1 at pristine sites and 19.4 g m-2 yr-1 at drained sites, while for peat layers younger than 300 years the respective figures were 45.3 and 34.5 g m-2 yr-1 at pristine and drained sites. For the <300-year-old peat layers studied here, the average thickness was 19 cm less and the carbon accumulation rate 10.8 g m-2 yr-1 lower in drained areas than in pristine areas. The amount carbon accumulation of surface peat layers depends upon the mire site type, vegetation and natural state; variations reflect differences in plant communities as well as factors that affect biomass production and decay rates. The highest accumulation rates and thus carbon binding for layers younger than 300 years were measured in the ombrotrophic mire site types (Sphagnum fuscum bog and Sphagnum fuscum pine bog), and the second highest rates in wet, treeless oligotrophic and minerotrophic mire site types. The lowest values of carbon accumulation over the last 300 years were obtained for the most transformed, sparsely forested and forested mire site types, where the water

Climate mitigation scenarios of drained peat soils

Science.gov (United States)

Kasimir Klemedtsson, Åsa; Coria, Jessica; He, Hongxing; Liu, Xiangping; Nordén, Anna

2014-05-01

The national inventory reports (NIR) submitted to the UNFCCC show Sweden - which as many other countries has wetlands where parts have been drained for agriculture and forestry purposes, - to annually emit 12 million tonnes carbon dioxide equivalents, which is more GHG'es than industrial energy use release in Sweden. Similar conditions can be found in other northern countries, having cool and wet conditions, naturally promoting peat accumulation, and where land use management over the last centuries have promoted draining activities. These drained peatland, though covering only 2% of the land area, have emissions corresponding to 20% of the total reported NIR emissions. This substantial emission contribution, however, is hidden within the Land Use Land Use Change and Forestry sector (LULUCF) where the forest Carbon uptake is even larger, which causes the peat soil emissions become invisible. The only drained soil emission accounted in the Swedish Kyoto reporting is the N2O emission from agricultural drained organic soils of the size 0.5 million tonnes CO2e yr-1. This lack of visibility has made incentives for land use change and management neither implemented nor suggested, however with large potential. Rewetting has the potential to decrease soil mineralization, why CO2 and N2O emissions are mitigated. However if the soil becomes very wet CH4 emission will increase together with hampered plant growth. By ecological modeling, using the CoupModel the climate change mitigation potential have been estimated for four different land use scenarios; 1, Drained peat soil with Spruce (business as usual scenario), 2, raised ground water level to 20 cm depth and Willow plantation, 3, raised ground water level to 10 cm depth and Reed Canary Grass, and 4, rewetting to an average water level in the soil surface with recolonizing wetland plants and mosses. We calculate the volume of biomass production per year, peat decomposition, N2O emission together with nitrate and DOC

Fluvial sediment inputs to upland gravel bed rivers draining forested catchments: potential ecological impacts

Directory of Open Access Journals (Sweden)

S. D. Marks

1997-01-01

Full Text Available As identified by the detailed long-term monitoring networks at Plynlimon, increased sediment supply to upland fluvial systems is often associated with forestry land-use and practice. Literature is reviewed, in the light of recent results from Plynlimon sediment studies, to enable identification of the potential ecological impacts of fluvial particulate inputs to upland gravel bed rivers draining forested catchments similar to the headwaters of the River Severn. Both sediment transport and deposition can have significant impacts upon aquatic vertebrates, invertebrates and plants.

Method of draining water through a solid waste site without leaching

Science.gov (United States)

Treat, Russell L.; Gee, Glendon W.; Whyatt, Greg A.

1993-01-01

The present invention is a method of preventing water from leaching solid waste sites by preventing atmospheric precipitation from contacting waste as the water flows through a solid waste site. The method comprises placing at least one drain hole through the solid waste site. The drain hole is seated to prevent waste material from entering the drain hole, and the solid waste site cover material is layered and graded to direct water to flow toward the drain hole and to soil beneath the waste site.

E-Center: A Collaborative Platform for Wide Area Network Users

Science.gov (United States)

Grigoriev, M.; DeMar, P.; Tierney, B.; Lake, A.; Metzger, J.; Frey, M.; Calyam, P.

2012-12-01

The E-Center is a social collaborative web-based platform for assisting network users in understanding network conditions across network paths of interest to them. It is designed to give a user the necessary tools to isolate, identify, and resolve network performance-related problems. E-Center provides network path information on a link-by-link level, as well as from an end-to-end perspective. In addition to providing current and recent network path data, E-Center is intended to provide a social media environment for them to share issues, ideas, concerns, and problems. The product has a modular design that accommodates integration of other network services that make use of the same network path and performance data.

E-center: A collaborative platform for wide area network users

Energy Technology Data Exchange (ETDEWEB)

Grigoriev, M. [Fermilab; DeMar, P. [Fermilab; Tierney, B. [LBL, Berkeley; Lake, A. [LBL, Berkeley; Metzger, J. [LBL, Berkeley; Frey, M. [Bucknell U.; Calyam, P. [Ohio State U.

2012-01-01

The E-Center is a social collaborative web-based platform for assisting network users in understanding network conditions across network paths of interest to them. It is designed to give a user the necessary tools to isolate, identify, and resolve network performance-related problems. E-Center provides network path information on a link-by-link level, as well as from an end-to-end perspective. In addition to providing current and recent network path data, E-Center is intended to provide a social media environment for them to share issues, ideas, concerns, and problems. The product has a modular design that accommodates integration of other network services that make use of the same network path and performance data.

E-Center: A Collaborative Platform for Wide Area Network Users

International Nuclear Information System (INIS)

Grigoriev, M; DeMar, P; Tierney, B; Lake, A; Metzger, J; Frey, M; Calyam, P

2012-01-01

The E-Center is a social collaborative web-based platform for assisting network users in understanding network conditions across network paths of interest to them. It is designed to give a user the necessary tools to isolate, identify, and resolve network performance-related problems. E-Center provides network path information on a link-by-link level, as well as from an end-to-end perspective. In addition to providing current and recent network path data, E-Center is intended to provide a social media environment for them to share issues, ideas, concerns, and problems. The product has a modular design that accommodates integration of other network services that make use of the same network path and performance data.

Network Analysis Tools: from biological networks to clusters and pathways.

Science.gov (United States)

Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Vanderstocken, Gilles; van Helden, Jacques

2008-01-01

Network Analysis Tools (NeAT) is a suite of computer tools that integrate various algorithms for the analysis of biological networks: comparison between graphs, between clusters, or between graphs and clusters; network randomization; analysis of degree distribution; network-based clustering and path finding. The tools are interconnected to enable a stepwise analysis of the network through a complete analytical workflow. In this protocol, we present a typical case of utilization, where the tasks above are combined to decipher a protein-protein interaction network retrieved from the STRING database. The results returned by NeAT are typically subnetworks, networks enriched with additional information (i.e., clusters or paths) or tables displaying statistics. Typical networks comprising several thousands of nodes and arcs can be analyzed within a few minutes. The complete protocol can be read and executed in approximately 1 h.

RF dynamic and noise performance of Metallic Source/Drain SOI n-MOSFETs

Science.gov (United States)

Martin, Maria J.; Pascual, Elena; Rengel, Raúl

2012-07-01

This paper presents a detailed study of the RF and noise performance of n-type Schottky barrier (SB) MOSFETs with a particular focus on the influence of the Schottky barrier height (SBH) on the main dynamic and noise figures of merit. With this aim, a 2D Monte Carlo simulator including tunnelling transport across Schottky interfaces has been developed, with special care to consider quantum transmission coefficients and the influence of image charge effects at the Schottky junctions. Particular attention is paid to the microscopic transport features, including carrier mean free paths or number of scattering events along the channel for investigating the optimization of the device topology and the strategic concepts related to the noise performance of this new architecture. A more effective control of the gate electrode over drain current for low SBH (discussed in terms of internal physical quantities) is translated into an enhanced transconductance gm, cut-off frequency fT, and non-quasistatic dynamic parameters. The drain and gate intrinsic noise sources show a noteworthy degradation with the SBH reduction due to the increased current, influence of hot carriers and reduced number of phonon scatterings. However, the results evidence that this effect is counterbalanced by the extremely improved dynamic performance in terms of gm and fT. Therefore, the deterioration of the intrinsic noise performance of the SB-MOSFET has no significant impact on high-frequency noise FoMs as NFmin, Rn and Gass for low SBH and large gate overdrive conditions. The role of the SBH on Γopt, optimum noise reactance and susceptance has been also analyzed.

Interactive analysis of geographically distributed population imaging data collections over light-path data networks

Science.gov (United States)

van Lew, Baldur; Botha, Charl P.; Milles, Julien R.; Vrooman, Henri A.; van de Giessen, Martijn; Lelieveldt, Boudewijn P. F.

2015-03-01

The cohort size required in epidemiological imaging genetics studies often mandates the pooling of data from multiple hospitals. Patient data, however, is subject to strict privacy protection regimes, and physical data storage may be legally restricted to a hospital network. To enable biomarker discovery, fast data access and interactive data exploration must be combined with high-performance computing resources, while respecting privacy regulations. We present a system using fast and inherently secure light-paths to access distributed data, thereby obviating the need for a central data repository. A secure private cloud computing framework facilitates interactive, computationally intensive exploration of this geographically distributed, privacy sensitive data. As a proof of concept, MRI brain imaging data hosted at two remote sites were processed in response to a user command at a third site. The system was able to automatically start virtual machines, run a selected processing pipeline and write results to a user accessible database, while keeping data locally stored in the hospitals. Individual tasks took approximately 50% longer compared to a locally hosted blade server but the cloud infrastructure reduced the total elapsed time by a factor of 40 using 70 virtual machines in the cloud. We demonstrated that the combination light-path and private cloud is a viable means of building an analysis infrastructure for secure data analysis. The system requires further work in the areas of error handling, load balancing and secure support of multiple users.

Inverse problem in anisotropic poroelasticity: drained constants from undrained ultrasound measurements.

Science.gov (United States)

Berryman, James G; Nakagawa, Seiji

2010-02-01

Poroelastic analysis has traditionally focused on the relationship between dry and drained constants, which are assumed known, and the saturated or undrained constants, which are assumed unknown. However, there are many applications in this field of study for which the main measurements can only be made on the saturated/undrained system, and then it is uncertain what the effects of the fluids were on the system, since the drained constants remain a mystery. The work presented here shows how to deduce drained constants from undrained constants for anisotropic systems having symmetries ranging from isotropic to orthotropic. Laboratory ultrasound data are then inverted for the drained constants in three granular packings: one of glass beads, and two others for distinct types of more or less angular sand grain packings. Experiments were performed under uniaxial stress, which resulted in hexagonal (transversely isotropic) symmetry of the poroelastic response. One important conclusion from the general analysis is that the drained constants are uniquely related to the undrained constants, assuming that porosity, grain bulk modulus, and pore fluid bulk modulus are already known. Since the resulting system of equations for all the drained constants is linear, measurement error in undrained constants also propagates linearly into the computed drained constants.

Inverse problem in anisotropic poroelasticity: Drained constants from undrained ultrasound measurements

Energy Technology Data Exchange (ETDEWEB)

Berryman, J.G.; Nakagawa, S.

2009-11-20

Poroelastic analysis has traditionally focused on the relationship between dry or drained constants which are assumed known and the saturated or undrained constants which are assumed unknown. However, there are many applications in this field of study for which the main measurements can only be made on the saturated/undrained system, and then it is uncertain what the eects of the uids were on the system, since the drained constants remain a mystery. The work presented here shows how to deduce drained constants from undrained constants for anisotropic systems having symmetries ranging from isotropic to orthotropic. Laboratory ultrasound data are then inverted for the drained constants in three granular packings: one of glass beads, and two others for distinct types of more or less angular sand grain packings. Experiments were performed under uniaxial stress, which resulted in hexagonal (transversely isotropic) symmetry of the poroelastic response. One important conclusion from the general analysis is that the drained constants are uniquely related to the undrained constants, assuming that porosity, grain bulk modulus, and pore uid bulk modulus are already known. Since the resulting system of equations for all the drained constants is linear, measurement error in undrained constants also propagates linearly into the computed drained constants.

Detecting peatland drains with Object Based Image Analysis and Geoeye-1 imagery.

Science.gov (United States)

Connolly, J; Holden, N M

2017-12-01

Peatlands play an important role in the global carbon cycle. They provide important ecosystem services including carbon sequestration and storage. Drainage disturbs peatland ecosystem services. Mapping drains is difficult and expensive and their spatial extent is, in many cases, unknown. An object based image analysis (OBIA) was performed on a very high resolution satellite image (Geoeye-1) to extract information about drain location and extent on a blanket peatland in Ireland. Two accuracy assessment methods: Error matrix and the completeness, correctness and quality (CCQ) were used to assess the extracted data across the peatland and at several sub sites. The cost of the OBIA method was compared with manual digitisation and field survey. The drain maps were also used to assess the costs relating to blocking drains vs. a business-as-usual scenario and estimating the impact of each on carbon fluxes at the study site. The OBIA method performed well at almost all sites. Almost 500 km of drains were detected within the peatland. In the error matrix method, overall accuracy (OA) of detecting the drains was 94% and the kappa statistic was 0.66. The OA for all sub-areas, except one, was 95-97%. The CCQ was 85%, 85% and 71% respectively. The OBIA method was the most cost effective way to map peatland drains and was at least 55% cheaper than either field survey or manual digitisation, respectively. The extracted drain maps were used constrain the study area CO 2 flux which was 19% smaller than the prescribed Peatland Code value for drained peatlands. The OBIA method used in this study showed that it is possible to accurately extract maps of fine scale peatland drains over large areas in a cost effective manner. The development of methods to map the spatial extent of drains is important as they play a critical role in peatland carbon dynamics. The objective of this study was to extract data on the spatial extent of drains on a blanket bog in the west of Ireland. The

Detecting peatland drains with Object Based Image Analysis and Geoeye-1 imagery

Directory of Open Access Journals (Sweden)

J. Connolly

2017-03-01

Full Text Available Abstract Background Peatlands play an important role in the global carbon cycle. They provide important ecosystem services including carbon sequestration and storage. Drainage disturbs peatland ecosystem services. Mapping drains is difficult and expensive and their spatial extent is, in many cases, unknown. An object based image analysis (OBIA was performed on a very high resolution satellite image (Geoeye-1 to extract information about drain location and extent on a blanket peatland in Ireland. Two accuracy assessment methods: Error matrix and the completeness, correctness and quality (CCQ were used to assess the extracted data across the peatland and at several sub sites. The cost of the OBIA method was compared with manual digitisation and field survey. The drain maps were also used to assess the costs relating to blocking drains vs. a business-as-usual scenario and estimating the impact of each on carbon fluxes at the study site. Results The OBIA method performed well at almost all sites. Almost 500 km of drains were detected within the peatland. In the error matrix method, overall accuracy (OA of detecting the drains was 94% and the kappa statistic was 0.66. The OA for all sub-areas, except one, was 95–97%. The CCQ was 85%, 85% and 71% respectively. The OBIA method was the most cost effective way to map peatland drains and was at least 55% cheaper than either field survey or manual digitisation, respectively. The extracted drain maps were used constrain the study area CO2 flux which was 19% smaller than the prescribed Peatland Code value for drained peatlands. Conclusions The OBIA method used in this study showed that it is possible to accurately extract maps of fine scale peatland drains over large areas in a cost effective manner. The development of methods to map the spatial extent of drains is important as they play a critical role in peatland carbon dynamics. The objective of this study was to extract data on the spatial extent of

Active Path Planning for Drones in Object Search

OpenAIRE

Wang, Zeyangyi

2017-01-01

Object searching is one of the most popular applications of unmanned aerial vehicles. Low cost small drones are particularly suited for surveying tasks in difficult conditions. With their limited on-board processing power and battery life, there is a need for more efficient search algorithm. The proposed path planning algorithm utilizes AZ-net, a deep learning network to process images captured on drones for adaptive flight path planning. Search simulation based on videos and actual experimen...

Nurses’ Knowledge Levels of Chest Drain Management: A Descriptive Study

Directory of Open Access Journals (Sweden)

Merve Tarhan

2016-12-01

Full Text Available Objective: The physician is responsible for inserting one or more chest tubes into the pleural space or the mediastinal space and connecting them to an appropriate drainage system. When the general principles about care of patients with chest drains were implemented correctly and effectively by nurses, nurse will contribute to accelerate the healing process of patients. In this context, the aim of this study was to determine the nurses’ level of knowledge regarding the care of patients with chest drains. Methods: The study was conducted with 153 nurses who worked in a chest diseases and thoracic surgery hospital in July 2014. Questionnaire form of 35 questions prepared by investigators was used to collect data. For the analysis of results, frequency tests, independent sample t-test and oneway ANOVA test were used. Results: 69.3% of nurses stated that they had obtained information from colleguages. 35.3% considered their knowledge about chest drain management to be inadequate. 55.6% scored 13 points and above from knowledge questionnaire about chest drain management. There were statistically significant difference between knowledge level and educational background, clinic work type, working unit, years of professional experience and institutional experience, frequency of contact patients with chest drain and perception of knowledge level (p<0.05. Conclusion: Results of this study indicate that lack of evidence-based nursing care and insufficient training has resulted in uncertainty and knowledge deficit in important aspects of chest drain care. It can be concluded that nurses receive training needs and training protocols are about chest drain management.

Graphene-based battery electrodes having continuous flow paths

Science.gov (United States)

Zhang, Jiguang; Xiao, Jie; Liu, Jun; Xu, Wu; Li, Xiaolin; Wang, Deyu

2014-05-24

Some batteries can exhibit greatly improved performance by utilizing electrodes having randomly arranged graphene nanosheets forming a network of channels defining continuous flow paths through the electrode. The network of channels can provide a diffusion pathway for the liquid electrolyte and/or for reactant gases. Metal-air batteries can benefit from such electrodes. In particular Li-air batteries show extremely high capacities, wherein the network of channels allow oxygen to diffuse through the electrode and mesopores in the electrode can store discharge products.

Controlling the ambipolarity and improvement of RF performance using Gaussian Drain Doped TFET

Science.gov (United States)

Nigam, Kaushal; Gupta, Sarthak; Pandey, Sunil; Kondekar, P. N.; Sharma, Dheeraj

2018-05-01

Ambipolar conduction in tunnel field-effect transistors (TFETs) has been occurred as an inherent issue due to drain-channel tunneling. It makes TFET less efficient and restricts its application in complementary digital circuits. Therefore, this manuscript reports the application of Gaussian doping profile on nanometer regime silicon channel TFETs to completely eliminate the ambipolarity. For this, Gaussian doping is used in the drain region of conventional gate-drain overlap TFET to control the tunneling of electrons from the valence band of channel to the conduction band of drain. As a result, barrier width at the drain/channel junction increases significantly leading to the suppression of an ambipolar current even when higher doping concentration (1 ? 10 ? cm ?) is considered in the drain region. However, significant improvement in terms of RF figure-of-merits such as cut-off frequency (f ?), gain bandwidth product (GBW), and gate-to-drain capacitance (C ?) is achieved with Gaussian doped gate on drain overlap TFET as compared to its counterpart TFET.

Pheromone Static Routing Strategy for Complex Networks

Science.gov (United States)

Hu, Mao-Bin; Henry, Y. K. Lau; Ling, Xiang; Jiang, Rui

2012-12-01

We adopt the concept of using pheromones to generate a set of static paths that can reach the performance of global dynamic routing strategy [Phys. Rev. E 81 (2010) 016113]. The path generation method consists of two stages. In the first stage, a pheromone is dropped to the nodes by packets forwarded according to the global dynamic routing strategy. In the second stage, pheromone static paths are generated according to the pheromone density. The output paths can greatly improve traffic systems' overall capacity on different network structures, including scale-free networks, small-world networks and random graphs. Because the paths are static, the system needs much less computational resources than the global dynamic routing strategy.

Brain drain: Propulsive factors and consequences

Directory of Open Access Journals (Sweden)

Dragan ILIC

2018-01-01

Full Text Available When speaking about the total number of highly educated individuals’ migration, it is easy to spot that it is rapidly increasing. The brain drain issues should be taken very seriously especially in under developed and in the developing countries, knowing that the human capital is globally mobile and that highly educated individuals can without any issues market their knowledge around the globe. Dealing with it requires a carefully tailored strategy for these countries, which are suffering from severe human capital losses on annual basis. Since the labor markets of today are highly competitive, it is necessary for these countries to secure good advancement and doing business opportunities. The purpose of this research is to provide an insight into the key propulsive factors and potential consequences caused by the brain drain. The method used in order to conduct the research was a carefully designed questionnaire taken by the date subject enrolled at the third and fourth years of state governed and privately owned universities. This research shows that one of the key reasons for brain drain in underdeveloped and in the developing countries is shortage of further educational advancement opportunities.

A numerical scheme for optimal transition paths of stochastic chemical kinetic systems

International Nuclear Information System (INIS)

Liu Di

2008-01-01

We present a new framework for finding the optimal transition paths of metastable stochastic chemical kinetic systems with large system size. The optimal transition paths are identified to be the most probable paths according to the Large Deviation Theory of stochastic processes. Dynamical equations for the optimal transition paths are derived using the variational principle. A modified Minimum Action Method (MAM) is proposed as a numerical scheme to solve the optimal transition paths. Applications to Gene Regulatory Networks such as the toggle switch model and the Lactose Operon Model in Escherichia coli are presented as numerical examples

Drain Tube-Induced Jejunal Penetration Masquerading as Bile Leak following Whipple's Operation.

Science.gov (United States)

Bae, Sang Ho; Lee, Tae Hoon; Lee, Sae Hwan; Lee, Suck-Ho; Park, Sang-Heum; Kim, Sun-Joo; Kim, Chang Ho

2011-05-01

A 70-year-old man had undergone pancreaticoduodenectomy due to a distal common bile duct malignancy. After the operation, serous fluid discharge decreased from two drain tubes in the retroperitoneum. Over four weeks, the appearance of the serous fluid changed to a greenish bile color and the patient persistently drained over 300 ml/day. Viewed as bile leak at the choledochojejunostomy, treatment called for endoscopic diagnosis and therapy. Cap-fitted forward-viewing endoscopy demonstrated that the distal tip of a pancreatic drain catheter inserted at the pancreaticojejunostomy site had penetrated the opposite jejunum wall. One of the drain tubes primarily placed in the retroperitoneum had also penetrated the jejunum wall, with the distal tip positioned near the choledochojejunostomy site. No leak of contrast appeared beyond the jejunum or anastomosis site. Following repositioning of a penetrating catheter of the pancreaticojejunostomy, four days later, the patient underwent removal of two drain tubes without additional complications. In conclusion, the distal tip of the catheter, placed to drain pancreatic juice, penetrated the jejunum wall and may have caused localized perijejunal inflammation. The other drain tube, placed in the retroperitoneal space, might then have penetrated the inflamed wall of the jejunum, allowing persistent bile drainage via the drain tube. The results masqueraded as bile leakage following pancreaticoduodenectomy.

Time optimized path-choice in the termite hunting ant Megaponera analis.

Science.gov (United States)

Frank, Erik T; Hönle, Philipp O; Linsenmair, K Eduard

2018-05-10

Trail network systems among ants have received a lot of scientific attention due to their various applications in problem solving of networks. Recent studies have shown that ants select the fastest available path when facing different velocities on different substrates, rather than the shortest distance. The progress of decision-making by these ants is determined by pheromone-based maintenance of paths, which is a collective decision. However, path optimization through individual decision-making remains mostly unexplored. Here we present the first study of time-optimized path selection via individual decision-making by scout ants. Megaponera analis scouts search for termite foraging sites and lead highly organized raid columns to them. The path of the scout determines the path of the column. Through installation of artificial roads around M. analis nests we were able to influence the pathway choice of the raids. After road installation 59% of all recorded raids took place completely or partly on the road, instead of the direct, i.e. distance-optimized, path through grass from the nest to the termites. The raid velocity on the road was more than double the grass velocity, the detour thus saved 34.77±23.01% of the travel time compared to a hypothetical direct path. The pathway choice of the ants was similar to a mathematical model of least time allowing us to hypothesize the underlying mechanisms regulating the behavior. Our results highlight the importance of individual decision-making in the foraging behavior of ants and show a new procedure of pathway optimization. © 2018. Published by The Company of Biologists Ltd.

Evaluation of Network Reliability for Computer Networks with Multiple Sources

Directory of Open Access Journals (Sweden)

Yi-Kuei Lin

2012-01-01

Full Text Available Evaluating the reliability of a network with multiple sources to multiple sinks is a critical issue from the perspective of quality management. Due to the unrealistic definition of paths of network models in previous literature, existing models are not appropriate for real-world computer networks such as the Taiwan Advanced Research and Education Network (TWAREN. This paper proposes a modified stochastic-flow network model to evaluate the network reliability of a practical computer network with multiple sources where data is transmitted through several light paths (LPs. Network reliability is defined as being the probability of delivering a specified amount of data from the sources to the sink. It is taken as a performance index to measure the service level of TWAREN. This paper studies the network reliability of the international portion of TWAREN from two sources (Taipei and Hsinchu to one sink (New York that goes through a submarine and land surface cable between Taiwan and the United States.

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Gaurantees

Directory of Open Access Journals (Sweden)

Srinivasan Murali

2007-01-01

Full Text Available Networks on Chips (NoCs are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today's NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in the network is reduced significantly, which translates to improved network performance or reduced network bandwidth requirements and power consumption. Multiple paths can also be utilized to achieve spatial redundancy, which helps in achieving tolerance against faults or errors in the NoC. A major problem with multipath routing is that packets can reach the destination in an out-of-order fashion, while many applications require in-order packet delivery. In this work, we present a multipath routing strategy that guarantees in-order packet delivery for NoCs. It is based on the idea of routing packets on partially nonintersecting paths and rebuilding packet order at path reconvergent nodes. We present a design methodology that uses the routing strategy to optimally spread the traffic in the NoC to minimize the network bandwidth needs and power consumption. We also integrate support for tolerance against transient and permanent failures in the NoC links in the methodology by utilizing spatial and temporal redundancy for transporting packets. Our experimental studies show large reduction in network bandwidth requirements (36.86% on average and power consumption (30.51% on average compared to single-path systems. The area overhead of the proposed scheme is small (a modest 5% increase in network area. Hence, it is practical to be used in the on-chip domain.

Neural Networks in Mobile Robot Motion

Directory of Open Access Journals (Sweden)

Danica Janglová

2004-03-01

Full Text Available This paper deals with a path planning and intelligent control of an autonomous robot which should move safely in partially structured environment. This environment may involve any number of obstacles of arbitrary shape and size; some of them are allowed to move. We describe our approach to solving the motion-planning problem in mobile robot control using neural networks-based technique. Our method of the construction of a collision-free path for moving robot among obstacles is based on two neural networks. The first neural network is used to determine the “free” space using ultrasound range finder data. The second neural network “finds” a safe direction for the next robot section of the path in the workspace while avoiding the nearest obstacles. Simulation examples of generated path with proposed techniques will be presented.

Dynamic Protection of Optical Networks

DEFF Research Database (Denmark)

Ruepp, Sarah Renée

2008-01-01

This thesis deals with making optical networks resilient to failures. The recovery performance of path, segment and span restoration is evaluated in a network with limited wavelength conversion capability using both standard and enhanced wavelength assignment schemes. The enhanced wavelength...... stubs at the failure adjacent nodes. Both modifcations have a positive influence on the recovery percentage. The recovery enhancements are applicable in both single and multi-domain network environments. Stub release, where the still working parts of a failure affected connection are released prior...... of the modularity of capacity units is investigated for resilient network design. Different span upgrading strategies and algorithms for finding restoration paths are evaluated. Furthermore, the capacity effciency of constraining restoration requests for the same destination node to the same restoration path...

The Impact of Drainage Network Structure on Flooding in a Small Urban Watershed in Metropolitan Baltimore, MD

Science.gov (United States)

Meierdiercks, K. L.; Smith, J. A.; Miller, A. J.

2006-12-01

The impact of urban development on watershed-scale hydrology is examined in a small urban watershed in the Metropolitan Baltimore area. Analyses focus on Dead Run, a 14.3 km2 tributary of the Gwynns Falls, which is the principal study watershed of the Baltimore Ecosystem Study. Field observations of rainfall and discharge have been collected for storms occurring in the 2003, 2004, and 2005 warm seasons including the flood of record for the USGS Dead Run at Franklintown gage (7 July 2004), in which 5 inches of rain fell in less than 4 hours. Dead Run has stream gages at 6 locations with drainage areas ranging from 1.2 to 14.3 km2. Hydrologic response to storm events varies greatly in each of the subwatersheds due to the diverse development types located there. These subwatersheds range in land use from medium-density residential, with and without stormwater management control, to commercial/light industrial with large impervious lots and an extensive network of stormwater management ponds. The unique response of each subwatershed is captured using field observations in conjunction with the EPA Stormwater Management Model (SWMM), which routes storm runoff over the land surface and through the drainage network of a watershed. Of particular importance to flood response is the structure of the drainage network (both surface channels and storm drain network) and its connectivity to preferential flow paths within the watershed. The Dead Run drainage network has been delineated using geospatial data derived from aerial photography and engineering planning drawings. Model analyses are used to examine the characteristics of flow paths that control flood response in urban watersheds. These analyses aim to identify patterns in urban flow pathways and use those patterns to predict response in other urban watersheds.

Dominant mechanisms for the delivery of fine sediment and phosphorus to fluvial networks draining grassland dominated headwater catchments.

Science.gov (United States)

Perks, M T; Owen, G J; Benskin, C McW H; Jonczyk, J; Deasy, C; Burke, S; Reaney, S M; Haygarth, P M

2015-08-01

Recent advances in monitoring technology have enabled high frequency, in-situ measurements of total phosphorus and total reactive phosphorus to be undertaken with high precision, whilst turbidity can provide an excellent surrogate for suspended sediment. Despite these measurements being fundamental to understanding the mechanisms and flow paths that deliver these constituents to river networks, there is a paucity of such data for headwater agricultural catchments. The aim of this paper is to deduce the dominant mechanisms for the delivery of fine sediment and phosphorus to an upland river network in the UK through characterisation of the temporal variability of hydrological fluxes, and associated soluble and particulate concentrations for the period spanning March 2012-February 2013. An assessment of the factors producing constituent hysteresis is undertaken following factor analysis (FA) on a suite of measured environmental variables representing the fluvial and wider catchment conditions prior to, and during catchment-wide hydrological events. Analysis indicates that suspended sediment is delivered to the fluvial system predominantly via rapidly responding pathways driven by event hydrology. However, evidence of complex, figure-of-eight hysteresis is observed following periods of hydrological quiescence, highlighting the importance of preparatory processes. Sediment delivery via a slow moving, probably sub-surface pathway does occur, albeit infrequently and during low magnitude events at the catchment outlet. Phosphorus is revealed to have a distinct hysteretic response to that of suspended sediment, with sub-surface pathways dominating. However, high magnitude events were observed to exhibit threshold-like behaviour, whereby activation and connection of usually disconnected depositional zones to the fluvial networks results in the movement of vast phosphorus fluxes. Multiple pathways are observed for particulate and soluble constituents, highlighting the

Steam generator fitted with a dynamic draining device

International Nuclear Information System (INIS)

Chaix, J.E.

1982-01-01

This generator has, at its upper part, at least one drying structure for holding the water carried with the steam and communicating at its lower part with at least one discharge pipe for draining off the water, each pipe communicating with a dynamic draining device capable of creating a depression in order to suck up the water contained in the drying structure. Application is for pressurized water nuclear reactors [fr

Leaching of dissolved phosphorus from tile-drained agricultural areas.

Science.gov (United States)

Andersen, H E; Windolf, J; Kronvang, B

2016-01-01

We investigated leaching of dissolved phosphorus (P) from 45 tile-drains representing animal husbandry farms in all regions of Denmark. Leaching of P via tile-drains exhibits a high degree of spatial heterogeneity with a low concentration in the majority of tile-drains and few tile-drains (15% in our investigation) having high to very high concentration of dissolved P. The share of dissolved organic P (DOP) was high (up to 96%). Leaching of DOP has hitherto been a somewhat overlooked P loss pathway in Danish soils and the mechanisms of mobilization and transport of DOP needs more investigation. We found a high correlation between Olsen-P and water extractable P. Water extractable P is regarded as an indicator of risk of loss of dissolved P. Our findings indicate that Olsen-P, which is measured routinely in Danish agricultural soils, may be a useful proxy for the P leaching potential of soils. However, we found no straight-forward correlation between leaching potential of the top soil layer (expressed as either degree of P saturation, Olsen-P or water extractable P) and the measured concentration of dissolved P in the tile-drain. This underlines that not only the source of P but also the P loss pathway must be taken into account when evaluating the risk of P loss.

Numerical Simulation of Liquids Draining From a Tank Using OpenFOAM

Science.gov (United States)

Sakri, Fadhilah Mohd; Sukri Mat Ali, Mohamed; Zaki Shaikh Salim, Sheikh Ahmad; Muhamad, Sallehuddin

2017-08-01

Accurate simulation of liquids draining is a challenging task. It involves two phases flow, i.e. liquid and air. In this study draining a liquid from a cylindrical tank is numerically simulated using OpenFOAM. OpenFOAM is an open source CFD package and it becomes increasingly popular among the academician and also industries. Comparisons with theoretical and results from previous published data confirmed that OpenFOAM is able to simulate the liquids draining very well. This is done using the gas-liquid interface solver available in the standard library of OpenFOAM. Additionally, this study was also able to explain the physics flow of the draining tank.

Closed suction drain with bulb

Science.gov (United States)

... of gloves. Put a new bandage around the drain tube site. Use surgical tape to hold it down ... small amount of redness is normal). There is drainage from the skin around the tube site. There is more tenderness and swelling at ...

Path finding using the multi-layer network description language

NARCIS (Netherlands)

Dijkstra, F.; van der Ham, J.; Grosso, P.; de Laat, C.

2008-01-01

Research networks are providing their users with dedicated network connections. Users want these connects to go through different domains, so the research networks are challenged to find valid network connections through multiple domains. The challenge arises if the different network domains use

The Simple Urine Bag as Wound Drain Post-Craniotomy in a Low ...

African Journals Online (AJOL)

Methods: A 4-year prospective cohort study of the effectiveness, outcome with use and complications of the Uribag as post craniotomy wound drain in a consecutive cohort of neurosurgical patients. Data analyzed include the patients' brief demographics; the types of cranial surgery in which drain was used; the drain ...

Frequency dependence and passive drains in fish-eye lenses

Science.gov (United States)

Quevedo-Teruel, O.; Mitchell-Thomas, R. C.; Hao, Y.

2012-11-01

The Maxwell fish eye lens has previously been reported as being capable of the much sought after phenomenon of subwavelength imaging. The inclusion of a drain in this system is considered crucial to the imaging ability, although its role is the topic of much debate. This paper provides a numerical investigation into a practical implementation of a drain in such systems, and analyzes the strong frequency dependence of both the Maxwell fish eye lens and an alternative, the Miñano lens. The imaging capability of these types of lens is questioned, and it is supported by simulations involving various configurations of drain arrays. Finally, a discussion of the near-field and evanescent wave contribution is given.

Shearon Harris steam generator channel head drain line leakage

International Nuclear Information System (INIS)

Bauer, P.A.

1992-01-01

All three Shearon Harris steam generators were equipped with Inconel 600 drain penetrations inserted into clearance holes on the bottom center line of the plenums, roll expanded into the plenum shell, and seal welded to the stainless steel cladding. Eddy current inspections showed axial cracks in the drain lines of B and C generators, but not on the leaking A generator. The drain lines of the three generators were repaired by cutting off the pipe under the plenum, applying Inconel 600 cladding to the underside of the plenum by a temper bead process, spot facing the overlay cladding and welding a new Inconel 600 pipe coupling to the clad surface. 3 figs

Intra-articular injection of tranexamic acid via a drain plus drain-clamping to reduce blood loss in cementless total knee arthroplasty

Directory of Open Access Journals (Sweden)

Mutsuzaki Hirotaka

2012-09-01

Full Text Available Abstract Background Patients undergoing cementless total knee arthroplasty (TKA sometimes suffer large blood loss. In a retrospective study, we explored whether postoperative intra-articular retrograde injection of tranexamic acid (TA and leaving a drain clamp in place for 1 h reduced blood loss. Patients and methods Patients (n = 140 treated with unilateral primary cementless TKA (posterior cruciate ligament retained were divided into two groups: those who had an intra-articular injection of TA (1000 mg and drain clamping for 1 h postoperatively (study group, n = 70 and those who were not given TA and did not undergo clamping of their drains (control group, n = 70. Postoperative total blood loss, volume of drainage, hemoglobin level, transfusion amounts and rates, D-dimer level at postoperative day (POD 7, and complications were recorded. Results Total blood loss, total drainage, mean transfusion volume, and transfusion rates were lower in the study group than in controls (P P P  Conclusions Immediately postoperative intra-articular retrograde injection of TA and 1 h of drain-clamping effectively reduced blood loss and blood transfusion after cementless TKA. We believe that this method is simple, easy, and suitable for these patients.

OPTIMIZATION OF DISJOINTS FOR MINIMIZATION OF FAILURE IN WDM OPTICAL NETWORK

Directory of Open Access Journals (Sweden)

A. Renugadevi

2015-06-01

Full Text Available In an optical network, the fiber optic cable is used for communication between the nodes in a network by passing lights. The main problem in optical network is finding the link disjoints as well as optimal solution for the disjoints. To tolerate a single link failure in the network, the enhanced active path first algorithm is used which computes the re-routed back-up path. The multiple link failure in a network called fibre span disjoint path problem is solved using integer linear programming algorithm. The loop back recovery is used to provide pre-planned recovery of link or node failures in a network which allows dynamic choice of routes over pre-planned directions. Considering reliability in a mesh networks, the reliability algorithm helps to achieve the maximum reliability in two-path protection. It addresses the multiple disjoint failures that arise in a network and discusses the best solution between paths shared nodes or links. The unified algorithm is used to generate the optimal results with minimum cost for multiple link failures. The heuristic algorithm namely maximum arbitrary double-link protection algorithm helps to pre-compute the back-up path for double-link failures. In all the above approaches the shortest optimized path must be improved. To find the best shortest path, link-disjoint lightpath algorithm is designed to compute the disjoint occurred in a network and it also satisfies the wavelength continuity constraint in wavelength division multiplexing. A polynomial time algorithm Wavelength Division Multiplexing – Passive Optical Networking is used to compute the disjoint happen in the network. The overall time efficiency is analyzed and performance is evaluated through simulations.

Planning the electron traffic in semiconductor networks: A mesoscopic analog of the Braess paradox encountered in road networks

International Nuclear Information System (INIS)

Huant, S.; Liu, P.; Sellier, H.; Baltazar, S.; Hackens, B.; Martins, F.; Bayot, V.; Wallart, X.; Desplanque, L.; Pala, M. G.

2013-01-01

By combining quantum simulations of electron transport and scanning-gate microscopy, we have shown that the current transmitted through a semiconductor two-path rectangular network in the ballistic and coherent regimes of transport can be paradoxically degraded by adding a third path to the network. This is analogous to the Braess paradox occurring in classical networks. Simulations reported here enlighten the role played by congestion in the network

PSO-Optimized Hopfield Neural Network-Based Multipath Routing for Mobile Ad-hoc Networks

Directory of Open Access Journals (Sweden)

Mansour Sheikhan

2012-06-01

Full Text Available Mobile ad-hoc network (MANET is a dynamic collection of mobile computers without the need for any existing infrastructure. Nodes in a MANET act as hosts and routers. Designing of robust routing algorithms for MANETs is a challenging task. Disjoint multipath routing protocols address this problem and increase the reliability, security and lifetime of network. However, selecting an optimal multipath is an NP-complete problem. In this paper, Hopfield neural network (HNN which its parameters are optimized by particle swarm optimization (PSO algorithm is proposed as multipath routing algorithm. Link expiration time (LET between each two nodes is used as the link reliability estimation metric. This approach can find either node-disjoint or link-disjoint paths in singlephase route discovery. Simulation results confirm that PSO-HNN routing algorithm has better performance as compared to backup path set selection algorithm (BPSA in terms of the path set reliability and number of paths in the set.

Adaptive Dynamics, Control, and Extinction in Networked Populations

Science.gov (United States)

2015-07-09

network geometries. From the pre-history of paths that go extinct, a density function is created from the prehistory of these paths, and a clear local...density plots of Fig. 3b. Using the IAMM to compute the most probable path and comparing it to the prehistory of extinction events on stochastic networks

WDM networking on a European Scale

DEFF Research Database (Denmark)

Parnis, Noel; Limal, Emmanuel; Hjelme, Dag R.

1998-01-01

Four different topological approaches to designing a pan-European optical network are discussed. For such an ultra-high capacity large-scale network, it is necessary to overcome physical path length limitations and to limit Optical Cross-Connect (OXC) complexity.......Four different topological approaches to designing a pan-European optical network are discussed. For such an ultra-high capacity large-scale network, it is necessary to overcome physical path length limitations and to limit Optical Cross-Connect (OXC) complexity....

Drain Back Systems in Laboratory and in Practice

DEFF Research Database (Denmark)

Perers, Bengt; Furbo, Simon; Fan, Jianhua

2015-01-01

in the collector loop to have a safe reliable operation. The components should also be designed and marked so that only one correct mounting option is possible, like forward and return pipes to/from the collector of slightly different sizes or color. Adapted installer education and training is a very important...... step to have success with drain back systems. Practices used in glycol systems may give serious failures. Key-words: Drain Back, Low Flow, Solar Combi System, ETC collectors....

Drain Tube-Induced Jejunal Penetration Masquerading as Bile Leak following Whipple’s Operation

Directory of Open Access Journals (Sweden)

Sang Ho Bae

2011-05-01

Full Text Available A 70-year-old man had undergone pancreaticoduodenectomy due to a distal common bile duct malignancy. After the operation, serous fluid discharge decreased from two drain tubes in the retroperitoneum. Over four weeks, the appearance of the serous fluid changed to a greenish bile color and the patient persistently drained over 300 ml/day. Viewed as bile leak at the choledochojejunostomy, treatment called for endoscopic diagnosis and therapy. Cap-fitted forward-viewing endoscopy demonstrated that the distal tip of a pancreatic drain catheter inserted at the pancreaticojejunostomy site had penetrated the opposite jejunum wall. One of the drain tubes primarily placed in the retroperitoneum had also penetrated the jejunum wall, with the distal tip positioned near the choledochojejunostomy site. No leak of contrast appeared beyond the jejunum or anastomosis site. Following repositioning of a penetrating catheter of the pancreaticojejunostomy, four days later, the patient underwent removal of two drain tubes without additional complications. In conclusion, the distal tip of the catheter, placed to drain pancreatic juice, penetrated the jejunum wall and may have caused localized perijejunal inflammation. The other drain tube, placed in the retroperitoneal space, might then have penetrated the inflamed wall of the jejunum, allowing persistent bile drainage via the drain tube. The results masqueraded as bile leakage following pancreaticoduodenectomy.

Perioperative lumbar drain utilization in transsphenoidal pituitary resection.

Science.gov (United States)

Alharbi, Shatha; Harsh, Griffith; Ajlan, Abdulrazag

2018-01-01

To evaluate lumbar drain (LD) efficacy in transnasal resection of pituitary macroadenomas in preventing postoperative cerebrospinal fluid (CSF) leak, technique safety, and effect on length of hospital stay. We conducted a retrospective data review of pituitary tumor patients in our institution who underwent surgery between December 2006 and January 2013. All patients were operated on for complete surgical resection of pituitary macroadenoma tumors. Patients were divided into 2 groups: group 1 received a preoperative drain, while LD was not preoperatively inserted in group 2. In cases of tumors with suprasellar extension with anticipation of high-flow leak, LD was inserted after the patient was intubated and in a lateral position. Lumbar drain was used for 48 hours, and the drain was removed if no leak was observed postoperatively. In documented postoperative CSF leak patients with no preoperative drain, the leak was treated by LD trial prior to surgical reconstruction. Cases in which leak occurred 6 months postoperatively were excluded. Our study population consisted of 186 patients, 99 women (53%) and 87 men (47%), with a mean age of 50.3+/-16.1 years. Complications occurred in 7 patients (13.7%) in group 1 versus 21 (15.5%) in group 2 (p=0.72). Postoperative CSF leak was observed in 1 patient (1.9%) in group 1 and 7 (5%) in group 2 (Fisher exact test=0.3). Length of hospital stay was a mean of 4.7+/-1.9 days in group 1 and a mean of 2.7+/-2.4 days in group 2 (pLD insertion is generally considered safe with a low risk of complications, it increases the length of hospitalization. Minor complications include headaches and patient discomfort.

Data center networks and network architecture

Science.gov (United States)

Esaki, Hiroshi

2014-02-01

This paper discusses and proposes the architectural framework, which is for data center networks. The data center networks require new technical challenges, and it would be good opportunity to change the functions, which are not need in current and future networks. Based on the observation and consideration on data center networks, this paper proposes; (i) Broadcast-free layer 2 network (i.e., emulation of broadcast at the end-node), (ii) Full-mesh point-to-point pipes, and (iii) IRIDES (Invitation Routing aDvertisement for path Engineering System).

Path integration of head direction: updating a packet of neural activity at the correct speed using axonal conduction delays.

Science.gov (United States)

Walters, Daniel; Stringer, Simon; Rolls, Edmund

2013-01-01

The head direction cell system is capable of accurately updating its current representation of head direction in the absence of visual input. This is known as the path integration of head direction. An important question is how the head direction cell system learns to perform accurate path integration of head direction. In this paper we propose a model of velocity path integration of head direction in which the natural time delay of axonal transmission between a linked continuous attractor network and competitive network acts as a timing mechanism to facilitate the correct speed of path integration. The model effectively learns a "look-up" table for the correct speed of path integration. In simulation, we show that the model is able to successfully learn two different speeds of path integration across two different axonal conduction delays, and without the need to alter any other model parameters. An implication of this model is that, by learning look-up tables for each speed of path integration, the model should exhibit a degree of robustness to damage. In simulations, we show that the speed of path integration is not significantly affected by degrading the network through removing a proportion of the cells that signal rotational velocity.

Effects of pond draining on biodiversity and water quality of farm ponds.

Science.gov (United States)

Usio, Nisikawa; Imada, Miho; Nakagawa, Megumi; Akasaka, Munemitsu; Takamura, Noriko

2013-12-01

Farm ponds have high conservation value because they contribute significantly to regional biodiversity and ecosystem services. In Japan pond draining is a traditional management method that is widely believed to improve water quality and eradicate invasive fish. In addition, fishing by means of pond draining has significant cultural value for local people, serving as a social event. However, there is a widespread belief that pond draining reduces freshwater biodiversity through the extirpation of aquatic animals, but scientific evaluation of the effectiveness of pond draining is lacking. We conducted a large-scale field study to evaluate the effects of pond draining on invasive animal control, water quality, and aquatic biodiversity relative to different pond-management practices, pond physicochemistry, and surrounding land use. The results of boosted regression-tree models and analyses of similarity showed that pond draining had little effect on invasive fish control, water quality, or aquatic biodiversity. Draining even facilitated the colonization of farm ponds by invasive red swamp crayfish (Procambarus clarkii), which in turn may have detrimental effects on the biodiversity and water quality of farm ponds. Our results highlight the need for reconsidering current pond management and developing management plans with respect to multifunctionality of such ponds. Efectos del Drenado de Estanques sobre la Biodiversidad y la Calidad del Agua en Estanques de Cultivo. © 2013 Society for Conservation Biology.

Placement of percutaneous transhepatic biliary stent using a silicone drain with channels

Science.gov (United States)

Yoshida, Hiroshi; Mamada, Yasuhiro; Taniai, Nobuhiko; Mineta, Sho; Mizuguchi, Yoshiaki; Kawano, Yoichi; Sasaki, Junpei; Nakamura, Yoshiharu; Aimoto, Takayuki; Tajiri, Takashi

2009-01-01

This report describes a method for percutaneous transhepatic biliary stenting with a BLAKE Silicone Drain, and discusses the usefulness of placement of the drain connected to a J-VAC Suction Reservoir for the treatment of stenotic hepaticojejunostomy. Percutaneous transhepatic biliary drainage was performed under ultrasonographic guidance in a patient with stenotic hepaticojejunostomy after hepatectomy for hepatic hilum malignancy. The technique used was as follows. After dilatation of the drainage root, an 11-Fr tube with several side holes was passed through the stenosis of the hepaticojejunostomy. A 10-Fr BLAKE Silicone Drain is flexible, which precludes one-step insertion. One week after insertion of the 11-Fr tube, a 0.035-inch guidewire was inserted into the tube. After removal of the 11-Fr tube, the guidewire was put into the channel of a 10-Fr BLAKE Silicone Drain. The drain was inserted into the jejunal limb through the intrahepatic bile duct and was connected to a J-VAC Suction Reservoir. Low-pressure continued suction was applied. Patients can be discharged after insertion of the 10-Fr BLAKE Silicone Drain connected to the J-VAC Suction Reservoir. Placement of a percutaneous transhepatic biliary stent using a 10-Fr BLAKE Silicone Drain connected to a J-VAC Suction Reservoir is useful for the treatment of stenotic hepaticojejunostomy. PMID:19725159

cisPath: an R/Bioconductor package for cloud users for visualization and management of functional protein interaction networks.

Science.gov (United States)

Wang, Likun; Yang, Luhe; Peng, Zuohan; Lu, Dan; Jin, Yan; McNutt, Michael; Yin, Yuxin

2015-01-01

With the burgeoning development of cloud technology and services, there are an increasing number of users who prefer cloud to run their applications. All software and associated data are hosted on the cloud, allowing users to access them via a web browser from any computer, anywhere. This paper presents cisPath, an R/Bioconductor package deployed on cloud servers for client users to visualize, manage, and share functional protein interaction networks. With this R package, users can easily integrate downloaded protein-protein interaction information from different online databases with private data to construct new and personalized interaction networks. Additional functions allow users to generate specific networks based on private databases. Since the results produced with the use of this package are in the form of web pages, cloud users can easily view and edit the network graphs via the browser, using a mouse or touch screen, without the need to download them to a local computer. This package can also be installed and run on a local desktop computer. Depending on user preference, results can be publicized or shared by uploading to a web server or cloud driver, allowing other users to directly access results via a web browser. This package can be installed and run on a variety of platforms. Since all network views are shown in web pages, such package is particularly useful for cloud users. The easy installation and operation is an attractive quality for R beginners and users with no previous experience with cloud services.

Improved Efficient Routing Strategy on Scale-Free Networks

Science.gov (United States)

Jiang, Zhong-Yuan; Liang, Man-Gui

Since the betweenness of nodes in complex networks can theoretically represent the traffic load of nodes under the currently used routing strategy, we propose an improved efficient (IE) routing strategy to enhance to the network traffic capacity based on the betweenness centrality. Any node with the highest betweenness is susceptible to traffic congestion. An efficient way to improve the network traffic capacity is to redistribute the heavy traffic load from these central nodes to non-central nodes, so in this paper, we firstly give a path cost function by considering the sum of node betweenness with a tunable parameter β along the actual path. Then, by minimizing the path cost, our IE routing strategy achieved obvious improvement on the network transport efficiency. Simulations on scale-free Barabási-Albert (BA) networks confirmed the effectiveness of our strategy, when compared with the efficient routing (ER) and the shortest path (SP) routing.

Management of extensive surgical emphysema with subcutaneous drain: A case report

Directory of Open Access Journals (Sweden)

Quoc Tran

Full Text Available Introduction: Subcutaneous emphysema (SE is a frequent and often self-limiting complication of tube thoracostomy or other cardiothoracic procedures. On rare occasions, severe and extensive surgical emphysema marked by palpable cutaneous tension, dysphagia, dysphonia, palpebral closure or associated with pneumoperitoneum, airway compromise, “tension phenomenon” and respiratory failure require treatment. Presentation of case: A 67 year old lady presented with a large spontaneous pneumothorax on the background of end-stage chronic obstructive pulmonary disease (COPD and newly diagnosed lung cancer, developed extensive surgical emphysema following insertion of a chest drain. Immediate improvement was observed after insertion of a large-bore, 26 French (Fr. intercostal catheter, subcutaneous drain which was maintained under low suction (−5 cm H2O for a further 24 h. Discussion: Several methods have been described in the literature for the treatment of extensive subcutaneous emphysema, including: emergency tracheostomy, multisite subcutaneous drainage, infraclavicular “blow holes” incisions and subcutaneous drains or simply increasing suction on an in situ chest drain. Here a large-bore, fenestrated, subcutaneous drain maintained on low negative pressure also provided the necessary decompression. Conclusion: In the absence of a comparative study to identify the most effective method to manage extensive subcutaneous emphysema, this case highlights an effective, simple and safe management option. Keywords: Pneumothorax, Subcutaneous emphysema, Drain, Low suction, Intercostal catheter, Case report

A deterministic method for estimating free energy genetic network landscapes with applications to cell commitment and reprogramming paths.

Science.gov (United States)

Olariu, Victor; Manesso, Erica; Peterson, Carsten

2017-06-01

Depicting developmental processes as movements in free energy genetic landscapes is an illustrative tool. However, exploring such landscapes to obtain quantitative or even qualitative predictions is hampered by the lack of free energy functions corresponding to the biochemical Michaelis-Menten or Hill rate equations for the dynamics. Being armed with energy landscapes defined by a network and its interactions would open up the possibility of swiftly identifying cell states and computing optimal paths, including those of cell reprogramming, thereby avoiding exhaustive trial-and-error simulations with rate equations for different parameter sets. It turns out that sigmoidal rate equations do have approximate free energy associations. With this replacement of rate equations, we develop a deterministic method for estimating the free energy surfaces of systems of interacting genes at different noise levels or temperatures. Once such free energy landscape estimates have been established, we adapt a shortest path algorithm to determine optimal routes in the landscapes. We explore the method on three circuits for haematopoiesis and embryonic stem cell development for commitment and reprogramming scenarios and illustrate how the method can be used to determine sequential steps for onsets of external factors, essential for efficient reprogramming.

Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Sunil Kumar

2013-01-01

Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

Effect of random edge failure on the average path length

Energy Technology Data Exchange (ETDEWEB)

Guo Dongchao; Liang Mangui; Li Dandan; Jiang Zhongyuan, E-mail: mgliang58@gmail.com, E-mail: 08112070@bjtu.edu.cn [Institute of Information Science, Beijing Jiaotong University, 100044, Beijing (China)

2011-10-14

We study the effect of random removal of edges on the average path length (APL) in a large class of uncorrelated random networks in which vertices are characterized by hidden variables controlling the attachment of edges between pairs of vertices. A formula for approximating the APL of networks suffering random edge removal is derived first. Then, the formula is confirmed by simulations for classical ER (Erdoes and Renyi) random graphs, BA (Barabasi and Albert) networks, networks with exponential degree distributions as well as random networks with asymptotic power-law degree distributions with exponent {alpha} > 2. (paper)

Detection of deregulated modules using deregulatory linked path.

Directory of Open Access Journals (Sweden)

Yuxuan Hu

Full Text Available The identification of deregulated modules (such as induced by oncogenes is a crucial step for exploring the pathogenic process of complex diseases. Most of the existing methods focus on deregulation of genes rather than the links of the path among them. In this study, we emphasize on the detection of deregulated links, and develop a novel and effective regulatory path-based approach in finding deregulated modules. Observing that a regulatory pathway between two genes might involve in multiple rather than a single path, we identify condition-specific core regulatory path (CCRP to detect the significant deregulation of regulatory links. Using time-series gene expression, we define the regulatory strength within each gene pair based on statistical dependence analysis. The CCRPs in regulatory networks can then be identified using the shortest path algorithm. Finally, we derive the deregulated modules by integrating the differential edges (as deregulated links of the CCRPs between the case and the control group. To demonstrate the effectiveness of our approach, we apply the method to expression data associated with different states of Human Epidermal Growth Factor Receptor 2 (HER2. The experimental results show that the genes as well as the links in the deregulated modules are significantly enriched in multiple KEGG pathways and GO biological processes, most of which can be validated to suffer from impact of this oncogene based on previous studies. Additionally, we find the regulatory mechanism associated with the crucial gene SNAI1 significantly deregulated resulting from the activation of HER2. Hence, our method provides not only a strategy for detecting the deregulated links in regulatory networks, but also a way to identify concerning deregulated modules, thus contributing to the target selection of edgetic drugs.

Path optimization method for the sign problem

Directory of Open Access Journals (Sweden)

Ohnishi Akira

2018-01-01

Full Text Available We propose a path optimization method (POM to evade the sign problem in the Monte-Carlo calculations for complex actions. Among many approaches to the sign problem, the Lefschetz-thimble path-integral method and the complex Langevin method are promising and extensively discussed. In these methods, real field variables are complexified and the integration manifold is determined by the flow equations or stochastically sampled. When we have singular points of the action or multiple critical points near the original integral surface, however, we have a risk to encounter the residual and global sign problems or the singular drift term problem. One of the ways to avoid the singular points is to optimize the integration path which is designed not to hit the singular points of the Boltzmann weight. By specifying the one-dimensional integration-path as z = t +if(t(f ϵ R and by optimizing f(t to enhance the average phase factor, we demonstrate that we can avoid the sign problem in a one-variable toy model for which the complex Langevin method is found to fail. In this proceedings, we propose POM and discuss how we can avoid the sign problem in a toy model. We also discuss the possibility to utilize the neural network to optimize the path.

Optimal Path Planner for Mobile Robot in 2D Environment

Directory of Open Access Journals (Sweden)

Valeri Kroumov

2004-06-01

Full Text Available The problem of path planning for the case of a mobile robot moving in an environment filled with obstacles with known shapes and positions is studied. A path planner based on the genetic algorithm approach, which generates optimal in length path is proposed. The population member paths are generated by another algorithm, which uses for description of the obstacles an artificial annealing neural network and is based on potential field approach. The resulting path is piecewise linear with changing directions at the corners of the obstacles. Because of this feature, the inverse kinematics problems in controlling differential drive robots are simply solved: to drive the robot to some goal pose (x, y, theta, the robot can be spun in place until it is aimed at (x, y, then driven forward until it is at (x, y, and then spun in place until the required goal orientation

LambdaStation: Exploiting Advance Networks In Data Intensive High Energy Physics Applications

Energy Technology Data Exchange (ETDEWEB)

Harvey B. Newman

2009-09-11

Lambda Station software implements selective, dynamic, secure path control between local storage & analysis facilities, and high bandwidth, wide-area networks (WANs). It is intended to facilitate use of desirable, alternate wide area network paths which may only be intermittently available, or subject to policies that restrict usage to specified traffic. Lambda Station clients gain awareness of potential alternate network paths via Clarens-based web services, including path characteristics such as bandwidth and availability. If alternate path setup is requested and granted, Lambda Station will configure the local network infrastructure to properly forward designated data flows via the alternate path. A fully functional implementation of Lambda Station, capable of dynamic alternate WAN path setup and teardown, has been successfully developed. A limited Lambda Station-awareness capability within the Storage Resource Manager (SRM) product has been developed. Lambda Station has been successfully tested in a number of venues, including Super Computing 2008. LambdaStation software, developed by the Fermilab team, enables dynamic allocation of alternate network paths for high impact traffic and to forward designated flows across LAN. It negotiates with reservation and provisioning systems of WAN control planes, be it based on SONET channels, demand tunnels, or dynamic circuit networks. It creates End-To-End circuit between single hosts, computer farms or networks with predictable performance characteristics, preserving QoS if supported in LAN and WAN and tied security policy allowing only specific traffic to be forwarded or received through created path. Lambda Station project also explores Network Awareness capabilities.

Secure Path Selection under Random Fading

Directory of Open Access Journals (Sweden)

Furqan Jameel

2017-05-01

Full Text Available Application-oriented Wireless Sensor Networks (WSNs promises to be one of the most useful technologies of this century. However, secure communication between nodes in WSNs is still an unresolved issue. In this context, we propose two protocols (i.e. Optimal Secure Path (OSP and Sub-optimal Secure Path (SSP to minimize the outage probability of secrecy capacity in the presence of multiple eavesdroppers. We consider dissimilar fading at the main and wiretap link and provide detailed evaluation of the impact of Nakagami-m and Rician-K factors on the secrecy performance of WSNs. Extensive simulations are performed to validate our findings. Although the optimal scheme ensures more security, yet the sub-optimal scheme proves to be a more practical approach to secure wireless links.

A retrospective study of the use of active suction wound drains in dogs and cats.

Science.gov (United States)

Bristow, P C; Halfacree, Z J; Baines, S J

2015-05-01

To report indications for use and complications associated with commonly used closed active suction wound drains in a large number of clinical cases. Retrospective review of medical case records (from 2004 to 2010) for dogs and cats that had a closed active suction drain placed into a wound. Only the four most common drain types were included: Mini Redovac®, Redovac®, Jackson Pratt® and Wound Evac®. Two hundred and fifty-three drains were placed in 33 cats and 195 dogs. Mini Redovac drains were used most frequently in cats (76 · 5%) and Redovac drains in dogs (54 · 3%). The infection rate for clean surgeries in dogs was 15 · 6% (unattainable in cats). Major complications occurred in four dogs; minor complications occurred in 12 drains in cats (35 · 3%), and in 74 drains in dogs (33 · 8%). There was no statistically significant association between the type of drain and complication rate for either species. Although closed active suction drains can be used with low risk of major complications, they lead to a high rate of infection in clean surgeries in dogs. It is recommended that such drains are kept in place for the shortest time possible and that strict asepsis is adhered to both during placement and management. © 2015 British Small Animal Veterinary Association.

Radiation dose associated with CT-guided drain placement for pediatric patients

Energy Technology Data Exchange (ETDEWEB)

Schwartz, Cody J.; Isaacson, Ari J.; Fordham, Lynn Ansley; Ivanovic, Marija; Dixon, Robert G. [University of North Carolina at Chapel Hill, Department of Radiology, UNC Health Care, Chapel Hill, NC (United States); Taylor, J.B. [University of North Carolina at Chapel Hill, Environment, Health and Safety, Chapel Hill, NC (United States)

2017-05-15

To date, there are limited radiation dose data on CT-guided procedures in pediatric patients. Our goal was to quantify the radiation dose associated with pediatric CT-guided drain placement and follow-up drain evaluations in order to estimate effective dose. We searched the electronic medical record and picture archiving and communication system (PACS) to identify all pediatric (<18 years old) CT-guided drain placements performed between January 2008 and December 2013 at our institution. We compiled patient data and radiation dose information from CT-guided drain placements as well as pre-procedural diagnostic CTs and post-procedural follow-up fluoroscopic abscess catheter injections (sinograms). Then we converted dose-length product, fluoroscopy time and number of acquisitions to effective doses using Monte Carlo simulations and age-appropriate conversion factors based on annual quality-control testing. Fifty-two drainages were identified with mean patient age of 11.0 years (5 weeks to 17 years). Most children had diagnoses of appendicitis (n=23) or inflammatory bowel disease (n=11). Forty-seven patients had diagnostic CTs, with a mean effective dose of 7.3 mSv (range 1.1-25.5 mSv). Drains remained in place for an average of 16.9 days (range 0-75 days), with an average of 0.9 (0-5) sinograms per patient in follow-up. The mean effective dose for all drainages and follow-up exams was 5.3 mSv (0.7-17.1) and 62% (32/52) of the children had effective doses less than 5 mSv. The majority of pediatric patients who have undergone CT-guided drain placements at our institution have received total radiation doses on par with diagnostic ranges. This information could be useful when describing the dose of radiation to parents and providers when CT-guided drain placement is necessary. (orig.)

Radiation dose associated with CT-guided drain placement for pediatric patients

International Nuclear Information System (INIS)

Schwartz, Cody J.; Isaacson, Ari J.; Fordham, Lynn Ansley; Ivanovic, Marija; Dixon, Robert G.; Taylor, J.B.

2017-01-01

To date, there are limited radiation dose data on CT-guided procedures in pediatric patients. Our goal was to quantify the radiation dose associated with pediatric CT-guided drain placement and follow-up drain evaluations in order to estimate effective dose. We searched the electronic medical record and picture archiving and communication system (PACS) to identify all pediatric (<18 years old) CT-guided drain placements performed between January 2008 and December 2013 at our institution. We compiled patient data and radiation dose information from CT-guided drain placements as well as pre-procedural diagnostic CTs and post-procedural follow-up fluoroscopic abscess catheter injections (sinograms). Then we converted dose-length product, fluoroscopy time and number of acquisitions to effective doses using Monte Carlo simulations and age-appropriate conversion factors based on annual quality-control testing. Fifty-two drainages were identified with mean patient age of 11.0 years (5 weeks to 17 years). Most children had diagnoses of appendicitis (n=23) or inflammatory bowel disease (n=11). Forty-seven patients had diagnostic CTs, with a mean effective dose of 7.3 mSv (range 1.1-25.5 mSv). Drains remained in place for an average of 16.9 days (range 0-75 days), with an average of 0.9 (0-5) sinograms per patient in follow-up. The mean effective dose for all drainages and follow-up exams was 5.3 mSv (0.7-17.1) and 62% (32/52) of the children had effective doses less than 5 mSv. The majority of pediatric patients who have undergone CT-guided drain placements at our institution have received total radiation doses on par with diagnostic ranges. This information could be useful when describing the dose of radiation to parents and providers when CT-guided drain placement is necessary. (orig.)

An Approach for Indoor Path Computation among Obstacles that Considers User Dimension

Directory of Open Access Journals (Sweden)

Liu Liu

2015-12-01

Full Text Available People often transport objects within indoor environments, who need enough space for the motion. In such cases, the accessibility of indoor spaces relies on the dimensions, which includes a person and her/his operated objects. This paper proposes a new approach to avoid obstacles and compute indoor paths with respect to the user dimension. The approach excludes inaccessible spaces for a user in five steps: (1 compute the minimum distance between obstacles and find the inaccessible gaps; (2 group obstacles according to the inaccessible gaps; (3 identify groups of obstacles that influence the path between two locations; (4 compute boundaries for the selected groups; and (5 build a network in the accessible area around the obstacles in the room. Compared to the Minkowski sum method for outlining inaccessible spaces, the proposed approach generates simpler polygons for groups of obstacles that do not contain inner rings. The creation of a navigation network becomes easier based on these simple polygons. By using this approach, we can create user- and task-specific networks in advance. Alternatively, the accessible path can be generated on the fly before the user enters a room.

Distributed wireless quantum communication networks with partially entangled pairs

International Nuclear Information System (INIS)

Yu Xu-Tao; Zhang Zai-Chen; Xu Jin

2014-01-01

Wireless quantum communication networks transfer quantum state by teleportation. Existing research focuses on maximal entangled pairs. In this paper, we analyse the distributed wireless quantum communication networks with partially entangled pairs. A quantum routing scheme with multi-hop teleportation is proposed. With the proposed scheme, is not necessary for the quantum path to be consistent with the classical path. The quantum path and its associated classical path are established in a distributed way. Direct multi-hop teleportation is conducted on the selected path to transfer a quantum state from the source to the destination. Based on the feature of multi-hop teleportation using partially entangled pairs, if the node number of the quantum path is even, the destination node will add another teleportation at itself. We simulated the performance of distributed wireless quantum communication networks with a partially entangled state. The probability of transferring the quantum state successfully is statistically analyzed. Our work shows that multi-hop teleportation on distributed wireless quantum networks with partially entangled pairs is feasible. (general)

Theory of Maxwell's fish eye with mutually interacting sources and drains

Science.gov (United States)

Leonhardt, Ulf; Sahebdivan, Sahar

2015-11-01

Maxwell's fish eye is predicted to image with a resolution not limited by the wavelength of light. However, interactions between sources and drains may ruin the subwavelength imaging capabilities of this and similar absolute optical instruments. Nevertheless, as we show in this paper, at resonance frequencies of the device, an array of drains may resolve a single source, or alternatively, a single drain may scan an array of sources, no matter how narrowly spaced they are. It seems that near-field information can be obtained from far-field distances.

Analysis of Known Linear Distributed Average Consensus Algorithms on Cycles and Paths

Directory of Open Access Journals (Sweden)

Jesús Gutiérrez-Gutiérrez

2018-03-01

Full Text Available In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required. The selected network topologies for the analysis (comparison are the cycle and the path. Specifically, in the present paper, we compute closed-form expressions for the convergence time of four known deterministic algorithms and closed-form bounds for the convergence time of two known randomized algorithms on cycles and paths. Moreover, we also compute a closed-form expression for the convergence time of the fastest deterministic algorithm considered on grids.

Improved simulation of poorly drained forests using Biome-BGC.

Science.gov (United States)

Bond-Lamberty, Ben; Gower, Stith T; Ahl, Douglas E

2007-05-01

Forested wetlands and peatlands are important in boreal and terrestrial biogeochemical cycling, but most general-purpose forest process models are designed and parameterized for upland systems. We describe changes made to Biome-BGC, an ecophysiological process model, that improve its ability to simulate poorly drained forests. Model changes allowed for: (1) lateral water inflow from a surrounding watershed, and variable surface and subsurface drainage; (2) adverse effects of anoxic soil on decomposition and nutrient mineralization; (3) closure of leaf stomata in flooded soils; and (4) growth of nonvascular plants (i.e., bryophytes). Bryophytes were treated as ectohydric broadleaf evergreen plants with zero stomatal conductance, whose cuticular conductance to CO(2) was dependent on plant water content. Individual model changes were parameterized with published data, and ecosystem-level model performance was assessed by comparing simulated output to field data from the northern BOREAS site in Manitoba, Canada. The simulation of the poorly drained forest model exhibited reduced decomposition and vascular plant growth (-90%) compared with that of the well-drained forest model; the integrated bryophyte photosynthetic response accorded well with published data. Simulated net primary production, biomass and soil carbon accumulation broadly agreed with field measurements, although simulated net primary production was higher than observed data in well-drained stands. Simulated net primary production in the poorly drained forest was most sensitive to oxygen restriction on soil processes, and secondarily to stomatal closure in flooded conditions. The modified Biome-BGC remains unable to simulate true wetlands that are subject to prolonged flooding, because it does not track organic soil formation, water table changes, soil redox potential or anaerobic processes.

Management of Chest Drains: A National Survey on Surgeons‑in ...

African Journals Online (AJOL)

triangle of safety [Figure 1]. Just above a quarter of respondents (27.2%) always utilized different sizes of tubes for different pathologies and the same proportion of respondents always positioned the tip of the tube apically to drain pneumothorax and basally to drain pleural effusion. In contrast, 9.9% and 6.2% of respondents.

Optimal solution for travelling salesman problem using heuristic shortest path algorithm with imprecise arc length

Science.gov (United States)

Bakar, Sumarni Abu; Ibrahim, Milbah

2017-08-01

The shortest path problem is a popular problem in graph theory. It is about finding a path with minimum length between a specified pair of vertices. In any network the weight of each edge is usually represented in a form of crisp real number and subsequently the weight is used in the calculation of shortest path problem using deterministic algorithms. However, due to failure, uncertainty is always encountered in practice whereby the weight of edge of the network is uncertain and imprecise. In this paper, a modified algorithm which utilized heuristic shortest path method and fuzzy approach is proposed for solving a network with imprecise arc length. Here, interval number and triangular fuzzy number in representing arc length of the network are considered. The modified algorithm is then applied to a specific example of the Travelling Salesman Problem (TSP). Total shortest distance obtained from this algorithm is then compared with the total distance obtained from traditional nearest neighbour heuristic algorithm. The result shows that the modified algorithm can provide not only on the sequence of visited cities which shown to be similar with traditional approach but it also provides a good measurement of total shortest distance which is lesser as compared to the total shortest distance calculated using traditional approach. Hence, this research could contribute to the enrichment of methods used in solving TSP.

Appendices for: Improper Signaling in Two-Path Relay Channels

KAUST Repository

Gaafar, Mohamed

2016-12-01

This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

Appendices for: Improper Signaling in Two-Path Relay Channels

KAUST Repository

Gaafar, Mohamed; Amin, Osama; Schaefer, Rafael F.; Alouini, Mohamed-Slim

2016-01-01

This document contains the appendices for the work in “Improper Signaling in Two-Path Relay Channels,” which is submitted to 2017 IEEE International Conference on Communications (ICC) Workshop on Full-Duplex Communications for Future Wireless Networks, Paris, France.

Hard paths, soft paths or no paths? Cross-cultural perceptions of water solutions

Science.gov (United States)

Wutich, A.; White, A. C.; White, D. D.; Larson, K. L.; Brewis, A.; Roberts, C.

2014-01-01

In this study, we examine how development status and water scarcity shape people's perceptions of "hard path" and "soft path" water solutions. Based on ethnographic research conducted in four semi-rural/peri-urban sites (in Bolivia, Fiji, New Zealand, and the US), we use content analysis to conduct statistical and thematic comparisons of interview data. Our results indicate clear differences associated with development status and, to a lesser extent, water scarcity. People in the two less developed sites were more likely to suggest hard path solutions, less likely to suggest soft path solutions, and more likely to see no path to solutions than people in the more developed sites. Thematically, people in the two less developed sites envisioned solutions that involve small-scale water infrastructure and decentralized, community-based solutions, while people in the more developed sites envisioned solutions that involve large-scale infrastructure and centralized, regulatory water solutions. People in the two water-scarce sites were less likely to suggest soft path solutions and more likely to see no path to solutions (but no more likely to suggest hard path solutions) than people in the water-rich sites. Thematically, people in the two water-rich sites seemed to perceive a wider array of unrealized potential soft path solutions than those in the water-scarce sites. On balance, our findings are encouraging in that they indicate that people are receptive to soft path solutions in a range of sites, even those with limited financial or water resources. Our research points to the need for more studies that investigate the social feasibility of soft path water solutions, particularly in sites with significant financial and natural resource constraints.

Path coupling and aggregate path coupling

CERN Document Server

Kovchegov, Yevgeniy

2018-01-01

This book describes and characterizes an extension to the classical path coupling method applied to statistical mechanical models, referred to as aggregate path coupling. In conjunction with large deviations estimates, the aggregate path coupling method is used to prove rapid mixing of Glauber dynamics for a large class of statistical mechanical models, including models that exhibit discontinuous phase transitions which have traditionally been more difficult to analyze rigorously. The book shows how the parameter regions for rapid mixing for several classes of statistical mechanical models are derived using the aggregate path coupling method.

Continuous 'Passive' Registration of Non-Point Contaminant Loads Via Agricultural Subsurface Drain Tubes

Science.gov (United States)

Rozemeijer, J.; Jansen, S.; de Jonge, H.; Lindblad Vendelboe, A.

2014-12-01

Considering their crucial role in water and solute transport, enhanced monitoring and modeling of agricultural subsurface tube drain systems is important for adequate water quality management. For example, previous work in lowland agricultural catchments has shown that subsurface tube drain effluent contributed up to 80% of the annual discharge and 90-92% of the annual NO3 loads from agricultural fields towards the surface water. However, existing monitoring techniques for flow and contaminant loads from tube drains are expensive and labor-intensive. Therefore, despite the unambiguous relevance of this transport route, tube drain monitoring data are scarce. The presented study aimed developing a cheap, simple, and robust method to monitor loads from tube drains. We are now ready to introduce the Flowcap that can be attached to the outlet of tube drains and is capable of registering total flow, contaminant loads, and flow-averaged concentrations. The Flowcap builds on the existing SorbiCells, a modern passive sampling technique that measures average concentrations over longer periods of time (days to months) for various substances. By mounting SorbiCells in our Flowcap, a flow-proportional part of the drain effluent is sampled from the main stream. Laboratory testing yielded good linear relations (R-squared of 0.98) between drainage flow rates and sampling rates. The Flowcap was tested in practice for measuring NO3 loads from two agricultural fields and one glasshouse in the Netherlands. The Flowcap registers contaminant loads from tube drains without any need for housing, electricity, or maintenance. This enables large-scale monitoring of non-point contaminant loads via tube drains, which would facilitate the improvement of contaminant transport models and would yield valuable information for the selection and evaluation of mitigation options to improve water quality.

The stable stiffness triangle - drained sand during deformation cycles

DEFF Research Database (Denmark)

Sabaliauskas, Tomas; Ibsen, Lars Bo

2017-01-01

Cyclic, drained sand stiffness was observed using the Danish triaxial appa- ratus. New, deformation dependant soil property (the stable stiffness triangle) was detected. Using the the stable stiffness triangle, secant stiffness of drained sand was plausible to predict (and control) even during ir...... findings can find application in off-shore, seismic and other engi- neering practice, or inspire new branches of research and modelling wherever dynamic, cyclic or transient loaded sand is encountered....

Cold Vacuum Drying facility effluent drain system design description

International Nuclear Information System (INIS)

PITKOFF, C.C.

1999-01-01

This document describes the Cold Vacuum Drying Facility (CVDF) effluent drain system (EFS). The primary function of the EFS is to collect and transport fire suppression water discharged into a CVDF process bay to a retention basin located outside the facility. The EFS also provides confinement of spills that occur inside a process bay and allows non-contaminated water that drains to the process bay sumps to be collected until sampling and analysis are complete

PathShuffle: Credit Mixing and Anonymous Payments for Ripple

OpenAIRE

Moreno-Sanchez Pedro; Ruffing Tim; Kate Aniket

2017-01-01

The I owe you (IOU) credit network Ripple is one of the most prominent alternatives in the burgeoning field of decentralized payment systems. Ripple’s path-based transactions set it apart from cryptocurrencies such as Bitcoin. Its pseudonymous nature, while still maintaining some regulatory capabilities, has motivated several financial institutions across the world to use Ripple for processing their daily transactions. Nevertheless, with its public ledger, a credit network such as Ripple is n...

241-AY-102 Leak Detection Pit Drain Line Inspection Report

International Nuclear Information System (INIS)

Boomer, Kayle D.; Engeman, Jason K.; Gunter, Jason R.; Joslyn, Cameron C.; Vazquez, Brandon J.; Venetz, Theodore J.; Garfield, John S.

2014-01-01

This document provides a description of the design components, operational approach, and results from the Tank AY-102 leak detection pit drain piping visual inspection. To perform this inspection a custom robotic crawler with a deployment device was designed, built, and operated by IHI Southwest Technologies, Inc. for WRPS to inspect the 6-inch leak detection pit drain line

Effect of an intervention in storm drains to prevent Aedes aegypti reproduction in Salvador, Brazil.

Science.gov (United States)

Souza, Raquel Lima; Mugabe, Vánio André; Paploski, Igor Adolfo Dexheimer; Rodrigues, Moreno S; Moreira, Patrícia Sousa Dos Santos; Nascimento, Leile Camila Jacob; Roundy, Christopher Michael; Weaver, Scott C; Reis, Mitermayer Galvão; Kitron, Uriel; Ribeiro, Guilherme Sousa

2017-07-11

Aedes aegypti, the principal vector for dengue, chikungunya and Zika viruses, is a synanthropic species that uses stagnant water to complete its reproductive cycle. In urban settings, rainfall water draining structures, such as storm drains, may retain water and serve as a larval development site for Aedes spp. reproduction. Herein, we describe the effect of a community-based intervention on preventing standing water accumulation in storm drains and their consequent infestation by adult and immature Ae. aegypti and other mosquitoes. Between April and May of 2016, local residents association of Salvador, Brazil, after being informed of water accumulation and Ae. aegypti infestation in the storm drains in their area, performed an intervention on 52 storm drains. The intervention consisted of placing concrete at the bottom of the storm drains to elevate their base to the level of the outflow tube, avoiding water accumulation, and placement of a metal mesh covering the outflow tube to avoid its clogging with debris. To determine the impact of the intervention, we compared the frequency at which the 52 storm drains contained water, as well as adult and immature mosquitoes using data from two surveys performed before and two surveys performed after the intervention. During the pre-intervention period, water accumulated in 48 (92.3%) of the storm drains, and immature Ae. aegypti were found in 11 (21.2%) and adults in 10 (19.2%). After the intervention, water accumulated in 5 (9.6%) of the storm drains (P Aedes mosquitoes (mainly Culex spp.) in the storm drains also decreased after the intervention. This study exemplifies how a simple intervention targeting storm drains can result in a major reduction of water retention, and, consequently, impact Ae. aegypti larval populations. Larger and multi-center evaluations are needed to confirm the potential of citywide structural modifications of storm drains to reduce Aedes spp. infestation level.

An Energy-Efficient Cluster-Based Vehicle Detection on Road Network Using Intention Numeration Method

Directory of Open Access Journals (Sweden)

Deepa Devasenapathy

2015-01-01

Full Text Available The traffic in the road network is progressively increasing at a greater extent. Good knowledge of network traffic can minimize congestions using information pertaining to road network obtained with the aid of communal callers, pavement detectors, and so on. Using these methods, low featured information is generated with respect to the user in the road network. Although the existing schemes obtain urban traffic information, they fail to calculate the energy drain rate of nodes and to locate equilibrium between the overhead and quality of the routing protocol that renders a great challenge. Thus, an energy-efficient cluster-based vehicle detection in road network using the intention numeration method (CVDRN-IN is developed. Initially, sensor nodes that detect a vehicle are grouped into separate clusters. Further, we approximate the strength of the node drain rate for a cluster using polynomial regression function. In addition, the total node energy is estimated by taking the integral over the area. Finally, enhanced data aggregation is performed to reduce the amount of data transmission using digital signature tree. The experimental performance is evaluated with Dodgers loop sensor data set from UCI repository and the performance evaluation outperforms existing work on energy consumption, clustering efficiency, and node drain rate.

An energy-efficient cluster-based vehicle detection on road network using intention numeration method.

Science.gov (United States)

Devasenapathy, Deepa; Kannan, Kathiravan

2015-01-01

The traffic in the road network is progressively increasing at a greater extent. Good knowledge of network traffic can minimize congestions using information pertaining to road network obtained with the aid of communal callers, pavement detectors, and so on. Using these methods, low featured information is generated with respect to the user in the road network. Although the existing schemes obtain urban traffic information, they fail to calculate the energy drain rate of nodes and to locate equilibrium between the overhead and quality of the routing protocol that renders a great challenge. Thus, an energy-efficient cluster-based vehicle detection in road network using the intention numeration method (CVDRN-IN) is developed. Initially, sensor nodes that detect a vehicle are grouped into separate clusters. Further, we approximate the strength of the node drain rate for a cluster using polynomial regression function. In addition, the total node energy is estimated by taking the integral over the area. Finally, enhanced data aggregation is performed to reduce the amount of data transmission using digital signature tree. The experimental performance is evaluated with Dodgers loop sensor data set from UCI repository and the performance evaluation outperforms existing work on energy consumption, clustering efficiency, and node drain rate.

The shortest-path problem analysis and comparison of methods

CERN Document Server

Ortega-Arranz, Hector; Gonzalez-Escribano, Arturo

2014-01-01

Many applications in different domains need to calculate the shortest-path between two points in a graph. In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques. Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements. To make methods more comprehensive and to facilitate their co

Drain-Site Hernia Containing the Vermiform Appendix: Report of a Case

Directory of Open Access Journals (Sweden)

Markus Gass

2013-01-01

Full Text Available The herniated vermiform appendix has been described as content of every hernia orifice in the right lower quadrant. While the femoral and inguinal herniated vermiform appendix is frequent enough to result in an own designation, port-site or even drain-site hernias are less frequently described. We report the case of a 62-year-old woman who presented with right lower quadrant pain seven years after Roux-en-Y Cystojejunostomy for a pancreatic cyst. CT scan showed herniation of the vermiform appendix through a former drain-site. A diagnostic laparoscopy with appendectomy and direct closure of the abdominal wall defect combined with mesh reinforcement was performed. Despite the decreasing use of intraperitoneal drains over the recent years, a multitude of patients had intraperitoneal drainage in former times. These patients face nowadays the risk of drain-site hernias with sometimes even unexpected structures inside.

Path Creation, Path Dependence and Breaking Away from the Path

OpenAIRE

Wang, Jens; Hedman, Jonas; Tuunainen, Virpi Kristiina

2016-01-01

The explanation of how and why firms succeed or fail is a recurrent research challenge. This is particularly important in the context of technological innovations. We focus on the role of historical events and decisions in explaining such success and failure. Using a case study of Nokia, we develop and extend a multi-layer path dependence framework. We identify four layers of path dependence: technical, strategic and leadership, organizational, and external collaboration. We show how path dep...

Dynamic Pathloss Model for Future Mobile Communication Networks

DEFF Research Database (Denmark)

Kumar, Ambuj; Mihovska, Albena Dimitrova; Prasad, Ramjee

2016-01-01

that are essentially static. Therefore, once the signal level drops beyond the predicted values due to any variance in the environmental conditions, very crowded areas may not be catered well enough by the deployed network that had been designed with the static path loss model. This paper proposes an approach......— Future mobile communication networks (MCNs) are expected to be more intelligent and proactive based on new capabilities that increase agility and performance. However, for any successful mobile network service, the dexterity in network deployment is a key factor. The efficiency of the network...... planning depends on how congruent the chosen path loss model and real propagation are. Various path loss models have been developed that predict the signal propagation in various morphological and climatic environments; however they consider only those physical parameters of the network environment...

Wide area network monitoring system for HEP experiments at Fermilab

International Nuclear Information System (INIS)

Grigoriev, Maxim; Fermilab; Cottrell, Les; Logg, Connie; SLAC

2004-01-01

Large, distributed High Energy Physics (HEP) collaborations, such as D0, CDF and US-CMS, depend on stable and robust network paths between major world research centres. The evolving emphasis on data and compute Grids increases the reliance on network performance. Fermilab's experimental groups and network support personnel identified a critical need for WAN monitoring to ensure the quality and efficient utilization of such network paths. This has led to the development of the Network Monitoring system we will present in this paper. The system evolved from the IEPM-BW project, started at SLAC three years ago. At Fermilab this system has developed into a fully functional infrastructure with bi-directional active network probes and path characterizations. It is based on the Iperf achievable throughput tool, Ping and Synack to test ICMP/TCP connectivity. It uses Pipechar and Traceroute to test, compare and report hop-by-hop network path characterization. It also measures real file transfer performance by BBFTP and GridFTP. The Monitoring system has an extensive web-interface and all the data is available through standalone SOAP web services or by a MonaLISA client. Also in this paper we will present a case study of network path asymmetry and abnormal performance between FNAL and SDSC, which was discovered and resolved by utilizing the Network Monitoring system

Wide Area Network Monitoring System for HEP Experiments at Fermilab

International Nuclear Information System (INIS)

Grigoriev, M.

2004-01-01

Large, distributed High Energy Physics (HEP) collaborations, such as D0, CDF and US-CMS, depend on stable and robust network paths between major world research centres. The evolving emphasis on data and compute Grids increases the reliance on network performance. Fermilab's experimental groups and network support personnel identified a critical need for WAN monitoring to ensure the quality and efficient utilization of such network paths. This has led to the development of the Network Monitoring system we will present in this paper. The system evolved from the IEPM-BW project, started at SLAC three years ago. At Fermilab this system has developed into a fully functional infrastructure with bi-directional active network probes and path characterizations. It is based on the Iperf achievable throughput tool, Ping and Synack to test ICMP/TCP connectivity. It uses Pipechar and Traceroute to test, compare and report hop-by-hop network path characterization. It also measures real file transfer performance by BBFTP and GridFTP. The Monitoring system has an extensive web-interface and all the data is available through standalone SOAP web services or by a MonaLISA client. Also in this paper we will present a case study of network path asymmetry and abnormal performance between FNAL and SDSC, which was discovered and resolved by utilizing the Network Monitoring system

Wide Area Network Monitoring System for HEP Experiments at Fermilab

Energy Technology Data Exchange (ETDEWEB)

Grigoriev, M.

2004-11-23

Large, distributed High Energy Physics (HEP) collaborations, such as D0, CDF and US-CMS, depend on stable and robust network paths between major world research centres. The evolving emphasis on data and compute Grids increases the reliance on network performance. Fermilab's experimental groups and network support personnel identified a critical need for WAN monitoring to ensure the quality and efficient utilization of such network paths. This has led to the development of the Network Monitoring system we will present in this paper. The system evolved from the IEPM-BW project, started at SLAC three years ago. At Fermilab this system has developed into a fully functional infrastructure with bi-directional active network probes and path characterizations. It is based on the Iperf achievable throughput tool, Ping and Synack to test ICMP/TCP connectivity. It uses Pipechar and Traceroute to test, compare and report hop-by-hop network path characterization. It also measures real file transfer performance by BBFTP and GridFTP. The Monitoring system has an extensive web-interface and all the data is available through standalone SOAP web services or by a MonaLISA client. Also in this paper we will present a case study of network path asymmetry and abnormal performance between FNAL and SDSC, which was discovered and resolved by utilizing the Network Monitoring system.

Homogenization of one-dimensional draining through heterogeneous porous media including higher-order approximations

Science.gov (United States)

Anderson, Daniel M.; McLaughlin, Richard M.; Miller, Cass T.

2018-02-01

We examine a mathematical model of one-dimensional draining of a fluid through a periodically-layered porous medium. A porous medium, initially saturated with a fluid of a high density is assumed to drain out the bottom of the porous medium with a second lighter fluid replacing the draining fluid. We assume that the draining layer is sufficiently dense that the dynamics of the lighter fluid can be neglected with respect to the dynamics of the heavier draining fluid and that the height of the draining fluid, represented as a free boundary in the model, evolves in time. In this context, we neglect interfacial tension effects at the boundary between the two fluids. We show that this problem admits an exact solution. Our primary objective is to develop a homogenization theory in which we find not only leading-order, or effective, trends but also capture higher-order corrections to these effective draining rates. The approximate solution obtained by this homogenization theory is compared to the exact solution for two cases: (1) the permeability of the porous medium varies smoothly but rapidly and (2) the permeability varies as a piecewise constant function representing discrete layers of alternating high/low permeability. In both cases we are able to show that the corrections in the homogenization theory accurately predict the position of the free boundary moving through the porous medium.

Framework for path finding in multi-layer transport networks

NARCIS (Netherlands)

Dijkstra, F.

2009-01-01

In only a few decades the use of computer networks has dramatically increased. Today, networks are ubiquitous in society: they are used for surfing, email and financial transactions. The capacity of the network has increased so much, that it is now possible to transfer massive data sets that

Stages of neuronal network formation

International Nuclear Information System (INIS)

Woiterski, Lydia; Käs, Josef A; Claudepierre, Thomas; Luxenhofer, Robert; Jordan, Rainer

2013-01-01

Graph theoretical approaches have become a powerful tool for investigating the architecture and dynamics of complex networks. The topology of network graphs revealed small-world properties for very different real systems among these neuronal networks. In this study, we observed the early development of mouse retinal ganglion cell (RGC) networks in vitro using time-lapse video microscopy. By means of a time-resolved graph theoretical analysis of the connectivity, shortest path length and the edge length, we were able to discover the different stages during the network formation. Starting from single cells, at the first stage neurons connected to each other ending up in a network with maximum complexity. In the further course, we observed a simplification of the network which manifested in a change of relevant network parameters such as the minimization of the path length. Moreover, we found that RGC networks self-organized as small-world networks at both stages; however, the optimization occurred only in the second stage. (paper)

Origin of the water drained by the tunnel Graton

International Nuclear Information System (INIS)

Plata B, A.

1992-12-01

The research of the origin of the water drained by the Graton tunnel was attempted using isotope techniques. During the period of studies (April 1989-October 1992), four field work was executed to sample waters for chemistry, stable isotope and Tritium analysis, an to inject tracers and verify the possible infiltration from the Rimac and Blanco rivers to the tunnel. The results of the stable isotope analysis show that the water drained by the Graton tunnel comes from a basin around 300 meters above the average altitude of the basin where the Graton is located. The Tritium analysis show that the water is relatively modern. Using the model of total mixing, the residence times of the water drained at the km 0.5 and 2.5 are in the order to 45 years. The conductivities of the water of the tunnel is higher than the Rimac river ones because the influence of mine water. The chemical analysis of the water sampled at the downstream end of the tunnel, show that the conservative ions of the water kept almost constant during more than two years. The results of the work with artificial tracer show that there is no significant leakage from the Rimac and Blanco rivers to the Graton tunnel. So far, it can be concluded as a preliminary approach that the Graton tunnel drains relatively modern water originated in another basin. The hydrodynamics of the area of study seems to include a large storage on underground water in the system. The topography, geology and isotopic composition of the water samples, points to the upper Mantaro river basin as the possible source of part of the water drained by the Graton tunnel. (authors). 20 p. 2 figs., 7 ills., 4 tabs

Optimization design for drain to nuclear power condenser

International Nuclear Information System (INIS)

Ding Jiapeng; Jiang Chengren

2010-01-01

Characters and varieties of drain to nuclear power condenser are discussed in this paper. Take the main steam system of a nuclear power as an example, normal and detailed optimization design are introduced, related expatiate are used as a reference for the drain of other systems. According to the characters of nuclear power instant operation, the influence and needed actions related with the optimization design are also analyzed. Based on the above research, the scheme has been carried out in a nuclear power station and safety for the condenser operation of the nuclear power has been improved largely. (authors)

Charge plasma based source/drain engineered Schottky Barrier MOSFET: Ambipolar suppression and improvement of the RF performance

Science.gov (United States)

Kale, Sumit; Kondekar, Pravin N.

2018-01-01

This paper reports a novel device structure for charge plasma based Schottky Barrier (SB) MOSFET on ultrathin SOI to suppress the ambipolar leakage current and improvement of the radio frequency (RF) performance. In the proposed device, we employ dual material for the source and drain formation. Therefore, source/drain is divided into two parts as main source/drain and source/drain extension. Erbium silicide (ErSi1.7) is used as main source/drain material and Hafnium metal is used as source/drain extension material. The source extension induces the electron plasma in the ultrathin SOI body resulting reduction of SB width at the source side. Similarly, drain extension also induces the electron plasma at the drain side. This significantly increases the SB width due to increased depletion at the drain end. As a result, the ambipolar leakage current can be suppressed. In addition, drain extension also reduces the parasitic capacitances of the proposed device to improve the RF performance. The optimization of length and work function of metal used in the drain extension is performed to achieve improvement in device performance. Moreover, the proposed device makes fabrication simpler, requires low thermal budget and free from random dopant fluctuations.

Estimating drain flow from measured water table depth in layered soils under free and controlled drainage

Science.gov (United States)

Saadat, Samaneh; Bowling, Laura; Frankenberger, Jane; Kladivko, Eileen

2018-01-01

Long records of continuous drain flow are important for quantifying annual and seasonal changes in the subsurface drainage flow from drained agricultural land. Missing data due to equipment malfunction and other challenges have limited conclusions that can be made about annual flow and thus nutrient loads from field studies, including assessments of the effect of controlled drainage. Water table depth data may be available during gaps in flow data, providing a basis for filling missing drain flow data; therefore, the overall goal of this study was to examine the potential to estimate drain flow using water table observations. The objectives were to evaluate how the shape of the relationship between drain flow and water table height above drain varies depending on the soil hydraulic conductivity profile, to quantify how well the Hooghoudt equation represented the water table-drain flow relationship in five years of measured data at the Davis Purdue Agricultural Center (DPAC), and to determine the impact of controlled drainage on drain flow using the filled dataset. The shape of the drain flow-water table height relationship was found to depend on the selected hydraulic conductivity profile. Estimated drain flow using the Hooghoudt equation with measured water table height for both free draining and controlled periods compared well to observed flow with Nash-Sutcliffe Efficiency values above 0.7 and 0.8 for calibration and validation periods, respectively. Using this method, together with linear regression for the remaining gaps, a long-term drain flow record for a controlled drainage experiment at the DPAC was used to evaluate the impacts of controlled drainage on drain flow. In the controlled drainage sites, annual flow was 14-49% lower than free drainage.

Estimation of local and regional components of drain - flow from an irrigated field

International Nuclear Information System (INIS)

Eching, S.O.; Hopmans, J.W.; Wallender, W.W.; Macyntyre, J.L.; Peters, D.

1995-01-01

The contribution of regional ground water and deep percolation from a furrow irrigated field to total drain flow was estimated using salt load analysis. It was found that 64% of the drain flow comes from regional ground water flow. The electrical conductivity of the drain water was highly correlated with the drain flow rate. From the field water balance with deep percolation as estimated from the salt load analysis, using yield function derived evapotranspiration, and measured changes in root zone water storage, it was shown that 14% of the crop evapotranspiration comes from ground water during the study period. 8 figs; 5 tabs; 15 refs ( Author )

Strip-drains for in situ clean up of contaminated fine-grained soils

International Nuclear Information System (INIS)

Bowders, J.J.; Gabr, M.A.

1995-01-01

Methods for in situ remediation of contaminated soils, such as bioremediation, vacuum/air stripping and soil flushing have been found to be less effective under fine-grained soil conditions. To enhance the performance of these techniques, it was proposed that strip-drains or wick drains also known as prefabricated vertical (PV) drains be used. The research objective was to determine the feasibility of using PV drains to enhance the soil flushing process. Bench top and intermediate-scale laboratory experiments were conducted. An overview of the work, results and future considerations were presented. Results indicated that the technology is feasible. A preliminary model for the technology to be used in any field situation was developed. The model is currently being tested with data from physical experiments on both intermediate and field tests. 5 figs

Learning to improve path planning performance

International Nuclear Information System (INIS)

Chen, Pang C.

1995-04-01

In robotics, path planning refers to finding a short. collision-free path from an initial robot configuration to a desired configuratioin. It has to be fast to support real-time task-level robot programming. Unfortunately, current planning techniques are still too slow to be effective, as they often require several minutes, if not hours of computation. To remedy this situation, we present and analyze a learning algorithm that uses past experience to increase future performance. The algorithm relies on an existing path planner to provide solutions to difficult tasks. From these solutions, an evolving sparse network of useful robot configurations is learned to support faster planning. More generally, the algorithm provides a speedup-learning framework in which a slow but capable planner may be improved both cost-wise and capability-wise by a faster but less capable planner coupled with experience. The basic algorithm is suitable for stationary environments, and can be extended to accommodate changing environments with on-demand experience repair and object-attached experience abstraction. To analyze the algorithm, we characterize the situations in which the adaptive planner is useful, provide quantitative bounds to predict its behavior, and confirm our theoretical results with experiments in path planning of manipulators. Our algorithm and analysis are sufficiently, general that they may also be applied to other planning domains in which experience is useful

Reverse blocking characteristics and mechanisms in Schottky-drain AlGaN/GaN HEMT with a drain field plate and floating field plates

International Nuclear Information System (INIS)

Mao Wei; She Wei-Bo; Zhang Jin-Feng; Zheng Xue-Feng; Wang Chong; Hao Yue; Yang Cui

2016-01-01

In this paper, a novel AlGaN/GaN HEMT with a Schottky drain and a compound field plate (SD-CFP HEMT) is presented for the purpose of better reverse blocking capability. The compound field plate (CFP) consists of a drain field plate (DFP) and several floating field plates (FFPs). The physical mechanisms of the CFP to improve the reverse breakdown voltage and to modulate the distributions of channel electric field and potential are investigated by two-dimensional numerical simulations with Silvaco-ATLAS. Compared with the HEMT with a Schottky drain (SD HEMT) and the HEMT with a Schottky drain and a DFP (SD-FP HEMT), the superiorities of SD-CFP HEMT lie in the continuous improvement of the reverse breakdown voltage by increasing the number of FFPs and in the same fabrication procedure as the SD-FP HEMT. Two useful optimization laws for the SD-CFP HEMTs are found and extracted from simulation results. The relationship between the number of the FFPs and the reverse breakdown voltage as well as the FP efficiency in SD-CFP HEMTs are discussed. The results in this paper demonstrate a great potential of CFP for enhancing the reverse blocking ability in AlGaN/GaN HEMT and may be of great value and significance in the design and actual manufacture of SD-CFP HEMTs. (paper)

Thailand and brain drain

OpenAIRE

Terry Commins

2009-01-01

Brain drain has been the subject of research since the 1960s. This research has been hampered by a lack of accurate data from both source and receiving countries on migration and on the losses and gains to developing economies of skilled migration. However, despite these handicaps, research has been able to clearly show that trends are changing and the effect this is having is usually quite different for individual source countries.Thailand, as a developing economy, could be regarded as a sou...

Prairie Network Fireballs: Data of motion and ablation of fireball bodies obtained by local-ballistic method applied to variably-sliding path-segment

Science.gov (United States)

Kalenichenko, Valentin V.

2000-11-01

The electronic version of an extensive catalogue of the results of the fireball physics inverse problem solution for the precise observational data of the Prairie Network Fireballs (DTHM-values) obtained by local-ballistic method of a variably-sliding path-segment contains a set of the physical parameters for the 480 fireball images of the 248 cosmic body entries into the Earth's atmosphere (PNVK-values). The parameters are: the fireball velocity with the corresponding values of the mass to cross-section area ratio for the fireball-generating body a teach measured point of the fireball path, the ablation factor and the ratio of the luminous fireball energy to the drag work for the body in the Earth's atmosphere using a factor inversely proportional to the density of the body. The catalogue of all PNVK-values, about 3.1 Mbytes in ASCII is accessible from ftp://ftp2.mao.kiev.ua/pub/astro/pnvk, files pnvk.cat and pnvks.cat

An economic perspective on Malawi's medical "brain drain"

Directory of Open Access Journals (Sweden)

Mohiddin Abdu

2006-12-01

Full Text Available Abstract Background The medical "brain drain" has been described as rich countries "looting" doctors and nurses from developing countries undermining their health systems and public health. However this "brain-drain" might also be seen as a success in the training and "export" of health professionals and the benefits this provides. This paper illustrates the arguments and possible policy options by focusing on the situation in one of the poorest countries in the world, Malawi. Discussion Many see this "brain drain" of medical staff as wrong with developed countries exploiting poorer ones. The effects are considerable with Malawi facing high vacancy rates in its public health system, and with migration threatening to outstrip training despite efforts to improve pay and conditions. This shortage of staff has made it more challenging for Malawi to deliver on its Essential Health Package and to absorb new international health funding. Yet, without any policy effort Malawi has been able to demonstrate its global competitiveness in the training ("production" of skilled health professionals. Remittances from migration are a large and growing source of foreign exchange for poor countries and tend to go directly to households. Whilst the data for Malawi is limited, studies from other poor countries demonstrate the power of remittances in significantly reducing poverty. Malawi can benefit from the export of health professionals provided there is a resolution of the situation whereby the state pays for training and the benefits are gained by the individual professional working abroad. Solutions include migrating staff paying back training costs, or rich host governments remitting part of a tax (e.g. income or national insurance to the Malawi government. These schemes would allow Malawi to scale up training of health professionals for local needs and to work abroad. Summary There is concern about the negative impacts of the medical "brain-drain". However a

An economic perspective on Malawi's medical "brain drain"

Science.gov (United States)

Record, Richard; Mohiddin, Abdu

2006-01-01

Background The medical "brain drain" has been described as rich countries "looting" doctors and nurses from developing countries undermining their health systems and public health. However this "brain-drain" might also be seen as a success in the training and "export" of health professionals and the benefits this provides. This paper illustrates the arguments and possible policy options by focusing on the situation in one of the poorest countries in the world, Malawi. Discussion Many see this "brain drain" of medical staff as wrong with developed countries exploiting poorer ones. The effects are considerable with Malawi facing high vacancy rates in its public health system, and with migration threatening to outstrip training despite efforts to improve pay and conditions. This shortage of staff has made it more challenging for Malawi to deliver on its Essential Health Package and to absorb new international health funding. Yet, without any policy effort Malawi has been able to demonstrate its global competitiveness in the training ("production") of skilled health professionals. Remittances from migration are a large and growing source of foreign exchange for poor countries and tend to go directly to households. Whilst the data for Malawi is limited, studies from other poor countries demonstrate the power of remittances in significantly reducing poverty. Malawi can benefit from the export of health professionals provided there is a resolution of the situation whereby the state pays for training and the benefits are gained by the individual professional working abroad. Solutions include migrating staff paying back training costs, or rich host governments remitting part of a tax (e.g. income or national insurance) to the Malawi government. These schemes would allow Malawi to scale up training of health professionals for local needs and to work abroad. Summary There is concern about the negative impacts of the medical "brain-drain". However a closer look at the evidence

Reduction in wick drain effectiveness with spacing for Utah silts and clays.

Science.gov (United States)

2012-04-01

Although decreasing the spacing of vertical drains usually decreases the time for consolidation, previous field tests have shown that there is a critical drain spacing for which tighter spacing does not decrease the time for consolidation. This...

Processing method of radioactive cleaning drain

International Nuclear Information System (INIS)

Otsuka, Shigemitsu; Murakami, Tadashi; Kitao, Hideo

1998-01-01

Upon processing of radioactive cleaning drains, contained Co-60 is removed by a selectively adsorbing adsorbent. In addition, after removing suspended materials by a filtering device, Co-60 as predominant nuclides in the drain is selectively adsorbed. The concentration of objective Co-60 is in the order of 0.1 Bq/cc, and non-radioactive metal ions such as Na + ions are present in the order of ppm in addition to Co-60. A granular adsorbent for selectively adsorbing Co-60 is oxine-added activated carbon, and has a grain size of from 20 to 48 mesh. The granular adsorbent is used while being filled in an adsorbing tower. Since a relatively simple device comprising the filtering device and the adsorbing tower in combination is provided, the reduction of the construction cost can be expected. In addition, since no filtering aid is used in the filtering device, the amount of secondary wastes is small. (N.H.)

Investigating summer flow paths in a Dutch agricultural field using high frequency direct measurements

Science.gov (United States)

Delsman, J. R.; Waterloo, M. J.; Groen, M. M. A.; Groen, J.; Stuyfzand, P. J.

2014-11-01

The search for management strategies to cope with projected water scarcity and water quality deterioration calls for a better understanding of the complex interaction between groundwater and surface water in agricultural catchments. We separately measured flow routes to tile drains and an agricultural ditch in a deep polder in the coastal region of the Netherlands, characterized by exfiltration of brackish regional groundwater flow and intake of diverted river water for irrigation and water quality improvement purposes. We simultaneously measured discharge, electrical conductivity and temperature of these separate flow routes at hourly frequencies, disclosing the complex and time-varying patterns and origins of tile drain and ditch exfiltration. Tile drainage could be characterized as a shallow flow system, showing a non-linear response to groundwater level changes. Tile drainage was fed primarily by meteoric water, but still transported the majority (80%) of groundwater-derived salt to surface water. In contrast, deep brackish groundwater exfiltrating directly in the ditch responded linearly to groundwater level variations and is part of a regional groundwater flow system. We could explain the observed salinity of exfiltrating drain and ditch water from the interaction between the fast-responding pressure distribution in the subsurface that determined groundwater flow paths (wave celerity), and the slow-responding groundwater salinity distribution (water velocity). We found water demand for maintaining water levels and diluting salinity through flushing to greatly exceed the actual sprinkling demand. Counterintuitively, flushing demand was found to be largest during precipitation events, suggesting the possibility of water savings by operational flushing control.

Autologous transfusion of drain contents in elective primary knee arthroplasty: its value and relevance.

Science.gov (United States)

Singh, Vinay Kumar; Singh, Pankaj Kumar; Javed, Sadaf; Kumar, Kuldeep; Tomar, Juhi

2011-07-01

Total knee arthroplasty is associated with significant post-operative blood loss often necessitating blood transfusions. Blood transfusions may be associated with transfusion reactions and may transmit human immunodeficiency virus, hepatitis C virus and hepatitis B virus, with devastating consequences. After total knee arthroplasty, transfusion of the contents of an autologous drain is becoming common practice. The aim of our study was to look at the effectiveness of these drains in elective primary total knee arthroplasty. A prospective study was conducted including 70 non-randomised patients. A normal suction drain was used in 35 patients (group A), whereas in the other 35 patients, a CellTrans™ drain was used (group B). All the operations were performed by four surgeons using a tourniquet with a medial parapatellar approach. Pre- and post-operative haemoglobin concentrations were recorded in both groups. A Student's t-test was applied to determine the statistical significance of the data collected. The average fall in post-operative haemoglobin was 3.66 g/dL (SD 1.46; range, 0.6-7.0) among patients in whom the simple drain was used (group A) and 2.29 g/dL (SD 0.92; range, 0.6-5.9) among those in whom the CellTrans™ drain was used (group B) (p<0.0001). Twenty-five units of allogeneic blood were required in group A compared to four units in group B. The rate of transfusion was 5.7% (2 patients) in the group in which CellTrans™ drain was used and 25.7% (9 patients) in the group in which a simple suction drain was used. Total knee arthroplasty is associated with significant post-operative blood loss despite best operative technique. Autologous reinfusion of the contents of a CellTrans™ drain significantly reduces the rate of post-operative blood transfusion. This study indicates that the use of an autologous drain could be recommended as routine practice in primary total knee arthroplasty.

An evidential path logic for multi-relational networks

Energy Technology Data Exchange (ETDEWEB)

Rodriguez, Marko A [Los Alamos National Laboratory; Geldart, Joe [UNIV OF DURHAM

2008-01-01

Multi-relational networks are used extensively to structure knowledge. Perhaps the most popular instance, due to the widespread adoption of the Semantic Web, is the Resource Description Framework (RDF). One of the primary purposes of a knowledge network is to reason; that is, to alter the topology of the network according to an algorithm that uses the existing topological structure as its input. There exist many such reasoning algorithms. With respect to the Semantic Web, the bivalent, axiomatic reasoners of the RDF Schema (RDFS) and the Web Ontology Language (OWL) are the most prevalent. However, nothing prevents other forms of reasoning from existing in the Semantic Web. This article presents a non-bivalent, non-axiomatic, evidential logic and reasoner that is an algebraic ring over a multi-relational network and two binary operations that can be composed to perform various forms of inference. Given its multi-relational grounding, it is possible to use the presented evidential framework as another method for structuring knowledge and reasoning in the Semantic Web. The benefits of this framework are that it works with arbitrary, partial, and contradictory knowledge while, at the same time, supporting a tractable approximate reasoning process.

Is a drain tube necessary for minimally invasive lumbar spine fusion surgery?

Science.gov (United States)

Hung, Pei-I; Chang, Ming-Chau; Chou, Po-Hsin; Lin, Hsi-Hsien; Wang, Shih-Tien; Liu, Chien-Lin

2017-03-01

This study aimed to evaluate if closed suction wound drainage is necessary in minimally invasive surgery of transforaminal lumbar interbody fusion (MIS TLIF). This is a prospective randomized clinical study. Fifty-six patients who underwent MIS TLIF were randomly divided into groups A (with a closed suction wound drainage) and B (without tube drainage). Surgical duration, intraoperative blood loss, timing of ambulation, length of hospital stay and complications were recorded. Patients were followed up for an average of 25.3 months. Clinical outcome was assessed using the Oswestry disability index and visual analogue scale (VAS). Fusion rate was classified with the Bridwell grading system, based on plain radiograph. Both groups had similar patient demographics. The use of drains had no significant influence on perioperative parameters including operative time, estimated blood loss, length of stay and complications. Patients in group B started ambulation 1 day earlier than patients in group A (p drain tube can lead to pain, anxiety and discomfort during the postoperative period. We conclude that drain tubes are not necessary for MIS TLIF. Patients without drains had the benefit of earlier ambulation than those with drains.

Nurses’ knowledge of care of chest drain: A survey in a Nigerian semiurban university hospital

Science.gov (United States)

Kesieme, Emeka Blessius; Essu, Ifeanyichukwu Stanley; Arekhandia, Bruno Jeneru; Welcker, Katrin; Prisadov, Georgi

2016-01-01

Background/Objective: Inefficient nursing care of chest drains may associated with unacceptable and sometimes life-threatening complications. This report aims to ascertain the level of knowledge of care of chest drains among nurses working in wards in a teaching hospital in Nigeria. Methods: A cross-sectional study among nurses at teaching hospital using pretested self-administered questionnaires. Results: The majority were respondents aged between 31 and 40 years (45.4%) and those who have nursing experience between 6 and 10 years. Only 37 respondents (26.2%) had a good knowledge of nursing care of chest drains. Knowledge was relatively higher among nurses who cared for chest drains daily, nurses who have a work experience of 0.05). Performance was poor on the questions on position of drainage system were not statistically significant with relationship to waist level while mobilizing the patient, application of suction to chest drains, daily changing of dressing over chest drain insertion site, milking of tubes and drainage system with dependent loop. Conclusion: The knowledge of care of chest drains among nurses is poor, especially in the key post procedural care. There is an urgent need to train them so as to improve the nursing care of patients managed with chest drains. PMID:26857934

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

We define the entanglement-gradient routing scheme for quantum repeater networks. The routing framework fuses the fundamentals of swarm intelligence and quantum Shannon theory. Swarm intelligence provides nature-inspired solutions for problem solving. Motivated by models of social insect behavior, the routing is performed using parallel threads to determine the shortest path via the entanglement gradient coefficient, which describes the feasibility of the entangled links and paths of the network. The routing metrics are derived from the characteristics of entanglement transmission and relevant measures of entanglement distribution in quantum networks. The method allows a moderate complexity decentralized routing in quantum repeater networks. The results can be applied in experimental quantum networking, future quantum Internet, and long-distance quantum communications.

Dynamic Pathloss Model for Place and Time Itinerant Networks

DEFF Research Database (Denmark)

Kumar, Ambuj; Mihovska, Albena; Prasad, Ramjee

2018-01-01

that are essentially static. Therefore, once the signal level drops beyond the predicted values due to any variance in the environmental conditions, very crowded areas may not be catered well enough by the deployed network that had been designed with the static path loss model. This paper proposes an approach......t Future mobile communication networks are expected to be more intelligent and proactive based on new capabilities that increase agility and performance. However, for any successful mobile network service, the dexterity in network deployment is a key factor. The efficiency of the network planning...... depends on how congruent the chosen path loss model and real propagation are. Various path loss models have been developed that predict the signal propagation in various morphological and climatic environments; however they consider only those physical parameters of the network environment...

Path Diversity Media Streaming over Best Effort Packet Switched Networks

Science.gov (United States)

2003-01-01

intolerable sounds of my violin practice, but my mom was always there to defend and encourage her young violinist. When I left my full-time job for graduate...information can be incomplete or inaccurate. For exam - ple, traceroute can only differentiate between routers and not switches. Two paths with completely

Drainage of shallow peat harvesting areas with pipe drains; Madaltuneen turvetuotantokentaen kuivatustutkimus

Energy Technology Data Exchange (ETDEWEB)

Klemetti, V. [Vapo Oy, Jyvaeskylae (Finland)

1997-12-01

This study aims to develop pipe draining techniques in peat harvesting areas, which have been in active use so long time that the remaining peat layer is about one meter thick. The method should be technically and economically feasible as well as environmentally acceptable. Special attention is paid to pipe installation techniques, drain spacing and impacts on watercourses, which receive the drainage waters. After pipe installation the area was monitored by measuring pipe runoffs, water tables, moisture content of peat and quality of drain water. These are the results of second year. (orig.)

Current-flow efficiency of networks

Science.gov (United States)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

Efficient extraction of drainage networks from massive, radar-based elevation models with least cost path search

Directory of Open Access Journals (Sweden)

M. Metz

2011-02-01

Full Text Available The availability of both global and regional elevation datasets acquired by modern remote sensing technologies provides an opportunity to significantly improve the accuracy of stream mapping, especially in remote, hard to reach regions. Stream extraction from digital elevation models (DEMs is based on computation of flow accumulation, a summary parameter that poses performance and accuracy challenges when applied to large, noisy DEMs generated by remote sensing technologies. Robust handling of DEM depressions is essential for reliable extraction of connected drainage networks from this type of data. The least-cost flow routing method implemented in GRASS GIS as the module r.watershed was redesigned to significantly improve its speed, functionality, and memory requirements and make it an efficient tool for stream mapping and watershed analysis from large DEMs. To evaluate its handling of large depressions, typical for remote sensing derived DEMs, three different methods were compared: traditional sink filling, impact reduction approach, and least-cost path search. The comparison was performed using the Shuttle Radar Topographic Mission (SRTM and Interferometric Synthetic Aperture Radar for Elevation (IFSARE datasets covering central Panama at 90 m and 10 m resolutions, respectively. The accuracy assessment was based on ground control points acquired by GPS and reference points digitized from Landsat imagery along segments of selected Panamanian rivers. The results demonstrate that the new implementation of the least-cost path method is significantly faster than the original version, can cope with massive datasets, and provides the most accurate results in terms of stream locations validated against reference points.

Draining Collars and Lenses in Liquid-Lined Vertical Tubes.

Science.gov (United States)

Jensen

2000-01-01

The speed at which an annular liquid collar drains under gravity g in a vertical tube of radius a, when the tube has an otherwise thin viscous liquid lining on its interior, is determined by a balance between the collar's weight and viscous shear stresses confined to narrow regions in the neighborhood of the collar's effective contact lines. Whether a collar grows or shrinks in volume as it drains depends on the modified Bond number B=rho g a(2)/(sigmaepsilon), where rho is the fluid density, sigma is its surface tension, and epsilona is the thickness of the thin film immediately ahead of the collar. Asymptotic methods are used here to determine the following nonlinear stability criteria for an individual collar, valid in the limit of small epsilon. For 0draining collars grow in volume and, in sufficiently long tubes, ultimately "snap off" to form stable lenses. For 0.5960drain, so that any lens ultimately ruptures, unless stabilizing intermolecular forces allow the formation of a lamella supported by a macroscopic Plateau border. If surfactant immobilizes the liquid's free surface, these critical values of B are reduced by a factor of 2 but the distance a collar must travel before it snaps off is unchanged. Gravitationally driven snap off is therefore most likely to occur in long tubes with radii substantially less than the capillary lengthscale sigma/rhog)(1/2). Copyright 2000 Academic Press.

Brain drain in globalization A general equilibrium analysis from the sending countries’ perspective

OpenAIRE

Luca MARCHIORI; I-Ling SHEN; Frederic DOCQUIER

2009-01-01

The paper assesses the global effects of brain drain on developing economies and quantifies the relative sizes of various static and dynamic impacts. By constructing a unified generic framework characterized by overlapping generations dynamics and calibrated to real data, this study incorporates many direct impacts of brain drain whose interactions, along with other indirect effects, are endogenously and dynamically generated. Our findings suggest that the short-run impact of brain drain on r...

Artificial pheromone for path selection by a foraging swarm of robots.

Science.gov (United States)

Campo, Alexandre; Gutiérrez, Alvaro; Nouyan, Shervin; Pinciroli, Carlo; Longchamp, Valentin; Garnier, Simon; Dorigo, Marco

2010-11-01

Foraging robots involved in a search and retrieval task may create paths to navigate faster in their environment. In this context, a swarm of robots that has found several resources and created different paths may benefit strongly from path selection. Path selection enhances the foraging behavior by allowing the swarm to focus on the most profitable resource with the possibility for unused robots to stop participating in the path maintenance and to switch to another task. In order to achieve path selection, we implement virtual ants that lay artificial pheromone inside a network of robots. Virtual ants are local messages transmitted by robots; they travel along chains of robots and deposit artificial pheromone on the robots that are literally forming the chain and indicating the path. The concentration of artificial pheromone on the robots allows them to decide whether they are part of a selected path. We parameterize the mechanism with a mathematical model and provide an experimental validation using a swarm of 20 real robots. We show that our mechanism favors the selection of the closest resource is able to select a new path if a selected resource becomes unavailable and selects a newly detected and better resource when possible. As robots use very simple messages and behaviors, the system would be particularly well suited for swarms of microrobots with minimal abilities.

Restructuring brain drain: strengthening governance and financing for health worker migration.

Science.gov (United States)

Mackey, Tim K; Liang, Bryan A

2013-01-15

Health worker migration from resource-poor countries to developed countries, also known as ''brain drain'', represents a serious global health crisis and a significant barrier to achieving global health equity. Resource-poor countries are unable to recruit and retain health workers for domestic health systems, resulting in inadequate health infrastructure and millions of dollars in healthcare investment losses. Using acceptable methods of policy analysis, we first assess current strategies aimed at alleviating brain drain and then propose our own global health policy based solution to address current policy limitations. Although governments and private organizations have tried to address this policy challenge, brain drain continues to destabilise public health systems and their populations globally. Most importantly, lack of adequate financing and binding governance solutions continue to fail to prevent health worker brain drain. In response to these challenges, the establishment of a Global Health Resource Fund in conjunction with an international framework for health worker migration could create global governance for stable funding mechanisms encourage equitable migration pathways, and provide data collection that is desperately needed.

Powerful Software to Simulate Soil Consolidation Problems with Prefabricated Vertical Drains

Directory of Open Access Journals (Sweden)

Gonzalo García-Ros

2018-02-01

Full Text Available The present work describes the program Simulation of Consolidation with Vertical Drains (SICOMED_2018, a tool for the solution of consolidation processes in heterogeneous soils, with totally or partially penetrating prefabricated vertical drains (PVD and considering both the effects of the smear zone, generated when introducing the drain into the ground, and the limitation in the discharge capacity of the drain. In order to provide a completely free program, the code Next-Generation Simulation Program with Integrated Circuit Emphasis (Ngspice has been used as a numerical tool while the Matrix Laboratory (MATLAB code was used to program and create an interface with the user through interactive screens. In this way, SICOMED_2018 is presented as an easy-to-use and intuitive program, with a simple graphical interface that allows the user to enter all the soil properties and geometry of the problem without having to resort to a complex software package that requires programming. Illustrative applications describe both the versatility of the program and the reliability of its numerical solutions.

Brain drain from developing countries: how can brain drain be converted into wisdom gain?

OpenAIRE

Dodani, Sunita; LaPorte, Ronald E

2005-01-01

Brain drain is defined as the migration of health personnel in search of the better standard of living and quality of life, higher salaries, access to advanced technology and more stable political conditions in different places worldwide. This migration of health professionals for better opportunities, both within countries and across international borders, is of growing concern worldwide because of its impact on health systems in developing countries. Why do talented people leave their count...

Effective caching of shortest paths for location-based services

DEFF Research Database (Denmark)

Jensen, Christian S.; Thomsen, Jeppe Rishede; Yiu, Man Lung

2012-01-01

Web search is ubiquitous in our daily lives. Caching has been extensively used to reduce the computation time of the search engine and reduce the network traffic beyond a proxy server. Another form of web search, known as online shortest path search, is popular due to advances in geo...

In patients with extensive subcutaneous emphysema, which technique achieves maximal clinical resolution: infraclavicular incisions, subcutaneous drain insertion or suction on in situ chest drain?

Science.gov (United States)

Johnson, Charles H N; Lang, Sommer A; Bilal, Haris; Rammohan, Kandadai S

2014-06-01

A best evidence topic in cardiac surgery was written according to a structured protocol. The question addressed was: 'In patients with extensive subcutaneous emphysema, which technique achieves maximal clinical resolution: infraclavicular incisions, subcutaneous drain insertion or suction on in situ chest drain?'. Altogether more than 200 papers were found using the reported search, of which 14 represented the best evidence to answer the clinical question. The authors, journal, date and country of publication, patient group studied, study type, relevant outcomes and results of these papers are tabulated. Subcutaneous emphysema is usually a benign, self-limiting condition only requiring conservative management. Interventions are useful in the context of severe patient discomfort, respiratory distress or persistent air leak. In the absence of any comparative study, it is not possible to choose definitively between infraclavicular incisions, drain insertion and increasing suction on an in situ drain as the best method for managing severe subcutaneous emphysema. All the three techniques described have been shown to provide effective relief. Increasing suction on a chest tube already in situ provided rapid relief in patients developing SE following pulmonary resection. A retrospective study showed resolution in 66%, increasing to 98% in those who underwent video-assisted thoracic surgery with identification and closure of the leak. Insertion of a drain into the subcutaneous tissue also provided rapid sustained relief. Several studies aided drainage by using regular compressive massage. Infraclavicular incisions were also shown to provide rapid relief, but were noted to be more invasive and carried the potential for cosmetic defect. No major complications were illustrated. © The Author 2014. Published by Oxford University Press on behalf of the European Association for Cardio-Thoracic Surgery. All rights reserved.

Outcome in Chronic Subdural Hematoma After Subdural vs. Subgaleal Drain.

Science.gov (United States)

Ishfaq, Asim

2017-07-01

To compare the outcome after surgery for chronic subdural hematoma when the drain is placed in subdural space or subgaleal space. Quasi experimental study. Combined Military Hospital, Lahore, from July 2015 to June 2016. Patients with chronic subdural hematoma of both genders and age, ranging between 55 to 85 years, were included. Patients on antiplatelet/anticoagulant therapy and acute on chronic subdural hematoma were excluded. Patients were divided in two equal groups each depending on whether drain was placed in subgaleal space (Group 1), and subdual space (Group 2), (n=31 patients each). Patients were positioned flat in bed after surgery. Clinical and radiological parameters and clinical outcome were compared between the two groups. Statistical test with significance of p hematoma was 15 ±6.5 mm. Patients with subdural drain placement had more complications such as pneumocephalus 11 (35.4%) vs. 6 (19.3%), and intracerebral hemorrhage 4 (12.9%) vs. 2 (6.4%). Clinical outcome was good in both groups 27 (87%) in Group 1 and 28 (90%) in Group 2. Patients of both groups had good outcome after surgery. Complications like pneumocephalus and intracerebral hemorrhage were more common in subdural location of drain, though not reaching statistically significance level to favor one technique over another.

Prefabricated vertical drains, vol. I : engineering guidelines.

Science.gov (United States)

1986-09-01

This volume presents procedures and guidelines applicable to the design and instal : tion of prefabricated vertical drains to accelerate consolidation of soils. The : contents represent the Consultant's interpretation of the state-of-the-art as of : ...

Path Dependency

OpenAIRE

Mark Setterfield

2015-01-01

Path dependency is defined, and three different specific concepts of path dependency – cumulative causation, lock in, and hysteresis – are analyzed. The relationships between path dependency and equilibrium, and path dependency and fundamental uncertainty are also discussed. Finally, a typology of dynamical systems is developed to clarify these relationships.

Adverse Outcome Pathway Networks II: Network Analytics.

Science.gov (United States)

Villeneuve, Daniel L; Angrish, Michelle M; Fortin, Marie C; Katsiadaki, Ioanna; Leonard, Marc; Margiotta-Casaluci, Luigi; Munn, Sharon; O'Brien, Jason M; Pollesch, Nathan L; Smith, L Cody; Zhang, Xiaowei; Knapen, Dries

2018-02-28

Toxicological responses to stressors are more complex than the simple one biological perturbation to one adverse outcome model portrayed by individual adverse outcome pathways (AOPs). Consequently, the AOP framework was designed to facilitate de facto development of AOP networks that can aid understanding and prediction of pleiotropic and interactive effects more common to environmentally realistic, complex exposure scenarios. The present paper introduces nascent concepts related to the qualitative analysis of AOP networks. First, graph theory-based approaches for identifying important topological features are illustrated using two example AOP networks derived from existing AOP descriptions. Second, considerations for identifying the most significant path(s) through an AOP network from either a biological or risk assessment perspective are described. Finally, approaches for identifying interactions among AOPs that may result in additive, synergistic, or antagonistic responses, or previously undefined emergent patterns of response, are introduced. Along with a companion article (Knapen et al. part I), these concepts set the stage for development of tools and case studies that will facilitate more rigorous analysis of AOP networks, and the utility of AOP network-based predictions, for use in research and regulatory decision-making. Collectively, this work addresses one of the major themes identified through a SETAC Horizon Scanning effort focused on advancing the AOP framework. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

The effect of drains on the alkalinity of agricultural soils

International Nuclear Information System (INIS)

Iqbal, M.A.; Butt, T.; Anwar-ul-Haque; Haroon, M.; Haq, I.U.

2009-01-01

The purpose of the study was to observe the effect of industrial and domestic drains on the nearby agricultural areas which are either irrigated or not by the waste water but are close to drains. For this purpose 48 soil samples were collected from the selected areas of Faisalabad and were analyzed for alkali metals like Na/sup +/, K/sup +/, Li/sup +/ and some alkaline earth metals like Ba/sup 2+/> Mg/sup 3+/> Na/sup +/> K/sup +/> Li/sup +/ the levels of Ba/sup +2/ and K/sup +/ were found higher than permissible levels in almost all the soil samples. It was also concluded that the agricultural areas near the industrial drain which are either irrigated or not by the industrial waste water are found highly contaminated with mobile alkali metals (K, Na etc.) and higher values of percentage salinity. (author)

An analytical drain current model for symmetric double-gate MOSFETs

Science.gov (United States)

Yu, Fei; Huang, Gongyi; Lin, Wei; Xu, Chuanzhong

2018-04-01

An analytical surface-potential-based drain current model of symmetric double-gate (sDG) MOSFETs is described as a SPICE compatible model in this paper. The continuous surface and central potentials from the accumulation to the strong inversion regions are solved from the 1-D Poisson's equation in sDG MOSFETs. Furthermore, the drain current is derived from the charge sheet model as a function of the surface potential. Over a wide range of terminal voltages, doping concentrations, and device geometries, the surface potential calculation scheme and drain current model are verified by solving the 1-D Poisson's equation based on the least square method and using the Silvaco Atlas simulation results and experimental data, respectively. Such a model can be adopted as a useful platform to develop the circuit simulator and provide the clear understanding of sDG MOSFET device physics.

Drained Lava Tubes and Lobes From Eocretaceous Paraná-Etendeka Province, Brazil

Science.gov (United States)

Waichel, B. L.; Lima, E. F. D.; Mouro, L. D.; Briske, D. R.; Tratz, E. B.

2017-12-01

The identification of lava tubes in continental flood basalt provinces (CFBP) is difficult and reports of preserved drained tubes and lobes are rare. The large extension of CFBP must be related to an efficient transport of lava and tubes are the most efficient mechanism to transport lava in insulated pathways, like observed in modern volcanic fields. Looking for caves in the central portion of Paraná-Etendeka Province, we discovered drained lava tubes (4) and lobes (6) in a volcanic sequence constituted by pahoehoe flows. Lava tubes are: Casa de Pedra, Perau Branco, Dal Pae and Pinhão. The Casa de Pedra tube system is composed of two principal chambers with similar dimensions, reaching up to 10 m long and 4.0 m high connected by a narrow passage. The general form of the chamber is hemispherical, with re-entrances of ellipsoidal shape probably formed by small lava lobes and collapse structures in the roof. The second chamber is connected with three secondary lava tubes. Columns in the cave are formed when the flowing lava separates in two lava channels that join again further down the system, forming and anastomosing tube network. Lateral lava benches and lava drainings at the walls are observed in secondary tubes. The general lava flow is to SW. The Perau Branco system is composed of five tubes with ellipsoidal openings. The main features are the long tubes that emerge from the small flattened chambers. One tube is more than 20 m long, with alternating circular and flattened ellipsoidal sections. The general lava flow is to NE. Pinhão tube is spherical with 3 meters diameter and 15 m long, with lava flow orientation to NW. This tube has a bottleneck shape with linings (up to 3 cm thick), which are observed in the roof and walls. Dal Pae Tube is 10 m long with an ellipsoidal opening, bottleneck shape and orientation to NE. The lava flow directions measured in the tubes is to SW (Casa de Pedra, Pinhão) and NE (Perau Branco, Dal Pae) and this pattern is related to

Postoperative use of drain in thyroid lobectomy – a randomized clinical trial conducted at Civil Hospital, Karachi, Pakistan

Directory of Open Access Journals (Sweden)

Memon Zahid

2012-09-01

Full Text Available Abstract Background Thyroidectomy is a common surgical procedure, after which drains are placed routinely. This study aims to assess the benefits of placing postoperative drains, its complications and affects on postoperative stay, in thyroid lobectomy. Methodology Randomized Clinical Trial of 60 goitre patients undergoing lobectomy was conducted at Civil Hospital Karachi, during July’11-December’11. Patients were randomly assigned into drain and non drain groups. Patient demographics, labs and complications were noted. Ultrasound of neck was performed on both groups. For drain group, the amount of fluid present in the surgical bed and redivac drain was added to calculate fluid collection while in non drain group it was calculated by ultrasound of neck on first and second post-op days. Data was entered and analyzed on SPSS v16 using Independent T tests. Result The mean total drain output for 2 days in non-drain group was significantly lower 10.67 (±9.072 ml while in drain group was 30.97 (±42.812 ml (p = 0.014. The mean postoperative stay of drain group (79.2 ±15.63 hours was significantly higher, as compared to mean postoperative stay of non drain group (50.4 ±7.32 hours. Mean Visual Analogue Score (VAS for pain day 1 (6.2 ±0.997 and day 2 (4.17 ±0.95 in drain group were significantly higher compared to day 1 (2.6 ±1.163 and day 2 (1.3 ±0.877 of non drain group. From drain group, 2 patients complained of stridor, dyspnea on Day 1 which subsided by Day 2 and 1 case of voice change, with no such complains in non drain group. No patients from both groups developed seroma, wound infection or hematoma. Conclusion In uncomplicated surgeries especially for lobectomy, use of drain can be omitted.

Reverse blocking characteristics and mechanisms in Schottky-drain AlGaN/GaN HEMT with a drain field plate and floating field plates

Science.gov (United States)

Wei, Mao; Wei-Bo, She; Cui, Yang; Jin-Feng, Zhang; Xue-Feng, Zheng; Chong, Wang; Yue, Hao

2016-01-01

In this paper, a novel AlGaN/GaN HEMT with a Schottky drain and a compound field plate (SD-CFP HEMT) is presented for the purpose of better reverse blocking capability. The compound field plate (CFP) consists of a drain field plate (DFP) and several floating field plates (FFPs). The physical mechanisms of the CFP to improve the reverse breakdown voltage and to modulate the distributions of channel electric field and potential are investigated by two-dimensional numerical simulations with Silvaco-ATLAS. Compared with the HEMT with a Schottky drain (SD HEMT) and the HEMT with a Schottky drain and a DFP (SD-FP HEMT), the superiorities of SD-CFP HEMT lie in the continuous improvement of the reverse breakdown voltage by increasing the number of FFPs and in the same fabrication procedure as the SD-FP HEMT. Two useful optimization laws for the SD-CFP HEMTs are found and extracted from simulation results. The relationship between the number of the FFPs and the reverse breakdown voltage as well as the FP efficiency in SD-CFP HEMTs are discussed. The results in this paper demonstrate a great potential of CFP for enhancing the reverse blocking ability in AlGaN/GaN HEMT and may be of great value and significance in the design and actual manufacture of SD-CFP HEMTs. Project supported by the National Natural Science Foundation of China (Grant Nos. 61204085, 61334002, 61306017, 61474091, 61574112, and 61574110).

Omnidirectional sparse visual path following with occlusion-robust feature tracking

OpenAIRE

Goedemé, Toon; Tuytelaars, Tinne; Van Gool, Luc; Vanacker, Gerolf; Nuttin, Marnix

2005-01-01

Goedemé T., Tuytelaars T., Van Gool L., Vanacker G., Nuttin M., ''Omnidirectional sparse visual path following with occlusion-robust feature tracking'', Proceedings 6th workshop on omnidirectional vision, camera networks and non-classical cameras, 8 pp., October 21, 2005, Beijing, China.

Effects of Drains on Pain, Comfort and Anxiety in Patients Undergone Surgery

Directory of Open Access Journals (Sweden)

Ummu Yildiz Findik

2013-01-01

Full Text Available Backround: Surgical drains negatively affect patients’ comfort, cause anxiety along with pain, as they are used to promote healing after surgery.Purpose: This study aimed to determine pain, comfort and anxiety levels of patients with drains postoperatively.Methodology: Research was performed with 192 patients undergone abdominal, neck, breast and open heart surgery and had surgical and underwater chest drains at the postoperative period. Patient Information Form, Numerical Pain Scale, General Comfort Questionnaire and Trait Anxiety Scale was used for collection of data. In evaluating the data, we used the t-test, variance and correlation analysis, mean, percentage and frequency.Results: The patients’ mean score of pain was 4.67±2.93, comfort was 2.75±0.29 and anxiety was 39.31±9.21. It was found statistically significant that the comfort level decreases as the pain level increases and that the patients undergone open heart surgery and with underwater chest drains have higher pain levels. It was found statistically significant that, comfort level in patients undergone abdominal or cardiac surgery is lower than patients undergone breast or neck surgery, and that the comfort level decreases as the duration of drains increases. The increasing state anxiety while pain increases and comfort decreases was found statistically significant.Conclusions: Surgeries and drains applied after these procedures decrease the comfort level of the patients as increases the pain level. Also, pain and discomfort increase the patients’ anxiety. Nurses who providing care to these patients are suggested to improve measures about pain and anxiety reduction for maintaining of comfort.

Coexistence of Named Data Networking (NDN) and Software-Defined Networking (SDN)

Science.gov (United States)

2017-09-01

COD) for deploying the data found by CL at optimal node, and c) Path Optimizer (PO) for balancing network traffic in both spatial and temporal...and software- defined networking with big data . Ithaca (NY): Cornell University Library; 2016 Nov 19. arXiv: 1611.06299v1 [cs.NI]. Approved for...ARL-TN-0845 ● SEP 2017 US Army Research Laboratory Coexistence of Named Data Networking (NDN) and Software-Defined Networking

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

OpenAIRE

Dianjie Lu; Guijuan Zhang; Ren Han; Xiangwei Zheng; Hong Liu

2014-01-01

Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficu...

Drain tube migration into the anastomotic site of an esophagojejunostomy for gastric small cell carcinoma: short report.

Science.gov (United States)

Lai, Peng-Sheng; Lo, Chiao; Lin, Long-Wei; Lee, Po-Chu

2010-05-21

Intraluminal migration of a drain through an anastomotic site is a rare complication of gastric surgery. We herein report the intraluminal migration of a drain placed after a lower esophagectomy and total gastrectomy with Roux-en-Y anastomosis for gastric small cell carcinoma. Persistent drainage was noted 1 month after surgery, and radiographic studies were consistent with drain tube migration. Endoscopy revealed the drain had migrated into the esophagojejunostomy anastomotic site. The drain was removed from outside of abdominal wound while observing the anastomotic site endoscopically. The patient was treated with suction via a nasogastric tube drain for 5 days, and thereafter had an uneventful recovery. Though drain tube migration is a rare occurrence, it should be considered in patients with persistent drainage who have undergone gastric surgery.

Research on Innovating, Applying Multiple Paths Routing Technique Based on Fuzzy Logic and Genetic Algorithm for Routing Messages in Service - Oriented Routing

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

Full Text Available MANET (short for Mobile Ad-Hoc Network consists of a set of mobile network nodes, network configuration changes very fast. In content based routing, data is transferred from source node to request nodes is not based on destination addresses. Therefore, it is very flexible and reliable, because source node does not need to know destination nodes. If We can find multiple paths that satisfies bandwidth requirement, split the original message into multiple smaller messages to transmit concurrently on these paths. On destination nodes, combine separated messages into the original message. Hence it can utilize better network resources, causes data transfer rate to be higher, load balancing, failover. Service Oriented Routing is inherited from the model of content based routing (CBR, combined with several advanced techniques such as Multicast, multiple path routing, Genetic algorithm to increase the data rate, and data encryption to ensure information security. Fuzzy logic is a logical field study evaluating the accuracy of the results based on the approximation of the components involved, make decisions based on many factors relative accuracy based on experimental or mathematical proof. This article presents some techniques to support multiple path routing from one network node to a set of nodes with guaranteed quality of service. By using these techniques can decrease the network load, congestion, use network resources efficiently.

Directional maximum likelihood self-estimation of the path-loss exponent

NARCIS (Netherlands)

Hu, Y.; Leus, G.J.T.; Dong, Min; Zheng, Thomas Fang

2016-01-01

The path-loss exponent (PLE) is a key parameter in wireless propagation channels. Therefore, obtaining the knowledge of the PLE is rather significant for assisting wireless communications and networking to achieve a better performance. Most existing methods for estimating the PLE not only require

Traffic engineering and regenerator placement in GMPLS networks with restoration

Science.gov (United States)

Yetginer, Emre; Karasan, Ezhan

2002-07-01

In this paper we study regenerator placement and traffic engineering of restorable paths in Generalized Multipro-tocol Label Switching (GMPLS) networks. Regenerators are necessary in optical networks due to transmission impairments. We study a network architecture where there are regenerators at selected nodes and we propose two heuristic algorithms for the regenerator placement problem. Performances of these algorithms in terms of required number of regenerators and computational complexity are evaluated. In this network architecture with sparse regeneration, offline computation of working and restoration paths is studied with bandwidth reservation and path rerouting as the restoration scheme. We study two approaches for selecting working and restoration paths from a set of candidate paths and formulate each method as an Integer Linear Programming (ILP) prob-lem. Traffic uncertainty model is developed in order to compare these methods based on their robustness with respect to changing traffic patterns. Traffic engineering methods are compared based on number of additional demands due to traffic uncertainty that can be carried. Regenerator placement algorithms are also evaluated from a traffic engineering point of view.

Quivers of Bound Path Algebras and Bound Path Coalgebras

Directory of Open Access Journals (Sweden)

Dr. Intan Muchtadi

2010-09-01

Full Text Available bras and coalgebras can be represented as quiver (directed graph, and from quiver we can construct algebras and coalgebras called path algebras and path coalgebras. In this paper we show that the quiver of a bound path coalgebra (resp. algebra is the dual quiver of its bound path algebra (resp. coalgebra.

Critical path method applied to research project planning: Fire Economics Evaluation System (FEES)

Science.gov (United States)

Earl B. Anderson; R. Stanton Hales

1986-01-01

The critical path method (CPM) of network analysis (a) depicts precedence among the many activities in a project by a network diagram; (b) identifies critical activities by calculating their starting, finishing, and float times; and (c) displays possible schedules by constructing time charts. CPM was applied to the development of the Forest Service's Fire...

Fractional path planning and path tracking

International Nuclear Information System (INIS)

Melchior, P.; Jallouli-Khlif, R.; Metoui, B.

2011-01-01

This paper presents the main results of the application of fractional approach in path planning and path tracking. A new robust path planning design for mobile robot was studied in dynamic environment. The normalized attractive force applied to the robot is based on a fictitious fractional attractive potential. This method allows to obtain robust path planning despite robot mass variation. The danger level of each obstacles is characterized by the fractional order of the repulsive potential of the obstacles. Under these conditions, the robot dynamic behavior was studied by analyzing its X - Y path planning with dynamic target or dynamic obstacles. The case of simultaneously mobile obstacles and target is also considered. The influence of the robot mass variation is studied and the robustness analysis of the obtained path shows the robustness improvement due to the non integer order properties. Pre shaping approach is used to reduce system vibration in motion control. Desired systems inputs are altered so that the system finishes the requested move without residual vibration. This technique, developed by N.C. Singer and W.P.Seering, is used for flexible structure control, particularly in the aerospace field. In a previous work, this method was extended for explicit fractional derivative systems and applied to second generation CRONE control, the robustness was also studied. CRONE (the French acronym of C ommande Robuste d'Ordre Non Entier ) control system design is a frequency-domain based methodology using complex fractional integration.

Path spectra derived from inversion of source and site spectra for earthquakes in Southern California

Science.gov (United States)

Klimasewski, A.; Sahakian, V. J.; Baltay, A.; Boatwright, J.; Fletcher, J. B.; Baker, L. M.

2017-12-01

A large source of epistemic uncertainty in Ground Motion Prediction Equations (GMPEs) is derived from the path term, currently represented as a simple geometric spreading and intrinsic attenuation term. Including additional physical relationships between the path properties and predicted ground motions would produce more accurate and precise, region-specific GMPEs by reclassifying some of the random, aleatory uncertainty as epistemic. This study focuses on regions of Southern California, using data from the Anza network and Southern California Seismic network to create a catalog of events magnitude 2.5 and larger from 1998 to 2016. The catalog encompasses regions of varying geology and therefore varying path and site attenuation. Within this catalog of events, we investigate several collections of event region-to-station pairs, each of which share similar origin locations and stations so that all events have similar paths. Compared with a simple regional GMPE, these paths consistently have high or low residuals. By working with events that have the same path, we can isolate source and site effects, and focus on the remaining residual as path effects. We decompose the recordings into source and site spectra for each unique event and site in our greater Southern California regional database using the inversion method of Andrews (1986). This model represents each natural log record spectra as the sum of its natural log event and site spectra, while constraining each record to a reference site or Brune source spectrum. We estimate a regional, path-specific anelastic attenuation (Q) and site attenuation (t*) from the inversion site spectra and corner frequency from the inversion event spectra. We then compute the residuals between the observed record data, and the inversion model prediction (event*site spectra). This residual is representative of path effects, likely anelastic attenuation along the path that varies from the regional median attenuation. We examine the

An analytical drain current model for symmetric double-gate MOSFETs

Directory of Open Access Journals (Sweden)

Fei Yu

2018-04-01

Full Text Available An analytical surface-potential-based drain current model of symmetric double-gate (sDG MOSFETs is described as a SPICE compatible model in this paper. The continuous surface and central potentials from the accumulation to the strong inversion regions are solved from the 1-D Poisson’s equation in sDG MOSFETs. Furthermore, the drain current is derived from the charge sheet model as a function of the surface potential. Over a wide range of terminal voltages, doping concentrations, and device geometries, the surface potential calculation scheme and drain current model are verified by solving the 1-D Poisson’s equation based on the least square method and using the Silvaco Atlas simulation results and experimental data, respectively. Such a model can be adopted as a useful platform to develop the circuit simulator and provide the clear understanding of sDG MOSFET device physics.

Dual paths to individuals’ network based performance in intra-organizational networks

DEFF Research Database (Denmark)

Waldstrøm, Christian; Shah, Neha P.; Parker, Andrew

Scholars have long been aware of the advantages to performance when colleagues share work information. We know less about the implications of multiplex ties such as when the sharing of work information is combined with that of nonwork information. We contrast social embeddedness theory with that ......Scholars have long been aware of the advantages to performance when colleagues share work information. We know less about the implications of multiplex ties such as when the sharing of work information is combined with that of nonwork information. We contrast social embeddedness theory...... a negative effect on performance. In addition, we find that the path to higher performance differs by the amount of time people have been in an organization. Those with low tenure outperformed colleagues with a moderate number of multiplex ties. Whereas, for their high tenure colleagues, multiplex ties had...... little effect....

Path integration of head direction: updating a packet of neural activity at the correct speed using neuronal time constants.

Science.gov (United States)

Walters, D M; Stringer, S M

2010-07-01

A key question in understanding the neural basis of path integration is how individual, spatially responsive, neurons may self-organize into networks that can, through learning, integrate velocity signals to update a continuous representation of location within an environment. It is of vital importance that this internal representation of position is updated at the correct speed, and in real time, to accurately reflect the motion of the animal. In this article, we present a biologically plausible model of velocity path integration of head direction that can solve this problem using neuronal time constants to effect natural time delays, over which associations can be learned through associative Hebbian learning rules. The model comprises a linked continuous attractor network and competitive network. In simulation, we show that the same model is able to learn two different speeds of rotation when implemented with two different values for the time constant, and without the need to alter any other model parameters. The proposed model could be extended to path integration of place in the environment, and path integration of spatial view.

Drain tube migration into the anastomotic site of an esophagojejunostomy for gastric small cell carcinoma: short report

Directory of Open Access Journals (Sweden)

Lin Long-Wei

2010-05-01

Full Text Available Abstract Background Intraluminal migration of a drain through an anastomotic site is a rare complication of gastric surgery. Case Presentation We herein report the intraluminal migration of a drain placed after a lower esophagectomy and total gastrectomy with Roux-en-Y anastomosis for gastric small cell carcinoma. Persistent drainage was noted 1 month after surgery, and radiographic studies were consistent with drain tube migration. Endoscopy revealed the drain had migrated into the esophagojejunostomy anastomotic site. The drain was removed from outside of abdominal wound while observing the anastomotic site endoscopically. The patient was treated with suction via a nasogastric tube drain for 5 days, and thereafter had an uneventful recovery. Conclusions Though drain tube migration is a rare occurrence, it should be considered in patients with persistent drainage who have undergone gastric surgery.

Verifiable metamodels for nitrate losses to drains and groundwater in the Corn Belt, USA

Science.gov (United States)

Nolan, Bernard T.; Malone, Robert W.; Gronberg, Jo Ann M.; Thorp, K.R.; Ma, Liwang

2012-01-01

Nitrate leaching in the unsaturated zone poses a risk to groundwater, whereas nitrate in tile drainage is conveyed directly to streams. We developed metamodels (MMs) consisting of artificial neural networks to simplify and upscale mechanistic fate and transport models for prediction of nitrate losses by drains and leaching in the Corn Belt, USA. The two final MMs predicted nitrate concentration and flux, respectively, in the shallow subsurface. Because each MM considered both tile drainage and leaching, they represent an integrated approach to vulnerability assessment. The MMs used readily available data comprising farm fertilizer nitrogen (N), weather data, and soil properties as inputs; therefore, they were well suited for regional extrapolation. The MMs effectively related the outputs of the underlying mechanistic model (Root Zone Water Quality Model) to the inputs (R2 = 0.986 for the nitrate concentration MM). Predicted nitrate concentration was compared with measured nitrate in 38 samples of recently recharged groundwater, yielding a Pearson’s r of 0.466 (p = 0.003). Predicted nitrate generally was higher than that measured in groundwater, possibly as a result of the time-lag for modern recharge to reach well screens, denitrification in groundwater, or interception of recharge by tile drains. In a qualitative comparison, predicted nitrate concentration also compared favorably with results from a previous regression model that predicted total N in streams.

Method of bilateral pleural drainage by single Blake drain after esophagectomy.

Science.gov (United States)

Niwa, Yukiko; Koike, Masahiko; Oya, Hisaharu; Iwata, Naoki; Kobayashi, Daisuke; Kanda, Mitsuro; Tanaka, Chie; Yamada, Suguru; Fujii, Tsutomu; Nakayama, Goro; Sugimoto, Hiroyuki; Nomoto, Shuji; Fujiwara, Michitaka; Kodera, Yasuhiro

2015-03-01

Clinicians often encounter left pleural effusion after esophagectomy, which sometimes necessitates thoracentesis. We have introduced a new drainage method, bilateral pleural drainage by single Blake drain (BDSD), which we have been using since April 2013. This study aims to evaluate the performance of the BDSD. The BDSD method employs a 15-F Blake drain inserted from the right thoracic cavity to the left thoracic cavity across the posterior mediastinum. The conventional drain (CD) group consisted of 50 patients with a 19-F Blake drain placed in the right thoracic cavity during the period from April 2012 to March 2013. The BDSD group consisted of 54 patients treated from April 2013 to June 2014. The amount of total drainage in the BDSD group was significantly higher than that in the CD group (P pleural effusion and left lower lobe atelectasis in the BDSD group were significantly lower than those in the CD group (P pleural effusion necessitating thoracentesis drainage in the BDSD group. Compared with the conventional method, BDSD was able to evacuate bilateral pleural effusion more effectively, and the incidences of left pleural effusion and left atelectasis were lower. This method is therefore clinically useful after esophagectomy.

State waste discharge permit application, 200-E chemical drain field

Energy Technology Data Exchange (ETDEWEB)

1994-06-01

As part of the Hanford Federal Facility Agreement and Consent Order negotiations (Ecology et al. 1994), the US Department of Energy, Richland Operations Office, the US Environmental Protection Agency, and the Washington State Department of Ecology agreed that liquid effluent discharges to the ground on the Hanford Site which affect groundwater or have the potential to affect ground would be subject to permitting under the structure of Chapter 173-216 (or 173-218 where applicable) of the Washington Administrative Code, the State Waste Discharge Permit Program. As a result of this decision, the Washington State Department of Ecology and the US Department of Energy, Richland Operations Office entered into Consent Order No. DE 91NM-177, (Ecology and DOE-RL 1991). The Consent Order No. DE 91NM-177 requires a series of permitting activities for liquid effluent discharges. This document presents the State Waste Discharge Permit (SWDP) application for the 200-E Chemical Drain Field. Waste water from the 272-E Building enters the process sewer line directly through a floor drain, while waste water from the 2703-E Building is collected in two floor drains, (north and south) that act as sumps and are discharged periodically. The 272-E and 2703-E Buildings constitute the only discharges to the process sewer line and the 200-E Chemical Drain Field.

State waste discharge permit application, 200-E chemical drain field

International Nuclear Information System (INIS)

1994-06-01

As part of the Hanford Federal Facility Agreement and Consent Order negotiations (Ecology et al. 1994), the US Department of Energy, Richland Operations Office, the US Environmental Protection Agency, and the Washington State Department of Ecology agreed that liquid effluent discharges to the ground on the Hanford Site which affect groundwater or have the potential to affect ground would be subject to permitting under the structure of Chapter 173-216 (or 173-218 where applicable) of the Washington Administrative Code, the State Waste Discharge Permit Program. As a result of this decision, the Washington State Department of Ecology and the US Department of Energy, Richland Operations Office entered into Consent Order No. DE 91NM-177, (Ecology and DOE-RL 1991). The Consent Order No. DE 91NM-177 requires a series of permitting activities for liquid effluent discharges. This document presents the State Waste Discharge Permit (SWDP) application for the 200-E Chemical Drain Field. Waste water from the 272-E Building enters the process sewer line directly through a floor drain, while waste water from the 2703-E Building is collected in two floor drains, (north and south) that act as sumps and are discharged periodically. The 272-E and 2703-E Buildings constitute the only discharges to the process sewer line and the 200-E Chemical Drain Field

On Applications of Disruption Tolerant Networking to Optical Networking in Space

Science.gov (United States)

Hylton, Alan Guy; Raible, Daniel E.; Juergens, Jeffrey; Iannicca, Dennis

2012-01-01

The integration of optical communication links into space networks via Disruption Tolerant Networking (DTN) is a largely unexplored area of research. Building on successful foundational work accomplished at JPL, we discuss a multi-hop multi-path network featuring optical links. The experimental test bed is constructed at the NASA Glenn Research Center featuring multiple Ethernet-to-fiber converters coupled with free space optical (FSO) communication channels. The test bed architecture models communication paths from deployed Mars assets to the deep space network (DSN) and finally to the mission operations center (MOC). Reliable versus unreliable communication methods are investigated and discussed; including reliable transport protocols, custody transfer, and fragmentation. Potential commercial applications may include an optical communications infrastructure deployment to support developing nations and remote areas, which are unburdened with supporting an existing heritage means of telecommunications. Narrow laser beam widths and control of polarization states offer inherent physical layer security benefits with optical communications over RF solutions. This paper explores whether or not DTN is appropriate for space-based optical networks, optimal payload sizes, reliability, and a discussion on security.

Network features and pathway analyses of a signal transduction cascade

Directory of Open Access Journals (Sweden)

Ryoji Yanashima

2009-05-01

Full Text Available The scale-free and small-world network models reflect the functional units of networks. However, when we investigated the network properties of a signaling pathway using these models, no significant differences were found between the original undirected graphs and the graphs in which inactive proteins were eliminated from the gene expression data. We analyzed signaling networks by focusing on those pathways that best reflected cellular function. Therefore, our analysis of pathways started from the ligands and progressed to transcription factors and cytoskeletal proteins. We employed the Python module to assess the target network. This involved comparing the original and restricted signaling cascades as a directed graph using microarray gene expression profiles of late onset Alzheimer's disease. The most commonly used method of shortest-path analysis neglects to consider the influences of alternative pathways that can affect the activation of transcription factors or cytoskeletal proteins. We therefore introduced included k-shortest paths and k-cycles in our network analysis using the Python modules, which allowed us to attain a reasonable computational time and identify k-shortest paths. This technique reflected results found in vivo and identified pathways not found when shortest path or degree analysis was applied. Our module enabled us to comprehensively analyse the characteristics of biomolecular networks and also enabled analysis of the effects of diseases considering the feedback loop and feedforward loop control structures as an alternative path.

Drainage of shallow peat harvesting areas with pipe drains; Mataloituneen turvekentaen kuivatus putkisalaojilla

Energy Technology Data Exchange (ETDEWEB)

Klemetti, V.; Saenkiaho, K. [Vapo Oy, Jyvaeskylae (Finland); Rautiainen, O. [Ojamarkkinointi Oy, Heinola (Finland)

1996-12-31

This study aims to develop pipe draining technics in peat harvesting areas, which have been in active use so long time that the remaining peat layer is about one meter thick. The method should be technically and economically feasible as well as environmentally acceptable. Special attention is paid to pipe installation techniques, drain spacing and impacts on watercourses, which receive the drainage waters. After pipe installation the area is monitored by measuring pipe runoffs, water tables, moisture content of peat and quality of drain water

Multifuel multimodal network design; Projeto de redes multicombustiveis multimodal

Energy Technology Data Exchange (ETDEWEB)

Lage, Carolina; Dias, Gustavo; Bahiense, Laura; Ferreira Filho, Virgilio J.M. [Universidade Federal do Rio de Janeiro (UFRJ), RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia (COPPE). Programa de Engenharia de Producao

2008-07-01

The objective of the Multi commodity Multimodal Network Project is the development of modeling tools and methodologies for the optimal sizing of production networks and multimodal distribution of multiple fuel and its incomes, considering investments and transportation costs. Given the inherently non-linear combinatory nature of the problem, the resolution of real instances by the complete model, in an exact way, becomes computationally intractable. Thus, the strategy for resolution should contain a combination of exacts and heuristics methods, that must be applied to subdivisions of the original problem. This paper deals with one of these subdivisions, tackling the problem of modeling a network of pipelines in order to drain the production of ethanol away from the producing plants. The objective consists in defining the best network topology, minimizing investment and operational costs, and attending the total demand. In order to do that, the network was considered a tree, where the nodes are the center of producing regions and the edges are the pipelines, trough where the ethanol produced by plants must be drained away. The main objective also includes the decision over the optimal diameter of each pipeline and the optimal size of the bombs, in order to minimize the pumping costs. (author)

Constraint-Based Local Search for Constrained Optimum Paths Problems

Science.gov (United States)

Pham, Quang Dung; Deville, Yves; van Hentenryck, Pascal

Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algorithms, which are often hard to extend with side constraints and to apply widely. This paper proposes a constraint-based local search (CBLS) framework for COP applications, bringing the compositionality, reuse, and extensibility at the core of CBLS and CP systems. The modeling contribution is the ability to express compositional models for various COP applications at a high level of abstraction, while cleanly separating the model and the search procedure. The main technical contribution is a connected neighborhood based on rooted spanning trees to find high-quality solutions to COP problems. The framework, implemented in COMET, is applied to Resource Constrained Shortest Path (RCSP) problems (with and without side constraints) and to the edge-disjoint paths problem (EDP). Computational results show the potential significance of the approach.

Pesticide transport to tile-drained fields in SWAT model – macropore flow and sediment

DEFF Research Database (Denmark)

Lu, Shenglan; Trolle, Dennis; Blicher-Mathiesen, Gitte

2015-01-01

Tool (SWAT) to simulate transport of both mobile (e.g. Bentazon) and strongly sorbed (e.g. Diuron) pesticides in tile drains. Macropore flow is initiated when soil water content exceeds a threshold and rainfall intensity exceeds infiltration capacity. The amount of macropore flow is calculated...... to macropore sediment transport. Simulated tile drain discharge, sediment and pesticide loads are calibrated against data from intensively monitored tile-drained fields and streams in Denmark....

Safety of peritoneal and pleural drain placement in pediatric stem cell transplant recipients with severe veno-occlusive disease.

Science.gov (United States)

Madenci, Arin L; Stetson, Alyssa; Weldon, Christopher B; Lehmann, Leslie E

2016-08-01

Hepatic VOD (veno-occlusive disease) is a serious complication of HSCT (hematopoietic stem cell transplantation) and has historically been associated with high mortality. This obstruction to hepatic flow often results in fluid collections in the peritoneal and pleural cavities. Catheter placement to drain ascites or pleural fluid may reduce intra-abdominal hypertension and/or improve respiratory parameters. The safety of these interventions among critically ill, immunocompromised children is unknown. Among 32 HSCT recipients (2000-2012) with severe VOD, we assessed the primary outcome of procedural complication from peritoneal drain placement. Twenty-four (75%) patients underwent peritoneal drain placement. No patient sustained visceral perforation or hemorrhage with drain placement. Overall mortality was 47% (n = 15). The procedure was not associated with increased overall mortality (p > 0.99). Eight (25%) peritoneal drains required replacement for malfunction. Of 24 patients with peritoneal drains, one (4%) patient had a positive culture from ascitic fluid. Eight (25%) patients underwent pleural drain placement. No pleural drain-related procedural complication or infection occurred. Four (50%) of the eight patients with pleural drains had de-escalation in oxygen requirement at drain removal, compared to time of placement. In this study, peritoneal and pleural drains were safe interventions for children with severe VOD. © 2016 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

YongQiang Li

2018-01-01

Full Text Available For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR, is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

cPath: open source software for collecting, storing, and querying biological pathways

Directory of Open Access Journals (Sweden)

Gross Benjamin E

2006-11-01

Full Text Available Abstract Background Biological pathways, including metabolic pathways, protein interaction networks, signal transduction pathways, and gene regulatory networks, are currently represented in over 220 diverse databases. These data are crucial for the study of specific biological processes, including human diseases. Standard exchange formats for pathway information, such as BioPAX, CellML, SBML and PSI-MI, enable convenient collection of this data for biological research, but mechanisms for common storage and communication are required. Results We have developed cPath, an open source database and web application for collecting, storing, and querying biological pathway data. cPath makes it easy to aggregate custom pathway data sets available in standard exchange formats from multiple databases, present pathway data to biologists via a customizable web interface, and export pathway data via a web service to third-party software, such as Cytoscape, for visualization and analysis. cPath is software only, and does not include new pathway information. Key features include: a built-in identifier mapping service for linking identical interactors and linking to external resources; built-in support for PSI-MI and BioPAX standard pathway exchange formats; a web service interface for searching and retrieving pathway data sets; and thorough documentation. The cPath software is freely available under the LGPL open source license for academic and commercial use. Conclusion cPath is a robust, scalable, modular, professional-grade software platform for collecting, storing, and querying biological pathways. It can serve as the core data handling component in information systems for pathway visualization, analysis and modeling.

Assessing Receiving Water Quality Impacts due to Flow Path Alteration in Residential Catchments, using the Stormwater and Wastewater Management Model

Science.gov (United States)

Wolosoff, S. E.; Duncan, J.; Endreny, T.

2001-05-01

The Croton water supply system, responsible for supplying approximately 10% of New York City's water, provides an opportunity for exploration into the impacts of significant terrestrial flow path alteration upon receiving water quality. Natural flow paths are altered during residential development in order to allow for construction at a given location, reductions in water table elevation in low lying areas and to provide drainage of increased overland flow volumes. Runoff conducted through an artificial drainage system, is prevented from being attenuated by the natural environment, thus the pollutant removal capacity inherent in most natural catchments is often limited to areas where flow paths are not altered by development. By contrasting the impacts of flow path alterations in two small catchments in the Croton system, with different densities of residential development, we can begin to identify appropriate limits to the re-routing of runoff in catchments draining into surface water supplies. The Stormwater and Wastewater Management Model (SWMM) will be used as a tool to predict the runoff quantity and quality generated from two small residential catchments and to simulate the potential benefits of changes to the existing drainage system design, which may improve water quality due to longer residence times.

Improved Path Loss Simulation Incorporating Three-Dimensional Terrain Model Using Parallel Coprocessors

Directory of Open Access Journals (Sweden)

Zhang Bin Loo

2017-01-01

Full Text Available Current network simulators abstract out wireless propagation models due to the high computation requirements for realistic modeling. As such, there is still a large gap between the results obtained from simulators and real world scenario. In this paper, we present a framework for improved path loss simulation built on top of an existing network simulation software, NS-3. Different from the conventional disk model, the proposed simulation also considers the diffraction loss computed using Epstein and Peterson’s model through the use of actual terrain elevation data to give an accurate estimate of path loss between a transmitter and a receiver. The drawback of high computation requirements is relaxed by offloading the computationally intensive components onto an inexpensive off-the-shelf parallel coprocessor, which is a NVIDIA GPU. Experiments are performed using actual terrain elevation data provided from United States Geological Survey. As compared to the conventional CPU architecture, the experimental result shows that a speedup of 20x to 42x is achieved by exploiting the parallel processing of GPU to compute the path loss between two nodes using terrain elevation data. The result shows that the path losses between two nodes are greatly affected by the terrain profile between these two nodes. Besides this, the result also suggests that the common strategy to place the transmitter in the highest position may not always work.

Mathematical optimization for planning and design of cycle paths

Energy Technology Data Exchange (ETDEWEB)

LiÑan Ruiz, R.J.; Perez Aracil, J.; Cabrera Cañizares, V.

2016-07-01

The daily need for citizens to move for different activities, whatever its nature, has been greatly affected by the changes. The advantages resulting from the inclusion of the bicycle as a mode of transport and the proliferation of its use among citizens are numerous and extend both in the field of urban mobility and sustainable development.Currently, there are a number of programs for the implementation, promotion or increased public participation related to cycling in cities. But ultimately, each and every one of these initiatives have the same goal, to create a mesh of effective, useful and cycling trails that allow the use of bicycles in preferred routes with high guarantees of security, incorporating bicycle model intermodal urban transport.With the gradual implementation of bike lanes, many people have begun to use them to get around the city. But everything again needs a period of adaptation, and the reality is that the road network for these vehicles is full of obstacles to the rider. The current situation has led to the proposal that many kilometers of cycle paths needed to supply the demand of this mode of transport and, if implemented and planned are correct and sufficient.This paper presents a mathematical programming model for optimal design of a network for cyclists is presented. Specifically, the model determines a network of bicycle infrastructure, appropriate to the characteristics of a network of existing roads.As an application of the proposed model, the result of these experiments give a number of useful conclusions for planning and designing networks of cycle paths from a social perspective, applied to the case in the city of Malaga. (Author)

76 FR 62605 - Virginia Graeme Baker Pool and Spa Safety Act; Interpretation of Unblockable Drain

Science.gov (United States)

2011-10-11

... the VGB Act defines an ``unblockable drain'' as ``a drain of any size and shape that a human body... intentions. They claim that for this reason, backup systems are necessary, and a swimming pool or spa with a... of an ``unblockable drain,'' at 16 CFR 1450.2(b) and believe it was in error. Regardless of the size...

Interaction of the Bored Sand and Gravel Drain Pile with the Surrounding Compacted Loam Soil and Foundation Raft Taking into Account Rheological Properties of the Loam Soil and Non-Linear Properties of the Drain Pile

Science.gov (United States)

Ter-Martirosyan, Z. G.; Ter-Martirosyan, A. Z.; Anzhelo, G. O.; Buslov, A. S.

2018-01-01

The task of the interaction of the sand and gravel drain pile with the surrounding loam soil after its preliminary deep compaction and formation of the composite ground cylinder from the drain pile and surrounding compacted loam soil (cells) is considered in the article. It is seen that the subsidence and carrying capacity of such cell considerably depends on physical and mechanical properties of the compacted drain piles and surrounding loam soil as well as their diameter and intercellular distance. The strain-stress state of the cell is considered not taking into account its component elements, but taking into account linear and elastic-plastic properties of the drain pile and creep flow of the surrounding loam soil. It is stated that depending on these properties the distribution and redistribution of the load on a cell takes place from the foundation raft between the drain pile and surrounding soil. Based on the results of task solving the formulas and charts are given demonstrating the ratio of the load between the drain pile and surrounding loam soil in time.

Slow Path to the Superintendency: Women's Social Networks and Negotiation Skills

Science.gov (United States)

Montz, Carol B.; Wanat, Carolyn L.

2008-01-01

Women superintendents in one Midwestern state participated in this study of their personal demographics, professional qualifications and career paths, and demographics of districts and boards of education that hired them. Participants identified characteristics, skills, and barriers to women seeking superintendencies. Thirty-one of 36 women…

A sum-over-paths algorithm for third-order impulse-response moment extraction within RC IC-interconnect networks

Science.gov (United States)

Wojcik, E. A.; Ni, D.; Lam, T. M.; Le Coz, Y. L.

2015-07-01

We have created the first stochastic SoP (Sum-over-Paths) algorithm to extract third-order impulse-response (IR) moment within RC IC interconnects. It employs a newly discovered Feynman SoP Postulate. Importantly, our algorithm maintains computational efficiency and full parallelism. Our approach begins with generation of s-domain nodal-voltage equations. We then perform a Taylor-series expansion of the circuit transfer function. These expansions yield transition diagrams involving mathematical coupling constants, or weight factors, in integral powers of complex frequency s. Our SoP Postulate enables stochastic evaluation of path sums within the circuit transition diagram to order s3-corresponding to the order of IR moment (m3) we seek here. We furnish, for the first time, an informal algebraic proof independently validating our SoP Postulate and algorithm. We list, as well, detailed procedural steps, suitable for coding, that define an efficient stochastic algorithm for m3 IR extraction. Origins of the algorithm's statistical "capacitor-number cubed" correction and "double-counting" weight factors are explained, for completeness. Our algorithm was coded and successfully tested against exact analytical solutions for 3-, 5-, and 10-stage RC lines. We achieved better than 0.65% 1-σ error convergence, after only 10K statistical samples, in less than 1 s of 2-GHz Pentium® execution time. These results continue to suggest that stochastic SoP algorithms may find useful application in circuit analysis of massively coupled networks, such as those encountered in high-end digital IC-interconnect CAD.

Performance Evaluation of Resilience using Service Relocation for GMPLS Networks

DEFF Research Database (Denmark)

Wessing, Henrik; Herrmann, Sven; Ruepp, Sarah Renée

2015-01-01

Cloud computing today represents an ever increasing part of the data exchanged over the Internet. This influences the core network, where the special properties of cloud based services can be leveraged to increase the network efficiency. This paper explores the concept of relocation for the backup...... path when providing resiliency to cloud services in the network. The control plane of a GMPLSenabled optical network is simulated, thus evaluating the proposed Path Computation Element architecture for service relocation. The results show that for increased offered traffic in the network, the overall...

Modelling Technique for the Assessment of the Sub-Soil Drain for Groundwater Seepage Remediation

Directory of Open Access Journals (Sweden)

Tajul Baharuddin Mohamad Faizal

2017-01-01

Full Text Available Groundwater simulation technique was carried out for examining the performance of sub-soil drain at problematic site area. Subsoil drain was proposed as one of solution for groundwater seepage occurred at the slope face by reducing groundwater table at Taman Botani Park Kuala Lumpur. The simulation technique used Modular Three-Dimensional Finite Difference Groundwater Flow (MODFLOW software. In transient conditions, the results of simulation showed that heads increases surpass 1 to 2 m from the elevation level of the slope area that caused groundwater seepage on slope face. This study attempt to decrease the heads increase surpass by using different sub-soil drain size in simulation technique. The sub-soil drain capable to decline the heads ranges of 1 to 2 m.

Decommissioning of fast reactors after sodium draining

International Nuclear Information System (INIS)

2009-11-01

Acknowledging the importance of passing on knowledge and experience, as well mentoring the next generation of scientists and engineers, and in response to expressed needs by Member States, the IAEA has undertaken concrete steps towards the implementation of a fast reactor data retrieval and knowledge preservation initiative. Decommissioning of fast reactors and other sodium bearing facilities is a domain in which considerable experience has been accumulated. Within the framework and drawing on the wide expertise of the Technical Working Group on Fast Reactors (TWG-FR), the IAEA has initiated activities aiming at preserving the feedback (lessons learned) from this experience and condensing those to technical recommendations on fast reactor design features that would ease their decommissioning. Following a recommendation by the TWG-FR, the IAEA had convened a topical Technical Meeting (TM) on 'Operational and Decommissioning Experience with Fast Reactors', hosted by CEA, Centre d'Etudes de Cadarache, France, from 11 to 15 March 2002 (IAEA-TECDOC- 1405). The participants in that TM exchanged detailed technical information on fast reactor operation and decommissioning experience with various sodium cooled fast reactors, and, in particular, reviewed the status of the various decommissioning programmes. The TM concluded that the decommissioning of fast reactors to reach safe enclosure presented no major difficulties, and that this had been accomplished mainly through judicious adaptation of processes and procedures implemented during the reactor operation phase, and the development of safe sodium waste treatment processes. However, the TM also concluded that, on the path to achieving total dismantling, challenges remain with regard to the decommissioning of components after sodium draining, and suggested that a follow-on TM be convened, that would provide a forum for in-depth scientific and technical exchange on this topic. This publication constitutes the Proceedings of

Feynman's path integrals and Bohm's particle paths

International Nuclear Information System (INIS)

Tumulka, Roderich

2005-01-01

Both Bohmian mechanics, a version of quantum mechanics with trajectories, and Feynman's path integral formalism have something to do with particle paths in space and time. The question thus arises how the two ideas relate to each other. In short, the answer is, path integrals provide a re-formulation of Schroedinger's equation, which is half of the defining equations of Bohmian mechanics. I try to give a clear and concise description of the various aspects of the situation. (letters and comments)

Evapotranspiration from drained wetlands: drivers, modeling, storage functions, and restoration implications

Science.gov (United States)

Shukla, S.; Wu, C. L.; Shrestha, N.

2017-12-01

Abstract Evapotranspiration (ET) is a major component of wetland and watershed water budgets. The effect of wetland drainage on ET is not well understood. We tested whether the current understanding of insignificant effect of drainage on ET in the temperate region wetlands applies to those in the sub-tropics. Eddy covariance (EC) based ET measurements were made for two years at two previously drained and geographically close wetlands in the Everglades region of Florida. One wetland was significantly drained with 97% of its storage capacity lost. The other was a more functional wetland with 42% of storage capacity lost. Annual average ET at the significantly drained wetland was 836 mm, 34% less than the function wetland (1271 mm) and the difference was statistically significant (p = 0.001). Such differences in wetland ET in the same climatic region have not been observed. The difference in ET was mainly due to drainage driven differences in inundation and associated effects on net radiation (Rn) and local relative humidity. Two daily ET models, a regression (r2 = 0.80) and a Relevance Vector Machine (RVM) model (r2 = 0.84), were developed with the latter being more robust. These models, when used in conjunction with hydrologic models, improved ET predictions for drained wetlands. Predictions from an integrated model showed that more intensely drained wetlands at higher elevation should be targeted for restoration of downstream flows (flooding) because they have the ability to loose higher water volume through ET which increases available water storage capacity of wetlands. Daily ET models can predict changes in ET for improved evaluation of basin-scale effects of restoration programs and climate change scenarios.

A dural lymphatic vascular system that drains brain interstitial fluid and macromolecules.

Science.gov (United States)

Aspelund, Aleksanteri; Antila, Salli; Proulx, Steven T; Karlsen, Tine Veronica; Karaman, Sinem; Detmar, Michael; Wiig, Helge; Alitalo, Kari

2015-06-29

The central nervous system (CNS) is considered an organ devoid of lymphatic vasculature. Yet, part of the cerebrospinal fluid (CSF) drains into the cervical lymph nodes (LNs). The mechanism of CSF entry into the LNs has been unclear. Here we report the surprising finding of a lymphatic vessel network in the dura mater of the mouse brain. We show that dural lymphatic vessels absorb CSF from the adjacent subarachnoid space and brain interstitial fluid (ISF) via the glymphatic system. Dural lymphatic vessels transport fluid into deep cervical LNs (dcLNs) via foramina at the base of the skull. In a transgenic mouse model expressing a VEGF-C/D trap and displaying complete aplasia of the dural lymphatic vessels, macromolecule clearance from the brain was attenuated and transport from the subarachnoid space into dcLNs was abrogated. Surprisingly, brain ISF pressure and water content were unaffected. Overall, these findings indicate that the mechanism of CSF flow into the dcLNs is directly via an adjacent dural lymphatic network, which may be important for the clearance of macromolecules from the brain. Importantly, these results call for a reexamination of the role of the lymphatic system in CNS physiology and disease. © 2015 Aspelund et al.

Multi-Dimensional Path Queries

DEFF Research Database (Denmark)

Bækgaard, Lars

1998-01-01

to create nested path structures. We present an SQL-like query language that is based on path expressions and we show how to use it to express multi-dimensional path queries that are suited for advanced data analysis in decision support environments like data warehousing environments......We present the path-relationship model that supports multi-dimensional data modeling and querying. A path-relationship database is composed of sets of paths and sets of relationships. A path is a sequence of related elements (atoms, paths, and sets of paths). A relationship is a binary path...

Polygonal-path approximations on the path spaces of quantum-mechanical systems: properties of the polygonal paths

International Nuclear Information System (INIS)

Exner, P.; Kolerov, G.I.

1981-01-01

Properties of the subset of polygonal paths in the Hilbert space H of paths referring to a d-dimensional quantum-mechanical system are examined. Using the reproduction kernel technique we prove that each element of H is approximated by polygonal paths uniformly with respect to the ''norm'' of time-interval partitions. This result will be applied in the second part of the present paper to prove consistency of the uniform polygonal-path extension of the Feynman maps [ru

Development of Charge Drain Coatings: Final CRADA Report

Energy Technology Data Exchange (ETDEWEB)

Elam, Jeffrey W. [Argonne National Lab. (ANL), Argonne, IL (United States)

2017-01-17

The primary goal of this CRADA project was to develop and optimize tunable resistive coatings prepared by atomic layer deposition (ALD) for use as charge-drain coatings on the KLA-Tencor digital pattern generators (DPGs).

Beyond centrality-classifying topological significance using backup efficiency and alternative paths

International Nuclear Information System (INIS)

Shavitt, Yuval; Singer, Yaron

2007-01-01

In complex networks characterized by broad degree distribution, node significance is often associated with its degree or with centrality metrics which relate to its reachability and shortest paths passing through it. Such measures do not consider availability of efficient backup of the node and thus often fail to capture its contribution to the functionality and resilience of the network operation. In this paper, we suggest the quality of backup (QoB) and alternative path centrality (APC) measures as complementary methods which enable analysis of node significance in a manner which considers backup. We examine the theoretical significance of these measures and use them to classify nodes in social interaction networks and in the Internet AS (autonomous system) graph while applying the valley-free routing restrictions which reflect the economic relationships between the AS nodes in the Internet. We show that both node degree and node centrality are not necessarily evidence of its significance. In particular, we show that social structures do not necessarily depend on highly central nodes and that medium degree nodes with medium centrality measure prove to be crucial for efficient routing in the Internet AS graph

Cryogenic Fuel Tank Draining Analysis Model

Science.gov (United States)

Greer, Donald

1999-01-01

One of the technological challenges in designing advanced hypersonic aircraft and the next generation of spacecraft is developing reusable flight-weight cryogenic fuel tanks. As an aid in the design and analysis of these cryogenic tanks, a computational fluid dynamics (CFD) model has been developed specifically for the analysis of flow in a cryogenic fuel tank. This model employs the full set of Navier-Stokes equations, except that viscous dissipation is neglected in the energy equation. An explicit finite difference technique in two-dimensional generalized coordinates, approximated to second-order accuracy in both space and time is used. The stiffness resulting from the low Mach number is resolved by using artificial compressibility. The model simulates the transient, two-dimensional draining of a fuel tank cross section. To calculate the slosh wave dynamics the interface between the ullage gas and liquid fuel is modeled as a free surface. Then, experimental data for free convection inside a horizontal cylinder are compared with model results. Finally, cryogenic tank draining calculations are performed with three different wall heat fluxes to demonstrate the effect of wall heat flux on the internal tank flow field.

Roundtable. Strategies to discourage brain drain.

Science.gov (United States)

Kupfer, Linda; Hofman, Karen; Jarawan, Raya; McDermott, Jeanne; Bridbord, Ken

2004-08-01

Building health research expertise in developing countries often requires personnel to receive training beyond national borders. For research funding agencies that sponsor this type of training, a major goal is to ensure that trainees return to their country of origin: attaining this objective requires the use of proactive strategies. The strategies described were developed under the extramural acquired immunodeficiency syndrome (AIDS) International Training and Research Program (AITRP) funded by the Fogarty International Center (FIC) at the National Institutes of Health, United States. This programme supports universities in the United States that provide research training to scientists from developing countries to enable them to address the global epidemic of human immunodeficiency virus (HIV)/AIDS and the related tuberculosis (TB) epidemic. This paper describes the strategies employed to discourage brain drain by the principle investigators (PIs) of five of the longest-funded AITRPs (funded for 15 years). Long-term trainees in these programmes spent from 11 to 96 months (an average of 26 months) studying. Using scientific, political and economic strategies that address brain drain issues, PIs working in AITRPs have attained an average rate of return home for their trainees of 80%.

Postoperative intraabdominal fluid collections : a modified percutaneous drainage method using a surgical drain track

International Nuclear Information System (INIS)

Lee, Deok Hee; Kim, Gab Choul; Hwang, Jae Cheol; Yoon, Hyun Ki; Song, Ho Young; Sung, Kyu Bo

2000-01-01

In the management of postoperative fluid collection, the conventional percutaneous drainage method can be employed. Because of abdominal incisions and various types of surgical drains and/or T-tubes, the application of this method is not always easy, however. We inserted a drainage catheter through a pre-existing percutaneous track formed by a surgical drain located adjacent to the site of abnormal fluid collection. There was no need to remove the drain nor make an additional puncture in the abdominal wall. A dilator was inserted along the drain, and a guide wire was used to negotiate its intraperitoneal track and reach the accumulated fluid. The procedure was simple and safe. We briefly describe our experience of this modified percutaneous drainage technique, as used in three cases involving postoperative fluid collection. (author)

High performance AlGaN/GaN HEMTs with 2.4 μm source-drain spacing