SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks

NASA Astrophysics Data System (ADS)

Li, Celia; Wang, Zhuang; Yang, Cungang

In this paper, we propose a Security Enhanced AODV routing protocol (SEAODV) for wireless mesh networks (WMN). SEAODV employs Blom's key pre-distribution scheme to compute the pairwise transient key (PTK) through the flooding of enhanced HELLO message and subsequently uses the established PTK to distribute the group transient key (GTK). PTK and GTK authenticate unicast and broadcast routing messages respectively. In WMN, a unique PTK is shared by each pair of nodes, while GTK is shared secretly between the node and all its one-hop neighbours. A message authentication code (MAC) is attached as the extension to the original AODV routing message to guarantee the message's authenticity and integrity in a hop-by-hop fashion. Security analysis and performance evaluation show that SEAODV is more effective in preventing identified routing attacks and outperforms ARAN and SAODV in terms of computation cost and route acquisition latency.

The Fizz-Keeper: A Useful Science Tool

ERIC Educational Resources Information Center

Williams, John P.; Natta, Sandy Van; Knipp, Rebecca

2005-01-01

The relationship between the amount of gas, pressure and volume is demonstrated by an example of a household science tool, fizz-keeper. It is explained that the fizz in the soft drink is due to carbon dioxide (CO(sub 2)) that is bottled under pressure, by using fizz-keeper.

Keeper-Animal Interactions: Differences between the Behaviour of Zoo Animals Affect Stockmanship.

PubMed

Ward, Samantha J; Melfi, Vicky

2015-01-01

Stockmanship is a term used to describe the management of animals with a good stockperson someone who does this in a in a safe, effective, and low-stress manner for both the stock-keeper and animals involved. Although impacts of unfamiliar zoo visitors on animal behaviour have been extensively studied, the impact of stockmanship i.e familiar zoo keepers is a new area of research; which could reveal significant ramifications for zoo animal behaviour and welfare. It is likely that different relationships are formed dependant on the unique keeper-animal dyad (human-animal interaction, HAI). The aims of this study were to (1) investigate if unique keeper-animal dyads were formed in zoos, (2) determine whether keepers differed in their interactions towards animals regarding their attitude, animal knowledge and experience and (3) explore what factors affect keeper-animal dyads and ultimately influence animal behaviour and welfare. Eight black rhinoceros (Diceros bicornis), eleven Chapman's zebra (Equus burchellii), and twelve Sulawesi crested black macaques (Macaca nigra) were studied in 6 zoos across the UK and USA. Subtle cues and commands directed by keepers towards animals were identified. The animals latency to respond and the respective behavioural response (cue-response) was recorded per keeper-animal dyad (n = 93). A questionnaire was constructed following a five-point Likert Scale design to record keeper demographic information and assess the job satisfaction of keepers, their attitude towards the animals and their perceived relationship with them. There was a significant difference in the animals' latency to appropriately respond after cues and commands from different keepers, indicating unique keeper-animal dyads were formed. Stockmanship style was also different between keepers; two main components contributed equally towards this: "attitude towards the animals" and "knowledge and experience of the animals". In this novel study, data demonstrated unique dyads

Investigation of Keeper Erosion in the NSTAR Ion Thruster

NASA Technical Reports Server (NTRS)

Domonkos, Matthew T.; Foster, John E.; Patterson, Michael J.; Williams, George J., Jr.

2001-01-01

The goal of the present investigation was to determine the cause for the difference in the observed discharge keeper erosion between the 8200 hr wear test of a NASA Solar Electric Propulsion Technology Applications Readiness (NSTAR) engineering model thruster and the ongoing extended life test (ELT) of the NSTAR flight spare thruster. During the ELT, the NSTAR flight spare ion thruster experienced unanticipated erosion of the discharge cathode keeper. Photographs of the discharge keeper show that the orifice has enlarged to slightly more than twice the original diameter. Several differences between the ELT and the 8200 hr wear test were initially identified to determine any effects which could lead to the erosion in the ELT. In order to identify the cause of the ELT erosion, emission spectra from an engineering model thruster were collected to assess the dependence of keeper erosion on operating conditions. Keeper ion current was measured to estimate wear. Additionally, post-test inspection of both a copper keeper-cap was conducted, and the results are presented. The analysis indicated that the bulk of the ion current was collected within 2-mm radially of the orifice. The estimated volumetric wear in the ELT was comparable to previous wear tests. Redistribution of the ion current on the discharge keeper was determined to be the most likely cause of the ELT erosion. The change in ion current distribution was hypothesized to caused by the modified magnetic field of the flight assemblies.

Keeper-Animal Interactions: Differences between the Behaviour of Zoo Animals Affect Stockmanship

PubMed Central

Ward, Samantha J.; Melfi, Vicky

2015-01-01

Stockmanship is a term used to describe the management of animals with a good stockperson someone who does this in a in a safe, effective, and low-stress manner for both the stock-keeper and animals involved. Although impacts of unfamiliar zoo visitors on animal behaviour have been extensively studied, the impact of stockmanship i.e familiar zoo keepers is a new area of research; which could reveal significant ramifications for zoo animal behaviour and welfare. It is likely that different relationships are formed dependant on the unique keeper-animal dyad (human-animal interaction, HAI). The aims of this study were to (1) investigate if unique keeper-animal dyads were formed in zoos, (2) determine whether keepers differed in their interactions towards animals regarding their attitude, animal knowledge and experience and (3) explore what factors affect keeper-animal dyads and ultimately influence animal behaviour and welfare. Eight black rhinoceros (Diceros bicornis), eleven Chapman’s zebra (Equus burchellii), and twelve Sulawesi crested black macaques (Macaca nigra) were studied in 6 zoos across the UK and USA. Subtle cues and commands directed by keepers towards animals were identified. The animals latency to respond and the respective behavioural response (cue-response) was recorded per keeper-animal dyad (n = 93). A questionnaire was constructed following a five-point Likert Scale design to record keeper demographic information and assess the job satisfaction of keepers, their attitude towards the animals and their perceived relationship with them. There was a significant difference in the animals’ latency to appropriately respond after cues and commands from different keepers, indicating unique keeper-animal dyads were formed. Stockmanship style was also different between keepers; two main components contributed equally towards this: “attitude towards the animals” and “knowledge and experience of the animals”. In this novel study, data demonstrated

Comparative study of the surface characteristics, microstructure, and magnetic retentive forces of laser-welded dowel-keepers and cast dowel-keepers for use with magnetic attachments.

PubMed

Chao, Yonglie; Du, Li; Yang, Ling

2005-05-01

Information regarding the merits and problems associated with connecting a keeper to a dowel and coping using a laser welding technique has not been explored extensively in the dental literature. This in vitro study compared the surface characteristics, microstructure, and magnetic retentive forces for a dowel and coping-keeper mechanism fabricated using a laser welding process and a cast-to casting technique. Five cast-to and 6 laser-welded dowel and coping-keeper specimens were tested. Using 5 freestanding keepers as the control group, the surface characteristics and microstructures of the specimens were examined by means of stereomicroscopy, metallographic microscopy, and scanning electron microscopy (SEM). Energy-dispersive spectroscopic (EDS) microanalysis with SEM provided elemental concentration information for the test specimens. The vertical magnetic retentive forces (N) of the 3 groups were measured using a universal testing machine. The results were statistically compared using 1-way analysis of variance and the Newman-Keuls multiple range test (alpha =.05). The laser-welded dowel-keeper generally maintained its original surface smoothness as well as the original microstructure. Elements diffused readily through the fusion zone. The surface of the cast dowel-keeper became rough with the formation of an oxide layer, the microstructure changed, and there was only limited elemental diffusion in the fusion zone. The average vertical magnetic retentive force of the laser-welded group, the cast group, and the control group were 4.2 +/- 0.2 N, 3.8 +/- 0.3 N, and 5.6 +/- 0.3 N, respectively. Statistically significant differences in vertical magnetic retentive force were found between the control group and both the laser-welded and cast groups (P <.01). Compared with the cast dowel-keepers, the average vertical magnetic retentive force of the laser-welded dowel-keepers was significantly higher (P <.05). The laser welding technique had less influence on the

A Secure Cluster-Based Multipath Routing Protocol for WMSNs

PubMed Central

Almalkawi, Islam T.; Zapata, Manel Guerrero; Al-Karaki, Jamal N.

2011-01-01

The new characteristics of Wireless Multimedia Sensor Network (WMSN) and its design issues brought by handling different traffic classes of multimedia content (video streams, audio, and still images) as well as scalar data over the network, make the proposed routing protocols for typical WSNs not directly applicable for WMSNs. Handling real-time multimedia data requires both energy efficiency and QoS assurance in order to ensure efficient utility of different capabilities of sensor resources and correct delivery of collected information. In this paper, we propose a Secure Cluster-based Multipath Routing protocol for WMSNs, SCMR, to satisfy the requirements of delivering different data types and support high data rate multimedia traffic. SCMR exploits the hierarchical structure of powerful cluster heads and the optimized multiple paths to support timeliness and reliable high data rate multimedia communication with minimum energy dissipation. Also, we present a light-weight distributed security mechanism of key management in order to secure the communication between sensor nodes and protect the network against different types of attacks. Performance evaluation from simulation results demonstrates a significant performance improvement comparing with existing protocols (which do not even provide any kind of security feature) in terms of average end-to-end delay, network throughput, packet delivery ratio, and energy consumption. PMID:22163854

A secure cluster-based multipath routing protocol for WMSNs.

PubMed

Almalkawi, Islam T; Zapata, Manel Guerrero; Al-Karaki, Jamal N

2011-01-01

The new characteristics of Wireless Multimedia Sensor Network (WMSN) and its design issues brought by handling different traffic classes of multimedia content (video streams, audio, and still images) as well as scalar data over the network, make the proposed routing protocols for typical WSNs not directly applicable for WMSNs. Handling real-time multimedia data requires both energy efficiency and QoS assurance in order to ensure efficient utility of different capabilities of sensor resources and correct delivery of collected information. In this paper, we propose a Secure Cluster-based Multipath Routing protocol for WMSNs, SCMR, to satisfy the requirements of delivering different data types and support high data rate multimedia traffic. SCMR exploits the hierarchical structure of powerful cluster heads and the optimized multiple paths to support timeliness and reliable high data rate multimedia communication with minimum energy dissipation. Also, we present a light-weight distributed security mechanism of key management in order to secure the communication between sensor nodes and protect the network against different types of attacks. Performance evaluation from simulation results demonstrates a significant performance improvement comparing with existing protocols (which do not even provide any kind of security feature) in terms of average end-to-end delay, network throughput, packet delivery ratio, and energy consumption.

A comparative approach to the study of Keeper-Animal Relationships in the zoo.

PubMed

Carlstead, Kathy

2009-11-01

Research on intensively farmed animals over the past 25 years has shown that human-animal interactions, by affecting the animal's fear of humans, can markedly limit the productivity and welfare of farm animals. This article begins to explore some of the factors that need to be considered to investigate Keeper-Animal Relationships (KARs) in the zoo. In the mid-1990s, a large body of multi-institutional data on zookeepers and animals was collected from 46 Zoos. Using standardized questionnaires, 82 keepers rated how they behaved towards animals, their husbandry routine, how the animal responds to them and to other people, and provided information about themselves. These data include 219 individuals of four endangered species: black rhinoceros, cheetah, maned wolf, and great hornbill. At each zoo, keepers were also videotaped calling to their animals in order to directly observe animal responses to keeper behaviors. Principle Components Analysis reduced eight animal variables to three components and ten keeper variables to five components. Scores for animals and for keepers were calculated on these components and compared, according to five predictions based on models of human-animal interactions in the literature. Animal responses to keepers varied along three dimensions: Affinity to Keeper, Fear of People, and Sociable/Curious. Animal scores of Fear of People were significantly and positively correlated with independent measures of poor welfare from two later studies: fecal corticoid concentrations for 12 black rhinos and "tense-fearful" scores for 12 cheetahs. (1) Significant species differences were found for Affinity to Keeper and Fear of People, and the interaction of these two dimensions of animal response to keepers appears to be species-specific. (2) The quality of KAR is influenced by whether the zookeeper goes in the enclosure with the animal or not, the frequency and time of feeding, and keeper visibility to the animal. Among keepers who go in with their

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks.

PubMed

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A; Al-Muhtadi, Jalal; Rodrigues, Joel J P C; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-03-31

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks.

Cost-Effective Encryption-Based Autonomous Routing Protocol for Efficient and Secure Wireless Sensor Networks

PubMed Central

Saleem, Kashif; Derhab, Abdelouahid; Orgun, Mehmet A.; Al-Muhtadi, Jalal; Rodrigues, Joel J. P. C.; Khalil, Mohammed Sayim; Ali Ahmed, Adel

2016-01-01

The deployment of intelligent remote surveillance systems depends on wireless sensor networks (WSNs) composed of various miniature resource-constrained wireless sensor nodes. The development of routing protocols for WSNs is a major challenge because of their severe resource constraints, ad hoc topology and dynamic nature. Among those proposed routing protocols, the biology-inspired self-organized secure autonomous routing protocol (BIOSARP) involves an artificial immune system (AIS) that requires a certain amount of time to build up knowledge of neighboring nodes. The AIS algorithm uses this knowledge to distinguish between self and non-self neighboring nodes. The knowledge-building phase is a critical period in the WSN lifespan and requires active security measures. This paper proposes an enhanced BIOSARP (E-BIOSARP) that incorporates a random key encryption mechanism in a cost-effective manner to provide active security measures in WSNs. A detailed description of E-BIOSARP is presented, followed by an extensive security and performance analysis to demonstrate its efficiency. A scenario with E-BIOSARP is implemented in network simulator 2 (ns-2) and is populated with malicious nodes for analysis. Furthermore, E-BIOSARP is compared with state-of-the-art secure routing protocols in terms of processing time, delivery ratio, energy consumption, and packet overhead. The findings show that the proposed mechanism can efficiently protect WSNs from selective forwarding, brute-force or exhaustive key search, spoofing, eavesdropping, replaying or altering of routing information, cloning, acknowledgment spoofing, HELLO flood attacks, and Sybil attacks. PMID:27043572

Corrosion behaviours of the dental magnetic keeper complexes made by different alloys and methods.

PubMed

Wu, Min-Ke; Song, Ning; Liu, Fei; Kou, Liang; Lu, Xiao-Wen; Wang, Min; Wang, Hang; Shen, Jie-Fei

2016-09-29

The keeper and cast dowel-coping, as a primary component for a magnetic attachment, is easily subjected to corrosion in a wet environment, such as the oral cavity, which contains electrolyte-rich saliva, complex microflora and chewing behaviour and so on. The objective of this in vitro study was to examine the corrosion resistance of a dowel and coping-keeper complex fabricated by finish keeper and three alloys (cobalt-chromium, CoCr; silver-palladium-gold, PdAu; gold-platinum, AuPt) using a laser-welding process and a casting technique. The surface morphology characteristics and microstructures of the samples were examined by means of metallographic microscope and scanning electron microscope (SEM). Energy-dispersive spectroscopy (EDS) with SEM provided elements analysis information for the test samples after 10% oxalic acid solution etching test. Tafel polarization curve recordings demonstrated parameter values indicating corrosion of the samples when subjected to electrochemical testing. This study has suggested that massive oxides are attached to the surface of the CoCr-keeper complex but not to the AuPt-keeper complex. Only the keeper area of cast CoCr-keeper complex displayed obvious intergranular corrosion and changes in the Fe and Co elements. Both cast and laser-welded AuPt-keeper complexes had the highest free corrosion potential, followed by the PdAu-keeper complex. We concluded that although the corrosion resistance of the CoCr-keeper complex was worst, the keeper surface passive film was actually preserved to its maximum extent. The laser-welded CoCr- and PdAu-keeper complexes possessed superior corrosion resistance as compared with their cast specimens, but no significant difference was found between the cast and laser-welded AuPt-keeper complexes. The Fe-poor and Cr-rich band, appearing on the edge of the keeper when casting, has been proven to be a corrosion-prone area.

Corrosion behaviours of the dental magnetic keeper complexes made by different alloys and methods

PubMed Central

Wu, Min-Ke; Song, Ning; Liu, Fei; Kou, Liang; Lu, Xiao-Wen; Wang, Min; Wang, Hang; Shen, Jie-Fei

2016-01-01

The keeper and cast dowel–coping, as a primary component for a magnetic attachment, is easily subjected to corrosion in a wet environment, such as the oral cavity, which contains electrolyte-rich saliva, complex microflora and chewing behaviour and so on. The objective of this in vitro study was to examine the corrosion resistance of a dowel and coping-keeper complex fabricated by finish keeper and three alloys (cobalt–chromium, CoCr; silver–palladium–gold, PdAu; gold–platinum, AuPt) using a laser-welding process and a casting technique. The surface morphology characteristics and microstructures of the samples were examined by means of metallographic microscope and scanning electron microscope (SEM). Energy-dispersive spectroscopy (EDS) with SEM provided elements analysis information for the test samples after 10% oxalic acid solution etching test. Tafel polarization curve recordings demonstrated parameter values indicating corrosion of the samples when subjected to electrochemical testing. This study has suggested that massive oxides are attached to the surface of the CoCr–keeper complex but not to the AuPt–keeper complex. Only the keeper area of cast CoCr–keeper complex displayed obvious intergranular corrosion and changes in the Fe and Co elements. Both cast and laser-welded AuPt–keeper complexes had the highest free corrosion potential, followed by the PdAu–keeper complex. We concluded that although the corrosion resistance of the CoCr–keeper complex was worst, the keeper surface passive film was actually preserved to its maximum extent. The laser-welded CoCr– and PdAu–keeper complexes possessed superior corrosion resistance as compared with their cast specimens, but no significant difference was found between the cast and laser-welded AuPt–keeper complexes. The Fe-poor and Cr-rich band, appearing on the edge of the keeper when casting, has been proven to be a corrosion-prone area. PMID:27388806

Privacy preservation and authentication on secure geographical routing in VANET

NASA Astrophysics Data System (ADS)

Punitha, A.; Manickam, J. Martin Leo

2017-05-01

Vehicular Ad hoc Networks (VANETs) play an important role in vehicle-to-vehicle communication as it offers a high level of safety and convenience to drivers. In order to increase the level of security and safety in VANETs, in this paper, we propose a Privacy Preservation and Authentication on Secure Geographical Routing Protocol (PPASGR) for VANET. It provides security by detecting and preventing malicious nodes through two directional antennas such as forward (f-antenna) and backward (b-antenna). The malicious nodes are detected by direction detection, consistency detection and conflict detection. The location of the trusted neighbour is identified using TNT-based location verification scheme after the implementation of the Vehicle Tamper Proof Device (VTPD), Trusted Authority (TA) is generated that produces the anonymous credentials. Finally, VTPD generates pseudo-identity using TA which retrieves the real identity of the sender. Through this approach, the authentication, integrity and confidentiality for routing packets can be achieved. The simulation results show that the proposed approach reduces the packet drop due to attack and improves the packet delivery ratio.

1. Keeper's house and light tower, view northwest, south and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Keeper's house and light tower, view northwest, south and east sides of keeper's house, southwest and southeast sides of light tower - Curtis Island Light Station, Curtis Island, at entrance to Camden Harbor, Camden, Knox County, ME

4. Storage building, outhouse, oil house, keeper's house and light ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Storage building, outhouse, oil house, keeper's house and light tower, view southwest, northeast sides (southeast and northeast sides of keeper's house) - Petit Manan Light Station, 2.5 miles south of Petit Manan Point, Milbridge, Washington County, ME

Efficient Security Mechanisms for the Border Gateway Routing Protocol

DTIC Science & Technology

1997-08-22

Finding Algorithm for Loop- Free Routing. IEEE/ACM Transactions on Networking, 5(1):148{160, Feb. 1997. [7] International Standards Organization. ISO/IEC...Jersey 07974, Feb. 1985. ftp://netlib.att.com/netlib/att/cs/ cstr /117.ps.Z. [16] S. L. Murphy. Presentation in Panel on \\Security Architecture for the

2. Light tower and keeper's house, view southwest, north northeast ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

2. Light tower and keeper's house, view southwest, north northeast side of tower, northeast and northwest sides of keeper's house - Wood Island Light Station, East end of Wood Island, at mouth of Soo River, Biddeford Pool, York County, ME

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks

PubMed Central

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole. PMID:28121992

A Secure Region-Based Geographic Routing Protocol (SRBGR) for Wireless Sensor Networks.

PubMed

Adnan, Ali Idarous; Hanapi, Zurina Mohd; Othman, Mohamed; Zukarnain, Zuriati Ahmad

2017-01-01

Due to the lack of dependency for routing initiation and an inadequate allocated sextant on responding messages, the secure geographic routing protocols for Wireless Sensor Networks (WSNs) have attracted considerable attention. However, the existing protocols are more likely to drop packets when legitimate nodes fail to respond to the routing initiation messages while attackers in the allocated sextant manage to respond. Furthermore, these protocols are designed with inefficient collection window and inadequate verification criteria which may lead to a high number of attacker selections. To prevent the failure to find an appropriate relay node and undesirable packet retransmission, this paper presents Secure Region-Based Geographic Routing Protocol (SRBGR) to increase the probability of selecting the appropriate relay node. By extending the allocated sextant and applying different message contention priorities more legitimate nodes can be admitted in the routing process. Moreover, the paper also proposed the bound collection window for a sufficient collection time and verification cost for both attacker identification and isolation. Extensive simulation experiments have been performed to evaluate the performance of the proposed protocol in comparison with other existing protocols. The results demonstrate that SRBGR increases network performance in terms of the packet delivery ratio and isolates attacks such as Sybil and Black hole.

2. Keeper's house, light tower and oil house, view north, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

2. Keeper's house, light tower and oil house, view north, south and east sides of keeper's house, south side of tower and oil house - Owl's Head Light Station, Off State Highway 73 just east of Rockland on Owl's Head Bay, Owls Head, Knox County, ME

7. Keeper's house, fog signal house and light tower, view ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

7. Keeper's house, fog signal house and light tower, view north northeast, west and south sides of keeper's house and tower, southwest and southeast sides of fog signal house - West Quoddy Head Light Station, At eastern tip of West Quaddy Head, Lubec, Washington County, ME

2. Barn, light tower and keeper's house, view southeast, west ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

2. Barn, light tower and keeper's house, view southeast, west and north sides of barn, northwest side of light tower, and west northwest and north northeast sides of keeper's house - Curtis Island Light Station, Curtis Island, at entrance to Camden Harbor, Camden, Knox County, ME

1. Keeper's house, small boathouse, and light tower, view east, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Keeper's house, small boathouse, and light tower, view east, west and south sides of keeper's house, west side of boathouse and tower - Great Duck Island Light Station, At southern tip of Great Duck Island southeast of Bass Harbor & northeast of Frenchboro, Frenchboro, Hancock County, ME

Ensuring Data Storage Security in Tree cast Routing Architecture for Sensor Networks

NASA Astrophysics Data System (ADS)

Kumar, K. E. Naresh; Sagar, U. Vidya; Waheed, Mohd. Abdul

2010-10-01

In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, this routing architecture moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this paper, we focus on data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in this architecture, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server

Using Trust to Establish a Secure Routing Model in Cognitive Radio Network.

PubMed

Zhang, Guanghua; Chen, Zhenguo; Tian, Liqin; Zhang, Dongwen

2015-01-01

Specific to the selective forwarding attack on routing in cognitive radio network, this paper proposes a trust-based secure routing model. Through monitoring nodes' forwarding behaviors, trusts of nodes are constructed to identify malicious nodes. In consideration of that routing selection-based model must be closely collaborative with spectrum allocation, a route request piggybacking available spectrum opportunities is sent to non-malicious nodes. In the routing decision phase, nodes' trusts are used to construct available path trusts and delay measurement is combined for making routing decisions. At the same time, according to the trust classification, different responses are made specific to their service requests. By adopting stricter punishment on malicious behaviors from non-trusted nodes, the cooperation of nodes in routing can be stimulated. Simulation results and analysis indicate that this model has good performance in network throughput and end-to-end delay under the selective forwarding attack.

4. Tower entrance wing, covered way, keeper's house and shed, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Tower entrance wing, covered way, keeper's house and shed, view west northwest, northeast side of wing and covered way, southeast and northeast sides of keeper's house, southwest and southeast sides of shed - Burnt Island Light Station, Burnt Island, west side of entrance to Boothbay Harbor, Pine Cliff, Lincoln County, ME

Security-Oriented and Load-Balancing Wireless Data Routing Game in the Integration of Advanced Metering Infrastructure Network in Smart Grid

DOE Office of Scientific and Technical Information (OSTI.GOV)

He, Fulin; Cao, Yang; Zhang, Jun Jason

Ensuring flexible and reliable data routing is indispensable for the integration of Advanced Metering Infrastructure (AMI) networks, we propose a secure-oriented and load-balancing wireless data routing scheme. A novel utility function is designed based on security routing scheme. Then, we model the interactive security-oriented routing strategy among meter data concentrators or smart grid meters as a mixed-strategy network formation game. Finally, such problem results in a stable probabilistic routing scheme with proposed distributed learning algorithm. One contributions is that we studied that different types of applications affect the routing selection strategy and the strategy tendency. Another contributions is that themore » chosen strategy of our mixed routing can adaptively to converge to a new mixed strategy Nash equilibrium (MSNE) during the learning process in the smart grid.« less

A turtle cognition research demonstration enhances visitor engagement and keeper-animal relationships.

PubMed

Alba, Andrew C; Leighty, Katherine A; Pittman Courte, Victoria L; Grand, Alison P; Bettinger, Tamara L

2017-07-01

Environmental enrichment techniques present animals with cognitive challenges while providing them opportunities to make choices and exert control over their environment. In this way, cognitive research and training is enriching to animals and can be used as a form of enrichment in zoos and aquariums. Cognitive research demonstrations also provide an opportunity to enhance visitor experience, as well as foster interactions between animals and keepers. We investigated how cognitive research sessions involving eastern box turtles (Terrapene carolina carolina) at Disney's Animal Kingdom ® impacted both the rate of visitors coming to the exhibit and the amount of time they spent engaged. Further, we used a questionnaire to assess the impact of keeper participation in these sessions on their relationships with and perceptions of the turtles. While visitation rate to the exhibit was not impacted, cognitive research sessions held visitor attention for longer than keeper interpretation or at times during which no keepers or researchers were present. We also found that keepers that had worked with the turtles for longer and keepers that regularly participated in cognitive research sessions reported stronger bonds with the turtles. Our research suggests that use of cognitive research and training demonstrations for guest viewing in zoos and aquariums may enhance visitor learning opportunities by increasing the amount of time they spend at the exhibit. Our study also provides evidence that participation in such demonstrations by zoo and aquarium professionals can be related to improved keeper-animal bonds, potentially resulting in better husbandry and enhanced animal welfare. © 2017 Wiley Periodicals, Inc.

A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks.

PubMed

Tang, Jiawei; Liu, Anfeng; Zhang, Jian; Xiong, Neal N; Zeng, Zhiwen; Wang, Tian

2018-03-01

The Internet of things (IoT) is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR) scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs). The main contributions of a TBSR are (a) the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b) Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of battery

A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks

PubMed Central

Tang, Jiawei; Zhang, Jian; Zeng, Zhiwen; Wang, Tian

2018-01-01

The Internet of things (IoT) is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR) scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs). The main contributions of a TBSR are (a) the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b) Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of battery

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

PubMed Central

Zhang, Lin; Yin, Na; Fu, Xiong; Lin, Qiaomin; Wang, Ruchuan

2017-01-01

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

Infection of great apes and a zoo keeper with the same Mycobacterium tuberculosis spoligotype.

PubMed

Akkerman, Onno W; van der Werf, Tjip S; Rietkerk, Frank; Eger, Tony; van Soolingen, Dick; van der Loo, Kees; van der Zanden, Adri G M

2014-04-01

An animal keeper was diagnosed with pulmonary tuberculosis (TB) after bi-annual screening for latent TB infection in zoo employees. In the same period, several bonobos of the zoo were suffering from TB as well. The Mycobacterium tuberculosis strains from both the animal keeper and the bonobos appeared identical. We provide evidence that the animals infected their keeper.

Can "patient keeper" help in-patients?

PubMed

Al-Hinnawi, M F

2009-06-01

The aim of this paper is to present our "Patient Keeper" application, which is a client-server medical application. "Patient Keeper" is designed to run on a mobile phone for the client application and on a PC for the server application using J2ME and JAVA2, respectively. This application can help doctors during visits to their patients in hospitals. The client application allows doctors to store on their mobile phones the results of their diagnoses and findings such as temperature, blood pressure, medications, analysis, etc., and send this information to the server via short message service (SMS) for storage in a database. The server can also respond to any request from the client and send the result via Bluetooth, infrared, or over the air. Experimental results showed a significant improvement of the healthcare delivery and reduction for in-patient stay.

My Brother's Keeper

ERIC Educational Resources Information Center

Obama, Barack

2014-01-01

In a White House address, the president announced an initiative to reclaim young boys and men of color. The "My Brother's Keeper" initiative partners with businesses, foundations, and nonprofits to address disparities in education, justice, and employment. President Obama was introduced by Christian, one of a group of students from…

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Students in the My Brother’s Keeper program line the railings of an observation deck overlooking the Granular Mechanics and Regolith Operations Lab at NASA’s Kennedy Space Center in Florida. The spaceport is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Students in the My Brother’s Keeper program get an inside look at NASA Kennedy Space Center’s iconic Vehicle Assembly Building from the transfer aisle. The Florida spaceport is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Students in the My Brother’s Keeper program try out some of the machinery inside the Prototype Lab at NASA’s Kennedy Space Center. The Florida spaceport is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Mike Lane demonstrates a 3D scanner inside the NASA Kennedy Space Center Prototype Lab for students in the My Brother’s Keeper program. The Florida spaceport is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Harold (Russ) McAmis demonstrates machinery inside NASA Kennedy Space Center’s Prototype Lab for students in the My Brother’s Keeper program. The Florida spaceport is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Jose Nunez of NASA Kennedy Space Center’s Exploration Research and Technology Programs talks to students in the My Brother’s Keeper program outside the Florida spaceport’s Swamp Works Lab. Kennedy is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Students in the My Brother’s Keeper program watch as Jose Nunez of NASA Kennedy Space Center’s Exploration Research and Technology Programs demonstrates some of the hardware in the Electrostatic and Surface Physics Lab at the Florida spaceport. Kennedy is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

My Brother’s Keeper National Lab Week

NASA Image and Video Library

2016-03-02

Students in the My Brother’s Keeper program listen as Jose Nunez of NASA Kennedy Space Center’s Exploration Research and Technology Programs explains some of the hardware in the Electrostatic and Surface Physics Lab at the Florida spaceport. Kennedy is one of six NASA centers that participated in My Brother’s Keeper National Lab Week. The event is a nationwide effort to bring youth from underrepresented communities into federal labs and centers for hands-on activities, tours and inspirational speakers. Sixty students from the nearby cities of Orlando and Sanford visited Kennedy, where they toured the Vehicle Assembly Building, the Space Station Processing Facility and the center’s innovative Swamp Works Labs. The students also had a chance to meet and ask questions of a panel of subject matter experts from across Kennedy.

5 CFR 1605.22 - Claims for correction of Board or TSP record keeper errors; time limitations.

Code of Federal Regulations, 2010 CFR

2010-01-01

... record keeper errors; time limitations. 1605.22 Section 1605.22 Administrative Personnel FEDERAL... § 1605.22 Claims for correction of Board or TSP record keeper errors; time limitations. (a) Filing claims... after that time, the Board or TSP record keeper may use its sound discretion in deciding whether to...

An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge

PubMed Central

Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

2008-01-01

For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODEplus. It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODEplus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully. PMID:27873956

An Energy-Efficient Secure Routing and Key Management Scheme for Mobile Sinks in Wireless Sensor Networks Using Deployment Knowledge.

PubMed

Hung, Le Xuan; Canh, Ngo Trong; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

2008-12-03

For many sensor network applications such as military or homeland security, it is essential for users (sinks) to access the sensor network while they are moving. Sink mobility brings new challenges to secure routing in large-scale sensor networks. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. Also, studies and experiences have shown that considering security during design time is the best way to provide security for sensor network routing. This paper presents an energy-efficient secure routing and key management for mobile sinks in sensor networks, called SCODE plus . It is a significant extension of our previous study in five aspects: (1) Key management scheme and routing protocol are considered during design time to increase security and efficiency; (2) The network topology is organized in a hexagonal plane which supports more efficiency than previous square-grid topology; (3) The key management scheme can eliminate the impacts of node compromise attacks on links between non-compromised nodes; (4) Sensor node deployment is based on Gaussian distribution which is more realistic than uniform distribution; (5) No GPS or like is required to provide sensor node location information. Our security analysis demonstrates that the proposed scheme can defend against common attacks in sensor networks including node compromise attacks, replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Both mathematical and simulation-based performance evaluation show that the SCODE plus significantly reduces the communication overhead, energy consumption, packet delivery latency while it always delivers more than 97 percent of packets successfully.

Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks.

PubMed

Perumal, Madhumathy; Dhandapani, Sivakumar

2015-01-01

Data gathering and optimal path selection for wireless sensor networks (WSN) using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS). This protocol finds the rendezvous point for optimal transmission of data using a "splitting tree" technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the "Biased Random Walk" model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS) is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR) protocol to prove that there is increase in the network lifetime compared with other routing protocols.

Knowledge and attitude towards zoonoses among animal health workers and livestock keepers in Arusha and Tanga, Tanzania.

PubMed

Swai, Emanuel S; Schoonman, Luuk; Daborn, Chris J

2010-10-01

Zoonoses are infections naturally transmitted between vertebrate animals and humans. An exploratory questionnaire-based survey of animal health workers(n=36) and livestock keepers(n=43) was carried out from April 2001 to March 2002 in Tanga and Arusha regions, northern Tanzania, to assess local knowledge, attitudes and public awareness for animal zoonoses. A combination of closed and open-ended questions, focus group discussions and ranking techniques were employed to gather information on perceptions concerning the type of zoonotic diseases prevalent in the study area, level of risk, mode of transmission and methods of preventing disease transmission from animals to humans. The results demonstrated that rabies, tuberculosis and anthrax were considered the three most common zoonotic diseases. Sharing living accommodation with animals, consumption of un-treated livestock products (i.e. milk, meat or eggs) and attending to parturition were perceived as routes of transmission. Knowledge about zoonosis was higher in smallholder dairy (92%; 33/36) than traditional livestock keepers (P<0.05). On the contrary, the perceived risk of contracting a zoonosis was significantly higher in traditional livestock (86%; 6/7) than smallholder dairy keepers (P<0.05). Stratification of the risk of zoonosis by farm location revealed that rural farms (85%; 7/8) were considered significantly at a higher risk when compared to peri or urban located farms (P<0.05). Most of the respondents stated cooking of meat or boiling of milk as a way to prevent transmission. However, there was a significant difference in the perception of the risk posed by contact with potentially infected animals /or animal products with animal health workers having a much higher level of perception compared to livestock keepers. These results suggest that in the Tanga and Arusha, Tanzania, patchy awareness and knowledge of zoonoses, combined with food consumption habits and poor animal husbandry are likely to expose

The Fizz-Keeper: A Useful Science Tool

NASA Astrophysics Data System (ADS)

Williams, John P.; van Natta, Sandy; Knipp, Rebecca

2005-10-01

Even though the Fizz-Keeper does not function as it is marketed (to keep soft drinks from going flat for extended periods of time), this "toy" is well suited for a great variety of science-based activities. Several abbreviated pressure-based activities are given.

Compensation and exotic livestock disease management: the views of animal keepers and veterinarians in England.

PubMed

Hamilton-Webb, A; Naylor, R; Little, R; Maye, D

2016-11-19

Relatively little is known about the perceived influence of different compensation systems on animal keepers' management of exotic livestock disease. This paper aims to address this research gap by drawing on interviews with 61 animal keepers and 21 veterinarians, as well as a series of nine animal keeper focus groups across five different livestock sectors in England. The perceived influence of current compensation systems on disease control behaviour was explored and alternative compensation systems that respectively reward positive practices and penalise poor practices were presented in the form of scenarios, alongside a third system that considered the option of a cost-sharing levy system between industry and government. The results indicate that animal keepers consider themselves to be influenced by a range of non-financial factors, for example, feelings of responsibility, reputation and animal welfare concerns, in the context of their exotic disease management practices. The majority of animal keepers were unaware of the current compensation systems in place for exotic diseases, and were therefore not consciously influenced by financial recompense. Concerns were raised about linking compensation to disease management behaviour due to auditing difficulties. A cost-sharing levy system would likely raise awareness of exotic disease and compensation among animal keepers, but differentiation of payments based upon individual farm-level risk assessments was called for by participants as a strategy to promote positive disease management practices. British Veterinary Association.

First Year Impacts of the "Heritage Keepers[R]" Life Skills Education Component. Final Report

ERIC Educational Resources Information Center

Clark, Melissa A.; Devaney, Barbara

2006-01-01

"Heritage Keepers[R]" is an abstinence education program developed by Heritage Community Services of South Carolina and is among the 900-plus programs receiving federal funding under the Title V, Section 510 Abstinence Education Program. The "Heritage Keepers[R]" program provides a systemic approach to abstinence education…

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment

PubMed Central

Wang, Liangmin

2018-01-01

Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical. PMID:29538314

3VSR: Three Valued Secure Routing for Vehicular Ad Hoc Networks using Sensing Logic in Adversarial Environment.

PubMed

Sohail, Muhammad; Wang, Liangmin

2018-03-14

Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node's transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.

A Distributed Energy-Aware Trust Management System for Secure Routing in Wireless Sensor Networks

NASA Astrophysics Data System (ADS)

Stelios, Yannis; Papayanoulas, Nikos; Trakadas, Panagiotis; Maniatis, Sotiris; Leligou, Helen C.; Zahariadis, Theodore

Wireless sensor networks are inherently vulnerable to security attacks, due to their wireless operation. The situation is further aggravated because they operate in an infrastructure-less environment, which mandates the cooperation among nodes for all networking tasks, including routing, i.e. all nodes act as “routers”, forwarding the packets generated by their neighbours in their way to the sink node. This implies that malicious nodes (denying their cooperation) can significantly affect the network operation. Trust management schemes provide a powerful tool for the detection of unexpected node behaviours (either faulty or malicious). Once misbehaving nodes are detected, their neighbours can use this information to avoid cooperating with them either for data forwarding, data aggregation or any other cooperative function. We propose a secure routing solution based on a novel distributed trust management system, which allows for fast detection of a wide set of attacks and also incorporates energy awareness.

6. Keeper's house, view southwest, east and north sides ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

6. Keeper's house, view southwest, east and north sides - Great Duck Island Light Station, At southern tip of Great Duck Island southeast of Bass Harbor & northeast of Frenchboro, Frenchboro, Hancock County, ME

5. AVALON DAM GATE KEEPER'S COMPLEX: HOUSE (LEFT), WAREHOUSE ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. AVALON DAM - GATE KEEPER'S COMPLEX: HOUSE (LEFT), WAREHOUSE (RIGHT), AND CCC LANDSCAPING (FOREGROUND). VIEW TO SOUTHEAST - Carlsbad Irrigation District, Avalon Dam, On Pecos River, 4 miles North of Carlsbad, Carlsbad, Eddy County, NM

4. Keeper's house, view southeast, north and west sides ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Keeper's house, view southeast, north and west sides - Ram Island Light Station, Ram Island, south of Ocean Point & just north of Fisherman Island, marking south side of Fisherman Island Passage, Ocean Point, Lincoln County, ME

6. AVALON DAM GATE KEEPER'S COMPLEX: GARAGE AND WAREHOUSE ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

6. AVALON DAM - GATE KEEPER'S COMPLEX: GARAGE AND WAREHOUSE (LEFT), HOUSE (RIGHT), AND CCC LANDSCAPING (FOREGROUND). VIEW TO NORTH - Carlsbad Irrigation District, Avalon Dam, On Pecos River, 4 miles North of Carlsbad, Carlsbad, Eddy County, NM

Molecular characterization of Blastocystis isolates from zoo animals and their animal-keepers.

PubMed

Parkar, Unaiza; Traub, Rebecca J; Vitali, Simone; Elliot, Aileen; Levecke, Bruno; Robertson, Ian; Geurden, Thomas; Steele, Jan; Drake, Bev; Thompson, R C Andrew

2010-04-19

Blastocystis is an enteric protist and one of the most frequently reported parasitic infections in humans and a variety of animal hosts. It has also been reported in numerous parasite surveys of animals in zoological gardens and in particular in non-human primate species. PCR-based methods capable of the direct detection of Blastocystis in faeces were used to detect Blastocystis from various hosts, including non-human primates, Australian native fauna, elephants and giraffes, as well as their keepers from a Western Australian zoo. Additional faecal samples were also collected from elephants and giraffes from four other zoos in Amsterdam (The Netherlands), Antwerp (Belgium), Melbourne and Werribee (Australia). Information regarding the general health and lifestyle of the human volunteers were obtained by questionnaire. Overall, 42% and 63% of animals and zoo-keepers sampled from the Western Australian zoo were positive for Blastocystis, respectively. The occurrence of Blastocystis in elephants and giraffes from other cities was similar. This is the first report of Blastocystis found in the elephant, giraffe, quokka, southern hairy nosed wombat and western grey kangaroo. Three novel and what appear to be highly host-specific subtypes (STs) of Blastocystis in the elephant, giraffe and quokka are also described. These findings indicate that further exploration of the genetic diversity of Blastocystis is crucial. Most zoo-keepers at the Perth Zoo were harbouring Blastocystis. Four of these zoo-keeper isolates were identical to the isolates from the southern hairy nosed wombat and five primate species.

Characterization of cathode keeper wear by surface layer activation

NASA Technical Reports Server (NTRS)

Polk, James E.

2003-01-01

In this study, the erosion rates of the discharge cathode keeper in a 30 cm NSTAR configuration ion thruster were measured using a technique known as Surface Layer Activation (SLA). This diagnostic technique involves producing a radioactive tracer in a given surface by bombardment with high energy ions. The decrease in activity of the tracer material may be monitored as the surface is subjected to wear processes and correlated to a depth calibration curve, yielding the eroded depth. Analysis of the activities was achieved through a gamma spectroscopy system. The primary objectives of this investigation were to reproduce erosion data observed in previous wear studies in order to validate the technique, and to determine the effect of different engine operating parameters on erosion rate. The erosion profile at the TH 15 (23 kw) setting observed during the 8200 hour Life Demonstration Test (LDT) was reproduced. The maximum keeper erosion rate at this setting was determined to be 0.085 pm/hr. Testing at the TH 8 (1.4 kw) setting demonstrated lower erosion rates than TH 15, along with a different wear profile. Varying the keeper voltage was shown to have a significant effect on the erosion, with a positive bias with respect to cathode potential decreasing the erosion rate significantly. Accurate measurements were achieved after operating times of only 40 to 70 hours, a significant improvement over other erosion diagnostic methods.

5. Keeper's house and light tower, view south southwest, east ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. Keeper's house and light tower, view south southwest, east and north sides - Rockland Breakwater Light Station, At end of granite breakwater extending south from Jameson Point, Rockland, Knox County, ME

4. Keeper's house and light tower, view south, northeast and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Keeper's house and light tower, view south, northeast and northwest sides - Seguin Island Light Station, Summit of Seguin Island, south of mouth of Kennebec River, Popham Beach, Sagadahoc County, ME

Using Reputation Systems and Non-Deterministic Routing to Secure Wireless Sensor Networks

PubMed Central

Moya, José M.; Vallejo, Juan Carlos; Fraga, David; Araujo, Álvaro; Villanueva, Daniel; de Goyeneche, Juan-Mariano

2009-01-01

Security in wireless sensor networks is difficult to achieve because of the resource limitations of the sensor nodes. We propose a trust-based decision framework for wireless sensor networks coupled with a non-deterministic routing protocol. Both provide a mechanism to effectively detect and confine common attacks, and, unlike previous approaches, allow bad reputation feedback to the network. This approach has been extensively simulated, obtaining good results, even for unrealistically complex attack scenarios. PMID:22412345

1. Keeper's house, oil house, light tower and storage building, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Keeper's house, oil house, light tower and storage building, view northeast, south or southwest sides - Petit Manan Light Station, 2.5 miles south of Petit Manan Point, Milbridge, Washington County, ME

4. Light tower and keeper's house ,view west, southeast and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Light tower and keeper's house ,view west, southeast and northeast sides - Baker Island Light, Lightkeeper's House, Just east of Cranberry Isles, at entrance to Frenchman Bay, Bar Harbor, Hancock County, ME

1. Keeper's house and light tower, view northeast, northwest and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Keeper's house and light tower, view northeast, northwest and southwest sides - Baker Island Light, Lightkeeper's House, Just east of Cranberry Isles, at entrance to Frenchman Bay, Bar Harbor, Hancock County, ME

K-4 Keepers Collection: A Service Learning Teacher Professional Development Program

NASA Astrophysics Data System (ADS)

Schwerin, T. G.; Blaney, L.; Myers, R. J.

2011-12-01

This poster focuses on the K-4 Keepers Collection, a service-learning program developed for the Earth System Science Education Alliance (ESSEA). ESSEA is a NOAA-, NASA- and NSF-supported program of teacher professional development that increases teachers' pedagogical content knowledge of climate-related Earth system science. The ESSEA program -- whether used in formal higher education courses or frequented by individual teachers who look for classroom activities in the environmental sciences -- provides a full suite of activities, lessons and units for teachers' use. The ESSEA network consists of 45 universities and education centers addressing climate and environment issues. K-4 Keepers Collection - ESSEA K-4 module collections focus on five specific themes of content development: spheres, Polar Regions, oceans, climate and service learning. The K-4 Keepers collection provides the opportunity for teachers to explore topics and learning projects promoting stewardship of the Earth's land, water, air and living things. Examination of the impacts of usage and pollution on water, air, land and living things through service-learning projects allows students to become informed stewards. All of the modules include short-term sample projects that either educate or initiate action involving caring for the environment. The K-4 Keepers course requires teachers to develop similar short or long-term projects for implementation in their classrooms. Objectives include: 1. Increase elementary teachers' environmental literacy addressing ocean, coastal, Great Lakes, stewardship, weather and climate science standards and using NOAA and NASA resources. 2. Develop elementary teachers' efficacy in employing service learning projects focused on conserving and preserving Earth's land, air, water and living things. 3. Prepare college faculty to incorporate service learning and environmental literacy into their courses through professional development and modules on the ESSEA website.

5. Light tower and corner of keeper's house, view northeast, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. Light tower and corner of keeper's house, view northeast, northwest and southwest sides - Baker Island Light, Lightkeeper's House, Just east of Cranberry Isles, at entrance to Frenchman Bay, Bar Harbor, Hancock County, ME

43. View of station from southwest side with duplex keepers' ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

43. View of station from southwest side with duplex keepers' dwelling to the left. USLHB photo by Herbert Bamber, June 9, 1893. - Bodie Island Light Station, Off Highway 12, Nags Head, Dare County, NC

7. McMILLAN DAM GATE KEEPER'S HOUSE WITH CCC LANDSCAPING ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

7. McMILLAN DAM - GATE KEEPER'S HOUSE WITH CCC LANDSCAPING IN THE FOREGROUND. VIEW TO SOUTHEAST - Carlsbad Irrigation District, McMillan Dam, On Pecos River, 13 miles North of Carlsbad, Carlsbad, Eddy County, NM

Exploring the role of small-scale livestock keepers for national biosecurity-The pig case.

PubMed

Correia-Gomes, Carla; Henry, Madeleine K; Auty, Harriet K; Gunn, George J

2017-09-15

Small-scale keepers are less likely to engage with production organisations and may therefore be less aware of legislation, rules and biosecurity practices which are implemented in the livestock sector. Their role in the transmission of endemic and exotic diseases is not well studied, but is believed to be important. The authors use small-scale pig keepers in Scotland as an example of how important small-scale livestock keepers might be for national biosecurity. In Scotland more than two thirds of pig producers report that they keep less than 10 pigs, meaning that biosecurity practices and pig health status on a substantial number of holdings are largely unknown; it is considered important to fill this knowledge gap. A questionnaire was designed and implemented in order to gather some of this information. The questionnaire comprised a total of 37 questions divided into seven sections (location of the enterprise, interest in pigs, details about the pig enterprise, marketing of pigs, transport of pigs, pig husbandry, and pig health/biosecurity). Over 610 questionnaires were sent through the post and the questionnaire was also available online. The questionnaire was implemented from June to October 2013 and 135 questionnaires were returned by target respondents. The responses for each question are discussed in detail in this paper. Overall, our results suggest that the level of disease identified by small-scale pig keepers is low but the majority of the small-scale pig keepers are mixed farms, with associated increased risk for disease transmission between species. Almost all respondents implemented at least one biosecurity measure, although the measures taken were not comprehensive in the majority of cases. Overall as interaction between small-scale keepers and commercial producers exists in Scotland the former can pose a risk for commercial production. This investigation fills gaps in knowledge which will allow industry stakeholders and policy makers to adapt their

Dynamic Trust Management for Delay Tolerant Networks and Its Application to Secure Routing

DTIC Science & Technology

2012-09-28

population of misbehaving nodes or evolving hostility or social relations such that an application (e.g., secure routing) built on top of trust...optimization in DTNs in response to dynamically changing conditions such as increasing population of misbehaving nodes. The design part addresses the...The rest of the paper is organized as follows. In Section 2, we survey existing trust management protocols and approaches to deal with misbehaved

4. Keeper's house and light tower, view south southeast, west ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

4. Keeper's house and light tower, view south southeast, west side of house, north and west sides of tower - Rockland Breakwater Light Station, At end of granite breakwater extending south from Jameson Point, Rockland, Knox County, ME

5. Keeper's house, detail of entrance porch, southeast corner, looking ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

5. Keeper's house, detail of entrance porch, southeast corner, looking northwest - Ram Island Light Station, Ram Island, south of Ocean Point & just north of Fisherman Island, marking south side of Fisherman Island Passage, Ocean Point, Lincoln County, ME

1. Light tower/keeper's house and abandoned light tower, view northwest, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Light tower/keeper's house and abandoned light tower, view northwest, south southeast and east northeast sides - Matinicus Rock Light Station, Matinicus Island, on Matinicus Rock, Matinicus, Knox County, ME

2. Abandoned light tower and keeper's house/light tower, view southeast, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

2. Abandoned light tower and keeper's house/light tower, view southeast, north northwest and west southwest sides - Matinicus Rock Light Station, Matinicus Island, on Matinicus Rock, Matinicus, Knox County, ME

7. Shed and keeper' house with helicopter pad in foreground, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

7. Shed and keeper' house with helicopter pad in foreground, view east, southwest and northwest sides - Goat Island Light Station, Goat Island, next to entrance to Cape Porpoise Harbor, just south of Trott Island, Cape Porpoise, York County, ME

1. Keeper's house and light tower, view north northeast, southwest ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Keeper's house and light tower, view north northeast, southwest and southeast sides of house, northwest and southwest sides of tower - Wood Island Light Station, East end of Wood Island, at mouth of Soo River, Biddeford Pool, York County, ME

1. Shed, keeper's house and light tower, view west northwest, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Shed, keeper's house and light tower, view west northwest, south and east sides - Ram Island Light Station, Ram Island, south of Ocean Point & just north of Fisherman Island, marking south side of Fisherman Island Passage, Ocean Point, Lincoln County, ME

1. Light tower, oil house close by, boathouse and keeper's ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Light tower, oil house close by, boathouse and keeper's house, view northwest, south or southeast sides - Goat Island Light Station, Goat Island, next to entrance to Cape Porpoise Harbor, just south of Trott Island, Cape Porpoise, York County, ME

Comparison of reproduce signal and noise of conventional and keepered CoCrTa/Cr thin film media

NASA Astrophysics Data System (ADS)

Sin, Kyusik; Ding, Juren; Glijer, Pawel; Sivertsen, John M.; Judy, Jack H.; Zhu, Jian-Gang

1994-05-01

We studied keepered high coercivity CoCrTa/Cr thin film media with a Cr isolation layer between the CoCrTa storage and an overcoating of an isotropic NiFe soft magnetic layer. The influence of the thickness of the NiFe and Cr layers, and the effects of head bias current on the signal output and noise, were studied using a thin film head. The reproduced signal increased by 7.3 dB, but the signal-to-noise ratio decreased by 4 dB at a linear density of 2100 fr/mm (53.3 kfr/in.) with a 1000 Å thick NiFe keeper layer. The medium noise increased with increasing NiFe thickness and the signal output decreased with decreasing Cr thickness. A low output signal obtained with very thin Cr may be due to magnetic interactions between the keeper layer and magnetic media layer. It is observed that signal distortion and timing asymmetry of the output signals depend on the thickness of the keeper layer and the head bias current. The signal distortion increased and the timing asymmetry decreased as the head bias current was increased. These results may be associated with different permeability of the keeper under the poles of the thin film head due to the superposition of head bias and bit fields.

6. Keeper's house, first floor, detail of woodwork, looking northeast ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

6. Keeper's house, first floor, detail of woodwork, looking northeast from southwest room into northwest room and stair hall - Ram Island Light Station, Ram Island, south of Ocean Point & just north of Fisherman Island, marking south side of Fisherman Island Passage, Ocean Point, Lincoln County, ME

Parametric investigation of enclosed keeper discharge characteristics

NASA Technical Reports Server (NTRS)

Sheheen, T. W.; Finke, R. C.

1973-01-01

Volt-ampere discharge characteristics of an enclosed keeper hollow cathode discharge were measured as a function of the mercury flow rate and external circuit impedance. Discharge currents were varied from 0 to 1 ampere and voltages were 7 to 39 volts. Batteries and a vacuum tube control circuit were used to obtain characteristics curves that were independent of power supply impedance. Variation of the neutral flow results in changes in the discharge which interact with the impedance of the external circuit, and under some conditions, give rise to multiple operating points.

GateKeeper: a new hardware architecture for accelerating pre-alignment in DNA short read mapping.

PubMed

Alser, Mohammed; Hassan, Hasan; Xin, Hongyi; Ergin, Oguz; Mutlu, Onur; Alkan, Can

2017-11-01

High throughput DNA sequencing (HTS) technologies generate an excessive number of small DNA segments -called short reads- that cause significant computational burden. To analyze the entire genome, each of the billions of short reads must be mapped to a reference genome based on the similarity between a read and 'candidate' locations in that reference genome. The similarity measurement, called alignment, formulated as an approximate string matching problem, is the computational bottleneck because: (i) it is implemented using quadratic-time dynamic programming algorithms and (ii) the majority of candidate locations in the reference genome do not align with a given read due to high dissimilarity. Calculating the alignment of such incorrect candidate locations consumes an overwhelming majority of a modern read mapper's execution time. Therefore, it is crucial to develop a fast and effective filter that can detect incorrect candidate locations and eliminate them before invoking computationally costly alignment algorithms. We propose GateKeeper, a new hardware accelerator that functions as a pre-alignment step that quickly filters out most incorrect candidate locations. GateKeeper is the first design to accelerate pre-alignment using Field-Programmable Gate Arrays (FPGAs), which can perform pre-alignment much faster than software. When implemented on a single FPGA chip, GateKeeper maintains high accuracy (on average >96%) while providing, on average, 90-fold and 130-fold speedup over the state-of-the-art software pre-alignment techniques, Adjacency Filter and Shifted Hamming Distance (SHD), respectively. The addition of GateKeeper as a pre-alignment step can reduce the verification time of the mrFAST mapper by a factor of 10. https://github.com/BilkentCompGen/GateKeeper. mohammedalser@bilkent.edu.tr or onur.mutlu@inf.ethz.ch or calkan@cs.bilkent.edu.tr. Supplementary data are available at Bioinformatics online. © The Author (2017). Published by Oxford University Press

Changing home treatment of childhood fevers by training shop keepers in rural Kenya.

PubMed

Marsh, V M; Mutemi, W M; Muturi, J; Haaland, A; Watkins, W M; Otieno, G; Marsh, K

1999-05-01

Malaria control in Africa relies primarily on early effective treatment for clinical disease, but most early treatments for fever occur through self-medication with shop-bought drugs. Lack of information to community members on over-the-counter drug use has led to widespread ineffective treatment of fevers, increased risks of drug toxicity and accelerating drug resistance. We examined the feasibility and measured the likely impact of training shop keepers in rural Africa on community drug use. In a rural area of coastal Kenya, we implemented a shop keeper training programme in 23 shops serving a population of approximately 3500, based on formative research within the community. We evaluated the training by measuring changes in the proportions of drug sales where an adequate amount of chloroquine was purchased and in the percentage of home-treated childhood fevers given an adequate amount of chloroquine. The programme was assessed qualitatively in the community following the shop keeper training. The percentage of drug sales for children with fever which included an antimalarial drug rose from 34.3% (95% CI 28.9%-40.1%) before the training to a minimum of 79.3% (95% CI 71.8%-85.3%) after the training. The percentage of antimalarial drug sales where an adequate amount of drug was purchased rose from 31.8% (95% CI 26.6%-37.6%) to a minimum of 82.9% (95% CI 76.3%-87.3%). The percentage of childhood fevers where an adequate dose of chloroquine was given to the child rose from 3.7% (95% CI 1.2%-9.7%) before the training to a minimum of 65.2% (95% CI 57.7%-72.0%) afterwards, which represents an increase in the appropriate use of over-the-counter chloroquine by at least 62% (95% CI 53.7%-69.3%). Shop keepers and community members were strongly supportive of the aims and outcome of the programme. The large shifts in behaviour observed indicate that the approach of training shop keepers as a channel for information to the community is both feasible and likely to have a

INTERIOR VIEW SHOWING FURNACE KEEPER OBSERVING FURNACE THROUGH BLUE GLASS ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

INTERIOR VIEW SHOWING FURNACE KEEPER OBSERVING FURNACE THROUGH BLUE GLASS EVERY TWENTY MINUTES TO DETERMINE SIZE AND TEXTURE OF BATCH AND OTHER VARIABLES. FAN IN FRONT COOLS WORKERS AS THEY CONDUCT REPAIRS. FURNACE TEMPERATURE AT 1572 DEGREES FAHRENHEIT. - Chambers-McKee Window Glass Company, Furnace No. 2, Clay Avenue Extension, Jeannette, Westmoreland County, PA

Retentive force and magnetic flux leakage of magnetic attachment in various keeper and magnetic assembly combinations.

PubMed

Hasegawa, Mikage; Umekawa, Yoshitada; Nagai, Eiich; Ishigami, Tomohiko

2011-04-01

Magnetic attachments are commonly used for overdentures. However, it can be difficult to identify and provide the same type and size of magnetic assembly and keeper if a repair becomes necessary. Therefore, the size and type may not match. This study evaluated the retentive force and magnetic flux strength and leakage of magnetic attachments in different combinations of keepers and magnetic assemblies. For 6 magnet-keeper combinations using 4 sizes of magnets (GIGAUSS D400, D600, D800, and D1000) (n=5), retentive force was measured 5 times at a crosshead speed of 5 mm/min in a universal testing machine. Magnetic flux strength was measured using a Hall Effect Gaussmeter. Data were statistically analyzed using a 1-way ANOVA, and between-group differences were analyzed with Tukey's HSD post hoc test (α=.05). The mean retentive force of the same-size magnet-keeper combinations was 3.2 N for GIGAUSS D400 and 5.1 N for GIGAUSS D600, but was significantly reduced when using larger magnets (P<.05). Magnetic flux leakage was significantly lower for corresponding size combinations. Size differences influence the retentive force and magnetic flux strength of magnetic attachments. Retentive force decreased due to the closed field structure becoming incomplete and due to magnetic field leakage. Copyright © 2011 The Editorial Council of the Journal of Prosthetic Dentistry. Published by Mosby, Inc. All rights reserved.

Poor livestock keepers: ecosystem–poverty–health interactions

PubMed Central

Lindahl, Johanna; Wanyoike, Francis; Bett, Bernard; Randolph, Tom; Rich, Karl M.

2017-01-01

Humans have never been healthier, wealthier or more numerous. Yet, present success may be at the cost of future prosperity and in some places, especially in sub-Saharan Africa, poverty persists. Livestock keepers, especially pastoralists, are over-represented among the poor. Poverty has been mainly attributed to a lack of access, whether to goods, education or enabling institutions. More recent insights suggest ecosystems may influence poverty and the self-reinforcing mechanisms that constitute poverty traps in more subtle ways. The plausibility of zoonoses as poverty traps is strengthened by landmark studies on disease burden in recent years. While in theory, endemic zoonoses are best controlled in the animal host, in practice, communities are often left to manage disease themselves, with the focus on treatment rather than prevention. We illustrate this with results from a survey on health costs in a pastoral ecosystem. Epidemic zoonoses are more likely to elicit official responses, but these can have unintended consequences that deepen poverty traps. In this context, a systems understanding of disease control can lead to more effective and pro-poor disease management. We illustrate this with an example of how a system dynamics model can help optimize responses to Rift Valley fever outbreaks in Kenya by giving decision makers real-time access to the costs of the delay in vaccinating. In conclusion, a broader, more ecological understanding of poverty and of the appropriate responses to the diseases of poverty can contribute to improved livelihoods for livestock keepers in Africa. This article is part of the themed issue ‘One Health for a changing world: zoonoses, ecosystems and human well-being’. PMID:28584174

Poor livestock keepers: ecosystem-poverty-health interactions.

PubMed

Grace, Delia; Lindahl, Johanna; Wanyoike, Francis; Bett, Bernard; Randolph, Tom; Rich, Karl M

2017-07-19

Humans have never been healthier, wealthier or more numerous. Yet, present success may be at the cost of future prosperity and in some places, especially in sub-Saharan Africa, poverty persists. Livestock keepers, especially pastoralists, are over-represented among the poor. Poverty has been mainly attributed to a lack of access, whether to goods, education or enabling institutions. More recent insights suggest ecosystems may influence poverty and the self-reinforcing mechanisms that constitute poverty traps in more subtle ways. The plausibility of zoonoses as poverty traps is strengthened by landmark studies on disease burden in recent years. While in theory, endemic zoonoses are best controlled in the animal host, in practice, communities are often left to manage disease themselves, with the focus on treatment rather than prevention. We illustrate this with results from a survey on health costs in a pastoral ecosystem. Epidemic zoonoses are more likely to elicit official responses, but these can have unintended consequences that deepen poverty traps. In this context, a systems understanding of disease control can lead to more effective and pro-poor disease management. We illustrate this with an example of how a system dynamics model can help optimize responses to Rift Valley fever outbreaks in Kenya by giving decision makers real-time access to the costs of the delay in vaccinating. In conclusion, a broader, more ecological understanding of poverty and of the appropriate responses to the diseases of poverty can contribute to improved livelihoods for livestock keepers in Africa.This article is part of the themed issue 'One Health for a changing world: zoonoses, ecosystems and human well-being'. © 2017 The Authors.

Composite resin root coping with a keeper for magnetic attachment for replacing the missing coronal portion of a removable partial denture abutment.

PubMed

Maeda, Yoshinobu; Nakao, Katsuhiko; Yagi, Kazutomo; Matsuda, Shisuke

2006-08-01

Numerous methods for replacing missing removable partial denture abutments have been introduced, however, most of them are time consuming and require several visits to complete the procedure. Since magnetic attachments can provide support and bracing as well as retention for overdenture abutments, the remaining tooth root structure can be used to support the coping with the keeper. Through the use of composite resin and adhesive material, improved retention of the keeper to the root may be achieved, along with improved esthetics. This article describes a method for replacing the missing abutment of a removable partial denture with a magnetic attachment, and a composite resin coping with a keeper.

[A survey of sexual psychology and attitude of Chinese peace-keepers in Liberia].

PubMed

Xue, Song; Ge, Yi-feng; Liu, Ai-jun; Wang, Yu-rong

2006-12-01

To investigate the sexual psychology and sexual attitude of the Chinese peace-keepers in Liberia, attempting a correct guidance and psychological intervention in this aspect. In the middle of the mission tour, a survey was conducted among 314 Chinese male peace-keeping soldiers with a self-designed questionnaire. More than 90% of the soldiers learned some sexual knowledge by themselves; quite a proportion of them were relatively deficient in sexual knowledge and lacked sexual education; 77% of them were afraid of AIDS even after sexual education. Married soldiers showed more maturity in sexual psychology than Appropriate psychological intervention the unmarried(P <0.05) , but with no differences in sexual attitude( P >0. 05). and guidance directed at the particulate population of peace-keepers may help them adopt a rational attitude towards their sexual drive and desire and convert, their sexual energy into further impetus to better creative performance in the peace-keeping mission.

46 CFR 169.209 - Routes permitted.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 7 2011-10-01 2011-10-01 false Routes permitted. 169.209 Section 169.209 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) NAUTICAL SCHOOLS SAILING SCHOOL VESSELS Inspection and Certification Certificate of Inspection § 169.209 Routes permitted. (a) The area of operation for...

46 CFR 169.209 - Routes permitted.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 7 2010-10-01 2010-10-01 false Routes permitted. 169.209 Section 169.209 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) NAUTICAL SCHOOLS SAILING SCHOOL VESSELS Inspection and Certification Certificate of Inspection § 169.209 Routes permitted. (a) The area of operation for...

Social Milieu Oriented Routing: A New Dimension to Enhance Network Security in WSNs.

PubMed

Liu, Lianggui; Chen, Li; Jia, Huiling

2016-02-19

In large-scale wireless sensor networks (WSNs), in order to enhance network security, it is crucial for a trustor node to perform social milieu oriented routing to a target a trustee node to carry out trust evaluation. This challenging social milieu oriented routing with more than one end-to-end Quality of Trust (QoT) constraint has proved to be NP-complete. Heuristic algorithms with polynomial and pseudo-polynomial-time complexities are often used to deal with this challenging problem. However, existing solutions cannot guarantee the efficiency of searching; that is, they can hardly avoid obtaining partial optimal solutions during a searching process. Quantum annealing (QA) uses delocalization and tunneling to avoid falling into local minima without sacrificing execution time. This has been proven a promising way to many optimization problems in recently published literatures. In this paper, for the first time, with the help of a novel approach, that is, configuration path-integral Monte Carlo (CPIMC) simulations, a QA-based optimal social trust path (QA_OSTP) selection algorithm is applied to the extraction of the optimal social trust path in large-scale WSNs. Extensive experiments have been conducted, and the experiment results demonstrate that QA_OSTP outperforms its heuristic opponents.

Cash transportation vehicle routing and scheduling under stochastic travel times

NASA Astrophysics Data System (ADS)

Yan, Shangyao; Wang, Sin-Siang; Chang, Yu-Hsuan

2014-03-01

Stochastic disturbances occurring in real-world operations could have a significant influence on the planned routing and scheduling results of cash transportation vehicles. In this study, a time-space network flow technique is utilized to construct a cash transportation vehicle routing and scheduling model incorporating stochastic travel times. In addition, to help security carriers to formulate more flexible routes and schedules, a concept of the similarity of time and space for vehicle routing and scheduling is incorporated into the model. The test results show that the model could be useful for security carriers in actual practice.

Goat farm management and Brucella serological test among goat keepers and livestock officers, 2011-2012, Nakhon Si Thammarat Province, southern Thailand.

PubMed

Te-Chaniyom, Thanidtha; Geater, Alan F; Kongkaew, Wandee; Chethanond, Usa; Chongsuvivatwong, Virasakdi

2016-12-01

Brucellosis, a zoonotic disease particularly affecting goats, emerged in Thailand in 2003, resulting in both an occupational hazard for goat keepers and livestock officers, and production losses. Farm management practices have been identified as risk factors associated with Brucella sero-positivity in many studies. Our finding in this study should be considered in order to strengthen the system of biosecurity control in farm animals as one health approach. The objectives of the study were to describe the distribution of potential risk factors by types of goat farms and to document the prevalence of human Brucella sero-positivity among goat keepers and livestock officers in Nakhon Si Thammarat, Thailand. A cross-sectional study was conducted from September to December 2012. The study population included three types of goat farms: standard, community enterprise and private goat farms that were located in Nakhon Si Thammmarat Province in southern Thailand. Information on whether the farm had any Brucella sero-positivity goats since 2011 was retrieved from the local livestock office records. Information on farming management was also traced back to 2011. Field researchers collected information from goat keepers of the selected farms using a structured questionnaire. Goat keepers on all farms pre-identified (January to June 2012) as having had at least one positive goat were considered to have been exposed. Goat keepers on a random sample of farms having all goats with negative results were considered to be unexposed. Venous blood samples were collected from goat keepers exposed and unexposed and from livestock officers and the samples were tested by IgG ELISA. Statistical analysis was done under the complex survey design in R software. Fourteen standard farms, 66 community enterprise farms and 68 private farms participated in the study; 82.4% (122/148) used public pasture and 53.4% (79/148) shared breeder goats with other farms. Farm management practices corresponding

Moving from Theory to Practice: Implementing the Kin Keeper[superscript SM] Cancer Prevention Model

ERIC Educational Resources Information Center

Williams, K. P.; Mullan, P. B.; Todem, D.

2009-01-01

This paper presents the rationale and findings of a feasibility and process study of the Kin Keeper[superscript SM] Cancer Prevention Intervention. An observational cohort study design was implemented with African-American women in synergistic female family relationships. Community health workers (CHWs) from two Michigan public health programs…

Aligning Cost Assessment with Community-Based Participatory Research: The Kin Keeper (superscript SM) Intervention

ERIC Educational Resources Information Center

Meghea, Cristian Ioan; Williams, Karen Patricia

2015-01-01

The few existing economic evaluations of community-based health promotion interventions were reported retrospectively at the end of the trial. We report an evaluation of the costs of the Kin Keeper(superscript SM) Cancer Prevention Intervention, a female family-focused educational intervention for underserved women applied to increase breast and…

Breed and trait preferences of Sheko cattle keepers in southwestern Ethiopia.

PubMed

Desta, Takele Taye; Ayalew, Workneh; Hegde, B P

2011-04-01

Like their smallholder subsistence counterparts in developing countries, breed and trait preferences of Sheko cattle keepers have broad perspectives. Our study has documented breed and trait preferences of Sheko cattle keepers in southwestern Ethiopia--the natural breeding tract of Sheko cattle. Our results showed that due to their multifunctionality, cattle are the most preferred livestock species. Overall, farmers showed slightly more preference to local Zebus over Sheko breed. This is due to voracious feeding behavior of Sheko cattle, which make them less preferable in the face of worsening feed shortage, and due to aggressive temperament of Sheko cattle. This is despite Sheko's outperforming potential over local Zebus in their milk production, draft power, and hardiness. At trait level, overall milk production was consistently reported as the most preferred trait followed by fertility and traction. This trait preference rank has matched with the reported frequency count ranks for Sheko cattle use. However, breed preference rank has not matched with reported trait preference ranks because Sheko excels local Zebus in all the three most preferred traits, but it was ranked second. Therefore, to minimize these conflicting interests, breed management plans for Sheko cattle should target on strategies that help to solve feed shortage problem and to improve feeding practices, and on selection of less aggressive Sheko cattle. Therefore, these strategies should be considered in line with Sheko cattle conservation and genetic improvement programs.

DFG-out Mode of Inhibition by an Irreversible Type-1 Inhibitor Capable of Overcoming Gate-Keeper Mutations in FGF Receptors

PubMed Central

2015-01-01

Drug-resistance acquisition through kinase gate-keeper mutations is a major hurdle in the clinic. Here, we determined the first crystal structures of the human FGFR4 kinase domain (FGFR4K) alone and complexed with ponatinib, a promiscuous type-2 (DFG-out) kinase inhibitor, and an oncogenic FGFR4K harboring the V550L gate-keeper mutation bound to FIIN-2, a new type-1 irreversible inhibitor. Remarkably, like ponatinib, FIIN-2 also binds in the DFG-out mode despite lacking a functional group necessary to occupy the pocket vacated upon the DFG-out flip. Structural analysis reveals that the covalent bond between FIIN-2 and a cysteine, uniquely present in the glycine-rich loop of FGFR kinases, facilitates the DFG-out conformation, which together with the internal flexibility of FIIN-2 enables FIIN-2 to avoid the steric clash with the gate-keeper mutation that causes the ponatinib resistance. The structural data provide a blueprint for the development of next generation anticancer inhibitors through combining the salient inhibitory mechanisms of ponatinib and FIIN-2. PMID:25317566

Predicting Catastrophic BGP Routing Instabilities

DTIC Science & Technology

2004-03-01

predict a BGP routing instability confine their focus to either macro- or micro -level metrics, but not to both. The inherent limitations of each of...Level and Micro -Level Metrics Correlation; Worm Attack Studies; 16. PRICE CODE 17. SECURITY CLASSIFICATION OF REPORT Unclassified 18. SECURITY... micro -level metrics, but not to both. The inherent limitations of each of these forms of metric gives rise to an excessive rate of spurious alerts

Keeper of the Gates.

ERIC Educational Resources Information Center

Bushweller, Kevin

1994-01-01

Profiles Floyd Wiggins, Jr., veteran school security chief for Richmond (Virginia) Public Schools. Besides a security force, the district uses hand-held metal-detectors and police-dog raids in its secondary schools and is considering use of student identification cards, security video cameras, and a larger parent volunteer force. Wiggins feels…

A Wide-Range Tunable Level-Keeper Using Vertical Metal-Oxide-Semiconductor Field-Effect Transistors for Current-Reuse Systems

NASA Astrophysics Data System (ADS)

Tanoi, Satoru; Endoh, Tetsuo

2012-04-01

A wide-range tunable level-keeper using vertical metal-oxide-semiconductor field-effect transistors (MOSFETs) is proposed for current-reuse analog systems. The design keys for widening tunable range of the operation are a two-path feed-back and a vertical MOSFET with back-bias-effect free. The proposed circuit with the vertical MOSFETs shows the 1.23-V tunable-range of the input level with the 2.4-V internal-supply voltage (VDD) in the simulation. This tunable-range of the proposed circuit is 4.7 times wider than that of the conventional. The achieved current efficiency of the proposed level-keeper is 66% at the 1.2-V output with the 2.4-V VDD. This efficiency of the proposed circuit is twice higher than that of the traditional voltage down converter.

Using Sphinx to Improve Onion Routing Circuit Construction

NASA Astrophysics Data System (ADS)

Kate, Aniket; Goldberg, Ian

This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing, and certificateless onion routing. Our new circuit constructions are also secure in the universal composability framework, a property that was missing from the original constructions. Further, we compare the performance of our schemes with their older counterparts as well as with each other.

Acute Tetraplegia Caused by Rat Bite Fever in Snake Keeper and Transmission of Streptobacillus moniliformis

PubMed Central

Eisenberg, Tobias; Poignant, Simon; Jouan, Youenn; Fawzy, Ahmad; Nicklas, Werner; Ewers, Christa; Mereghetti, Laurent

2017-01-01

We report acute tetraplegia caused by rat bite fever in a 59-year old man (snake keeper) and transmission of Streptobacillus moniliformis. We found an identical characteristic bacterial pattern in rat and human samples, which validated genotyping-based evidence for infection with the same strain, and identified diagnostic difficulties concerning infection with this microorganism. PMID:28322713

Will Obama's "My Brother's Keeper" and Similar Initiatives Have a Positive Impact on Low-Income Students?

ERIC Educational Resources Information Center

Sanacore, Joseph

2017-01-01

Barack Obama's "My Brother's Keeper" is designed to narrow persistent gaps that boys and young men of color confront often and to help all young people achieve their potential in college and career. An important part of this initiative is comprehensive mentoring that supports students in schools and in communities. Because…

Community health workers speak out about the Kin KeeperSM model.

PubMed

Mousa, Shimaa M; Brooks, Emily; Dietrich, Monika; Henderson, Aisha; McLean, Casey; Patricia Williams, Karen

2010-06-01

Community health workers (CHWs) informed students and researcher alike on the Kin Keeper(SM) Cancer Prevention Intervention. Students interested in medicine, guided by faculty, conducted a focus group session with 13 CHWs to find out if the intervention was effective for delivering breast and cervical cancer education. Strengths reported were (1) cultural appropriateness, (2) home visits, (3) CHW resource kits, and (4) increased awareness. The barriers were privacy perceptions and scheduling home visits. Overall, the CHWs indicated that the intervention was effective and flexible enough to accommodate the African American, Latina, and Arab groups of women.

The Daktari: An Interactive, Multi-Media Tool for Knowledge Transfer among Poor Livestock Keepers in Kenya

ERIC Educational Resources Information Center

Nielsen, Louise; Heffernan, Claire; Lin, Yibo; Yu, Jun

2010-01-01

This article describes the findings from the assessment of a touch-screen, multi-media learning program on livestock health and production: "The Daktari." The program was tested on a sample of 62 livestock keepers in the Nairobi slums of Kariobangi and Kibera. The study examined prior knowledge regarding three livestock diseases (liver…

Dynamic Routing and Coordination in Multi-Agent Networks

DTIC Science & Technology

2016-06-10

SECURITY CLASSIFICATION OF: Supported by this project, we designed innovative routing, planning and coordination strategies for robotic networks and...tasks partitioned among robots , in what order are they to be performed, and along which deterministic routes or according to which stochastic rules do...individual robots move. The fundamental novelties and our recent breakthroughs supported by this project are manifold: (1) the application 1

My Brother's Keeper: How Commerce Has Created Pathways to Success in the Workforce for Our Nation's Youth

ERIC Educational Resources Information Center

US Department of Commerce, 2017

2017-01-01

In 2014, President Obama launched the My Brother's Keeper (MBK) initiative to address persistent opportunity gaps faced by boys and young men of color and to ensure that all young people can reach their full potential. Through this initiative, the Administration has partnered with cities, towns, businesses, and foundations to connect young people…

AIB-OR: improving onion routing circuit construction using anonymous identity-based cryptosystems.

PubMed

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet.

The QKD network: model and routing scheme

NASA Astrophysics Data System (ADS)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.

Cultural Connections: the Key to Retention of Black, Latina, and Arab Women in the Kin Keeper(SM) Cancer Prevention Intervention Studies.

PubMed

Williams, Karen Patricia; Ford, Sabrina; Meghea, Cristian

2016-09-01

Diverse racial and ethnic populations must be included in research studies in order to address health disparities. Retaining hard-to-reach populations including poor, underserved, and racial/ethnic groups in longitudinal studies can be quite difficult. Using innovative retention strategies that address culture and community are imperative. The objective of this report is to identify and describe strategies for successful retention rates among a unique group of hard-to-reach racial/ethnic participants. We analyzed the follow-up rates in two different cohorts using the Kin Keeper(SM) study design. The aim of Study A was to examine the capability of the Kin Keeper(SM) education to increase health literacy in breast and cervical cancer. The primary aim of Study B was to measure changes in breast and cervical cancer screening after receiving the Kin Keeper(SM) education. Retention rates were analyzed and compared over 12 months for both cohorts. We found good retention rates for both cohorts with each having a unique set of differences. The overall follow-up rate was 82 % for Study A and 88 % for Study B with demographic differences between the studies reported herein. Despite changing cultural, community, and geopolitical factors, we were able to maintain consistent participation for each study. We attribute high retention rates to trusted cultural connections and the flexibility to adjust retention strategies.

46 CFR 117.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2013 CFR

2013-10-01

... sounds routes. 117.207 Section 117.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Each vessel with overnight accommodations certificated to operate on a lakes, bays, and sounds route must be provided with inflatable...

46 CFR 117.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2012 CFR

2012-10-01

... sounds routes. 117.207 Section 117.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Each vessel with overnight accommodations certificated to operate on a lakes, bays, and sounds route must be provided with inflatable...

46 CFR 117.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2014 CFR

2014-10-01

... sounds routes. 117.207 Section 117.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Each vessel with overnight accommodations certificated to operate on a lakes, bays, and sounds route must be provided with inflatable...

46 CFR 117.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2011 CFR

2011-10-01

... sounds routes. 117.207 Section 117.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Each vessel with overnight accommodations certificated to operate on a lakes, bays, and sounds route must be provided with inflatable...

Key management schemes using routing information frames in secure wireless sensor networks

NASA Astrophysics Data System (ADS)

Kamaev, V. A.; Finogeev, A. G.; Finogeev, A. A.; Parygin, D. S.

2017-01-01

The article considers the problems and objectives of key management for data encryption in wireless sensor networks (WSN) of SCADA systems. The structure of the key information in the ZigBee network and methods of keys obtaining are discussed. The use of a hybrid key management schemes is most suitable for WSN. The session symmetric key is used to encrypt the sensor data, asymmetric keys are used to encrypt the session key transmitted from the routing information. Three algorithms of hybrid key management using routing information frames determined by routing methods and the WSN topology are presented.

46 CFR 180.204 - Survival craft-vessels operating on coastwise routes.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 7 2010-10-01 2010-10-01 false Survival craft-vessels operating on coastwise routes. 180.204 Section 180.204 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED) SMALL... Craft § 180.204 Survival craft—vessels operating on coastwise routes. (a) Except as allowed by paragraph...

The Suprachoroidal Route in Glaucoma Surgery

PubMed Central

Shaarawy, Tarek

2016-01-01

ABSTRACT Glaucoma surgeries targeting the uveoscleral drainage pathways have been drawing more attention lately. Among all the available techniques, procedures focusing on the supra-choroidal space seem particularly promising, by making use of a presumably efficient and secure outflow route and avoiding subconjunctival filtration blebs. The purpose of this review is to assess the efficacy and the security of the different suprachoroidal drainage implants, namely the CyPass Micro-Stent, the iStent Supra, the SOLX Gold Shunt, the Aquashunt, and the STARflo Glaucoma Implant. Most clinical studies seem to currently point toward the direction that there are actual benefits in suprachoroidal surgeries by avoiding bleb-related complications. Nevertheless, even suprachoroidal implants may be subject to scarring and failure. More data are still needed, especially concerning long-term effects, although the approach does seem appealing. How to cite this article: Gigon A, Shaarawy T. The Suprachoroidal Route in Glaucoma Surgery. J Curr Glaucoma Pract 2016;10(1): 13-20. PMID:27231415

AIB-OR: Improving Onion Routing Circuit Construction Using Anonymous Identity-Based Cryptosystems

PubMed Central

Wang, Changji; Shi, Dongyuan; Xu, Xilei

2015-01-01

The rapid growth of Internet applications has made communication anonymity an increasingly important or even indispensable security requirement. Onion routing has been employed as an infrastructure for anonymous communication over a public network, which provides anonymous connections that are strongly resistant to both eavesdropping and traffic analysis. However, existing onion routing protocols usually exhibit poor performance due to repeated encryption operations. In this paper, we first present an improved anonymous multi-receiver identity-based encryption (AMRIBE) scheme, and an improved identity-based one-way anonymous key agreement (IBOWAKE) protocol. We then propose an efficient onion routing protocol named AIB-OR that provides provable security and strong anonymity. Our main approach is to use our improved AMRIBE scheme and improved IBOWAKE protocol in onion routing circuit construction. Compared with other onion routing protocols, AIB-OR provides high efficiency, scalability, strong anonymity and fault tolerance. Performance measurements from a prototype implementation show that our proposed AIB-OR can achieve high bandwidths and low latencies when deployed over the Internet. PMID:25815879

46 CFR 180.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2012 CFR

2012-10-01

... sounds routes. 180.207 Section 180.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival Craft § 180.207 Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Except as... operate on a lakes, bays, and sounds route in cold water must either: (1) Be provided with life floats of...

46 CFR 180.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2013 CFR

2013-10-01

... sounds routes. 180.207 Section 180.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival Craft § 180.207 Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Except as... operate on a lakes, bays, and sounds route in cold water must either: (1) Be provided with life floats of...

46 CFR 180.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2014 CFR

2014-10-01

... sounds routes. 180.207 Section 180.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival Craft § 180.207 Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Except as... operate on a lakes, bays, and sounds route in cold water must either: (1) Be provided with life floats of...

46 CFR 180.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2010 CFR

2010-10-01

... sounds routes. 180.207 Section 180.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival Craft § 180.207 Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Except as... operate on a lakes, bays, and sounds route in cold water must either: (1) Be provided with life floats of...

46 CFR 180.207 - Survival craft-vessels operating on lakes, bays, and sounds routes.

Code of Federal Regulations, 2011 CFR

2011-10-01

... sounds routes. 180.207 Section 180.207 Shipping COAST GUARD, DEPARTMENT OF HOMELAND SECURITY (CONTINUED... Survival Craft § 180.207 Survival craft—vessels operating on lakes, bays, and sounds routes. (a) Except as... operate on a lakes, bays, and sounds route in cold water must either: (1) Be provided with life floats of...

AVQS: attack route-based vulnerability quantification scheme for smart grid.

PubMed

Ko, Jongbin; Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

2014-01-01

A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification.

AVQS: Attack Route-Based Vulnerability Quantification Scheme for Smart Grid

PubMed Central

Lim, Hyunwoo; Lee, Seokjun; Shon, Taeshik

2014-01-01

A smart grid is a large, consolidated electrical grid system that includes heterogeneous networks and systems. Based on the data, a smart grid system has a potential security threat in its network connectivity. To solve this problem, we develop and apply a novel scheme to measure the vulnerability in a smart grid domain. Vulnerability quantification can be the first step in security analysis because it can help prioritize the security problems. However, existing vulnerability quantification schemes are not suitable for smart grid because they do not consider network vulnerabilities. We propose a novel attack route-based vulnerability quantification scheme using a network vulnerability score and an end-to-end security score, depending on the specific smart grid network environment to calculate the vulnerability score for a particular attack route. To evaluate the proposed approach, we derive several attack scenarios from the advanced metering infrastructure domain. The experimental results of the proposed approach and the existing common vulnerability scoring system clearly show that we need to consider network connectivity for more optimized vulnerability quantification. PMID:25152923

Immunological studies on bee-keepers: specific IgG and subclass typing IgG against bee venom and bee venom components.

PubMed

Urbanek, R; Forster, J; Ziupa, J; Karitzky, D

1980-11-17

Specific IgE antibodies against bee venom and its components were studied in 23 bee-keepers. The highest IgG serum levels were observed for whole bee venom followed by phospholipase A. The serum levels of specific IgG antibodies against melittin and MCD-peptide were lower, the lowest serum levels being observed for apamin. After a 5 month absence from bee-keeping a fall in the serum levels of IgG antibodies was observed in all the bee-keepers studied. The investigation of the IgG subclass antibodies 1-4 against bee venom and phospholipase A demonstrated the highest serum levels for IgG 4 and IgG 2, the lowest levels were observed for IgG 1. The lowest IgG serum levels were associated with the least effective protection to bee stings. These findings support the concept that specific IgG antibodies prevent the development of allergic symptoms after bee sting.

77 FR 72737 - Drawbridge Operation Regulations; Atlantic Intracoastal Waterway (Alternate Route), Dismal Swamp...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-06

... DEPARTMENT OF HOMELAND SECURITY Coast Guard 33 CFR Part 117 [Docket No. USCG-2012-1021] Drawbridge Operation Regulations; Atlantic Intracoastal Waterway (Alternate Route), Dismal Swamp Canal, South Mills, NC... (Alternate Route), Dismal Swamp Canal, South Mills, NC. The deviation restricts the operation of the draw...

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

NASA Astrophysics Data System (ADS)

Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

2018-01-01

The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli

2017-04-01

By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.

SCODE: A Secure Coordination-Based Data Dissemination to Mobile Sinks in Sensor Networks

NASA Astrophysics Data System (ADS)

Hung, Lexuan; Lee, Sungyoung; Lee, Young-Koo; Lee, Heejo

For many sensor network applications such as military, homeland security, it is necessary for users (sinks) to access sensor networks while they are moving. However, sink mobility brings new challenges to secure routing in large-scale sensor networks. Mobile sinks have to constantly propagate their current location to all nodes, and these nodes need to exchange messages with each other so that the sensor network can establish and maintain a secure multi-hop path between a source node and a mobile sink. This causes significant computation and communication overhead for sensor nodes. Previous studies on sink mobility have mainly focused on efficiency and effectiveness of data dissemination without security consideration. In this paper, we propose a secure and energy-efficient data dissemination protocol — Secure COodination-based Data dissEmination (SCODE) — for mobile sinks in sensor networks. We take advantages of coordination networks (grid structure) based on Geographical Adaptive Fidelity (GAF) protocol to construct a secure and efficient routing path between sources and sinks. Our security analysis demonstrates that the proposed protocol can defend against common attacks in sensor network routing such as replay attacks, selective forwarding attacks, sinkhole and wormhole, Sybil attacks, HELLO flood attacks. Our performance evaluation both in mathematical analysis and simulation shows that the SCODE significantly reduces communication overhead and energy consumption while the latency is similar compared with the existing routing protocols, and it always delivers more than 90 percentage of packets successfully.

Security Services Discovery by ATM Endsystems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sholander, Peter; Tarman, Thomas

This contribution proposes strawman techniques for Security Service Discovery by ATM endsystems in ATM networks. Candidate techniques include ILMI extensions, ANS extensions and new ATM anycast addresses. Another option is a new protocol based on an IETF service discovery protocol, such as Service Location Protocol (SLP). Finally, this contribution provides strawman requirements for Security-Based Routing in ATM networks.

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

PubMed

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

PubMed Central

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

Reliable Adaptive Data Aggregation Route Strategy for a Trade-off between Energy and Lifetime in WSNs

PubMed Central

Guo, Wenzhong; Hong, Wei; Zhang, Bin; Chen, Yuzhong; Xiong, Naixue

2014-01-01

Mobile security is one of the most fundamental problems in Wireless Sensor Networks (WSNs). The data transmission path will be compromised for some disabled nodes. To construct a secure and reliable network, designing an adaptive route strategy which optimizes energy consumption and network lifetime of the aggregation cost is of great importance. In this paper, we address the reliable data aggregation route problem for WSNs. Firstly, to ensure nodes work properly, we propose a data aggregation route algorithm which improves the energy efficiency in the WSN. The construction process achieved through discrete particle swarm optimization (DPSO) saves node energy costs. Then, to balance the network load and establish a reliable network, an adaptive route algorithm with the minimal energy and the maximum lifetime is proposed. Since it is a non-linear constrained multi-objective optimization problem, in this paper we propose a DPSO with the multi-objective fitness function combined with the phenotype sharing function and penalty function to find available routes. Experimental results show that compared with other tree routing algorithms our algorithm can effectively reduce energy consumption and trade off energy consumption and network lifetime. PMID:25215944

Hollow Cathode and Keeper-region Plasma Measurements Using Ultra-fast Miniature Scanning Probes

NASA Technical Reports Server (NTRS)

Goebel, Dan M.; Jameson, Kristina K.; Watkins, Ron M.; Katz, Ira

2004-01-01

In order to support the development of comprehensive performance and life models for future deep space missions that will utilize ion thrusters, we have undertaken a study of the plasma structure in hollow cathodes using an new pneumatic scanning probe diagnostic. This device is designed to insert a miniature probe directly into the hollow cathode orifice from either the upstream insert region in the interior of the hollow cathode, or from the downstream keeper-plasma region at the exit of the hollow cathode, to provide complete axial profiles of the discharge plasma parameters. Previous attempts to diagnose this region with probes was Limited by the melting of small probes in the intense discharge near the orifice, or caused significant perturbation of the plasma by probes large enough to survive. Our new probe is extremely compact, and when configured as a single Langmuir probe, the ceramic tube insulator is only 0.5mm in diameter and the current collecting conductor has a total area of 0.002 cm2. A series of current-voltage characteristics are obtained by applying a rapid sawtooth voltage waveform to the probe as it is scanned by the pneumatic actuator into and out of the plasma region, The bellow-sealed pneumatic drive scans the probe 4 cm in the cathode insert region and 10 cm in the anode/keeper plasmas region at average speeds of about 1 mm/msec, and the residence time at the end of the insertion stroke in the densest part of the plasma near the orifice is measured to be only 10 msec. Since the voltage sweep time is fast compared to the motion of the probe, axial profiles of the plasma density, temperature and potential with reasonable spatial resolution are obtained. Measurements of the internal cathode pressures and the axial plasma-parameter profiles for a hollow cathode operating at discharge currents of up to 35 A in xenon will be presented.

Performance evaluation of reactive and proactive routing protocol in IEEE 802.11 ad hoc network

NASA Astrophysics Data System (ADS)

Hamma, Salima; Cizeron, Eddy; Issaka, Hafiz; Guédon, Jean-Pierre

2006-10-01

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show

Initial Process and Expected Outcomes for Preliminary Identification of Routes to Yucca Mountain, Nevada

DOE Office of Scientific and Technical Information (OSTI.GOV)

Thrower, A.; Best, R.; Finewood, L.

2008-07-01

The Department of Energy's (DOE's) Office of Civilian Radioactive Waste Management (OCRWM) is responsible for developing and implementing a safe, secure and efficient transportation system to ship spent nuclear fuel (SNF) and high-level radioactive waste (HLW) from commercial and DOE sites to the proposed Yucca Mountain repository. The Office of Logistics Management (OLM) within OCRWM has begun to work with stakeholders to identify preliminary national suites of highway and rail routes that could be used for future shipments OLM is striving to develop a planning-basis set of routes that will support long-lead time logistical analyses (i.e., five or more yearsmore » before shipment). The results will represent a starting point for discussions between DOE and corridor jurisdictions, and for shipping arrangements between DOE and carriers. This fulfills a recommendation of the National Academy of Sciences report on SNF and HLW transportation that 'DOE should identify and make public its suite of preferred highway and rail routes for transporting spent fuel and high level waste to a federal repository as soon as practicable to support State, Tribal and local planning, especially for emergency responder preparedness'. OLM encourages and supports participation of program stakeholders in a process to identify suites of national routes. The principal objective is to identify preliminary suites of national routes that reflect responsible consideration of the interests of a broad cross-section of stakeholders. This will facilitate transportation planning activities to help meet program goals, including providing an advanced planning framework for State and Tribal authorities; supporting a pilot program for providing funding under Section 180(c) of the Nuclear Waste Policy Act; allowing sufficient time for security and operational reviews in advance of shipments to Yucca Mountain; and supporting utility planning and readiness for transportation operations. Concepts for

SECURITY GATE FOR WEAPONS STORAGE AREA. FROM LEFT TO RIGHT, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

SECURITY GATE FOR WEAPONS STORAGE AREA. FROM LEFT TO RIGHT, STORAGE BUILDING (BUILDING 3584), CONVENTIONAL MUNITIONS SHOP (BUILDING 3580), AND SECURITY POLICE ENTRY CONTROL BUILDING (BUILDING 3582). VIEW TO SOUTHWEST - Plattsburgh Air Force Base, U.S. Route 9, Plattsburgh, Clinton County, NY

A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET

PubMed Central

Fang, Weidong; Zhang, Wuxiong; Xiao, Jinchao; Yang, Yang; Chen, Wei

2017-01-01

Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV’s research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV. PMID:28629142

A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET.

PubMed

Fang, Weidong; Zhang, Wuxiong; Xiao, Jinchao; Yang, Yang; Chen, Wei

2017-06-17

Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV's research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV.

Analysis of MD5 authentication in various routing protocols using simulation tools

NASA Astrophysics Data System (ADS)

Dinakaran, M.; Darshan, K. N.; Patel, Harsh

2017-11-01

Authentication being an important paradigm of security and Computer Networks require secure paths to make the flow of the data even more secure through some security protocols. So MD-5(Message Digest 5) helps in providing data integrity to the data being sent through it and authentication to the network devices. This paper gives a brief introduction to the MD-5, simulation of the networks by including MD-5 authentication using various routing protocols like OSPF, EIGRP and RIPv2. GNS3 is being used to simulate the scenarios. Analysis of the MD-5 authentication is done in the later sections of the paper.

VANET Clustering Based Routing Protocol Suitable for Deserts.

PubMed

Nasr, Mohammed Mohsen Mohammed; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

2016-04-06

In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms.

VANET Clustering Based Routing Protocol Suitable for Deserts

PubMed Central

Mohammed Nasr, Mohammed Mohsen; Abdelgader, Abdeldime Mohamed Salih; Wang, Zhi-Gong; Shen, Lian-Feng

2016-01-01

In recent years, there has emerged applications of vehicular ad hoc networks (VANETs) towards security, safety, rescue, exploration, military and communication redundancy systems in non-populated areas, besides its ordinary use in urban environments as an essential part of intelligent transportation systems (ITS). This paper proposes a novel algorithm for the process of organizing a cluster structure and cluster head election (CHE) suitable for VANETs. Moreover, it presents a robust clustering-based routing protocol, which is appropriate for deserts and can achieve high communication efficiency, ensuring reliable information delivery and optimal exploitation of the equipment on each vehicle. A comprehensive simulation is conducted to evaluate the performance of the proposed CHE and routing algorithms. PMID:27058539

Security Meets Real-World Computing. Building Digital Libraries

ERIC Educational Resources Information Center

Huwe, Terence K.

2005-01-01

The author of this column describes several instances in which secure data on computers were compromised. In each of these instances, a different route was involved in gaining access to the secure data--one by office-based theft, one by hacking, and one by burglary. Is is proposed that the most difficult factor to guarantee in the protection of…

eHealth in Belgium, a new "secure" federal network: role of patients, health professions and social security services.

PubMed

France, Francis Roger

2011-02-01

eHealth platform is the official federal network in Belgium (created by law on 21 August 2008) devoted to a secure exchange of health data in many types of applications, such as health care purposes, simplification of administrative procedures and contribution to health policy. It implies a controlled access to decentralized databases and uses encrypted personal data. The national identification number has been chosen in order to authenticate the requester, the patient, and the receiver of information exchange. Authorizations have to be respected in order to obtain personal health data. Several questions are raised about its security: the lack of mandatory request for systematic journaling on accesses to the electronic patient record as well as the absence of explicit procedures for sanctions in case of unauthorized access, the new role of social security administration in managing security where a eHealth manager can be both judge and party (in the function of trusted third party for health data encryption and of a required lawyer for texts proposed by physicians to the Commission for the protection of private life). Another critic concerns the number of physicians in minority and the absence of patients' delegates in the eHealth Board. At a time when the patient is becoming a partner in the care team, should not he be the gate-keeper for the access to his own health record? How could networks help him to get the appropriate knowledge to contribute to care and to write his testament of life? Recent laws (on private life, patient rights and euthanasia) have contributed to a behavioural change in citizens and physician attitudes. Recommendations are made in order to improve the acceptability of eHealth platform. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

Development of Boys and Young Men of Color: Implications of Developmental Science for My Brother's Keeper Initiative. Social Policy Report. Volume 29, Number 3

ERIC Educational Resources Information Center

Barbarin, Oscar A.; Murry, Velma McBride; Tolan, Patrick; Graham, Sandra

2016-01-01

Boys and men of color (BMOC) are at significant risks for poor outcomes across multiple domains including education, health, and financial well-being with little promise of improvement in the near future. Out of concern for this situation, President Obama instituted the My Brother's Keeper Initiative (MBKI) to enlist the combined resources of…

Classical noise, quantum noise and secure communication

NASA Astrophysics Data System (ADS)

Tannous, C.; Langlois, J.

2016-01-01

Secure communication based on message encryption might be performed by combining the message with controlled noise (called pseudo-noise) as performed in spread-spectrum communication used presently in Wi-Fi and smartphone telecommunication systems. Quantum communication based on entanglement is another route for securing communications as demonstrated by several important experiments described in this work. The central role played by the photon in unifying the description of classical and quantum noise as major ingredients of secure communication systems is highlighted and described on the basis of the classical and quantum fluctuation dissipation theorems.

DS-ARP: A New Detection Scheme for ARP Spoofing Attacks Based on Routing Trace for Ubiquitous Environments

PubMed Central

Song, Min Su; Lee, Jae Dong; Jeong, Hwa-Young; Park, Jong Hyuk

2014-01-01

Despite the convenience, ubiquitous computing suffers from many threats and security risks. Security considerations in the ubiquitous network are required to create enriched and more secure ubiquitous environments. The address resolution protocol (ARP) is a protocol used to identify the IP address and the physical address of the associated network card. ARP is designed to work without problems in general environments. However, since it does not include security measures against malicious attacks, in its design, an attacker can impersonate another host using ARP spoofing or access important information. In this paper, we propose a new detection scheme for ARP spoofing attacks using a routing trace, which can be used to protect the internal network. Tracing routing can find the change of network movement path. The proposed scheme provides high constancy and compatibility because it does not alter the ARP protocol. In addition, it is simple and stable, as it does not use a complex algorithm or impose extra load on the computer system. PMID:25243205

DS-ARP: a new detection scheme for ARP spoofing attacks based on routing trace for ubiquitous environments.

PubMed

Song, Min Su; Lee, Jae Dong; Jeong, Young-Sik; Jeong, Hwa-Young; Park, Jong Hyuk

2014-01-01

Despite the convenience, ubiquitous computing suffers from many threats and security risks. Security considerations in the ubiquitous network are required to create enriched and more secure ubiquitous environments. The address resolution protocol (ARP) is a protocol used to identify the IP address and the physical address of the associated network card. ARP is designed to work without problems in general environments. However, since it does not include security measures against malicious attacks, in its design, an attacker can impersonate another host using ARP spoofing or access important information. In this paper, we propose a new detection scheme for ARP spoofing attacks using a routing trace, which can be used to protect the internal network. Tracing routing can find the change of network movement path. The proposed scheme provides high constancy and compatibility because it does not alter the ARP protocol. In addition, it is simple and stable, as it does not use a complex algorithm or impose extra load on the computer system.

ROUTES: a computer program for preliminary route location.

Treesearch

S.E. Reutebuch

1988-01-01

An analytical description of the ROUTES computer program is presented. ROUTES is part of the integrated preliminary harvest- and transportation-planning software package, PLANS. The ROUTES computer program is useful where grade and sideslope limitations are important in determining routes for vehicular travel. With the program, planners can rapidly identify route...

Semaphorin6A acts as a gate keeper between the central and the peripheral nervous system

PubMed Central

Mauti, Olivier; Domanitskaya, Elena; Andermatt, Irwin; Sadhu, Rejina; Stoeckli, Esther T

2007-01-01

Background During spinal cord development, expression of chicken SEMAPHORIN6A (SEMA6A) is almost exclusively found in the boundary caps at the ventral motor axon exit point and at the dorsal root entry site. The boundary cap cells are derived from a population of late migrating neural crest cells. They form a transient structure at the transition zone between the peripheral nervous system (PNS) and the central nervous system (CNS). Ablation of the boundary cap resulted in emigration of motoneurons from the ventral spinal cord along the ventral roots. Based on its very restricted expression in boundary cap cells, we tested for a role of Sema6A as a gate keeper between the CNS and the PNS. Results Downregulation of Sema6A in boundary cap cells by in ovo RNA interference resulted in motoneurons streaming out of the spinal cord along the ventral roots, and in the failure of dorsal roots to form and segregate properly. PlexinAs interact with class 6 semaphorins and are expressed by both motoneurons and sensory neurons. Knockdown of PlexinA1 reproduced the phenotype seen after loss of Sema6A function both at the ventral motor exit point and at the dorsal root entry site of the lumbosacral spinal cord. Loss of either PlexinA4 or Sema6D function had an effect only at the dorsal root entry site but not at the ventral motor axon exit point. Conclusion Sema6A acts as a gate keeper between the PNS and the CNS both ventrally and dorsally. It is required for the clustering of boundary cap cells at the PNS/CNS interface and, thus, prevents motoneurons from streaming out of the ventral spinal cord. At the dorsal root entry site it organizes the segregation of dorsal roots. PMID:18088409

A Model of Onion Routing With Provable Anonymity

DTIC Science & Technology

2006-08-30

Lysyanskaya. “A Formal Treatment of Onion Routing.” CRYPTO 2005, pp. 169.187, 2005. [4] David Chaum . “The dining cryptographers problem...1988. [5] David Chaum . “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms.” Communi- cations of the ACM, 24(2), pp. 84-88, 1981...network layer.” ACM Conference on Computer and Communications Security, pp. 193-206, 2002. [11] David Goldschlag, Michael Reed, and Paul Syverson

Individual social security accounts: issues in assessing administrative feasibility and costs.

PubMed

Olsen, K A; Salisbury, D L

1998-11-01

Whether to add individual accounts (IAs) to the Social Security system is a highly political issue. But almost lost in the debate so far have been any practical considerations about how to administer such accounts. Any discussion of whether to create individual accounts must also address the basic but critical questions of how they would work: Who would run them? What would they cost? Logistically, are they even possible? This EBRI Issue Brief provides an overview of the most salient administrative issues facing the current Social Security reform debate--issues that challenge proponents to carefully think through how their proposals could be implemented so as to achieve their policy goals. The options and difficulties in administering IAs raise concerns that cut across ideology. The object of this report is neither to dissuade the advocates nor support the critics of individual accounts. Rather, it is to bring practical considerations to a political debate that has largely ignored the pragmatic challenges of whether IAs would be too complex for participants to understand or too difficult for record keepers to administer. The major findings in this analysis include: Adding individual accounts to Social Security could be the largest undertaking in the history of the U.S. financial market, and no system to date has the capacity to administer such a system. The number of workers currently covered by Social Security--the largest single entitlement program in the nation--is at least four times higher than the combined number of all tax-favored employment-based retirement accounts in the United States, which are administered by hundreds of entities. Direct comparisons between employment-based retirement savings plans and Social Security reform are tenuous at best. Social Security covers workers and businesses that are disproportionately excluded from employment-based plans. Because of these differences, a system of individual Social Security accounts would be more

Integration of an Emerging Highly Sensitive Optical CO2 Sensor for Ocean Monitoring on an Existing Data Acquisition System SeaKeeper 1000 (trademark)

DTIC Science & Technology

2012-09-30

be deployed in geat numbers to autonomously monitor the overall patterns of CO2 emissions and ocean acidification . OBJECTIVES  Meet the...Integration of an Emerging Highly Sensitive Optical CO2 Sensor for Ocean Monitoring on an Existing Data Acquisition System SeaKeeper 1000TM Annual...challenging requirements for ocean pCO2 monitoring using an innovative sensor design based on high sensitivity fluorescence detection.  Assemble the system

Integration of an Emerging Highly Sensitive Optical CO2 Sensor for Ocean Monitoring on an Existing Data Acquisition System SeaKeeper 1000(TM)

DTIC Science & Technology

2011-09-30

be deployed in geat numbers to autonomously monitor the overall patterns of CO2 emissions and ocean acidification . OBJECTIVES  Meet the...Integration of an Emerging Highly Sensitive Optical CO2 Sensor for Ocean Monitoring on an Existing Data Acquisition System SeaKeeper 1000TM Annual...challenging requirements for ocean pCO2 monitoring using an innovative sensor design based on high sensitivity fluorescence detection.  Assemble the system

Application of the API/NPRA SVA methodology to transportation security issues.

PubMed

Moore, David A

2006-03-17

Security vulnerability analysis (SVA) is becoming more prevalent as the issue of chemical process security is of greater concern. The American Petroleum Institute (API) and the National Petrochemical and Refiner's Association (NPRA) have developed a guideline for conducting SVAs of petroleum and petrochemical facilities in May 2003. In 2004, the same organizations enhanced the guidelines by adding the ability to evaluate transportation security risks (pipeline, truck, and rail). The importance of including transportation and value chain security in addition to fixed facility security in a SVA is that these issues may be critically important to understanding the total risk of the operation. Most of the SVAs done using the API/NPRA SVA and other SVA methods were centered on the fixed facility and the operations within the plant fence. Transportation interfaces alone are normally studied as a part of the facility SVA, and the entire transportation route impacts and value chain disruption are not commonly considered. Particularly from a national, regional, or local infrastructure analysis standpoint, understanding the interdependencies is critical to the risk assessment. Transportation risks may include weaponization of the asset by direct attack en route, sabotage, or a Trojan Horse style attack into a facility. The risks differ in the level of access control and the degree of public exposures, as well as the dynamic nature of the assets. The public exposures along the transportation route need to be carefully considered. Risks may be mitigated by one of many strategies including internment, staging, prioritization, conscription, or prohibition, as well as by administrative security measures and technology for monitoring and isolating the assets. This paper illustrates how these risks can be analyzed by the API/NPRA SVA methodology. Examples are given of a pipeline operation, and other examples are found in the guidelines.

A Secure Communication Suite for Underwater Acoustic Sensor Networks

PubMed Central

Dini, Gianluca; Duca, Angelica Lo

2012-01-01

In this paper we describe a security suite for Underwater Acoustic Sensor Networks comprising both fixed and mobile nodes. The security suite is composed of a secure routing protocol and a set of cryptographic primitives aimed at protecting the confidentiality and the integrity of underwater communication while taking into account the unique characteristics and constraints of the acoustic channel. By means of experiments and simulations based on real data, we show that the suite is suitable for an underwater networking environment as it introduces limited, and sometimes negligible, communication and power consumption overhead. PMID:23202204

My Sister's Keeper Act of 2014

THOMAS, 113th Congress

Rep. Jackson Lee, Sheila [D-TX-18

2014-09-18

House - 10/28/2014 Referred to the Subcommittee on Crime, Terrorism, Homeland Security, and Investigations. (All Actions) Tracker: This bill has the status IntroducedHere are the steps for Status of Legislation:

Key issues and technical route of cyber physical distribution system

NASA Astrophysics Data System (ADS)

Zheng, P. X.; Chen, B.; Zheng, L. J.; Zhang, G. L.; Fan, Y. L.; Pei, T.

2017-01-01

Relying on the National High Technology Research and Development Program, this paper introduced the key issues in Cyber Physical Distribution System (CPDS), mainly includes: composite modelling method and interaction mechanism, system planning method, security defence technology, distributed control theory. Then on this basis, the corresponding technical route is proposed, and a more detailed research framework along with main schemes to be adopted is also presented.

Secure and Fair Cluster Head Selection Protocol for Enhancing Security in Mobile Ad Hoc Networks

PubMed Central

Paramasivan, B.; Kaliappan, M.

2014-01-01

Mobile ad hoc networks (MANETs) are wireless networks consisting of number of autonomous mobile devices temporarily interconnected into a network by wireless media. MANETs become one of the most prevalent areas of research in the recent years. Resource limitations, energy efficiency, scalability, and security are the great challenging issues in MANETs. Due to its deployment nature, MANETs are more vulnerable to malicious attack. The secure routing protocols perform very basic security related functions which are not sufficient to protect the network. In this paper, a secure and fair cluster head selection protocol (SFCP) is proposed which integrates security factors into the clustering approach for achieving attacker identification and classification. Byzantine agreement based cooperative technique is used for attacker identification and classification to make the network more attack resistant. SFCP used to solve this issue by making the nodes that are totally surrounded by malicious neighbors adjust dynamically their belief and disbelief thresholds. The proposed protocol selects the secure and energy efficient cluster head which acts as a local detector without imposing overhead to the clustering performance. SFCP is simulated in network simulator 2 and compared with two protocols including AODV and CBRP. PMID:25143986

Secure and fair cluster head selection protocol for enhancing security in mobile ad hoc networks.

PubMed

Paramasivan, B; Kaliappan, M

2014-01-01

Mobile ad hoc networks (MANETs) are wireless networks consisting of number of autonomous mobile devices temporarily interconnected into a network by wireless media. MANETs become one of the most prevalent areas of research in the recent years. Resource limitations, energy efficiency, scalability, and security are the great challenging issues in MANETs. Due to its deployment nature, MANETs are more vulnerable to malicious attack. The secure routing protocols perform very basic security related functions which are not sufficient to protect the network. In this paper, a secure and fair cluster head selection protocol (SFCP) is proposed which integrates security factors into the clustering approach for achieving attacker identification and classification. Byzantine agreement based cooperative technique is used for attacker identification and classification to make the network more attack resistant. SFCP used to solve this issue by making the nodes that are totally surrounded by malicious neighbors adjust dynamically their belief and disbelief thresholds. The proposed protocol selects the secure and energy efficient cluster head which acts as a local detector without imposing overhead to the clustering performance. SFCP is simulated in network simulator 2 and compared with two protocols including AODV and CBRP.

Systems for the Intermodal Routing of Spent Nuclear Fuel

DOE Office of Scientific and Technical Information (OSTI.GOV)

Peterson, Steven K; Liu, Cheng

The safe and secure movement of spent nuclear fuel from shutdown and active reactor facilities to intermediate or long term storage sites may, in some instances, require the use of several modes of transportation to accomplish the move. To that end, a fully operable multi-modal routing system is being developed within Oak Ridge National Laboratory s (ORNL) WebTRAGIS (Transportation Routing Analysis Geographic Information System). This study aims to provide an overview of multi-modal routing, the existing state of the TRAGIS networks, the source data needs, and the requirements for developing structural relationships between various modes to create a suitable systemmore » for modeling the transport of spent nuclear fuel via a multimodal network. Modern transportation systems are comprised of interconnected, yet separate, modal networks. Efficient transportation networks rely upon the smooth transfer of cargoes at junction points that serve as connectors between modes. A key logistical impediment to the shipment of spent nuclear fuel is the absence of identified or designated transfer locations between transport modes. Understanding the potential network impacts on intermodal transportation of spent nuclear fuel is vital for planning transportation routes from origin to destination. By identifying key locations where modes intersect, routing decisions can be made to prioritize cost savings, optimize transport times and minimize potential risks to the population and environment. In order to facilitate such a process, ORNL began the development of a base intermodal network and associated routing code. The network was developed using previous intermodal networks and information from publicly available data sources to construct a database of potential intermodal transfer locations with likely capability to handle spent nuclear fuel casks. The coding development focused on modifying the existing WebTRAGIS routing code to accommodate intermodal transfers and the

13. VIEW SOUTH, ROUTE 130 SOUTH FROM ROUTE 130 SOUTH ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

13. VIEW SOUTH, ROUTE 130 SOUTH FROM ROUTE 130 SOUTH ISLAND - White Horse Pike Rond Point, Intersection of Crescent Boulevard (U.S. Route 130), White Horse Pike (U.S. Route 30), & Clay Avenue, Collingswood, Camden County, NJ

12. VIEW EAST, ROUTE 30 EAST FROM ROUTE 130 SOUTH ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

12. VIEW EAST, ROUTE 30 EAST FROM ROUTE 130 SOUTH ISLAND - White Horse Pike Rond Point, Intersection of Crescent Boulevard (U.S. Route 130), White Horse Pike (U.S. Route 30), & Clay Avenue, Collingswood, Camden County, NJ

T2AR: trust-aware ad-hoc routing protocol for MANET.

PubMed

Dhananjayan, Gayathri; Subbiah, Janakiraman

2016-01-01

Secure data transfer against the malicious attacks is an important issue in an infrastructure-less independent network called mobile ad-hoc network (MANET). Trust assurance between MANET nodes is the key parameter in the high-security provision under dynamic topology variations and open wireless constraints. But, the malicious behavior of nodes reduces the trust level of the nodes that leads to an insecure data delivery. The increase in malicious attacks causes the excessive energy consumption that leads to a reduction of network lifetime. The lack of positional information update of the nodes in ad-hoc on-demand vector (AODV) protocol during the connection establishment offers less trust level between the nodes. Hence, the trust rate computation using energy and mobility models and its update are the essential tasks for secure data delivery. This paper proposes a trust-aware ad-hoc routing (T2AR) protocol to improve the trust level between the nodes in MANET. The proposed method modifies the traditional AODV routing protocol with the constraints of trust rate, energy, mobility based malicious behavior prediction. The packet sequence ID matching from the log reports of neighbor nodes determine the trust rate that avoids the malicious report generation. Besides, the direct and indirect trust observation schemes utilization increases the trust level. Besides, the received signal strength indicator utilization determines the trusted node is within the communication range or not. The comparative analysis between the proposed T2AR with the existing methods such as TRUNCMAN, RBT, GR, FBR and DICOTIDS regarding the average end-to-end delay, throughput, false positives, packet delivery ratio shows the effectiveness of T2AR in the secure MANET environment design.

History-based route selection for reactive ad hoc routing protocols

NASA Astrophysics Data System (ADS)

Medidi, Sirisha; Cappetto, Peter

2007-04-01

Ad hoc networks rely on cooperation in order to operate, but in a resource constrained environment not all nodes behave altruistically. Selfish nodes preserve their own resources and do not forward packets not in their own self interest. These nodes degrade the performance of the network, but judicious route selection can help maintain performance despite this behavior. Many route selection algorithms place importance on shortness of the route rather than its reliability. We introduce a light-weight route selection algorithm that uses past behavior to judge the quality of a route rather than solely on the length of the route. It draws information from the underlying routing layer at no extra cost and selects routes with a simple algorithm. This technique maintains this data in a small table, which does not place a high cost on memory. History-based route selection's minimalism suits the needs the portable wireless devices and is easy to implement. We implemented our algorithm and tested it in the ns2 environment. Our simulation results show that history-based route selection achieves higher packet delivery and improved stability than its length-based counterpart.

Mapping the economic benefits to livestock keepers from intervening against bovine trypanosomosis in Eastern Africa.

PubMed

Shaw, A P M; Cecchi, G; Wint, G R W; Mattioli, R C; Robinson, T P

2014-02-01

Endemic animal diseases such as tsetse-transmitted trypanosomosis are a constant drain on the financial resources of African livestock keepers and on the productivity of their livestock. Knowing where the potential benefits of removing animal trypanosomosis are distributed geographically would provide crucial evidence for prioritising and targeting cost-effective interventions as well as a powerful tool for advocacy. To this end, a study was conducted on six tsetse-infested countries in Eastern Africa: Ethiopia, Kenya, Somalia, South Sudan, Sudan and Uganda. First, a map of cattle production systems was generated, with particular attention to the presence of draught and dairy animals. Second, herd models for each production system were developed for two scenarios: with or without trypanosomosis. The herd models were based on publications and reports on cattle productivity (fertility, mortality, yields, sales), from which the income from, and growth of cattle populations were estimated over a twenty-year period. Third, a step-wise spatial expansion model was used to estimate how cattle populations might migrate to new areas when maximum stocking rates are exceeded. Last, differences in income between the two scenarios were mapped, thus providing a measure of the maximum benefits that could be obtained from intervening against tsetse and trypanosomosis. For this information to be readily mappable, benefits were calculated per bovine and converted to US$ per square kilometre. Results indicate that the potential benefits from dealing with trypanosomosis in Eastern Africa are both very high and geographically highly variable. The estimated total maximum benefit to livestock keepers for the whole of the study area amounts to nearly US$ 2.5 billion, discounted at 10% over twenty years--an average of approximately US$ 3300 per square kilometre of tsetse-infested area--but with great regional variation from less than US$ 500 per square kilometre to well over US$ 10,000. The

1. Intersection of US Route 4 and NH Route 143, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Intersection of US Route 4 and NH Route 143, showing farmhouse on left, barn at right. Looking east. - Batchelder-Edgerly Farmstead, Barn, U.S. Route 4, southwest side, southeast corner of New Hampshire Route 43, Northwood, Rockingham County, NH

Evaluation and development the routing protocol of a fully functional simulation environment for VANETs

NASA Astrophysics Data System (ADS)

Ali, Azhar Tareq; Warip, Mohd Nazri Mohd; Yaakob, Naimah; Abduljabbar, Waleed Khalid; Atta, Abdu Mohammed Ali

2017-11-01

Vehicular Ad-hoc Networks (VANETs) is an area of wireless technologies that is attracting a great deal of interest. There are still several areas of VANETS, such as security and routing protocols, medium access control, that lack large amounts of research. There is also a lack of freely available simulators that can quickly and accurately simulate VANETs. The main goal of this paper is to develop a freely available VANETS simulator and to evaluate popular mobile ad-hoc network routing protocols in several VANETS scenarios. The VANETS simulator consisted of a network simulator, traffic (mobility simulator) and used a client-server application to keep the two simulators in sync. The VANETS simulator also models buildings to create a more realistic wireless network environment. Ad-Hoc Distance Vector routing (AODV), Dynamic Source Routing (DSR) and Dynamic MANET On-demand (DYMO) were initially simulated in a city, country, and highway environment to provide an overall evaluation.

Underwater Acoustic Wireless Sensor Networks: Advances and Future Trends in Physical, MAC and Routing Layers

PubMed Central

Climent, Salvador; Sanchez, Antonio; Capella, Juan Vicente; Meratnia, Nirvana; Serrano, Juan Jose

2014-01-01

This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control and routing layers. It summarizes their security threads and surveys the currently proposed studies. Current envisioned niches for further advances in underwater networks research range from efficient, low-power algorithms and modulations to intelligent, energy-aware routing and medium access control protocols. PMID:24399155

Underwater acoustic wireless sensor networks: advances and future trends in physical, MAC and routing layers.

PubMed

Climent, Salvador; Sanchez, Antonio; Capella, Juan Vicente; Meratnia, Nirvana; Serrano, Juan Jose

2014-01-06

This survey aims to provide a comprehensive overview of the current research on underwater wireless sensor networks, focusing on the lower layers of the communication stack, and envisions future trends and challenges. It analyzes the current state-of-the-art on the physical, medium access control and routing layers. It summarizes their security threads and surveys the currently proposed studies. Current envisioned niches for further advances in underwater networks research range from efficient, low-power algorithms and modulations to intelligent, energy-aware routing and medium access control protocols.

On Delay and Security in Network Coding

ERIC Educational Resources Information Center

Dikaliotis, Theodoros K.

2013-01-01

In this thesis, delay and security issues in network coding are considered. First, we study the delay incurred in the transmission of a fixed number of packets through acyclic networks comprised of erasure links. The two transmission schemes studied are routing with hop-by-hop retransmissions, where every node in the network simply stores and…

Contact Graph Routing

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic

Smart photonic networks and computer security for image data

NASA Astrophysics Data System (ADS)

Campello, Jorge; Gill, John T.; Morf, Martin; Flynn, Michael J.

1998-02-01

Work reported here is part of a larger project on 'Smart Photonic Networks and Computer Security for Image Data', studying the interactions of coding and security, switching architecture simulations, and basic technologies. Coding and security: coding methods that are appropriate for data security in data fusion networks were investigated. These networks have several characteristics that distinguish them form other currently employed networks, such as Ethernet LANs or the Internet. The most significant characteristics are very high maximum data rates; predominance of image data; narrowcasting - transmission of data form one source to a designated set of receivers; data fusion - combining related data from several sources; simple sensor nodes with limited buffering. These characteristics affect both the lower level network design and the higher level coding methods.Data security encompasses privacy, integrity, reliability, and availability. Privacy, integrity, and reliability can be provided through encryption and coding for error detection and correction. Availability is primarily a network issue; network nodes must be protected against failure or routed around in the case of failure. One of the more promising techniques is the use of 'secret sharing'. We consider this method as a special case of our new space-time code diversity based algorithms for secure communication. These algorithms enable us to exploit parallelism and scalable multiplexing schemes to build photonic network architectures. A number of very high-speed switching and routing architectures and their relationships with very high performance processor architectures were studied. Indications are that routers for very high speed photonic networks can be designed using the very robust and distributed TCP/IP protocol, if suitable processor architecture support is available.

Constraint-Based Routing Models for the Transport of Radioactive Materials

DOE Office of Scientific and Technical Information (OSTI.GOV)

Peterson, Steven K

2015-01-01

The Department of Energy (DOE) has a historic programmatic interest in the safe and secure routing, tracking, and transportation risk analysis of radiological materials in the United States. In order to address these program goals, DOE has funded the development of several tools and related systems designed to provide insight to planners and other professionals handling radioactive materials shipments. These systems include the WebTRAGIS (Transportation Routing Analysis Geographic Information System) platform. WebTRAGIS is a browser-based routing application developed at Oak Ridge National Laboratory (ORNL) focused primarily on the safe transport of spent nuclear fuel from US nuclear reactors via railway,more » highway, or waterway. It is also used for the transport planning of low-level radiological waste to depositories such as the Waste Isolation Pilot Plant (WIPP) facility. One particular feature of WebTRAGIS is its coupling with high-resolution population data from ORNL s LandScan project. This allows users to obtain highly accurate population count and density information for use in route planning and risk analysis. To perform the routing and risk analysis WebTRAGIS incorporates a basic routing model methodology, with the additional application of various constraints designed to mimic US Department of Transportation (DOT), DOE, and Nuclear Regulatory Commission (NRC) regulations. Aside from the routing models available in WebTRAGIS, the system relies on detailed or specialized modal networks for the route solutions. These include a highly detailed network model of the US railroad system, the inland and coastal waterways, and a specialized highway network that focuses on the US interstate system and the designated hazardous materials and Highway Route Controlled Quantity (HRCQ) -designated roadways. The route constraints in WebTRAGIS rely upon a series of attributes assigned to the various components of the different modal networks. Routes are determined via

Optimization of the Costs and the Safety of Maritime Transport by Routing: The use of Currents Forecast in the Routing of Racing Sail Boats as a Prototype of Rout Optimization for Trading Ships

NASA Astrophysics Data System (ADS)

Theunynck, Denis; Peze, Thierry; Toumazou, Vincent; Zunquin, Gauthier; Cohen, Olivier; Monges, Arnaud

2005-03-01

It is interesting to see whether the model of routing designed for races and great Navy operations could be transferred to commercial navigation and if so, within which framework.Sail boat routing conquered its letters of nobility during great races like the « Route du Rhum » or the transatlantic race « Jacques Vabre ». It is the ultimate stage of the step begun by the Navy at the time of great operations, like D-day (Overlord )June 6, 1944, in Normandy1.Routing is, from the beginning, mainly based on statistical knowledge and weather forecast, but with the recent availability of reliable currents forecast, sail boats routers and/or skippers now have to learn how to use both winds and currents to obtain the best performance, that is to travel between two points in the shortest time possible in acceptable security conditions.Are the currents forecast only useful to racing sail boat ? Of course not, they are a great help to fisherman for whom the knowledge of currents is also the knowledge of sea temperature who indicates the probability of fish presence. They are also used in offshore work to predict the hardness of the sea during operation.A less developed field of application is the route optimization of trading ships. The idea is to optimize the use of currents to increase the relative speed of ships with no augmentation of fuel expense. This new field will require that currents forecasters learn about the specific needs of another type of clients. There is also a need of teaching because the future customers will have to learn how to use the information they will get.At this point, the introduction of the use of currents forecast in racing sail boats routing is only the first step. It is of great interest because it can rely on a high knowledge in routing.The main difference is of course that the wind direction and its force are of greater importance to a sail boat that they are for a trading ship for whom the point of interest will be the fuel consumption

SFTP: A Secure and Fault-Tolerant Paradigm against Blackhole Attack in MANET

NASA Astrophysics Data System (ADS)

KumarRout, Jitendra; Kumar Bhoi, Sourav; Kumar Panda, Sanjaya

2013-02-01

Security issues in MANET are a challenging task nowadays. MANETs are vulnerable to passive attacks and active attacks because of a limited number of resources and lack of centralized authority. Blackhole attack is an attack in network layer which degrade the network performance by dropping the packets. In this paper, we have proposed a Secure Fault-Tolerant Paradigm (SFTP) which checks the Blackhole attack in the network. The three phases used in SFTP algorithm are designing of coverage area to find the area of coverage, Network Connection algorithm to design a fault-tolerant model and Route Discovery algorithm to discover the route and data delivery from source to destination. SFTP gives better network performance by making the network fault free.

Reverse Flood Routing with the Lag-and-Route Storage Model

NASA Astrophysics Data System (ADS)

Mazi, K.; Koussis, A. D.

2010-09-01

This work presents a method for reverse routing of flood waves in open channels, which is an inverse problem of the signal identification type. Inflow determination from outflow measurements is useful in hydrologic forensics and in optimal reservoir control, but has been seldom studied. Such problems are ill posed and their solution is sensitive to small perturbations present in the data, or to any related uncertainty. Therefore the major difficulty in solving this inverse problem consists in controlling the amplification of errors that inevitably befall flow measurements, from which the inflow signal is to be determined. The lag-and-route model offers a convenient framework for reverse routing, because not only is formal deconvolution not required, but also reverse routing is through a single linear reservoir. In addition, this inversion degenerates to calculating the intermediate inflow (prior to the lag step) simply as the sum of the outflow and of its time derivative multiplied by the reservoir’s time constant. The remaining time shifting (lag) of the intermediate, reversed flow presents no complications, as pure translation causes no error amplification. Note that reverse routing with the inverted Muskingum scheme (Koussis et al., submitted to the 12th Plinius Conference) fails when that scheme is specialised to the Kalinin-Miljukov model (linear reservoirs in series). The principal functioning of the reverse routing procedure was verified first with perfect field data (outflow hydrograph generated by forward routing of a known inflow hydrograph). The field data were then seeded with random error. To smooth the oscillations caused by the imperfect (measured) outflow data, we applied a multipoint Savitzky-Golay low-pass filter. The combination of reverse routing and filtering achieved an effective recovery of the inflow signal extremely efficiently. Specifically, we compared the reverse routing results of the inverted lag-and-route model and of the inverted

Reconfigurable routing protocol for free space optical sensor networks.

PubMed

Xie, Rong; Yang, Won-Hyuk; Kim, Young-Chon

2012-01-01

Recently, free space optical sensor networks (FSOSNs), which are based on free space optics (FSO) instead of radio frequency (RF), have gained increasing visibility over traditional wireless sensor networks (WSNs) due to their advantages such as larger capacity, higher security, and lower cost. However, the performance of FSOSNs is restricted to the requirement of a direct line-of-sight (LOS) path between a sender and a receiver pair. Once a node dies of energy depletion, the network would probably suffer from a dramatic decrease of connectivity, resulting in a huge loss of data packets. Thus, this paper proposes a reconfigurable routing protocol (RRP) to overcome this problem by dynamically reconfiguring the network virtual topology. The RRP works in three phases: (1) virtual topology construction, (2) routing establishment, and (3) reconfigurable routing. When data transmission begins, the data packets are first routed through the shortest hop paths. Then a reconfiguration is initiated by the node whose residual energy falls below a threshold. Nodes affected by this dying node are classified into two types, namely maintenance nodes and adjustment nodes, and they are reconfigured according to the types. An energy model is designed to evaluate the performance of RRP through OPNET simulation. Our simulation results indicate that the RRP achieves better performance compared with the simple-link protocol and a direct reconfiguration scheme in terms of connectivity, network lifetime, packet delivery ratio and the number of living nodes.

Improving Operational Acceptability of Dynamic Weather Routes Through Analysis of Commonly Use Routings

NASA Technical Reports Server (NTRS)

Evans, Antony D.; Sridhar, Banavar; McNally, David

2016-01-01

The Dynamic Weather Routes (DWR) tool is a ground-based trajectory automation system that continuously and automatically analyzes active in-flight aircraft in en route airspace to find simple modifications to flight plan routes that can save significant flying time, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. Trials of the DWR system have shown that significant delay savings are possible. However, some DWR advised routes are also rejected by dispatchers or modified before being accepted. Similarly, of those sent by dispatchers to flight crews as proposed route change requests, many are not accepted by air traffic control, or are modified before implementation as Center route amendments. Such actions suggest that the operational acceptability of DWR advised route corrections could be improved, which may reduce workload and increase delay savings. This paper analyzes the historical usage of different flight routings, varying from simple waypoint pairs to lengthy strings of waypoints incorporating jet routes, in order to improve DWR route acceptability. An approach is developed that can be incorporated into DWR, advising routings with high historical usage and savings potential similar to that of the nominal DWR advisory. It is hypothesized that modifying a nominal DWR routing to one that is commonly used, and nearby, will result in more actual savings since common routings are generally familiar and operationally acceptable to air traffic control. The approach allows routing segments with high historical usage to be concatenated to form routes that meet all DWR constraints. The relevance of a route's historical usage to its acceptance by dispatchers and air traffic control is quantified by analyzing historical DWR data. Results indicate that while historical usage may be less of a concern to flight dispatchers accepting or rejecting DWR advised route corrections, it may be

Kin KeeperSM: Design and Baseline Characteristics of a Community-Based Randomized Controlled Trial Promoting Cancer Screening in Black, Latina, and Arab Women

PubMed Central

Williams, Karen Patricia; Roman, LeeAnne; Meghea, Cristian Ioan; Penner, Louis; Hammad, Adnan; Gardiner, Joseph

2013-01-01

Background Although breast and cervical cancer deaths have declined due to early screening, detection, and more effective treatment, racial and ethnic disparities persist. This paper describes the study design and baseline characteristics of a randomized controlled trial (RCT) evaluating the effectiveness of the Kin KeeperSM Cancer Prevention Intervention, a family-focused educational intervention for underserved women applied in a community-based setting to promote health literacy and screening adherence to address cancer disparities Methods Female public health community health workers (CHWs) were trained to administer the intervention. They recruited female clients from their public health program caseload and asked each to assemble two to four adult female family members for the breast and cervical cancer home-based education sessions the CHWs would deliver in English, Spanish or Arabic. We randomized the clients into the kin keeper group (treatment) or the participant client group (control) Results Complete data were obtained on 514 Black, Latina, and Arab women. Close to half were unemployed and had yearly family income below $20,000. Thirty-four percent had no medical insurance, and 21% had diabetes. Almost 40% had no mammography in the last year. Treatment and control groups were similar on most sociodemographics but showed differences in breast and cervical screening history. Conclusions This innovative study demonstrates the implementation of an RCT using community-based participatory research, while delivering cancer prevention education across woman’s life span with women not connected to the health care system. PMID:23274402

VIEW ALONG FLIGHT LINE FROM SECURITY GUARD TOWER (BUILDING 30631, ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

VIEW ALONG FLIGHT LINE FROM SECURITY GUARD TOWER (BUILDING 30631, LOOKING TOWARD FB-1 11A AIRCRAFT SHELTERS (BUILDINGS 3066, 3067,3068,3069,3071,3072,3073,3074,3076). VIEW TO SOUTHEAST - Plattsburgh Air Force Base, U.S. Route 9, Plattsburgh, Clinton County, NY

Route Repetition and Route Reversal: Effects of Age and Encoding Method

PubMed Central

Allison, Samantha; Head, Denise

2017-01-01

Previous research indicates age-related impairments in learning routes from a start location to a target destination. There is less research on age effects on the ability to reverse a learned path. The method used to learn routes may also influence performance. This study examined how encoding methods influence the ability of younger and older adults to recreate a route in a virtual reality environment in forward and reverse directions. Younger (n=50) and older (n=50) adults learned a route by either self-navigation through the virtual environment or through studying a map. At test, participants recreated the route in the forward and reverse directions. Older adults in the map study condition had greater difficulty learning the route in the forward direction compared to younger adults. Older adults who learned the route by self-navigation were less accurate in traversing the route in the reverse compared to forward direction after a delay. In contrast, for older adults who learned via map study there were no significant differences between forward and reverse directions. Results suggest that older adults may not as readily develop and retain a sufficiently flexible representation of the environment during self-navigation to support accurate route reversal. Thus, initially learning a route from a map may be more difficult for older adults, but may ultimately be beneficial in terms of better supporting the ability to return to a start location. PMID:28504535

Pathways to care and psychological problems of general practice patients in a "gate keeper" and an "open access" health care system: a comparison of Germany and the Netherlands.

PubMed

Linden, M; Gothe, H; Ormel, J

2003-12-01

The comparison of different health care systems is one way to give empirical evidence to health care reform and policy. The differences between health care systems in which general practitioners serve as gate keepers in comparison to systems in which patients are free to contact every physician and specialist they like are a question of high interest. This study compares the Netherlands and Germany, two countries with very similar political, social, and health system structures, but different types of access to the health care system. While Germany offers unconstrained access to specialist ambulatory care, the Netherlands restricts health care utilization by giving primary care a 'gate keeper' function not allowing patients direct access to specialist care. Data from the WHO international collaborative study on psychological problems in general health care (Ustün and Sartorius 1995) were analysed with respect to pathways to care, treatment, and health status. In an initial cross-sectional assessment, in 3-month and 12-month follow-ups, contacts to physicians or hospital admission have also been monitored. There were only marginal differences between the Dutch and the German sample in the sociodemographic characteristics as well as in the diagnostic status with respect to mental disorders. In the Netherlands, 95.5%, and in Germany, 68.8% of the patients presented their 'reason for visit' for the first time to any physician at this index contact with a general practitioner. During the following 3 months, 24% of the Dutch patients, but 60.2% of the German patients, additionally contacted other physicians ( P < 0.001). At 12 months, this rate was 62.9% vs. 78.6% ( P < 0.001). During the 12-month follow-up period, there were 15.7 0/00 hospital admissions in Germany vs. 25.4 0/00 in the Netherlands ( P < 0.005) [corrected]. Family physicians in a gate keeper system reduce the number of contacts to other physicians and the intensity of treatment, while at the same time

Snow route optimization.

DOT National Transportation Integrated Search

2016-01-01

Route optimization is a method of creating a set of winter highway treatment routes to meet a range of targets, including : service level improvements, resource reallocation and changes to overriding constraints. These routes will allow the : operato...

Visualizing Internet routing changes.

PubMed

Lad, Mohit; Massey, Dan; Zhang, Lixia

2006-01-01

Today's Internet provides a global data delivery service to millions of end users and routing protocols play a critical role in this service. It is important to be able to identify and diagnose any problems occurring in Internet routing. However, the Internet's sheer size makes this task difficult. One cannot easily extract out the most important or relevant routing information from the large amounts of data collected from multiple routers. To tackle this problem, we have developed Link-Rank, a tool to visualize Internet routing changes at the global scale. Link-Rank weighs links in a topological graph by the number of routes carried over each link and visually captures changes in link weights in the form of a topological graph with adjustable size. Using Link-Rank, network operators can easily observe important routing changes from massive amounts of routing data, discover otherwise unnoticed routing problems, understand the impact of topological events, and infer root causes of observed routing changes.

Routing UAVs to Co-Optimize Mission Effectiveness and Network Performance with Dynamic Programming

DTIC Science & Technology

2011-03-01

Heuristics on Hexagonal Connected Dominating Sets to Model Routing Dissemination," in Communication Theory, Reliability, and Quality of Service (CTRQ...24] Matthew Capt. USAF Compton, Improving the Quality of Service and Security of Military Networks with a Network Tasking Order Process, 2010. [25...Wesley, 2006. [32] James Haught, "Adaptive Quality of Service Engine with Dynamic Queue Control," Air Force Institute of Technology, Wright

Design and Analysis of Optimization Algorithms to Minimize Cryptographic Processing in BGP Security Protocols.

PubMed

Sriram, Vinay K; Montgomery, Doug

2017-07-01

The Internet is subject to attacks due to vulnerabilities in its routing protocols. One proposed approach to attain greater security is to cryptographically protect network reachability announcements exchanged between Border Gateway Protocol (BGP) routers. This study proposes and evaluates the performance and efficiency of various optimization algorithms for validation of digitally signed BGP updates. In particular, this investigation focuses on the BGPSEC (BGP with SECurity extensions) protocol, currently under consideration for standardization in the Internet Engineering Task Force. We analyze three basic BGPSEC update processing algorithms: Unoptimized, Cache Common Segments (CCS) optimization, and Best Path Only (BPO) optimization. We further propose and study cache management schemes to be used in conjunction with the CCS and BPO algorithms. The performance metrics used in the analyses are: (1) routing table convergence time after BGPSEC peering reset or router reboot events and (2) peak-second signature verification workload. Both analytical modeling and detailed trace-driven simulation were performed. Results show that the BPO algorithm is 330% to 628% faster than the unoptimized algorithm for routing table convergence in a typical Internet core-facing provider edge router.

Common Capabilities for Trust and Security in Service Oriented Infrastructures

NASA Astrophysics Data System (ADS)

Brossard, David; Colombo, Maurizio

In order to achieve agility of the enterprise and shorter concept-to-market timescales for new services, IT and communication providers and their customers increasingly use technologies and concepts which come together under the banner of the Service Oriented Infrastructure (SOI) approach. In this paper we focus on the challenges relating to SOI security. The solutions presented cover the following areas: i) identity federation, ii) distributed usage & access management, and iii) context-aware secure messaging, routing & transformation. We use a scenario from the collaborative engineering space to illustrate the challenges and the solutions.

Transnational Crime and Security Threats in Indonesia

DTIC Science & Technology

2010-03-01

archipelagos, while the region’s climate and cultures have also made it highly attractive to leisure activities. Piracy has been a traditional way of...coordinated patrols by Indonesia, Malaysia , and Singapore, along with increased security on vessels have sparked a dramatic downturn in piracy according to...just local but also international. Some sources believe that the network route runs from Cambodia to Southern Philippines to Malaysia then enters

Impact of an Electronic Health Record-Integrated Personal Health Record on Patient Participation in Health Care: Development and Randomized Controlled Trial of MyHealthKeeper

PubMed Central

Ryu, Borim; Kim, Nari; Heo, Eunyoung; Yoo, Sooyoung; Lee, Keehyuck; Hwang, Hee; Kim, Jeong-Whun; Kim, Yoojung; Lee, Joongseek

2017-01-01

Background Personal health record (PHR)–based health care management systems can improve patient engagement and data-driven medical diagnosis in a clinical setting. Objective The purpose of this study was (1) to demonstrate the development of an electronic health record (EHR)–tethered PHR app named MyHealthKeeper, which can retrieve data from a wearable device and deliver these data to a hospital EHR system, and (2) to study the effectiveness of a PHR data-driven clinical intervention with clinical trial results. Methods To improve the conventional EHR-tethered PHR, we ascertained clinicians’ unmet needs regarding PHR functionality and the data frequently used in the field through a cocreation workshop. We incorporated the requirements into the system design and architecture of the MyHealthKeeper PHR module. We constructed the app and validated the effectiveness of the PHR module by conducting a 4-week clinical trial. We used a commercially available activity tracker (Misfit) to collect individual physical activity data, and developed the MyHealthKeeper mobile phone app to record participants’ patterns of daily food intake and activity logs. We randomly assigned 80 participants to either the PHR-based intervention group (n=51) or the control group (n=29). All of the study participants completed a paper-based survey, a laboratory test, a physical examination, and an opinion interview. During the 4-week study period, we collected health-related mobile data, and study participants visited the outpatient clinic twice and received PHR-based clinical diagnosis and recommendations. Results A total of 68 participants (44 in the intervention group and 24 in the control group) completed the study. The PHR intervention group showed significantly higher weight loss than the control group (mean 1.4 kg, 95% CI 0.9-1.9; P<.001) at the final week (week 4). In addition, triglyceride levels were significantly lower by the end of the study period (mean 2.59 mmol/L, 95% CI 17

Children's route choice during active transportation to school: difference between shortest and actual route.

PubMed

Dessing, Dirk; de Vries, Sanne I; Hegeman, Geertje; Verhagen, Evert; van Mechelen, Willem; Pierik, Frank H

2016-04-12

The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible route to school. Children (n = 184; 86 boys, 98 girls; age range: 8-12 years) from seven schools in suburban municipalities in the Netherlands participated in the study. Actual walking and cycling routes to school were measured with a GPS-device that children wore during an entire school week. Measurements were conducted in the period April-June 2014. Route characteristics for both actual and shortest routes between home and school were determined for a buffer of 25 m from the routes and divided into four categories: Land use (residential, commercial, recreational, traffic areas), Aesthetics (presence of greenery/natural water ways along route), Traffic (safety measures such as traffic lights, zebra crossings, speed bumps) and Type of street (pedestrian, cycling, residential streets, arterial roads). Comparison of characteristics of shortest and actual routes was performed with conditional logistic regression models. Median distance of the actual walking routes was 390.1 m, whereas median distance of actual cycling routes was 673.9 m. Actual walking and cycling routes were not significantly longer than the shortest possible routes. Children mainly traveled through residential areas on their way to school (>80% of the route). Traffic lights were found to be positively associated with route choice during ATS. Zebra crossings were less often present along the actual routes (walking: OR = 0.17, 95% CI = 0.05-0.58; cycling: OR = 0.31, 95% CI = 0.14-0.67), and streets with a high occurrence of accidents were less often used during cycling to school (OR = 0.57, 95% CI = 0.43-0.76). Moreover, percentage of visible surface water along the actual route was higher

Adult Competency Education Kit. Basic Skills in Speaking, Math, and Reading for Employment. Part E. ACE Competency Based Job Descriptions: #11--Groundskeeper; #12--Animal Keeper; #15--Tire Repairperson; #16--Muffler Installer; #17--Garage Mechanic.

ERIC Educational Resources Information Center

San Mateo County Office of Education, Redwood City, CA. Career Preparation Centers.

This second of fifteen sets of Adult Competency Education (ACE) Based Job Descriptions in the ACE kit contains job descriptions for Groundskeeper, Animal Keeper, Tire Repairperson, Muffler Installer, and Garage Mechanic. Each begins with a fact sheet that includes this information: occupational title, D.O.T. code, ACE number, career ladder, D.O.T.…

Design and Implementation of Secure Area Expansion Scheme for Public Wireless LAN Services

NASA Astrophysics Data System (ADS)

Watanabe, Ryu; Tanaka, Toshiaki

Recently, wireless LAN (WLAN) technology has become a major wireless communication method. The communication bandwidth is increasing and speeds have attained rates exceeding 100 Mbps. Therefore, WLAN technology is regarded as one of the promising communication methods for future networks. In addition, public WLAN connection services can be used in many locations. However, the number of the access points (AP) is insufficient for seamless communication and it cannot be said that users can use the service ubiquitously. An ad-hoc network style connection can be used to expand the coverage area of a public WLAN service. By relaying the user messages among the user nodes, a node can obtain an Internet connection via an AP, even though the node is located outside the AP's direct wireless connection area. Such a coverage area extending technology has many advantages thanks to the feature that no additional infrastructure is required. Therefore, there is a strong demand for this technology as it allows the cost-effective construction of future networks. When a secure ad-hoc routing protocol is used for message exchange in the WLAN service, the message routes are protected from malicious behavior such as route forging and can be maintained appropriately. To do this, however, a new node that wants to join the WLAN service has to obtain information such as the public key certificate and IP address in order to start secure ad-hoc routing. In other words, an initial setup is required for every network node to join the WLAN service properly. Ordinarily, such information should be assigned from the AP. However, new nodes cannot always contact an AP directly. Therefore, there are problems about information delivery in the initial setup of a network node. These problems originate in the multi hop connection based on the ad-hoc routing protocols. In order to realize an expanded area WLAN service, in this paper, the authors propose a secure public key certificate and address provision

Route Recapitulation and Route Loyalty in Homing Pigeons: Pilotage From 25 km?

NASA Astrophysics Data System (ADS)

Biro, Dora; Meade, Jessica; Guilford, Tim

2006-01-01

We utilised precision Global Positioning System (GPS) tracking to examine the homing paths of pigeons (Columba livia) released 20 times consecutively 25 km from the loft. By the end of the training phase, birds had developed highly stereotyped yet individually distinct routes home, with detailed recapitulation evident at each stage of the journey. Following training, birds also participated in a series of releases from novel sites at perpendicular distances of up to 3 km from their established routes. Results showed that subjects were attracted back to their established routes and recapitulated them from the point of contact. Naïve conspecifics (yoked controls) released from the same off-route sites confirmed that the experienced birds' route choices were not influenced by constraints exerted by terrain features, but that increased experience with the general area conferred a homing advantage in the form of more efficient flight tracks, even from these novel sites. Patterns in the paths taken by experienced birds to rejoin their established routes are discussed with reference to navigational mechanisms employed by homing pigeons in their familiar area.

Security in the Cache and Forward Architecture for the Next Generation Internet

NASA Astrophysics Data System (ADS)

Hadjichristofi, G. C.; Hadjicostis, C. N.; Raychaudhuri, D.

The future Internet architecture will be comprised predominately of wireless devices. It is evident at this stage that the TCP/IP protocol that was developed decades ago will not properly support the required network functionalities since contemporary communication profiles tend to be data-driven rather than host-based. To address this paradigm shift in data propagation, a next generation architecture has been proposed, the Cache and Forward (CNF) architecture. This research investigates security aspects of this new Internet architecture. More specifically, we discuss content privacy, secure routing, key management and trust management. We identify security weaknesses of this architecture that need to be addressed and we derive security requirements that should guide future research directions. Aspects of the research can be adopted as a step-stone as we build the future Internet.

Impact of an Electronic Health Record-Integrated Personal Health Record on Patient Participation in Health Care: Development and Randomized Controlled Trial of MyHealthKeeper.

PubMed

Ryu, Borim; Kim, Nari; Heo, Eunyoung; Yoo, Sooyoung; Lee, Keehyuck; Hwang, Hee; Kim, Jeong-Whun; Kim, Yoojung; Lee, Joongseek; Jung, Se Young

2017-12-07

Personal health record (PHR)-based health care management systems can improve patient engagement and data-driven medical diagnosis in a clinical setting. The purpose of this study was (1) to demonstrate the development of an electronic health record (EHR)-tethered PHR app named MyHealthKeeper, which can retrieve data from a wearable device and deliver these data to a hospital EHR system, and (2) to study the effectiveness of a PHR data-driven clinical intervention with clinical trial results. To improve the conventional EHR-tethered PHR, we ascertained clinicians' unmet needs regarding PHR functionality and the data frequently used in the field through a cocreation workshop. We incorporated the requirements into the system design and architecture of the MyHealthKeeper PHR module. We constructed the app and validated the effectiveness of the PHR module by conducting a 4-week clinical trial. We used a commercially available activity tracker (Misfit) to collect individual physical activity data, and developed the MyHealthKeeper mobile phone app to record participants' patterns of daily food intake and activity logs. We randomly assigned 80 participants to either the PHR-based intervention group (n=51) or the control group (n=29). All of the study participants completed a paper-based survey, a laboratory test, a physical examination, and an opinion interview. During the 4-week study period, we collected health-related mobile data, and study participants visited the outpatient clinic twice and received PHR-based clinical diagnosis and recommendations. A total of 68 participants (44 in the intervention group and 24 in the control group) completed the study. The PHR intervention group showed significantly higher weight loss than the control group (mean 1.4 kg, 95% CI 0.9-1.9; P<.001) at the final week (week 4). In addition, triglyceride levels were significantly lower by the end of the study period (mean 2.59 mmol/L, 95% CI 17.6-75.8; P=.002). We developed an innovative

Securing Mobile Networks in an Operational Setting

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Stewart, David H.; Bell, Terry L.; Paulsen, Phillip E.; Shell, Dan

2004-01-01

This paper describes a network demonstration and three month field trial of mobile networking using mobile-IPv4. The network was implemented as part of the US Coast Guard operational network which is a ".mil" network and requires stringent levels of security. The initial demonstrations took place in November 2002 and a three month field trial took place from July through September of 2003. The mobile network utilized encryptors capable of NSA-approved Type 1 algorithms, mobile router from Cisco Systems and 802.11 and satellite wireless links. This paper also describes a conceptual architecture for wide-scale deployment of secure mobile networking in operational environments where both private and public infrastructure is used. Additional issues presented include link costs, placement of encryptors and running routing protocols over layer-3 encryption devices.

Network-wide Impacts of Eco-routes and Route Choice Behavior/Evaluation of AERIS Applications

DOT National Transportation Integrated Search

2016-07-01

The study investigates the eco-routes and route choice behaviors under connected vehicle environment. In particular, the study demonstrates the various conceptual development for an ecorouting system which includes an individual route choice behavior...

Automatic Extraction of Destinations, Origins and Route Parts from Human Generated Route Directions

NASA Astrophysics Data System (ADS)

Zhang, Xiao; Mitra, Prasenjit; Klippel, Alexander; Maceachren, Alan

Researchers from the cognitive and spatial sciences are studying text descriptions of movement patterns in order to examine how humans communicate and understand spatial information. In particular, route directions offer a rich source of information on how cognitive systems conceptualize movement patterns by segmenting them into meaningful parts. Route directions are composed using a plethora of cognitive spatial organization principles: changing levels of granularity, hierarchical organization, incorporation of cognitively and perceptually salient elements, and so forth. Identifying such information in text documents automatically is crucial for enabling machine-understanding of human spatial language. The benefits are: a) creating opportunities for large-scale studies of human linguistic behavior; b) extracting and georeferencing salient entities (landmarks) that are used by human route direction providers; c) developing methods to translate route directions to sketches and maps; and d) enabling queries on large corpora of crawled/analyzed movement data. In this paper, we introduce our approach and implementations that bring us closer to the goal of automatically processing linguistic route directions. We report on research directed at one part of the larger problem, that is, extracting the three most critical parts of route directions and movement patterns in general: origin, destination, and route parts. We use machine-learning based algorithms to extract these parts of routes, including, for example, destination names and types. We prove the effectiveness of our approach in several experiments using hand-tagged corpora.

A Secure and Privacy-Preserving Navigation Scheme Using Spatial Crowdsourcing in Fog-Based VANETs

PubMed Central

Wang, Lingling; Liu, Guozhu; Sun, Lijun

2017-01-01

Fog-based VANETs (Vehicular ad hoc networks) is a new paradigm of vehicular ad hoc networks with the advantages of both vehicular cloud and fog computing. Real-time navigation schemes based on fog-based VANETs can promote the scheme performance efficiently. In this paper, we propose a secure and privacy-preserving navigation scheme by using vehicular spatial crowdsourcing based on fog-based VANETs. Fog nodes are used to generate and release the crowdsourcing tasks, and cooperatively find the optimal route according to the real-time traffic information collected by vehicles in their coverage areas. Meanwhile, the vehicle performing the crowdsourcing task can get a reasonable reward. The querying vehicle can retrieve the navigation results from each fog node successively when entering its coverage area, and follow the optimal route to the next fog node until it reaches the desired destination. Our scheme fulfills the security and privacy requirements of authentication, confidentiality and conditional privacy preservation. Some cryptographic primitives, including the Elgamal encryption algorithm, AES, randomized anonymous credentials and group signatures, are adopted to achieve this goal. Finally, we analyze the security and the efficiency of the proposed scheme. PMID:28338620

A Secure and Privacy-Preserving Navigation Scheme Using Spatial Crowdsourcing in Fog-Based VANETs.

PubMed

Wang, Lingling; Liu, Guozhu; Sun, Lijun

2017-03-24

Fog-based VANETs (Vehicular ad hoc networks) is a new paradigm of vehicular ad hoc networks with the advantages of both vehicular cloud and fog computing. Real-time navigation schemes based on fog-based VANETs can promote the scheme performance efficiently. In this paper, we propose a secure and privacy-preserving navigation scheme by using vehicular spatial crowdsourcing based on fog-based VANETs. Fog nodes are used to generate and release the crowdsourcing tasks, and cooperatively find the optimal route according to the real-time traffic information collected by vehicles in their coverage areas. Meanwhile, the vehicle performing the crowdsourcing task can get a reasonable reward. The querying vehicle can retrieve the navigation results from each fog node successively when entering its coverage area, and follow the optimal route to the next fog node until it reaches the desired destination. Our scheme fulfills the security and privacy requirements of authentication, confidentiality and conditional privacy preservation. Some cryptographic primitives, including the Elgamal encryption algorithm, AES, randomized anonymous credentials and group signatures, are adopted to achieve this goal. Finally, we analyze the security and the efficiency of the proposed scheme.

Proposed definition of the term en route in en route aircraft noise

NASA Technical Reports Server (NTRS)

Garbell, Maurice A.

1990-01-01

The problem of en route aircraft noise was examined in a formal, dedicated, setting. Whereas the general meaning of the term en route might be intuitively understood, it is suggested that a precise formal definition of the term en route would be opportune from the outset, especially since the scientific and technical investigation of the problem of noise immissions on the ground from aircraft in flight away from the airspace of an airport may conceivably lead to administrative, regulatory, and legal consequences that would mandatorily require a precise definition of the term en route. Five flight segments, with their differing airframe configurations, engine thrusts, and airspeed management, should form the basis for the differential consideration of the noise immissions perceived on the ground underneath or near the defined segments of the flightpath in en route flight, from the end of the initial climb from an airport after takeoff until the final approach to an airport.

ROUTE-SPECIFIC DOSIMETRY

EPA Science Inventory

The capacity to perform route-to-route extrapolation of toxicity data is becoming increasingly crucial to the Agency, with a number of strategies suggested and demonstrated. One strategy involves using a combination of existing data and modeling approaches. This strategy propos...

Kin keepers and good providers: influence of gender socialization on well-being among USA birth cohorts.

PubMed

Salari, S; Zhang, W

2006-09-01

Previous research has suggested happiness and distress differ for men and women over the life course, but little attention has focused on whether the predictors of well-being vary for each group. The second wave of the National Survey of Families and Households (NSFH2) data was used to study whether hypothesized differential exposure to traditional gender socialization has influenced perceptions of life achievement, global happiness and depression for adult men and women in distinct USA birth cohorts. Numerous findings illustrated similarity among cohort and gender groups in predictors of well-being. There was also evidence of a change in USA gender socialization, and determinants of the dependent variables varied according to these shifts by sex and cohort membership. For example, in the earliest born cohort, women's happiness was related to frequency of contact with relatives, consistent with the kin keeper role. Assets and income predicted depression and global happiness for older men, suggesting a link between well-being and the good provider role. In the latest born cohorts, not just androgynous, but opposite influences predominated as men and women demonstrated less evidence of traditional socialization shaping their satisfaction with achievements and psychological well-being.

Near real-time traffic routing

NASA Technical Reports Server (NTRS)

Yang, Chaowei (Inventor); Xie, Jibo (Inventor); Zhou, Bin (Inventor); Cao, Ying (Inventor)

2012-01-01

A near real-time physical transportation network routing system comprising: a traffic simulation computing grid and a dynamic traffic routing service computing grid. The traffic simulator produces traffic network travel time predictions for a physical transportation network using a traffic simulation model and common input data. The physical transportation network is divided into a multiple sections. Each section has a primary zone and a buffer zone. The traffic simulation computing grid includes multiple of traffic simulation computing nodes. The common input data includes static network characteristics, an origin-destination data table, dynamic traffic information data and historical traffic data. The dynamic traffic routing service computing grid includes multiple dynamic traffic routing computing nodes and generates traffic route(s) using the traffic network travel time predictions.

Dynamic Reconfiguration of Security Policies in Wireless Sensor Networks

PubMed Central

Pinto, Mónica; Gámez, Nadia; Fuentes, Lidia; Amor, Mercedes; Horcas, José Miguel; Ayala, Inmaculada

2015-01-01

Providing security and privacy to wireless sensor nodes (WSNs) is very challenging, due to the heterogeneity of sensor nodes and their limited capabilities in terms of energy, processing power and memory. The applications for these systems run in a myriad of sensors with different low-level programming abstractions, limited capabilities and different routing protocols. This means that applications for WSNs need mechanisms for self-adaptation and for self-protection based on the dynamic adaptation of the algorithms used to provide security. Dynamic software product lines (DSPLs) allow managing both variability and dynamic software adaptation, so they can be considered a key technology in successfully developing self-protected WSN applications. In this paper, we propose a self-protection solution for WSNs based on the combination of the INTER-TRUST security framework (a solution for the dynamic negotiation and deployment of security policies) and the FamiWare middleware (a DSPL approach to automatically configure and reconfigure instances of a middleware for WSNs). We evaluate our approach using a case study from the intelligent transportation system domain. PMID:25746093

Class network routing

DOEpatents

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

2009-09-08

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

mizuRoute version 1: A river network routing tool for a continental domain water resources applications

USGS Publications Warehouse

Mizukami, Naoki; Clark, Martyn P.; Sampson, Kevin; Nijssen, Bart; Mao, Yixin; McMillan, Hilary; Viger, Roland; Markstrom, Steven; Hay, Lauren E.; Woods, Ross; Arnold, Jeffrey R.; Brekke, Levi D.

2016-01-01

This paper describes the first version of a stand-alone runoff routing tool, mizuRoute. The mizuRoute tool post-processes runoff outputs from any distributed hydrologic model or land surface model to produce spatially distributed streamflow at various spatial scales from headwater basins to continental-wide river systems. The tool can utilize both traditional grid-based river network and vector-based river network data. Both types of river network include river segment lines and the associated drainage basin polygons, but the vector-based river network can represent finer-scale river lines than the grid-based network. Streamflow estimates at any desired location in the river network can be easily extracted from the output of mizuRoute. The routing process is simulated as two separate steps. First, hillslope routing is performed with a gamma-distribution-based unit-hydrograph to transport runoff from a hillslope to a catchment outlet. The second step is river channel routing, which is performed with one of two routing scheme options: (1) a kinematic wave tracking (KWT) routing procedure; and (2) an impulse response function – unit-hydrograph (IRF-UH) routing procedure. The mizuRoute tool also includes scripts (python, NetCDF operators) to pre-process spatial river network data. This paper demonstrates mizuRoute's capabilities to produce spatially distributed streamflow simulations based on river networks from the United States Geological Survey (USGS) Geospatial Fabric (GF) data set in which over 54 000 river segments and their contributing areas are mapped across the contiguous United States (CONUS). A brief analysis of model parameter sensitivity is also provided. The mizuRoute tool can assist model-based water resources assessments including studies of the impacts of climate change on streamflow.

Developing an eco-routing application.

DOT National Transportation Integrated Search

2014-01-01

The study develops eco-routing algorithms and investigates and quantifies the system-wide impacts of implementing an eco-routing system. Two eco-routing algorithms are developed: one based on vehicle sub-populations (ECO-Subpopulation Feedback Assign...

A Novel QKD-based Secure Edge Router Architecture Design for Burst Confidentiality in Optical Burst Switched Networks

NASA Astrophysics Data System (ADS)

Balamurugan, A. M.; Sivasubramanian, A.

2014-06-01

The Optical Burst Switching (OBS) is an emergent result to the technology issue that could achieve a viable network in future. They have the ability to meet the bandwidth requisite of those applications that call for intensive bandwidth. The field of optical transmission has undergone numerous advancements and is still being researched mainly due to the fact that optical data transmission can be done at enormous speeds. The concept of OBS is still far from perfection facing issues in case of security threat. The transfer of optical switching paradigm to optical burst switching faces serious downfall in the fields of burst aggregation, routing, authentication, dispute resolution and quality of service (QoS). This paper proposes a framework based on QKD based secure edge router architecture design to provide burst confidentiality. The QKD protocol offers high level of confidentiality as it is indestructible. The design architecture was implemented in FPGA using diverse models and the results were taken. The results show that the proposed model is suitable for real time secure routing applications of the Optical burst switched networks.

Routing channels in VLSI layout

NASA Astrophysics Data System (ADS)

Cai, Hong

A number of algorithms for the automatic routing of interconnections in Very Large Scale Integration (VLSI) building-block layouts are presented. Algorithms for the topological definition of channels, the global routing and the geometrical definition of channels are presented. In contrast to traditional approaches the definition and ordering of the channels is done after the global routing. This approach has the advantage that global routing information can be taken into account to select the optimal channel structure. A polynomial algorithm for the channel definition and ordering problem is presented. The existence of a conflict-free channel structure is guaranteed by enforcing a sliceable placement. Algorithms for finding the shortest connection path are described. A separate algorithm is developed for the power net routing, because the two power nets must be planarly routed with variable wire width. An integrated placement and routing system for generating building-block layout is briefly described. Some experimental results and design experiences in using the system are also presented. Very good results are obtained.

Robustness of airline route networks

NASA Astrophysics Data System (ADS)

Lordan, Oriol; Sallan, Jose M.; Escorihuela, Nuria; Gonzalez-Prieto, David

2016-03-01

Airlines shape their route network by defining their routes through supply and demand considerations, paying little attention to network performance indicators, such as network robustness. However, the collapse of an airline network can produce high financial costs for the airline and all its geographical area of influence. The aim of this study is to analyze the topology and robustness of the network route of airlines following Low Cost Carriers (LCCs) and Full Service Carriers (FSCs) business models. Results show that FSC hubs are more central than LCC bases in their route network. As a result, LCC route networks are more robust than FSC networks.

Security issues in healthcare applications using wireless medical sensor networks: a survey.

PubMed

Kumar, Pardeep; Lee, Hoon-Jae

2012-01-01

Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs). Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are highly sensitive. Therefore, security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper discusses the security and privacy issues in healthcare application using WMSNs. We highlight some popular healthcare projects using wireless medical sensor networks, and discuss their security. Our aim is to instigate discussion on these critical issues since the success of healthcare application depends directly on patient security and privacy, for ethic as well as legal reasons. In addition, we discuss the issues with existing security mechanisms, and sketch out the important security requirements for such applications. In addition, the paper reviews existing schemes that have been recently proposed to provide security solutions in wireless healthcare scenarios. Finally, the paper ends up with a summary of open security research issues that need to be explored for future healthcare applications using WMSNs.

Security Issues in Healthcare Applications Using Wireless Medical Sensor Networks: A Survey

PubMed Central

Kumar, Pardeep; Lee, Hoon-Jae

2012-01-01

Healthcare applications are considered as promising fields for wireless sensor networks, where patients can be monitored using wireless medical sensor networks (WMSNs). Current WMSN healthcare research trends focus on patient reliable communication, patient mobility, and energy-efficient routing, as a few examples. However, deploying new technologies in healthcare applications without considering security makes patient privacy vulnerable. Moreover, the physiological data of an individual are highly sensitive. Therefore, security is a paramount requirement of healthcare applications, especially in the case of patient privacy, if the patient has an embarrassing disease. This paper discusses the security and privacy issues in healthcare application using WMSNs. We highlight some popular healthcare projects using wireless medical sensor networks, and discuss their security. Our aim is to instigate discussion on these critical issues since the success of healthcare application depends directly on patient security and privacy, for ethic as well as legal reasons. In addition, we discuss the issues with existing security mechanisms, and sketch out the important security requirements for such applications. In addition, the paper reviews existing schemes that have been recently proposed to provide security solutions in wireless healthcare scenarios. Finally, the paper ends up with a summary of open security research issues that need to be explored for future healthcare applications using WMSNs. PMID:22368458

Protocol Independent Adaptive Route Update for VANET

PubMed Central

Rasheed, Asim; Qayyum, Amir

2014-01-01

High relative node velocity and high active node density have presented challenges to existing routing approaches within highly scaled ad hoc wireless networks, such as Vehicular Ad hoc Networks (VANET). Efficient routing requires finding optimum route with minimum delay, updating it on availability of a better one, and repairing it on link breakages. Current routing protocols are generally focused on finding and maintaining an efficient route, with very less emphasis on route update. Adaptive route update usually becomes impractical for dense networks due to large routing overheads. This paper presents an adaptive route update approach which can provide solution for any baseline routing protocol. The proposed adaptation eliminates the classification of reactive and proactive by categorizing them as logical conditions to find and update the route. PMID:24723807

Route disruption analysis : final report.

DOT National Transportation Integrated Search

2007-01-01

The objective of this project is to analyze the major highway routes in and through Kentucky to determine the potential liabilities associated with disruption of these routes. The analysis assesses the availability of convenient by-pass routes and th...

77 FR 58564 - Agency Information Collection Activities: Declaration for Free Entry of Returned American Products

Federal Register 2010, 2011, 2012, 2013, 2014

2012-09-21

... forms of information technology; and (e) the annual cost burden to respondents or record keepers from... DEPARTMENT OF HOMELAND SECURITY U.S. Customs and Border Protection Agency Information Collection... of an existing collection of information. SUMMARY: As part of its continuing effort to reduce...

What Is the Best Route? Route-Finding Strategies of Middle School Students Using GIS

ERIC Educational Resources Information Center

Wigglesivorth, John C.

2003-01-01

This paper summarizes a research project conducted to investigate the strategies developed by middle school students to solve a route-finding problem using Arc View GIS software. Three different types of route-finding strategies were identified. Some students were visual route-finders and used a highly visual strategy; others were logical route…

Locking mechanism

DOEpatents

Williams, Gary L.; Goin, Jr., Jesse L.; Kirby, Patrick G.; McKenna, John P.

1997-01-01

The invention is a motorized linkage for operating a door strike. A six volt power source, controlled by a security code, rotates a small electric motor when a proper security code is given. The motor rotates a shaft which engages a coil spring. This moves a locking cam. When a catch on the locking cam separates from the locking lever catch, the latch bolt keeper may be manipulated by a user.

Secret weapon: the "new" Medicare as a route to health security.

PubMed

Schlesinger, Mark; Hacker, Jacob S

2007-04-01

Over the past twenty years, Medicare has been transformed from a single-payer insurer into a hybrid of complementary public and private insurance arrangements. Despite creating ongoing controversy, these changes have resulted in an ironic and largely overlooked strategic potential: Medicare's evolving hybrid form makes it the most promising vehicle for overcoming the historical obstacles to universal health insurance in the United States. To make this surprising case, we first explore the distinctive political dynamics of programs that, like today's Medicare, are hybrids of public and private arrangements. We then consider how these political dynamics might circumvent past barriers to universal health insurance. Finally, we discuss the strengths and weaknesses of alternative pathways through which Medicare could be expanded to promote health security.

Producing Gestures Facilitates Route Learning

PubMed Central

So, Wing Chee; Ching, Terence Han-Wei; Lim, Phoebe Elizabeth; Cheng, Xiaoqin; Ip, Kit Yee

2014-01-01

The present study investigates whether producing gestures would facilitate route learning in a navigation task and whether its facilitation effect is comparable to that of hand movements that leave physical visible traces. In two experiments, we focused on gestures produced without accompanying speech, i.e., co-thought gestures (e.g., an index finger traces the spatial sequence of a route in the air). Adult participants were asked to study routes shown in four diagrams, one at a time. Participants reproduced the routes (verbally in Experiment 1 and non-verbally in Experiment 2) without rehearsal or after rehearsal by mentally simulating the route, by drawing it, or by gesturing (either in the air or on paper). Participants who moved their hands (either in the form of gestures or drawing) recalled better than those who mentally simulated the routes and those who did not rehearse, suggesting that hand movements produced during rehearsal facilitate route learning. Interestingly, participants who gestured the routes in the air or on paper recalled better than those who drew them on paper in both experiments, suggesting that the facilitation effect of co-thought gesture holds for both verbal and nonverbal recall modalities. It is possibly because, co-thought gesture, as a kind of representational action, consolidates spatial sequence better than drawing and thus exerting more powerful influence on spatial representation. PMID:25426624

Route visualization using detail lenses.

PubMed

Karnick, Pushpak; Cline, David; Jeschke, Stefan; Razdan, Anshuman; Wonka, Peter

2010-01-01

We present a method designed to address some limitations of typical route map displays of driving directions. The main goal of our system is to generate a printable version of a route map that shows the overview and detail views of the route within a single, consistent visual frame. Our proposed visualization provides a more intuitive spatial context than a simple list of turns. We present a novel multifocus technique to achieve this goal, where the foci are defined by points of interest (POI) along the route. A detail lens that encapsulates the POI at a finer geospatial scale is created for each focus. The lenses are laid out on the map to avoid occlusion with the route and each other, and to optimally utilize the free space around the route. We define a set of layout metrics to evaluate the quality of a lens layout for a given route map visualization. We compare standard lens layout methods to our proposed method and demonstrate the effectiveness of our method in generating aesthetically pleasing layouts. Finally, we perform a user study to evaluate the effectiveness of our layout choices.

An overview of smart grid routing algorithms

NASA Astrophysics Data System (ADS)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

This paper summarizes the typical routing algorithm in smart grid by analyzing the communication business and communication requirements of intelligent grid. Mainly from the two kinds of routing algorithm is analyzed, namely clustering routing algorithm and routing algorithm, analyzed the advantages and disadvantages of two kinds of typical routing algorithm in routing algorithm and applicability.

A Critical Review of Surveys Emphasizing on Routing in Wireless Sensor Networks—An Anatomization under General Survey Design Framework

PubMed Central

2017-01-01

A large number of routing-related surveys are published so far for Wireless Sensor Networks (WSNs) that exhibit either complete or partial emphasis on routing in WSNs. These surveys classify and discuss the relevant routing protocols published mainly in the fields of classical, energy efficient, secure, hierarchical, geographic, intelligent, Quality of Service (QoS)-based and multipath WSNs. However, to the best of our knowledge, no study is presented so far which may clearly categorize the routing-related survey literature for WSNs.To fill this gap, an effort is made in this paper for presenting an in-depth review of already published routing-related survey literature in WSNs. Our review initially proposes a generalized survey design model and afterwards analyzes the routing-related survey literature in the light of the devised General Survey Design Framework (GSDF). Such an analysis describes the design soundness of the published routing-related surveys. Therefore, our review puts forth an original classification based on the frequency-of-survey-publication and taxonomizes the corresponding routing-related fields into high, medium and low focused areas of survey publication in WSNs. Furthermore, the surveys belonging to each main category are sub-categorized into various sub-classes and briefly discussed according to their design characteristics. On the one hand, this review is useful for beginners who may easily explore the already published routing-related survey literature in WSNs in a single document and investigate it by spending less effort. On the other hand, it is useful for expert researchers who may explore the trends and frequency of writing surveys in different areas of routing in WSNs. The experts may explore those areas of routing which are either neglected or least focused or lack in design soundness as per general survey design framework. In the end, insights and future research directions are outlined and a reasonable conclusion is put forth

A Critical Review of Surveys Emphasizing on Routing in Wireless Sensor Networks-An Anatomization under General Survey Design Framework.

PubMed

Rehan, Waqas; Fischer, Stefan; Rehan, Maaz

2017-07-26

A large number of routing-related surveys are published so far for Wireless Sensor Networks (WSNs) that exhibit either complete or partial emphasis on routing in WSNs. These surveys classify and discuss the relevant routing protocols published mainly in the fields of classical, energy efficient, secure, hierarchical, geographic, intelligent, Quality of Service (QoS)-based and multipath WSNs. However, to the best of our knowledge, no study is presented so far which may clearly categorize the routing-related survey literature for WSNs.To fill this gap, an effort is made in this paper for presenting an in-depth review of already published routing-related survey literature in WSNs. Our review initially proposes a generalized survey design model and afterwards analyzes the routing-related survey literature in the light of the devised General Survey Design Framework (GSDF) . Such an analysis describes the design soundness of the published routing-related surveys. Therefore, our review puts forth an original classification based on the frequency-of-survey-publication and taxonomizes the corresponding routing-related fields into high, medium and low focused areas of survey publication in WSNs. Furthermore, the surveys belonging to each main category are sub-categorized into various sub-classes and briefly discussed according to their design characteristics. On the one hand, this review is useful for beginners who may easily explore the already published routing-related survey literature in WSNs in a single document and investigate it by spending less effort. On the other hand, it is useful for expert researchers who may explore the trends and frequency of writing surveys in different areas of routing in WSNs. The experts may explore those areas of routing which are either neglected or least focused or lack in design soundness as per general survey design framework. In the end, insights and future research directions are outlined and a reasonable conclusion is put forth

Single-Layer Wire Routing.

DTIC Science & Technology

1987-08-01

techniques for routing and testing the rout- ability of designs. The design model is ill- suited for the developement of routing algorithms, but the...circular ordering of ca- bles at a feature endpoint. The arrows de - pict the circular ordering of cables at feature ’ 3 cables endpoints p and q. There can...Figure le -1, whose only proper realizations have size fQ(n 2 ). From a practical standpoint, however, the sketch algorithms do not seem as good. Most

Use of levetiracetam in a population of patients aged 65 years and older: a subset analysis of the KEEPER trial.

PubMed

Ferrendelli, J A; French, J; Leppik, I; Morrell, M J; Herbeuval, A; Han, J; Magnus, L

2003-12-01

Levetiracetam (Keppra) was evaluated in a subset of patients aged >/=65 years (n=78) enrolled in a large (n=1030) open-label, phase IV trial (the KEEPER trial). A 4-week dose adjustment was followed by a 12-week evaluation period. An overall median reduction in partial seizures of 80.1% (n=65) was observed. Overall, 76.9% of patients were >/=50% responders, 56.9% were >/=75% responders, and 40.0% were 100% responders. Levetiracetam was well tolerated, with 42.3% of patients reporting one or more adverse events. A total of 15 patients (19.2%) experienced an adverse event that led to discontinuation. Somnolence (n=13,16.7%) and dizziness (n=7,9.0%) were the most commonly reported adverse events. Despite the limitations of the open-label study design, these data provide information regarding the use of levetiracetam as add-on therapy for the treatment of partial-onset seizures in patients >/=65 years of age, including those requiring concomitant medications.

Water dependency and water exploitation at global scale as indicators of water security

NASA Astrophysics Data System (ADS)

De Roo, A. P. J.; Beck, H.; Burek, P.; Bernard, B.

2015-12-01

A water dependency index has been developed indicating the dependency of water consumption from upstream sources of water, sometimes across (multiple) national border. This index is calculated at global scale using the 0.1 global LISFLOOD hydrological modelling system forced by WFDEI meteorological data for the timeframe 1979-2012. The global LISFLOOD model simulates the most important hydrological processes, as well as water abstraction and consumption from various sectors, and flood routing, at daily scale, with sub-timesteps for routing and subgrid parameterization related to elevation and landuse. The model contains also options for water allocation, to allow preferences of water use for particular sectors in water scarce periods. LISFLOOD is also used for the Global Flood Awareness System (GloFAS), the European Flood Awareness System (EFAS), continental scale climate change impact studies on floods and droughts. The water dependency indicator is calculated on a monthly basis, and various annual and multiannual indicators are derived from it. In this study, the indicator will be compared against water security areas known from other studies. Other indicators calculated are the Water Exploitation Index (WEI+), which is a commonly use water security indicator in Europe, and freshwater resources per capita indicators at regional, national and river basin scale. Several climate scnearios are run to indicate future trends in water security.

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

Bley, Andreas; Fortz, Bernard; Gourdin, Eric; Holmberg, Kaj; Klopfenstein, Olivier; Pióro, Michał; Tomaszewski, Artur; Ümit, Hakan

The Internet is a huge world-wide packet switching network comprised of more than 13,000 distinct subnetworks, referred to as Autonomous Systems (ASs) autonomous system AS . They all rely on the Internet Protocol (IP) internet protocol IP for transport of packets across the network. And most of them use shortest path routing protocols shortest path routing!protocols , such as OSPF or IS-IS, to control the routing of IP packets routing!of IP packets within an AS. The idea of the routing is extremely simple — every packet is forwarded on IP links along the shortest route between its source and destination nodes of the AS. The AS network administrator can manage the routing of packets in the AS by supplying the so-called administrative weights of IP links, which specify the link lengths that are used by the routing protocols for their shortest path computations. The main advantage of the shortest path routing policy is its simplicity, allowing for little administrative overhead. From the network engineering perspective, however, shortest path routing can pose problems in achieving satisfactory traffic handling efficiency. As all routing paths depend on the same routing metric routing!metric , it is not possible to configure the routing paths for the communication demands between different pairs of nodes explicitly or individually; the routing can be controlled only indirectly and only as a whole by modifying the routing metric. Thus, one of the main tasks when planning such networks is to find administrative link weights that induce a globally efficient traffic routing

Intelligent routing protocol for ad hoc wireless network

NASA Astrophysics Data System (ADS)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

A novel routing scheme for mobile ad hoc networks (MANETs), which combines hybrid and multi-inter-routing path properties with a distributed topology discovery route mechanism using control agents is proposed in this paper. In recent years, a variety of hybrid routing protocols for Mobile Ad hoc wireless networks (MANETs) have been developed. Which is proactively maintains routing information for a local neighborhood, while reactively acquiring routes to destinations beyond the global. The hybrid protocol reduces routing discovery latency and the end-to-end delay by providing high connectivity without requiring much of the scarce network capacity. On the other side the hybrid routing protocols in MANETs likes Zone Routing Protocol still need route "re-discover" time when a route between zones link break. Sine the topology update information needs to be broadcast routing request on local zone. Due to this delay, the routing protocol may not be applicable for real-time data and multimedia communication. We utilize the advantages of a clustering organization and multi-routing path in routing protocol to achieve several goals at the same time. Firstly, IRP efficiently saves network bandwidth and reduces route reconstruction time when a routing path fails. The IRP protocol does not require global periodic routing advertisements, local control agents will automatically monitor and repair broke links. Secondly, it efficiently reduces congestion and traffic "bottlenecks" for ClusterHeads in clustering network. Thirdly, it reduces significant overheads associated with maintaining clusters. Fourthly, it improves clusters stability due to dynamic topology changing frequently. In this paper, we present the Intelligent Routing Protocol. First, we discuss the problem of routing in ad hoc networks and the motivation of IRP. We describe the hierarchical architecture of IRP. We describe the routing process and illustrate it with an example. Further, we describe the control manage

Dynamic information routing in complex networks

PubMed Central

Kirst, Christoph; Timme, Marc; Battaglia, Demian

2016-01-01

Flexible information routing fundamentally underlies the function of many biological and artificial networks. Yet, how such systems may specifically communicate and dynamically route information is not well understood. Here we identify a generic mechanism to route information on top of collective dynamical reference states in complex networks. Switching between collective dynamics induces flexible reorganization of information sharing and routing patterns, as quantified by delayed mutual information and transfer entropy measures between activities of a network's units. We demonstrate the power of this mechanism specifically for oscillatory dynamics and analyse how individual unit properties, the network topology and external inputs co-act to systematically organize information routing. For multi-scale, modular architectures, we resolve routing patterns at all levels. Interestingly, local interventions within one sub-network may remotely determine nonlocal network-wide communication. These results help understanding and designing information routing patterns across systems where collective dynamics co-occurs with a communication function. PMID:27067257

Protocols for Detection and Removal of Wormholes for Secure Routing and Neighborhood Creation in Wireless Ad Hoc Networks

ERIC Educational Resources Information Center

Hayajneh, Thaier Saleh

2009-01-01

Wireless ad hoc networks are suitable and sometimes the only solution for several applications. Many applications, particularly those in military and critical civilian domains (such as battlefield surveillance and emergency rescue) require that ad hoc networks be secure and stable. In fact, security is one of the main barriers to the extensive use…

Research for annual travel-route changes of reindeer living around the Arctic Circle using satellite remote sensing

NASA Astrophysics Data System (ADS)

Suzuki, G.; Sakka, T.; Tashiro, T.; Kawamata, H.; Tatsuzawa, S.; Naruse, N.; Takahashi, Y.

2017-12-01

For a long time, nomads living in the Arctic Circle around Siberia have been making a living by hunting reindeer traditionally. Wild reindeer have a recurrent migration every year, however, the travel-route of reindeer has been changing recently, so the nomads cannot expect the route in their traditional experience. To support them, one of authors (Tatsuzawa) investigated the route by installing GPS transmitter to some reindeer. The reason of the changing route, however, remain unclear. Previous works indicated that the reason of changing the route must be a global warming, forest fires, thunders, and floods, but they only discuss only on the basis of measurements in specific area. The purpose of this study is to research why the arctic reindeer alter the travel route annually through 1) the annual change of vegetation (NDVI: normalized difference vegetation index) in reindeer ground, and through 2) the annual change of soil water content (mNDWI: modified normalized difference water index) which can be reflected precipitation near Lena river. First, we analyzed NDVI using MODIS images that can be observed over a wide area, filmed in July and August; the reindeer started to travel. We have compared the seasonal changes of the NDVI images with the trace obtained by GPS data from 2010 to 2012. Although NDVI images in July showed similar numerical values in every year, the satellite images taken at August 29 is annually different; NDVI values become lower (0.5 or less) when the reindeer travel to the north area in winter. This suggests that reindeer move to secure enough food in the end of summer. In contrast, mNDWI becomes high when the reindeer travel to the north area. The annual changes of the route may be related to the amount of rainfall.

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2014 CFR

2014-01-01

... routes in the case of certificate holders conducting flag operations) have a width equal to the... width of other approved routes, he considers the following: (1) Terrain clearance. (2) Minimum en route...

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2012 CFR

2012-01-01

... routes in the case of certificate holders conducting flag operations) have a width equal to the... width of other approved routes, he considers the following: (1) Terrain clearance. (2) Minimum en route...

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2013 CFR

2013-01-01

... routes in the case of certificate holders conducting flag operations) have a width equal to the... width of other approved routes, he considers the following: (1) Terrain clearance. (2) Minimum en route...

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2011 CFR

2011-01-01

... routes in the case of certificate holders conducting flag operations) have a width equal to the... width of other approved routes, he considers the following: (1) Terrain clearance. (2) Minimum en route...

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2010 CFR

2010-01-01

... routes in the case of certificate holders conducting flag operations) have a width equal to the... width of other approved routes, he considers the following: (1) Terrain clearance. (2) Minimum en route...

Collective network routing

DOEpatents

Hoenicke, Dirk

2014-12-02

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

Cyber security with radio frequency interferences mitigation study for satellite systems

NASA Astrophysics Data System (ADS)

Wang, Gang; Wei, Sixiao; Chen, Genshe; Tian, Xin; Shen, Dan; Pham, Khanh; Nguyen, Tien M.; Blasch, Erik

2016-05-01

Satellite systems including the Global Navigation Satellite System (GNSS) and the satellite communications (SATCOM) system provide great convenience and utility to human life including emergency response, wide area efficient communications, and effective transportation. Elements of satellite systems incorporate technologies such as navigation with the global positioning system (GPS), satellite digital video broadcasting, and information transmission with a very small aperture terminal (VSAT), etc. The satellite systems importance is growing in prominence with end users' requirement for globally high data rate transmissions; the cost reduction of launching satellites; development of smaller sized satellites including cubesat, nanosat, picosat, and femtosat; and integrating internet services with satellite networks. However, with the promising benefits, challenges remain to fully develop secure and robust satellite systems with pervasive computing and communications. In this paper, we investigate both cyber security and radio frequency (RF) interferences mitigation for satellite systems, and demonstrate that they are not isolated. The action space for both cyber security and RF interferences are firstly summarized for satellite systems, based on which the mitigation schemes for both cyber security and RF interferences are given. A multi-layered satellite systems structure is provided with cross-layer design considering multi-path routing and channel coding, to provide great security and diversity gains for secure and robust satellite systems.

Radiofrequency heating and magnetically induced displacement of dental magnetic attachments during 3.0 T MRI

PubMed Central

Miyata, K; Hasegawa, M; Abe, Y; Tabuchi, T; Namiki, T; Ishigami, T

2012-01-01

Objective The aim of this study was to estimate the risk of injury from dental magnetic attachments due to their radiofrequency (RF) heating and magnetically induced displacement during 3.0 T MRI. Methods To examine the magnetic attachments, we adopted the American Society for Testing and Materials F2182-02a and F2052-06 standards in two MRI systems (Achieva 3.0 T Nova Dual; Philips, Tokyo, Japan, and Signa HDxt 3.0 T; GE Healthcare, Milwaukee, WI). The temperature change was measured in a cylindrical keeper (GIGAUSS D600; GC, Tokyo, Japan) with coping of the casting alloy and a keeper with a dental implant at the maximum specific absorption rate (SAR) for 20 min. To measure the magnetically induced displacement force, three sizes of keepers (GIGAUSS D400, D600 and D1000) were used in deflection angle tests conducted at the point of the maximum magnetic field strength. Results Temperature elevations of both coping and implant were higher in the Signa system than in the Achieva system. The highest temperature changes in the keeper with implant and keeper with coping were 0.6 °C and 0.8 °C in the Signa system, respectively. The temperature increase did not exceed 1.0 °C at any location. The deflection angle (α) was not measurable because it exceeded 90°. GIGAUSS D400 required an extra 3.0 g load to constrain the deflection angle to less than 45°; GIGAUSS D600 and D1000 required 5.0 and 9.0 g loads, respectively. Conclusions Dental magnetic attachments pose no risk due to RF heating and magnetically induced displacement at 3.0 T MRI. However, it is necessary to confirm that these keepers are securely attached to the prosthesis before imaging. PMID:22499128

Bellman Ford algorithm - in Routing Information Protocol (RIP)

NASA Astrophysics Data System (ADS)

Krianto Sulaiman, Oris; Mahmud Siregar, Amir; Nasution, Khairuddin; Haramaini, Tasliyah

2018-04-01

In a large scale network need a routing that can handle a lot number of users, one of the solutions to cope with large scale network is by using a routing protocol, There are 2 types of routing protocol that is static and dynamic, Static routing is manually route input based on network admin, while dynamic routing is automatically route input formed based on existing network. Dynamic routing is efficient used to network extensively because of the input of route automatic formed, Routing Information Protocol (RIP) is one of dynamic routing that uses the bellman-ford algorithm where this algorithm will search for the best path that traversed the network by leveraging the value of each link, so with the bellman-ford algorithm owned by RIP can optimize existing networks.

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

NASA Astrophysics Data System (ADS)

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.

Route guidance strategies revisited: Comparison and evaluation in an asymmetric two-route traffic network

NASA Astrophysics Data System (ADS)

He, Zhengbing; Chen, Bokui; Jia, Ning; Guan, Wei; Lin, Benchuan; Wang, Binghong

2014-12-01

To alleviate traffic congestion, a variety of route guidance strategies have been proposed for intelligent transportation systems. A number of strategies are introduced and investigated on a symmetric two-route traffic network over the past decade. To evaluate the strategies in a more general scenario, this paper conducts eight prevalent strategies on an asymmetric two-route traffic network with different slowdown behaviors on alternative routes. The results show that only mean velocity feedback strategy (MVFS) is able to equalize travel time, i.e. approximate user optimality (UO); while the others fail due to incapability of establishing relations between the feedback parameters and travel time. The paper helps better understand these strategies, and suggests MVFS if the authority intends to achieve user optimality.

Secure data aggregation in wireless sensor networks using homomorphic encryption

NASA Astrophysics Data System (ADS)

Kumar, Manish; Verma, Shekhar; Lata, Kusum

2015-04-01

In a Wireless Sensor Network (WSN), aggregation exploits the correlation between spatially and temporally proximate sensor data to reduce the total data volume to be transmitted to the sink. Mobile agents (MAs) fit into this paradigm, and data can be aggregated and collected by an MA from different sensor nodes using context specific codes. The MA-based data collection suffers due to large size of a typical WSN and is prone to security problems. In this article, homomorphic encryption in a clustered WSN has been proposed for secure and efficient data collection using MAs. The nodes keep encrypted data that are given to an MA for data aggregation tasks. The MA performs all the data aggregation operations upon encrypted data as it migrates between nodes in a tree-like structure in which the nodes are leafs and the cluster head is the root of the tree. It returns and deposits the encrypted aggregated data to the cluster head after traversing through all the intra cluster nodes over a shortest path route. The homomorphic encryption and aggregation processing in encrypted domain makes the data collection process secure. Simulation results confirm the effectiveness of the proposed secure data aggregation mechanism. In addition to security, MA-based mechanism leads to lesser delay and bandwidth requirements.

Impacts of transportation routes on landscape diversity: a comparison of different route types and their combined effects.

PubMed

Su, Shiliang; Xiao, Rui; Li, Delong; Hu, Yi'na

2014-03-01

A comparison of different transportation route types and their combined effects on landscape diversity was conducted within Tiaoxi watershed (China) between 1994 and 2005. Buffer analysis and Mann-Kendall's test were used to quantify the relationships between distance from transportation routes (railway, highway, national, and provincial road) and a family of landscape diversity parameters (Simpson's diversity index, Simpson's evenness index, Shannon's diversity index, and Shannon's evenness index). One-way ANOVA was further applied to compare influences from different route types and their combined effects. Five other landscape metrics (patch density, edge density, area-weighted mean shape index, connectance index, and Euclidean nearest neighbor distance) were also calculated to analyze the associations between landscape diversity and landscape pattern characteristics. Results showed that transportation routes exerted significant impacts on landscape diversity. Impact from railway was comparable to that from highway and national road but was more significant than that from provincial road. The spatial influential range of railway and national road was wider than that of highway and provincial road. Combined effects of routes were nonlinear, and impacts from different route types were more complex than those from the same type. The four landscape diversity metrics were comparably effective at the buffer zone scale. In addition, landscape diversity can be alternatively used to indicate fragmentation, connectivity, and isolation at route buffer scale. This study demonstrates an applicable approach to quantitatively characterize the impacts from transportation routes on landscape patterns and has potential to facilitate route network planning.

Functional localization of a "Time Keeper" function separate from attentional resources and task strategy.

PubMed

Tracy, J I; Faro, S H; Mohamed, F B; Pinsk, M; Pinus, A

2000-03-01

The functional neuroanatomy of time estimation has not been well-documented. This research investigated the fMRI measured brain response to an explicit, prospective time interval production (TIP) task. The study tested for the presence of brain activity reflecting a primary time keeper function, distinct from the brain systems involved either in conscious strategies to monitor time or attentional resource and other cognitive processes to accomplish the task. In the TIP task participants were given a time interval and asked to indicate when it elapsed. Two control tasks (counting forwards, backwards) were administered, in addition to a dual task format of the TIP task. Whole brain images were collected at 1.5 Tesla. Analyses (n = 6) yielded a statistical parametric map (SPM ¿z¿) reflecting time keeping and not strategy (counting, number manipulation) or attention resource utilization. Additional SPM ¿z¿s involving activation associated with the accuracy and magnitude the of time estimation response are presented. Results revealed lateral cerebellar and inferior temporal lobe activation were associated with primary time keeping. Behavioral data provided evidence that the procedures for the explicit time judgements did not occur automatically and utilized controlled processes. Activation sites associated with accuracy, magnitude, and the dual task provided indications of the other structures involved in time estimation that implemented task components related to controlled processing. The data are consistent with prior proposals that the cerebellum is a repository of codes for time processing, but also implicate temporal lobe structures for this type of time estimation task. Copyright 2000 Academic Press.

Zone routing in a torus network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

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

Entanglement-Gradient Routing for Quantum Networks.

PubMed

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.

Masked Proportional Routing

NASA Technical Reports Server (NTRS)

Wolpert, David

2004-01-01

Masked proportional routing is an improved procedure for choosing links between adjacent nodes of a network for the purpose of transporting an entity from a source node ("A") to a destination node ("B"). The entity could be, for example, a physical object to be shipped, in which case the nodes would represent waypoints and the links would represent roads or other paths between waypoints. For another example, the entity could be a message or packet of data to be transmitted from A to B, in which case the nodes could be computer-controlled switching stations and the links could be communication channels between the stations. In yet another example, an entity could represent a workpiece while links and nodes could represent, respectively, manufacturing processes and stages in the progress of the workpiece towards a finished product. More generally, the nodes could represent states of an entity and the links could represent allowed transitions of the entity. The purpose of masked proportional routing and of related prior routing procedures is to schedule transitions of entities from their initial states ("A") to their final states ("B") in such a manner as to minimize a cost or to attain some other measure of optimality or efficiency. Masked proportional routing follows a distributed (in the sense of decentralized) approach to probabilistically or deterministically choosing the links. It was developed to satisfy a need for a routing procedure that 1. Does not always choose the same link(s), even for two instances characterized by identical estimated values of associated cost functions; 2. Enables a graceful transition from one set of links to another set of links as the circumstances of operation of the network change over time; 3. Is preferably amenable to separate optimization of different portions of the network; 4. Is preferably usable in a network in which some of the routing decisions are made by one or more other procedure(s); 5. Preferably does not cause an

Strategies for Selecting Routes through Real-World Environments: Relative Topography, Initial Route Straightness, and Cardinal Direction

PubMed Central

Brunyé, Tad T.; Collier, Zachary A.; Cantelon, Julie; Holmes, Amanda; Wood, Matthew D.; Linkov, Igor; Taylor, Holly A.

2015-01-01

Previous research has demonstrated that route planners use several reliable strategies for selecting between alternate routes. Strategies include selecting straight rather than winding routes leaving an origin, selecting generally south- rather than north-going routes, and selecting routes that avoid traversal of complex topography. The contribution of this paper is characterizing the relative influence and potential interactions of these strategies. We also examine whether individual differences would predict any strategy reliance. Results showed evidence for independent and additive influences of all three strategies, with a strong influence of topography and initial segment straightness, and relatively weak influence of cardinal direction. Additively, routes were also disproportionately selected when they traversed relatively flat regions, had relatively straight initial segments, and went generally south rather than north. Two individual differences, extraversion and sense of direction, predicted the extent of some effects. Under real-world conditions navigators indeed consider a route’s initial straightness, cardinal direction, and topography, but these cues differ in relative influence and vary in their application across individuals. PMID:25992685

Effect of exposure routes on the relationships of lethal toxicity to rats from oral, intravenous, intraperitoneal and intramuscular routes.

PubMed

Ning, Zhong H; Long, Shuang; Zhou, Yuan Y; Peng, Zi Y; Sun, Yi N; Chen, Si W; Su, Li M; Zhao, Yuan H

2015-11-01

The lethal toxicity values (log 1/LD(50)) of 527 aliphatic and aromatic compounds in oral, intravenous, intramuscular and intraperitoneal routes were used to investigate the relationships of log 1/LD(50) from different exposure routes. Regression analysis shows that the log 1/LD(50) values are well correlated between intravenous and intraperitoneal or intramuscular injections. However, the correlations between oral and intravenous or intraperitoneal routes are relatively poor. Comparison of the average residuals indicates that intravenous injection is the most sensitive exposure route and oral administration is the least sensitive exposure route. This is attributed to the difference in kinetic process of toxicity testing. The toxic effect of a chemical can be similar or significantly different between exposure routes, depending on the absorption rates of chemicals into blood. Inclusion of hydrophobic parameter and fractions of ionic forms can improve the correlations between intravenous and intraperitoneal or oral routes, but not between intraperitoneal and oral routes. This is due to the differences of absorption rate in different exposure environments from different routes. Several factors, such as experimental uncertainty, metabolism and toxic kinetics, can affect the correlations between intravenous and intraperitoneal or oral routes. Copyright © 2015 Elsevier Inc. All rights reserved.

Direct trust-based security scheme for RREQ flooding attack in mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Kumar, Sunil; Dutta, Kamlesh

2017-06-01

The routing algorithms in MANETs exhibit distributed and cooperative behaviour which makes them easy target for denial of service (DoS) attacks. RREQ flooding attack is a flooding-type DoS attack in context to Ad hoc On Demand Distance Vector (AODV) routing protocol, where the attacker broadcasts massive amount of bogus Route Request (RREQ) packets to set up the route with the non-existent or existent destination in the network. This paper presents direct trust-based security scheme to detect and mitigate the impact of RREQ flooding attack on the network, in which, every node evaluates the trust degree value of its neighbours through analysing the frequency of RREQ packets originated by them over a short period of time. Taking the node's trust degree value as the input, the proposed scheme is smoothly extended for suppressing the surplus RREQ and bogus RREQ flooding packets at one-hop neighbours during the route discovery process. This scheme distinguishes itself from existing techniques by not directly blocking the service of a normal node due to increased amount of RREQ packets in some unusual conditions. The results obtained throughout the simulation experiments clearly show the feasibility and effectiveness of the proposed defensive scheme.

Assessing the fidelity of the Kin KeeperSM prevention intervention in African American, Latina and Arab women.

PubMed

Ford, Sabrina; Meghea, Cristian; Estes, Tamika; Hamade, Hiam; Lockett, Murlisa; Williams, Karen Patricia

2014-02-01

We evaluated a randomized controlled treatment, utilizing Community Health Workers (CHW) to deliver breast and cervical cancer education intervention to African American, Latina, and Arab women in Detroit and Dearborn, Michigan. The main objectives of the study are to: (1) examine fidelity and consistency of treatment delivery and (2) assess qualitative elements of the intervention. We surveyed 305 women who received the intervention and 16 CHWs Survey included questions regarding the treatment integrity, treatment received, and training provided. Surveys included both quantitative and questions. The intervention group (n = 305) was made up of 48% Black, 11% Latina, and 41% Arab women. Almost all (≥ 90%) women agreed that they received the treatment in the way that it was intended. Sixteen CHWs responded affirmatively as well. Both participants and CHWs indicated that the program was mutually rewarding, indicating that there was "cross fertilization and cross benefit" of working with each other. These benefits served to endorse and confirm that CHWs are a very important mechanism in increasing health literacy in the community and referring underserved individuals to health providers. Second, with strong treatment fidelity the Kin Keeper(SM) program and has the potential to be replicated for a number of diseases in a variety of venues especially for those facing health disparities.

Secure and Time-Aware Communication of Wireless Sensors Monitoring Overhead Transmission Lines.

PubMed

Mazur, Katarzyna; Wydra, Michal; Ksiezopolski, Bogdan

2017-07-11

Existing transmission power grids suffer from high maintenance costs and scalability issues along with a lack of effective and secure system monitoring. To address these problems, we propose to use Wireless Sensor Networks (WSNs) as a technology to achieve energy efficient, reliable, and low-cost remote monitoring of transmission grids. With WSNs, smart grid enables both utilities and customers to monitor, predict and manage energy usage effectively and react to possible power grid disturbances in a timely manner. However, the increased application of WSNs also introduces new security challenges, especially related to privacy, connectivity, and security management, repeatedly causing unpredicted expenditures. Monitoring the status of the power system, a large amount of sensors generates massive amount of sensitive data. In order to build an effective Wireless Sensor Network (WSN) for a smart grid, we focus on designing a methodology of efficient and secure delivery of the data measured on transmission lines. We perform a set of simulations, in which we examine different routing algorithms, security mechanisms and WSN deployments in order to select the parameters that will not affect the delivery time but fulfill their role and ensure security at the same time. Furthermore, we analyze the optimal placement of direct wireless links, aiming at minimizing time delays, balancing network performance and decreasing deployment costs.

14 CFR 221.41 - Routing.

Code of Federal Regulations, 2010 CFR

2010-01-01

...) Individually stated routings—Method of publication. The routing required by paragraph (a) of this section shall... with their respective explanations of the applicable routings shall be arranged in numerical order in...

Be-safe travel, a web-based geographic application to explore safe-route in an area

NASA Astrophysics Data System (ADS)

Utamima, Amalia; Djunaidy, Arif

2017-08-01

In large cities in developing countries, the various forms of criminality are often found. For instance, the most prominent crimes in Surabaya, Indonesia is 3C, that is theft with violence (curas), theft by weighting (curat), and motor vehicle theft (curanmor). 3C case most often occurs on the highway and residential areas. Therefore, new entrants in an area should be aware of these kind of crimes. Route Planners System or route planning system such as Google Maps only consider the shortest distance in the calculation of the optimal route. The selection of the optimal path in this study not only consider the shortest distance, but also involves other factors, namely the security level. This research considers at the need for an application to recommend the safest road to be passed by the vehicle passengers while drive an area. This research propose Be-Safe Travel, a web-based application using Google API that can be accessed by people who like to drive in an area, but still lack of knowledge of the pathways which are safe from crime. Be-Safe Travel is not only useful for the new entrants, but also useful for delivery courier of valuables goods to go through the safest streets.

Routing Protocols in Wireless Sensor Networks

PubMed Central

Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco

2009-01-01

The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks. PMID:22291515

Routing protocols in wireless sensor networks.

PubMed

Villalba, Luis Javier García; Orozco, Ana Lucila Sandoval; Cabrera, Alicia Triviño; Abbas, Cláudia Jacy Barenco

2009-01-01

The applications of wireless sensor networks comprise a wide variety of scenarios. In most of them, the network is composed of a significant number of nodes deployed in an extensive area in which not all nodes are directly connected. Then, the data exchange is supported by multihop communications. Routing protocols are in charge of discovering and maintaining the routes in the network. However, the appropriateness of a particular routing protocol mainly depends on the capabilities of the nodes and on the application requirements. This paper presents a review of the main routing protocols proposed for wireless sensor networks. Additionally, the paper includes the efforts carried out by Spanish universities on developing optimization techniques in the area of routing protocols for wireless sensor networks.

Method and System for Dynamic Automated Corrections to Weather Avoidance Routes for Aircraft in En Route Airspace

NASA Technical Reports Server (NTRS)

McNally, B. David (Inventor); Erzberger, Heinz (Inventor); Sheth, Kapil (Inventor)

2015-01-01

A dynamic weather route system automatically analyzes routes for in-flight aircraft flying in convective weather regions and attempts to find more time and fuel efficient reroutes around current and predicted weather cells. The dynamic weather route system continuously analyzes all flights and provides reroute advisories that are dynamically updated in real time while the aircraft are in flight. The dynamic weather route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

DS-SS with de Bruijn sequences for secure Inter Satellite Links

NASA Astrophysics Data System (ADS)

Spinsante, S.; Warty, C.; Gambi, E.

Today, both the military and commercial sectors are placing an increased emphasis on global communications. This has prompted the development of several Low Earth Orbit satellite systems that promise a worldwide connectivity and real-time voice, data and video communications. Constellations that avoid repeated uplink and downlink work by exploiting Inter Satellite Links have proved to be very economical in space routing. However, traditionally Inter Satellite Links were considered to be out of reach for any malicious activity and thus little, or no security was employed. This paper proposes a secured Inter Satellite Links based network, built upon the adoption of the Direct Sequence Spread Spectrum technique, with binary de Bruijn sequences used as spreading codes. Selected sequences from the de Bruijn family may be used over directional spot beams. The main intent of the paper is to propose a secure and robust communication link for the next generation of satellite communications, relying on a classical spread spectrum approach employing innovative sequences.

49 CFR 571.209 - Standard No. 209; Seat belt assemblies.

Code of Federal Regulations, 2010 CFR

2010-10-01

.... (1) Eye bolts, shoulder bolts, or other bolt used to secure the pelvic restraint of seat belt... connecting webbing to an eye bolt shall be provided with a retaining latch or keeper which shall not move...) Single attachment hook for connecting webbing to any eye bolt shall be tested in the following manner...

Multi-hop routing mechanism for reliable sensor computing.

PubMed

Chen, Jiann-Liang; Ma, Yi-Wei; Lai, Chia-Ping; Hu, Chia-Cheng; Huang, Yueh-Min

2009-01-01

Current research on routing in wireless sensor computing concentrates on increasing the service lifetime, enabling scalability for large number of sensors and supporting fault tolerance for battery exhaustion and broken nodes. A sensor node is naturally exposed to various sources of unreliable communication channels and node failures. Sensor nodes have many failure modes, and each failure degrades the network performance. This work develops a novel mechanism, called Reliable Routing Mechanism (RRM), based on a hybrid cluster-based routing protocol to specify the best reliable routing path for sensor computing. Table-driven intra-cluster routing and on-demand inter-cluster routing are combined by changing the relationship between clusters for sensor computing. Applying a reliable routing mechanism in sensor computing can improve routing reliability, maintain low packet loss, minimize management overhead and save energy consumption. Simulation results indicate that the reliability of the proposed RRM mechanism is around 25% higher than that of the Dynamic Source Routing (DSR) and ad hoc On-demand Distance Vector routing (AODV) mechanisms.

Evaluation of Neurophysiologic and Systematic Changes during Aeromedical Evacuation and en Route Care of Combat Casualties in a Swine Polytrauma Model

DTIC Science & Technology

2014-02-01

Chamber construction has been completed and swine experiments have been initiated. The NMRC Center for Hypobaric Experimentation, Simulation and...Aeromedical evacuation, en-route care, hypobaric conditions, hypobaric chamber, swine model 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF...diminished morbidity and mortality among combat casualties. However, not much is known about the effects of long range aero-medical evacuation in hypobaric

Global Security Scan for Canadian Science Capabilities (2015-2020): Report of Proceedings

DTIC Science & Technology

2008-03-01

apply targeted regulation to communications services such as obligations to save routing information as a way to track child predators, obligatory...what is risk, what does security mean to Canada. Is it on-line porn or a terrorist attack? Define the term then define the most heinous thing that...CoE Sec-Gen statement regarding child predators in cyberspace and Convention being open to additional signatories + ITU Plenipotentiary Conference

Pithy Review on Routing Protocols in Wireless Sensor Networks and Least Routing Time Opportunistic Technique in WSN

NASA Astrophysics Data System (ADS)

Salman Arafath, Mohammed; Rahman Khan, Khaleel Ur; Sunitha, K. V. N.

2018-01-01

Nowadays due to most of the telecommunication standard development organizations focusing on using device-to-device communication so that they can provide proximity-based services and add-on services on top of the available cellular infrastructure. An Oppnets and wireless sensor network play a prominent role here. Routing in these networks plays a significant role in fields such as traffic management, packet delivery etc. Routing is a prodigious research area with diverse unresolved issues. This paper firstly focuses on the importance of Opportunistic routing and its concept then focus is shifted to prime aspect i.e. on packet reception ratio which is one of the highest QoS Awareness parameters. This paper discusses the two important functions of routing in wireless sensor networks (WSN) namely route selection using least routing time algorithm (LRTA) and data forwarding using clustering technique. Finally, the simulation result reveals that LRTA performs relatively better than the existing system in terms of average packet reception ratio and connectivity.

Capacitated vehicle-routing problem model for scheduled solid waste collection and route optimization using PSO algorithm.

PubMed

Hannan, M A; Akhtar, Mahmuda; Begum, R A; Basri, H; Hussain, A; Scavino, Edgar

2018-01-01

Waste collection widely depends on the route optimization problem that involves a large amount of expenditure in terms of capital, labor, and variable operational costs. Thus, the more waste collection route is optimized, the more reduction in different costs and environmental effect will be. This study proposes a modified particle swarm optimization (PSO) algorithm in a capacitated vehicle-routing problem (CVRP) model to determine the best waste collection and route optimization solutions. In this study, threshold waste level (TWL) and scheduling concepts are applied in the PSO-based CVRP model under different datasets. The obtained results from different datasets show that the proposed algorithmic CVRP model provides the best waste collection and route optimization in terms of travel distance, total waste, waste collection efficiency, and tightness at 70-75% of TWL. The obtained results for 1 week scheduling show that 70% of TWL performs better than all node consideration in terms of collected waste, distance, tightness, efficiency, fuel consumption, and cost. The proposed optimized model can serve as a valuable tool for waste collection and route optimization toward reducing socioeconomic and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

A Routing Path Construction Method for Key Dissemination Messages in Sensor Networks

PubMed Central

Moon, Soo Young; Cho, Tae Ho

2014-01-01

Authentication is an important security mechanism for detecting forged messages in a sensor network. Each cluster head (CH) in dynamic key distribution schemes forwards a key dissemination message that contains encrypted authentication keys within its cluster to next-hop nodes for the purpose of authentication. The forwarding path of the key dissemination message strongly affects the number of nodes to which the authentication keys in the message are actually distributed. We propose a routing method for the key dissemination messages to increase the number of nodes that obtain the authentication keys. In the proposed method, each node selects next-hop nodes to which the key dissemination message will be forwarded based on secret key indexes, the distance to the sink node, and the energy consumption of its neighbor nodes. The experimental results show that the proposed method can increase by 50–70% the number of nodes to which authentication keys in each cluster are distributed compared to geographic and energy-aware routing (GEAR). In addition, the proposed method can detect false reports earlier by using the distributed authentication keys, and it consumes less energy than GEAR when the false traffic ratio (FTR) is ≥10%. PMID:25136649

Understanding Route Aggregation

DTIC Science & Technology

2010-03-09

routing anomalies, and is fingered to be the cause of many reported loops and blackholes . In this paper, we posit that the problem arises from a lack of...Route aggre- gation can also result in blackholes [18], which are surprisingly prevalent in the Internet [11]. We illustrate these known anomalies with...advertisement Forwarding paths A B C 10.1.30.0/24 10.1.16.0/22 10.1.16.0/2010.1.16.0/20 Figure 4: Illustration of a blackhole . forwards the packet to Y

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions.

PubMed

Khan, Anwar; Ali, Ihsan; Ghani, Abdullah; Khan, Nawsher; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-05-18

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described

Routing Protocols for Underwater Wireless Sensor Networks: Taxonomy, Research Challenges, Routing Strategies and Future Directions

PubMed Central

Ghani, Abdullah; Alsaqer, Mohammed; Rahman, Atiq Ur; Mahmood, Hasan

2018-01-01

Recent research in underwater wireless sensor networks (UWSNs) has gained the attention of researchers in academia and industry for a number of applications. They include disaster and earthquake prediction, water quality and environment monitoring, leakage and mine detection, military surveillance and underwater navigation. However, the aquatic medium is associated with a number of limitations and challenges: long multipath delay, high interference and noise, harsh environment, low bandwidth and limited battery life of the sensor nodes. These challenges demand research techniques and strategies to be overcome in an efficient and effective fashion. The design of routing protocols for UWSNs is one of the promising solutions to cope with these challenges. This paper presents a survey of the routing protocols for UWSNs. For the ease of description, the addressed routing protocols are classified into two groups: localization-based and localization-free protocols. These groups are further subdivided according to the problems they address or the major parameters they consider during routing. Unlike the existing surveys, this survey considers only the latest and state-of-the-art routing protocols. In addition, every protocol is described in terms of its routing strategy and the problem it addresses and solves. The merit(s) of each protocol is (are) highlighted along with the cost. A description of the protocols in this fashion has a number of advantages for researchers, as compared to the existing surveys. Firstly, the description of the routing strategy of each protocol makes its routing operation easily understandable. Secondly, the demerit(s) of a protocol provides (provide) insight into overcoming its flaw(s) in future investigation. This, in turn, leads to the foundation of new protocols that are more intelligent, robust and efficient with respect to the desired parameters. Thirdly, a protocol can be selected for the appropriate application based on its described

Astrocytes as gate-keepers in optic nerve regeneration--a mini-review.

PubMed

García, Dana M; Koke, Joseph R

2009-02-01

has been done. In fish, vigorously growing neurites sprout from the cut axons and within a few days begin to re-enervate the brain. This review offers a new perspective on the role of glia, particularly astrocytes, as "gate-keepers;" i.e., as being permissive or inhibitory, by comparison between fish and mammals of glial function during ONR.

APPLICATION AND USE OF DOSE ESTIMATING EXPOSURE MODEL (DEEM) FOR ROUTE TO ROUTE DOSE COMPARISONS AFTER EXPOSURE TO TRICHLOROETHYLENE (TCE)

EPA Science Inventory

Route-to-route extrapolations are a crucial step in many risk assessments. Often the doses which result In toxicological end points in one route must be compared with doses resulting from typical environmental exposures by another route. In this case we used EPA's Dose Estimati...

A TOTP-Based Enhanced Route Optimization Procedure for Mobile IPv6 to Reduce Handover Delay and Signalling Overhead

PubMed Central

Shah, Peer Azmat; Hasbullah, Halabi B.; Lawal, Ibrahim A.; Aminu Mu'azu, Abubakar; Tang Jung, Low

2014-01-01

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO). PMID:24688398

A TOTP-based enhanced route optimization procedure for mobile IPv6 to reduce handover delay and signalling overhead.

PubMed

Shah, Peer Azmat; Hasbullah, Halabi B; Lawal, Ibrahim A; Aminu Mu'azu, Abubakar; Tang Jung, Low

2014-01-01

Due to the proliferation of handheld mobile devices, multimedia applications like Voice over IP (VoIP), video conferencing, network music, and online gaming are gaining popularity in recent years. These applications are well known to be delay sensitive and resource demanding. The mobility of mobile devices, running these applications, across different networks causes delay and service disruption. Mobile IPv6 was proposed to provide mobility support to IPv6-based mobile nodes for continuous communication when they roam across different networks. However, the Route Optimization procedure in Mobile IPv6 involves the verification of mobile node's reachability at the home address and at the care-of address (home test and care-of test) that results in higher handover delays and signalling overhead. This paper presents an enhanced procedure, time-based one-time password Route Optimization (TOTP-RO), for Mobile IPv6 Route Optimization that uses the concepts of shared secret Token, time based one-time password (TOTP) along with verification of the mobile node via direct communication and maintaining the status of correspondent node's compatibility. The TOTP-RO was implemented in network simulator (NS-2) and an analytical analysis was also made. Analysis showed that TOTP-RO has lower handover delays, packet loss, and signalling overhead with an increased level of security as compared to the standard Mobile IPv6's Return-Routability-based Route Optimization (RR-RO).

Route monitoring program FY 1994

DOT National Transportation Integrated Search

1994-12-01

In Fiscal Year 1994, the Transit Authority of River City (TARC) Kentucky's Research Department completed an on-board ride check of 32 routes. This data was collected and compiled to measure the effectiveness and efficiency of TARC Service on a route ...

Key on demand (KoD) for software-defined optical networks secured by quantum key distribution (QKD).

PubMed

Cao, Yuan; Zhao, Yongli; Colman-Meixner, Carlos; Yu, Xiaosong; Zhang, Jie

2017-10-30

Software-defined optical networking (SDON) will become the next generation optical network architecture. However, the optical layer and control layer of SDON are vulnerable to cyberattacks. While, data encryption is an effective method to minimize the negative effects of cyberattacks, secure key interchange is its major challenge which can be addressed by the quantum key distribution (QKD) technique. Hence, in this paper we discuss the integration of QKD with WDM optical networks to secure the SDON architecture by introducing a novel key on demand (KoD) scheme which is enabled by a novel routing, wavelength and key assignment (RWKA) algorithm. The QKD over SDON with KoD model follows two steps to provide security: i) quantum key pools (QKPs) construction for securing the control channels (CChs) and data channels (DChs); ii) the KoD scheme uses RWKA algorithm to allocate and update secret keys for different security requirements. To test our model, we define a security probability index which measures the security gain in CChs and DChs. Simulation results indicate that the security performance of CChs and DChs can be enhanced by provisioning sufficient secret keys in QKPs and performing key-updating considering potential cyberattacks. Also, KoD is beneficial to achieve a positive balance between security requirements and key resource usage.

Distributed multiple path routing in complex networks

NASA Astrophysics Data System (ADS)

Chen, Guang; Wang, San-Xiu; Wu, Ling-Wei; Mei, Pan; Yang, Xu-Hua; Wen, Guang-Hui

2016-12-01

Routing in complex transmission networks is an important problem that has garnered extensive research interest in the recent years. In this paper, we propose a novel routing strategy called the distributed multiple path (DMP) routing strategy. For each of the O-D node pairs in a given network, the DMP routing strategy computes and stores multiple short-length paths that overlap less with each other in advance. And during the transmission stage, it rapidly selects an actual routing path which provides low transmission cost from the pre-computed paths for each transmission task, according to the real-time network transmission status information. Computer simulation results obtained for the lattice, ER random, and scale-free networks indicate that the strategy can significantly improve the anti-congestion ability of transmission networks, as well as provide favorable routing robustness against partial network failures.

A Survey on Underwater Acoustic Sensor Network Routing Protocols.

PubMed

Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

2016-03-22

Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research.

A Survey on Underwater Acoustic Sensor Network Routing Protocols

PubMed Central

Li, Ning; Martínez, José-Fernán; Meneses Chaus, Juan Manuel; Eckert, Martina

2016-01-01

Underwater acoustic sensor networks (UASNs) have become more and more important in ocean exploration applications, such as ocean monitoring, pollution detection, ocean resource management, underwater device maintenance, etc. In underwater acoustic sensor networks, since the routing protocol guarantees reliable and effective data transmission from the source node to the destination node, routing protocol design is an attractive topic for researchers. There are many routing algorithms have been proposed in recent years. To present the current state of development of UASN routing protocols, we review herein the UASN routing protocol designs reported in recent years. In this paper, all the routing protocols have been classified into different groups according to their characteristics and routing algorithms, such as the non-cross-layer design routing protocol, the traditional cross-layer design routing protocol, and the intelligent algorithm based routing protocol. This is also the first paper that introduces intelligent algorithm-based UASN routing protocols. In addition, in this paper, we investigate the development trends of UASN routing protocols, which can provide researchers with clear and direct insights for further research. PMID:27011193

Secure real-time wireless video streaming in the aeronautical telecommunications network

NASA Astrophysics Data System (ADS)

Czernik, Pawel; Olszyna, Jakub

2010-09-01

As Air Traffic Control Systems move from a voice only environment to one in which clearances are issued via data link, there is a risk that an unauthorized entity may attempt to masquerade as either the pilot or controller. In order to protect against this and related attacks, air-ground communications must be secured. The challenge is to add security in an environment in which bandwidth is limited. The Aeronautical Telecommunications Network (ATN) is an enabling digital network communications technology that addresses capacity and efficiency issues associated with current aeronautical voice communication systems. Equally important, the ATN facilitates migration to free flight, where direct computer-to-computer communication will automate air traffic management, minimize controller and pilot workload, and improve overall aircraft routing efficiency. Protecting ATN communications is critical since safety-of-flight is seriously affected if an unauthorized entity, a hacker for example, is able to penetrate an otherwise reliable communications system and accidentally or maliciously introduce erroneous information that jeopardizes the overall safety and integrity of a given airspace. However, an ATN security implementation must address the challenges associated with aircraft mobility, limited bandwidth communication channels, and uninterrupted operation across organizational and geopolitical boundaries. This paper provides a brief overview of the ATN, the ATN security concept, and begins a basic introduction to the relevant security concepts of security threats, security services and security mechanisms. Security mechanisms are further examined by presenting the fundamental building blocks of symmetric encipherment, asymmetric encipherment, and hash functions. The second part of this paper presents the project of cryptographiclly secure wireless communication between Unmanned Aerial Vehicles (UAV) and the ground station in the ATM system, based on the ARM9 processor

Robust Dynamic Multi-objective Vehicle Routing Optimization Method.

PubMed

Guo, Yi-Nan; Cheng, Jian; Luo, Sha; Gong, Dun-Wei

2017-03-21

For dynamic multi-objective vehicle routing problems, the waiting time of vehicle, the number of serving vehicles, the total distance of routes were normally considered as the optimization objectives. Except for above objectives, fuel consumption that leads to the environmental pollution and energy consumption was focused on in this paper. Considering the vehicles' load and the driving distance, corresponding carbon emission model was built and set as an optimization objective. Dynamic multi-objective vehicle routing problems with hard time windows and randomly appeared dynamic customers, subsequently, were modeled. In existing planning methods, when the new service demand came up, global vehicle routing optimization method was triggered to find the optimal routes for non-served customers, which was time-consuming. Therefore, robust dynamic multi-objective vehicle routing method with two-phase is proposed. Three highlights of the novel method are: (i) After finding optimal robust virtual routes for all customers by adopting multi-objective particle swarm optimization in the first phase, static vehicle routes for static customers are formed by removing all dynamic customers from robust virtual routes in next phase. (ii)The dynamically appeared customers append to be served according to their service time and the vehicles' statues. Global vehicle routing optimization is triggered only when no suitable locations can be found for dynamic customers. (iii)A metric measuring the algorithms' robustness is given. The statistical results indicated that the routes obtained by the proposed method have better stability and robustness, but may be sub-optimum. Moreover, time-consuming global vehicle routing optimization is avoided as dynamic customers appear.

Fatigue mitigation effects of en-route napping on commercial airline pilots flying international routes

NASA Astrophysics Data System (ADS)

Baldwin, Jarret Taylor

The introduction of ultra-long range commercial aircraft and the evolution of the commercial airline industry has provided new opportunities for air carriers to fly longer range international route segments while deregulation, industry consolidation, and the constant drive to reduce costs wherever possible has pressured airline managements to seek more productivity from their pilots. At the same time, advancements in the understanding of human physiology have begun to make their way into flight and duty time regulations and airline scheduling practices. In this complex and ever changing operating environment, there remains an essential need to better understand how these developments, and other daily realities facing commercial airline pilots, are affecting their fatigue management strategies as they go about their rituals of getting to and from their homes to work and performing their flight assignments. Indeed, the need for commercial airline pilots to have access to better and more effective fatigue mitigation tools to combat fatigue and insure that they are well rested and at the top of their game when flying long-range international route segments has never been greater. This study examined to what extent the maximum fatigue states prior to napping, as self-accessed by commercial airline pilots flying international route segments, were affected by a number of other common flight assignment related factors. The study also examined to what extent the availability of scheduled en-route rest opportunities, in an onboard crew rest facility, affected the usage of en-route napping as a fatigue mitigation strategy, and to what extent the duration of such naps affected the perceived benefits of such naps as self-accessed by commercial airline pilots flying international route segments. The study utilized an online survey tool to collect data on crew position, prior flight segments flown in the same duty period, augmentation, commuting, pre-flight rest obtained in the

Secure and Time-Aware Communication of Wireless Sensors Monitoring Overhead Transmission Lines

PubMed Central

Mazur, Katarzyna; Wydra, Michal; Ksiezopolski, Bogdan

2017-01-01

Existing transmission power grids suffer from high maintenance costs and scalability issues along with a lack of effective and secure system monitoring. To address these problems, we propose to use Wireless Sensor Networks (WSNs)as a technology to achieve energy efficient, reliable, and low-cost remote monitoring of transmission grids. With WSNs, smart grid enables both utilities and customers to monitor, predict and manage energy usage effectively and react to possible power grid disturbances in a timely manner. However, the increased application of WSNs also introduces new security challenges, especially related to privacy, connectivity, and security management, repeatedly causing unpredicted expenditures. Monitoring the status of the power system, a large amount of sensors generates massive amount of sensitive data. In order to build an effective Wireless Sensor Networks (WSNs) for a smart grid, we focus on designing a methodology of efficient and secure delivery of the data measured on transmission lines. We perform a set of simulations, in which we examine different routing algorithms, security mechanisms and WSN deployments in order to select the parameters that will not affect the delivery time but fulfill their role and ensure security at the same time. Furthermore, we analyze the optimal placement of direct wireless links, aiming at minimizing time delays, balancing network performance and decreasing deployment costs. PMID:28696390

Central East Pacific Flight Routing

NASA Technical Reports Server (NTRS)

Grabbe, Shon; Sridhar, Banavar; Kopardekar, Parimal; Cheng, Nadia

2006-01-01

With the introduction of the Federal Aviation Administration s Advanced Technology and Oceanic Procedures system at the Oakland Oceanic Center, a level of automation now exists in the oceanic environment to potentially begin accommodating increased user preferred routing requests. This paper presents the results of an initial feasibility assessment which examines the potential benefits of transitioning from the fixed Central East Pacific routes to user preferred routes. As a surrogate for the actual user-provided routing requests, a minimum-travel-time, wind-optimal dynamic programming algorithm was developed and utilized in this paper. After first describing the characteristics (e.g., origin airport, destination airport, vertical distribution and temporal distribution) of the westbound flights utilizing the Central East Pacific routes on Dec. 14-16 and 19-20, the results of both a flight-plan-based simulation and a wind-optimal-based simulation are presented. Whereas the lateral and longitudinal distribution of the aircraft trajectories in these two simulations varied dramatically, the number of simulated first-loss-of-separation events remained relatively constant. One area of concern that was uncovered in this initial analysis was a potential workload issue associated with the redistribution of traffic in the oceanic sectors due to thc prevailing wind patterns.

Cascade defense via routing in complex networks

NASA Astrophysics Data System (ADS)

Xu, Xiao-Lan; Du, Wen-Bo; Hong, Chen

2015-05-01

As the cascading failures in networked traffic systems are becoming more and more serious, research on cascade defense in complex networks has become a hotspot in recent years. In this paper, we propose a traffic-based cascading failure model, in which each packet in the network has its own source and destination. When cascade is triggered, packets will be redistributed according to a given routing strategy. Here, a global hybrid (GH) routing strategy, which uses the dynamic information of the queue length and the static information of nodes' degree, is proposed to defense the network cascade. Comparing GH strategy with the shortest path (SP) routing, efficient routing (ER) and global dynamic (GD) routing strategies, we found that GH strategy is more effective than other routing strategies in improving the network robustness against cascading failures. Our work provides insight into the robustness of networked traffic systems.

Assessing the fidelity of the Kin KeeperSM prevention intervention in African American, Latina and Arab women

PubMed Central

Ford, Sabrina; Meghea, Cristian; Estes, Tamika; Hamade, Hiam; Lockett, Murlisa; Williams, Karen Patricia

2014-01-01

Background: We evaluated a randomized controlled treatment, utilizing Community Health Workers (CHW) to deliver breast and cervical cancer education intervention to African American, Latina, and Arab women in Detroit and Dearborn, Michigan. The main objectives of the study are to: (1) examine fidelity and consistency of treatment delivery and (2) assess qualitative elements of the intervention. Methods: We surveyed 305 women who received the intervention and 16 CHWs Survey included questions regarding the treatment integrity, treatment received, and training provided. Surveys included both quantitative and questions. Results: The intervention group (n = 305) was made up of 48% Black, 11% Latina, and 41% Arab women. Almost all (≥ 90%) women agreed that they received the treatment in the way that it was intended. Sixteen CHWs responded affirmatively as well. Conclusions: Both participants and CHWs indicated that the program was mutually rewarding, indicating that there was “cross fertilization and cross benefit” of working with each other. These benefits served to endorse and confirm that CHWs are a very important mechanism in increasing health literacy in the community and referring underserved individuals to health providers. Second, with strong treatment fidelity the Kin KeeperSM program and has the potential to be replicated for a number of diseases in a variety of venues especially for those facing health disparities. PMID:24122323

The Time Window Vehicle Routing Problem Considering Closed Route

NASA Astrophysics Data System (ADS)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

The Vehicle Routing Problem (VRP) determines the optimal set of routes used by a fleet of vehicles to serve a given set of customers on a predefined graph; the objective is to minimize the total travel cost (related to the travel times or distances) and operational cost (related to the number of vehicles used). In this paper we study a variant of the predefined graph: given a weighted graph G and vertices a and b, and given a set X of closed paths in G, find the minimum total travel cost of a-b path P such that no path in X is a subpath of P. Path P is allowed to repeat vertices and edges. We use integer programming model to describe the problem. A feasible neighbourhood approach is proposed to solve the model

Vehicle routing problem and capacitated vehicle routing problem frameworks in fund allocation problem

NASA Astrophysics Data System (ADS)

Mamat, Nur Jumaadzan Zaleha; Jaaman, Saiful Hafizah; Ahmad, Rokiah@Rozita

2016-11-01

Two new methods adopted from methods commonly used in the field of transportation and logistics are proposed to solve a specific issue of investment allocation problem. Vehicle routing problem and capacitated vehicle routing methods are applied to optimize the fund allocation of a portfolio of investment assets. This is done by determining the sequence of the assets. As a result, total investment risk is minimized by this sequence.

A Machine Learning Concept for DTN Routing

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

This paper discusses the concept and architecture of a machine learning based router for delay tolerant space networks. The techniques of reinforcement learning and Bayesian learning are used to supplement the routing decisions of the popular Contact Graph Routing algorithm. An introduction to the concepts of Contact Graph Routing, Q-routing and Naive Bayes classification are given. The development of an architecture for a cross-layer feedback framework for DTN (Delay-Tolerant Networking) protocols is discussed. Finally, initial simulation setup and results are given.

Proactive routing mutation against stealthy Distributed Denial of Service attacks: metrics, modeling, and analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Duan, Qi; Al-Shaer, Ehab; Chatterjee, Samrat

The Infrastructure Distributed Denial of Service (IDDoS) attacks continue to be one of the most devastating challenges facing cyber systems. The new generation of IDDoS attacks exploit the inherent weakness of cyber infrastructure including deterministic nature of routes, skew distribution of flows, and Internet ossification to discover the network critical links and launch highly stealthy flooding attacks that are not observable at the victim end. In this paper, first, we propose a new metric to quantitatively measure the potential susceptibility of any arbitrary target server or domain to stealthy IDDoS attacks, and es- timate the impact of such susceptibility onmore » enterprises. Second, we develop a proactive route mutation technique to minimize the susceptibility to these attacks by dynamically changing the flow paths periodically to invalidate the adversary knowledge about the network and avoid targeted critical links. Our proposed approach actively changes these network paths while satisfying security and qualify of service requirements. We present an integrated approach of proactive route mutation that combines both infrastructure-based mutation that is based on reconfiguration of switches and routers, and middle-box approach that uses an overlay of end-point proxies to construct a virtual network path free of critical links to reach a destination. We implemented the proactive path mutation technique on a Software Defined Network using the OpendDaylight controller to demonstrate a feasible deployment of this approach. Our evaluation validates the correctness, effectiveness, and scalability of the proposed approaches.« less

Routing to preserve energy in wireless networks

NASA Astrophysics Data System (ADS)

Block, Frederick J., IV

Many applications for wireless radio networks require that some or all radios in the network rely on batteries as energy sources. In many cases, battery replacement is infeasible, expensive, or impossible. Communication protocols for such networks should be designed to preserve limited energy supplies. Because the choice of a route to a traffic sink influences how often radios must transmit and receive, poor route selection can quickly deplete the batteries of certain nodes. Previous work has shown that a network's lifetime can be extended by assigning higher routing costs to nodes with little remaining energy and nodes that must use high transmitter power to reach neighbor radios. Although using remaining energy levels in routing metrics can increase network lifetime, in practice, there may be significant error in a node's estimate of its battery level. The effect of battery level uncertainty on routing is examined. Routing metrics are presented that are designed to explicitly account for uncertainty in remaining energy. Simulation results using several statistical models for this uncertainty show that the proposed metrics perform well. In addition to knowledge of current battery levels, estimates of how quickly radios are consuming energy may be helpful in extending network lifetime. We present a family of routing metrics that incorporate a radio's rate of energy consumption. Simulation results show that the proposed family of metrics performs well under a variety of traffic models and network topologies. Route selection can also be complicated by time-varying link conditions. Radios may be subject to interference from other nearby communication systems, hostile jammers, and other, non-communication sources of noise. A route that first appears to have only a small cost may later require much greater energy expenditure when transmitting packets. Frequent route selection can help radios avoid using links with interference, but additional routing control messages

Integer Optimization Model for a Logistic System based on Location-Routing Considering Distance and Chosen Route

NASA Astrophysics Data System (ADS)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

In a distribution network it is important to decide the locations of facilities that impacts not only the profitability of an organization but the ability to serve customers.Generally the location-routing problem is to minimize the overall cost by simultaneously selecting a subset of candidate facilities and constructing a set of delivery routes that satisfy some restrictions. In this paper we impose restriction on the route that should be passed for delivery. We use integer programming model to describe the problem. A feasible neighbourhood search is proposed to solve the result model.

A graph-theoretic method to quantify the airline route authority

NASA Technical Reports Server (NTRS)

Chan, Y.

1979-01-01

The paper introduces a graph-theoretic method to quantify the legal statements in route certificate which specifies the airline routing restrictions. All the authorized nonstop and multistop routes, including the shortest time routes, can be obtained, and the method suggests profitable route structure alternatives to airline analysts. This method to quantify the C.A.B. route authority was programmed in a software package, Route Improvement Synthesis and Evaluation, and demonstrated in a case study with a commercial airline. The study showed the utility of this technique in suggesting route alternatives and the possibility of improvements in the U.S. route system.

Route Generation for a Synthetic Character (BOT) Using a Partial or Incomplete Knowledge Route Generation Algorithm in UT2004 Virtual Environment

NASA Technical Reports Server (NTRS)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

This paper presents a new Route Generation Algorithm that accurately and realistically represents human route planning and navigation for Military Operations in Urban Terrain (MOUT). The accuracy of this algorithm in representing human behavior is measured using the Unreal Tournament(Trademark) 2004 (UT2004) Game Engine to provide the simulation environment in which the differences between the routes taken by the human player and those of a Synthetic Agent (BOT) executing the A-star algorithm and the new Route Generation Algorithm can be compared. The new Route Generation Algorithm computes the BOT route based on partial or incomplete knowledge received from the UT2004 game engine during game play. To allow BOT navigation to occur continuously throughout the game play with incomplete knowledge of the terrain, a spatial network model of the UT2004 MOUT terrain is captured and stored in an Oracle 11 9 Spatial Data Object (SOO). The SOO allows a partial data query to be executed to generate continuous route updates based on the terrain knowledge, and stored dynamic BOT, Player and environmental parameters returned by the query. The partial data query permits the dynamic adjustment of the planned routes by the Route Generation Algorithm based on the current state of the environment during a simulation. The dynamic nature of this algorithm more accurately allows the BOT to mimic the routes taken by the human executing under the same conditions thereby improving the realism of the BOT in a MOUT simulation environment.

Routing Based on Length of Time of Available Connection

NASA Technical Reports Server (NTRS)

Anandappan, Thanga (Inventor); Roy, Aloke (Inventor); Malve, Sharath Babu (Inventor); Toth, Louis T. (Inventor)

2016-01-01

In an embodiment, a method of routing packets at a first node in an ad-hoc network is provided. The method includes receiving, at the first node, a plurality of route-alive messages corresponding to a destination, each of the plurality of route-alive messages including a route time indicating a length of time in which a communicative connection is available between the second node that sent the respective route-alive message and the destination. The method also includes determining an updated route time for each second node. The updated route time corresponds to a length of time in which a communication connection is available between the first node and the destination through the respective second node. A second node is selected for sending a packet to based on the updated route time for each of the second nodes, wherein a node having a longer updated route time is given higher priority for selection.

The Route Analysis Based On Flight Plan

NASA Astrophysics Data System (ADS)

Feriyanto, Nur; Saleh, Chairul; Fauzi, Achmad; Rachman Dzakiyullah, Nur; Riza Iwaputra, Kahfi

2016-02-01

Economic development effects use of air transportation since the business process in every aspect was increased. Many people these days was prefer using airplane because it can save time and money. This situation also effects flight routes, many airlines offer new routes to deal with competition. Managing flight routes is one of the problems that must be faced in order to find the efficient and effective routes. This paper investigates the best routes based on flight performance by determining the amount of block fuel for the Jakarta-Denpasar flight route. Moreover, in this work compares a two kinds of aircraft and tracks by calculating flight distance, flight time and block fuel. The result shows Jakarta-Denpasar in the Track II has effective and efficient block fuel that can be performed by Airbus 320-200 aircraft. This study can contribute to practice in making an effective decision, especially helping executive management of company due to selecting appropriate aircraft and the track in the flight plan based on the block fuel consumption for business operation.

Using Ant Colony Optimization for Routing in VLSI Chips

NASA Astrophysics Data System (ADS)

Arora, Tamanna; Moses, Melanie

2009-04-01

Rapid advances in VLSI technology have increased the number of transistors that fit on a single chip to about two billion. A frequent problem in the design of such high performance and high density VLSI layouts is that of routing wires that connect such large numbers of components. Most wire-routing problems are computationally hard. The quality of any routing algorithm is judged by the extent to which it satisfies routing constraints and design objectives. Some of the broader design objectives include minimizing total routed wire length, and minimizing total capacitance induced in the chip, both of which serve to minimize power consumed by the chip. Ant Colony Optimization algorithms (ACO) provide a multi-agent framework for combinatorial optimization by combining memory, stochastic decision and strategies of collective and distributed learning by ant-like agents. This paper applies ACO to the NP-hard problem of finding optimal routes for interconnect routing on VLSI chips. The constraints on interconnect routing are used by ants as heuristics which guide their search process. We found that ACO algorithms were able to successfully incorporate multiple constraints and route interconnects on suite of benchmark chips. On an average, the algorithm routed with total wire length 5.5% less than other established routing algorithms.

Space Act Agreement Maker (SAAM) With Electronic Routing System (ERouter) Developed

NASA Technical Reports Server (NTRS)

Stauber, Laurel J.

2003-01-01

Members of the Commercial Technology Office at the NASA Glenn Research Center have developed an exciting new tool that greatly reduces the lead time in creating and routing Space Act Agreements. The Space Act Agreement Maker (SAAM) is an e-government Web-based system that automates the initial drafting of Space Act Agreements by technical and program personnel. SAAM also is used for editing and will be used later for maintaining electronic copies of all Space Act Agreements. During the initial drafting, the software prompts NASA personnel proposing an agreement to answer questions regarding the agreement. On the basis of the answers, the software selects from a matrix of NASA standard clauses to produce a first draft of the agreement. The draft agreement and information submitted by the NASA personnel are electronically routed to Glenn s Commercial Technology Office for review and, where necessary, editing. The final version of the agreement, along with any supporting documentation, is then routed for electronic concurrence/approval to the necessary internal review participants using the electronic routing system (e-router). SAAM was developed cooperatively by Glenn s Commercial Technology Office and Glenn s Office of Chief Counsel. Currently, SAAM is being evaluated by the NASA Headquarters General Counsel Office for use at all NASA centers. This system allows for the effective processing of Space Act Agreements for NASA s internal and external customers. Document control is maintained by a database. With SAAM s electronic routing, review times can be reduced significantly, allowing Glenn to more rapidly establish partnerships with industry. Prior to the creation of SAAM, it took several hours to draft a Space Act Agreement. With SAAM in place, the document can be written in about 30 min. Using the e-router also saves time in determining where the agreement is in the routing process. The document can be tracked easily, and delays can be avoided. Important research

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

NASA Technical Reports Server (NTRS)

Segui, John S.; Jennings, Esther H.; Clare, Loren P.

2013-01-01

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

Route planning in a four-dimensional environment

NASA Technical Reports Server (NTRS)

Slack, M. G.; Miller, D. P.

1987-01-01

Robots must be able to function in the real world. The real world involves processes and agents that move independently of the actions of the robot, sometimes in an unpredictable manner. A real-time integrated route planning and spatial representation system for planning routes through dynamic domains is presented. The system will find the safest most efficient route through space-time as described by a set of user defined evaluation functions. Because the route planning algorthims is highly parallel and can run on an SIMD machine in O(p) time (p is the length of a path), the system will find real-time paths through unpredictable domains when used in an incremental mode. Spatial representation, an SIMD algorithm for route planning in a dynamic domain, and results from an implementation on a traditional computer architecture are discussed.

Towards seasonal Arctic shipping route predictions

NASA Astrophysics Data System (ADS)

Haines, K.; Melia, N.; Hawkins, E.; Day, J. J.

2017-12-01

In our previous work [1] we showed how trans-Arctic shipping routes would become more available through the 21st century as sea ice declines, using CMIP5 models with means and stds calibrated to PIOMAS sea ice observations. Sea ice will continue to close shipping routes to open water vessels through the winter months for the foreseeable future so the availability of open sea routes will vary greatly from year to year. Here [2] we look at whether the trans-Arctic shipping season period can be predicted in seasonal forecasts, again using several climate models, and testing both perfect and imperfect knowledge of the initial sea ice conditions. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts may show lower skill before a May `predictability barrier'. Focussing on the northern sea route (NSR) off Siberia, the date of opening of this sea route is twice as variable as the closing date, and this carries through to reduced predictability at the start of the season. Under climate change the later freeze-up date accounts for 60% of the lengthening season, Fig1 We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than for average ice years. Forecasting the exact timing of route open periods is harder (more weather dependent) under average ice conditions while in high and low ice years the season is more controlled by the initial ice conditions from spring onwards. This could be very useful information for companies planning vessel routing for the coming season. We tested this dependence on the initial ice conditions by changing the initial ice state towards climatologically average conditions and show directly that early summer sea-ice thickness information is crucial to obtain skilful forecasts of the coming shipping season. Mechanisms for this are discussed. This strongly suggests that good sea ice thickness observations

76 FR 43477 - Debit Card Interchange Fees and Routing

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-20

...The Board is adopting an interim final rule and requesting comment on provisions in Regulation II (Debit Card Interchange Fees and Routing) adopted in accordance with Section 920(a)(5) of the Electronic Fund Transfer Act, which governs adjustments to debit interchange transaction fees for fraud-prevention costs. The provisions allow an issuer to receive an adjustment of 1 cent to its interchange transaction fee if the issuer develops, implements, and updates policies and procedures reasonably designed to identify and prevent fraudulent electronic debit transactions; monitor the incidence of, reimbursements received for, and losses incurred from fraudulent electronic debit transactions; respond appropriately to suspicious electronic debit transactions so as to limit the fraud losses that may occur and prevent the occurrence of future fraudulent electronic debit transactions; and secure debit card and cardholder data. If an issuer meets these standards and wishes to receive the adjustment, it must certify its eligibility to receive the fraud-prevention adjustment to the payment card networks in which the issuer participates.

Providing reliable route guidance : phase II.

DOT National Transportation Integrated Search

2010-12-20

The overarching goal of the project is to enhance travel reliability of highway users by providing : them with reliable route guidance produced from newly developed routing algorithms that : are validated and implemented with real traffic data. To th...

View southeast to Canterbury Road (Route 169) showing the Israel ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

View southeast to Canterbury Road (Route 169) showing the Israel Putnam Memorial - Brooklyn Green, North Green, South Green, & West Green, parts of Brown Road, Canterbury Road (Route 169), Hartford Road (Route 6), Hyde Road, Pomfret Road (Route 169), Prince Hill Road, Providence Road (Route 6), Wauregan Road (Routes 169 & 205), & Wolf Den Road, Brooklyn, Windham County, CT

Key Management Scheme Based on Route Planning of Mobile Sink in Wireless Sensor Networks.

PubMed

Zhang, Ying; Liang, Jixing; Zheng, Bingxin; Jiang, Shengming; Chen, Wei

2016-01-29

In many wireless sensor network application scenarios the key management scheme with a Mobile Sink (MS) should be fully investigated. This paper proposes a key management scheme based on dynamic clustering and optimal-routing choice of MS. The concept of Traveling Salesman Problem with Neighbor areas (TSPN) in dynamic clustering for data exchange is proposed, and the selection probability is used in MS route planning. The proposed scheme extends static key management to dynamic key management by considering the dynamic clustering and mobility of MSs, which can effectively balance the total energy consumption during the activities. Considering the different resources available to the member nodes and sink node, the session key between cluster head and MS is established by modified an ECC encryption with Diffie-Hellman key exchange (ECDH) algorithm and the session key between member node and cluster head is built with a binary symmetric polynomial. By analyzing the security of data storage, data transfer and the mechanism of dynamic key management, the proposed scheme has more advantages to help improve the resilience of the key management system of the network on the premise of satisfying higher connectivity and storage efficiency.

Route Network Construction with Location-Direction-Enabled Photographs

NASA Astrophysics Data System (ADS)

Fujita, Hideyuki; Sagara, Shota; Ohmori, Tadashi; Shintani, Takahiko

2018-05-01

We propose a method for constructing a geometric graph for generating routes that summarize a geographical area and also have visual continuity by using a set of location-direction-enabled photographs. A location- direction-enabled photograph is a photograph that has information about the location (position of the camera at the time of shooting) and the direction (direction of the camera at the time of shooting). Each nodes of the graph corresponds to a location-direction-enabled photograph. The location of each node is the location of the corresponding photograph, and a route on the graph corresponds to a route in the geographic area and a sequence of photographs. The proposed graph is constructed to represent characteristic spots and paths linking the spots, and it is assumed to be a kind of a spatial summarization of the area with the photographs. Therefore, we call the routes on the graph as spatial summary route. Each route on the proposed graph also has a visual continuity, which means that we can understand the spatial relationship among the continuous photographs on the route such as moving forward, backward, turning right, etc. In this study, when the changes in the shooting position and shooting direction satisfied a given threshold, the route was defined to have visual continuity. By presenting the photographs in order along the generated route, information can be presented sequentially, while maintaining visual continuity to a great extent.

En route air traffic flow simulation.

DOT National Transportation Integrated Search

1971-01-01

The report covers the conception, design, development, and initial implementation of an advanced simulation technique applied to a study of national air traffic flow and its control by En Route Air Route Traffic Control Centers (ARTCC). It is intende...

Development of safe routes for children in urban environment

NASA Astrophysics Data System (ADS)

Koryagin, M. E.; Medvedev, V. I.; Strykov, P. G.

2018-01-01

The matter of development of safe travel routes for children between school and home is analyzed. The availability of various applications and devices to identify the location of the child and his/her travel routes is noted. The main factors to be taken into account when planning children travel routes are described. The most popular Russian services for route planning, Google, Yandex, and 2GIS, are discussed. These services are shown to have a number of shortcomings which does not allow them to choose really safe routes. A decision on making the route selection by two criteria (the travel time and the probability of an accident) is obtained. As a numerical example, the Pareto area for possible routes is constructed.

Annoyance caused by aircraft en route noise

NASA Technical Reports Server (NTRS)

Mccurdy, David A.

1992-01-01

A laboratory experiment was conducted to quantify the annoyance response of people on the ground to enroute noise generated by aircraft at cruise conditions. The en route noises were ground level recordings of eight advanced turboprop aircraft flyovers and six conventional turbofan flyovers. The eight advanced turboprop enroute noises represented the NASA Propfan Test Assessment aircraft operating at different combinations of altitude, aircraft Mach number, and propeller tip speed. The conventional turbofan en route noises represented six different commercial airliners. The overall durations of the en route noises varied from approximately 40 to 160 sec. In the experiment, 32 subjects judged the annoyance of the en route noises as well as recordings of the takeoff and landing noises of each of 5 conventional turboprop and 5 conventional turbofan aircraft. Each of the noises was presented at three sound pressure levels to the subjects in an anechoic listening room. Analysis of the judgments found small differences in annoyance between three combinations of aircraft type and operation. Current tone and corrections did not significantly improve en route annoyance prediction. The optimum duration-correction magnitude for en route noise was approximately 1 dB per doubling of effective duration.

Annoyance caused by aircraft en route noise

NASA Astrophysics Data System (ADS)

McCurdy, David A.

1992-03-01

A laboratory experiment was conducted to quantify the annoyance response of people on the ground to enroute noise generated by aircraft at cruise conditions. The en route noises were ground level recordings of eight advanced turboprop aircraft flyovers and six conventional turbofan flyovers. The eight advanced turboprop enroute noises represented the NASA Propfan Test Assessment aircraft operating at different combinations of altitude, aircraft Mach number, and propeller tip speed. The conventional turbofan en route noises represented six different commercial airliners. The overall durations of the en route noises varied from approximately 40 to 160 sec. In the experiment, 32 subjects judged the annoyance of the en route noises as well as recordings of the takeoff and landing noises of each of 5 conventional turboprop and 5 conventional turbofan aircraft. Each of the noises was presented at three sound pressure levels to the subjects in an anechoic listening room. Analysis of the judgments found small differences in annoyance between three combinations of aircraft type and operation. Current tone and corrections did not significantly improve en route annoyance prediction. The optimum duration-correction magnitude for en route noise was approximately 1 dB per doubling of effective duration.

Properties of Air Traffic Conflicts for Free and Structured Routing

NASA Technical Reports Server (NTRS)

Bilimoria, Karl D.; Lee, Hilda Q.

2001-01-01

This paper analyzes the properties of air traffic conflicts in a future free routing system against those in the current structured routing system. Simulation of en route air traffic operations (above 18,000 ft) over the contiguous United States for a 24-hour period, constructed with initial conditions from actual air traffic data, were conducted using the Future ATM Concepts Evaluation Tool (FACET). Free routes were modeled as great circle (direct) routes from origin to destination, and structured routes were derived from actual flight plans along the current system of air routes. The conflict properties analyzed in this study include: (1) Total number of conflicts; (2) Distributions of key conflict parameters; and, (3) Categorization of conflicts into independent conflicts and two types of interacting conflicts. Preliminary results (for Denver Center traffic) indicate that conflict properties in a free routing system are different from those in the current structured routing system. In particular, a free routing system has significantly fewer conflicts, involving a correspondingly smaller number of aircraft, compared to the current structured routing system. Additionally, the conflict parameter distributions indicate that free routing conflicts are less intrusive than structured routing conflicts, and would therefore require small trajectory deviations for resolution.

Development of quantitative security optimization approach for the picture archives and carrying system between a clinic and a rehabilitation center

NASA Astrophysics Data System (ADS)

Haneda, Kiyofumi; Kajima, Toshio; Koyama, Tadashi; Muranaka, Hiroyuki; Dojo, Hirofumi; Aratani, Yasuhiko

2002-05-01

The target of our study is to analyze the level of necessary security requirements, to search for suitable security measures and to optimize security distribution to every portion of the medical practice. Quantitative expression must be introduced to our study, if possible, to enable simplified follow-up security procedures and easy evaluation of security outcomes or results. Using fault tree analysis (FTA), system analysis showed that system elements subdivided into groups by details result in a much more accurate analysis. Such subdivided composition factors greatly depend on behavior of staff, interactive terminal devices, kinds of services provided, and network routes. Security measures were then implemented based on the analysis results. In conclusion, we identified the methods needed to determine the required level of security and proposed security measures for each medical information system, and the basic events and combinations of events that comprise the threat composition factors. Methods for identifying suitable security measures were found and implemented. Risk factors for each basic event, a number of elements for each composition factor, and potential security measures were found. Methods to optimize the security measures for each medical information system were proposed, developing the most efficient distribution of risk factors for basic events.

Theoretical Comparison of Fixed Route Bus and Flexible Route Subscription Bus Feeder Service in Low Density Areas

DOT National Transportation Integrated Search

1975-03-01

parametric variation of demand density was used to compare service level and cost of two alternative systems for providing low density feeder service. Supply models for fixed route and flexible route service were developed and applied to determine ra...

Secure vendor environment (SVE) for PACS

NASA Astrophysics Data System (ADS)

Honeyman-Buck, Janice; Frost, Meryll

2005-04-01

A Secure Vendor Environment (SVE) was created to protect radiology modalities from network intrusion, worms, viruses, and other forms of damaging attacks. Many vendors do not attempt any form of network security and if an institution demands a non-standard and secure installation, a future system upgrade could and frequently does eliminate any security measures installed during the initial installation. The SVE isolates the vendor equipment behind a virtual firewall on a private network that is invisible to the outside world. All interactions must go though a device containing two network interface cards called an Application Processor that acts as a store-and forward router, performs DICOM repair, proxies modality worklist, and isolates the vendor modalities. A small VPN appliance can open the device temporarily for remote access by vendor engineers. Prior to the routine installation of the SVE, vendor equipment was often attacked by hostile network intruders and viruses or worms, sometimes rendering the equipment unusable until the vendor could reload the system. The resulted in considerable clinical downtime and loss of revenue. Since the relatively low cost SVE solution has routinely been installed with all new equipment, no intrusions have occurred, although our network sniffers and intrusion detectors indicate that we are constantly being scanned for vulnerability. Purpose: To provide a secure network for vendor equipment in a PACS environment while allowing vendor access for upgrades and system repairs. Method: The network administrators at our university believe that network security should be implemented at the machine level rather than relying on a firewall. A firewall solution could conceivably block unwanted intrusion from outside the university network, but would still allow literally thousands of potential network users to get through to the PACS network. All the PACS archive, display and routing systems are individually protected from intrusion, but

Quantum chemistry-assisted synthesis route development

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-12-31

We have been investigating “quantum chemistry-assisted synthesis route development” using in silico screenings and applied the method to several targets. Another example was conducted to develop synthesis routes for a urea derivative, namely 1-(4-(trifluoromethyl)-2-oxo-2H-chromen-7-yl)urea. While five synthesis routes were examined, only three routes passed the second in silico screening. Among them, the reaction of 7-amino-4-(trifluoromethyl)-2H-chromen-2-one and O-methyl carbamate with BF{sub 3} as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with thatmore » observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings.« less

Detailed analysis of routing protocols with different network limitations

NASA Astrophysics Data System (ADS)

Masood, Mohsin; Abuhelala, Mohamed; Glesk, Ivan

2016-12-01

In network communication field, routing protocols have got a significant role which are not only used in networks to handle the user data but also to monitor the different network environments. Dynamic routing protocols such as OSPF, EIGRP and RIP are used for forwarding user data to its destination by instantly detecting the dynamic changes across the network. The dynamic changes in the network can be in the form of topological changes, congestions, links failure etc. Therefore, it becomes a challenge to develop and implement dynamic routing protocols that fulfills the network requirements. Hence, each routing protocol has its own characteristics such as convergence activity, routing metric, routing table etc. and will perform differently in various network environments. This paper presents a comprehensive study of static and dynamic routing, along with dynamic routing protocols. Experiments that are conducted under various network limitations are presented using the OPNET tool. The performance of each of dynamic routing protocols are monitored and explained in the form of simulated results using network parameters. The results are analyzed, in order to provide a clear understanding of each protocol performance for the selection of the proper protocol for a given network environment.

The Geomorphological Effects of Old Routes

NASA Astrophysics Data System (ADS)

Martinek, Jan; Bíl, Michal

2017-04-01

The communication network in rural areas in the historical Czech Lands predominantly consisted of unpaved routes prior to the eighteenth century. Certain parts of the network were transformed gradually into the current roads and are now being used by motor traffic. The majority of the old routes form, however, an abandoned network the remnants of which (abandoned during the Middle Ages or even earlier) are currently being discovered. Certain segments of used unpaved routes were, over the course of time, transformed into holloways (sunken lanes) and consequently also abandoned. The degree of incision of the holloway into the soil was determined by local geological conditions. Routes, which were abandoned due to more difficult transport in holloways, have distinct linear forms and can often be found as a grouping of parallel holloways. This indicates that these routes were frequently used or localized on low-resistant ground. Analyses of the precise digital elevation models, derived from LIDAR data, can reveal the distinct pattern of an old route network quite often interacting with other geomorphological phenomena (e.g., landslides, streams) or old human constructions (e.g., fortified settlements). We will present several cases where old paths interacted with landslides. These facts can consequently be used for dating the purposes of both the landslides and the old path sections. General erosion impacts, the degree of incision of the old transportation lines, can also be quantified through analyses of digital elevation models taking into consideration the former and new, incised, surface. We will demonstrate the methodology used for these analyses and the preliminary results.

49 CFR 236.767 - Locking, route.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 49 Transportation 4 2010-10-01 2010-10-01 false Locking, route. 236.767 Section 236.767 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION... Locking, route. Electric locking, effective when a train passes a signal displaying an aspect for it to...

Sigma Routing Metric for RPL Protocol.

PubMed

Sanmartin, Paul; Rojas, Aldo; Fernandez, Luis; Avila, Karen; Jabba, Daladier; Valle, Sebastian

2018-04-21

This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX). However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption.

Sigma Routing Metric for RPL Protocol

PubMed Central

Rojas, Aldo; Fernandez, Luis

2018-01-01

This paper presents the adaptation of a specific metric for the RPL protocol in the objective function MRHOF. Among the functions standardized by IETF, we find OF0, which is based on the minimum hop count, as well as MRHOF, which is based on the Expected Transmission Count (ETX). However, when the network becomes denser or the number of nodes increases, both OF0 and MRHOF introduce long hops, which can generate a bottleneck that restricts the network. The adaptation is proposed to optimize both OFs through a new routing metric. To solve the above problem, the metrics of the minimum number of hops and the ETX are combined by designing a new routing metric called SIGMA-ETX, in which the best route is calculated using the standard deviation of ETX values between each node, as opposed to working with the ETX average along the route. This method ensures a better routing performance in dense sensor networks. The simulations are done through the Cooja simulator, based on the Contiki operating system. The simulations showed that the proposed optimization outperforms at a high margin in both OF0 and MRHOF, in terms of network latency, packet delivery ratio, lifetime, and power consumption. PMID:29690524

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by dynamically adjusting local routing strategies

DOEpatents

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

2010-03-16

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Each node implements a respective routing strategy for routing data through the network, the routing strategies not necessarily being the same in every node. The routing strategies implemented in the nodes are dynamically adjusted during application execution to shift network workload as required. Preferably, adjustment of routing policies in selective nodes is performed at synchronization points. The network may be dynamically monitored, and routing strategies adjusted according to detected network conditions.

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

DOEpatents

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

2010-11-16

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

41 CFR 109-40.302 - Standard routing principle.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 41 Public Contracts and Property Management 3 2010-07-01 2010-07-01 false Standard routing principle. 109-40.302 Section 109-40.302 Public Contracts and Property Management Federal Property... Standard routing principle. (a) Shipments shall be routed using the mode of transportation, or individual...

Direct-To Tool for En Route Controllers

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; McNally, David; Foster, Michelle

2002-01-01

This paper describes a new automation tool for en route air traffic controllers, called the Direct-To Tool. The Tool is designed to reduce the time of flight and fuel consumption for aircraft flying in en route airspace. It provides each controller with the identities of aircraft in his/her sector, which can reduce their time en route by bypassing dog-legged route segments and flying "direct to" a waypoint closer to the destination airport. The Tool uses its build-in conflict probing capability to determine if the improved route is free of conflicts with other aircraft. The Tool's graphical computer interface enables the controller to enter a direct-to clearance by a simple point and click action. Because of its low workload and convenience, this method is strongly favored by controllers The Tool has been running since January with live radar data received at NASA from the Fort Worth Air Route Traffic Control Center. For aircraft operating in the Fort Worth Center, the Tool has the potential to save in excess of 500,000 in-flight minutes per year. A provisional patent application for this Tool has been filed. A field task in planned for the last quarter of this year.

Implementation of a light-route TDMA communications satellite system for advanced business networks

NASA Astrophysics Data System (ADS)

Hanson, B.; Smalley, A.; Zuliani, M.

The application of Light Route TDMA systems to various business communication requirements is discussed. It is noted that full development of this technology for use in advanced business networks will be guided by considerations of flexibility, reliability, security, and cost. The implementation of the TDMA system for demonstrating these advantages to a wide range of public and private organizations is described in detail. Among the advantages offered by this system are point-to-point and point-to-multipoint (broadcast) capability; the ability to vary the mix and quantity of services between destinations in a fully connected mesh network on an almost instantaneous basis through software control; and enhanced reliability with centralized monitor, alarm and control functions by virtue of an overhead channel.

Advances in optimal routing through computer networks

NASA Technical Reports Server (NTRS)

Paz, I. M.

1977-01-01

The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

Advanced Algorithms for Local Routing Strategy on Complex Networks.

PubMed

Lin, Benchuan; Chen, Bokui; Gao, Yachun; Tse, Chi K; Dong, Chuanfei; Miao, Lixin; Wang, Binghong

2016-01-01

Despite the significant improvement on network performance provided by global routing strategies, their applications are still limited to small-scale networks, due to the need for acquiring global information of the network which grows and changes rapidly with time. Local routing strategies, however, need much less local information, though their transmission efficiency and network capacity are much lower than that of global routing strategies. In view of this, three algorithms are proposed and a thorough investigation is conducted in this paper. These algorithms include a node duplication avoidance algorithm, a next-nearest-neighbor algorithm and a restrictive queue length algorithm. After applying them to typical local routing strategies, the critical generation rate of information packets Rc increases by over ten-fold and the average transmission time 〈T〉 decreases by 70-90 percent, both of which are key physical quantities to assess the efficiency of routing strategies on complex networks. More importantly, in comparison with global routing strategies, the improved local routing strategies can yield better network performance under certain circumstances. This is a revolutionary leap for communication networks, because local routing strategy enjoys great superiority over global routing strategy not only in terms of the reduction of computational expense, but also in terms of the flexibility of implementation, especially for large-scale networks.

Pheromone routing protocol on a scale-free network.

PubMed

Ling, Xiang; Hu, Mao-Bin; Jiang, Rui; Wang, Ruili; Cao, Xian-Bin; Wu, Qing-Song

2009-12-01

This paper proposes a routing strategy for network systems based on the local information of "pheromone." The overall traffic capacity of a network system can be evaluated by the critical packet generating rate R(c). Under this critical generating rate, the total packet number in the system first increases and then decreases to reach a balance state. The system behaves differently from that with a local routing strategy based on the node degree or shortest path routing strategy. Moreover, the pheromone routing strategy performs much better than the local routing strategy, which is demonstrated by a larger value of the critical generating rate. This protocol can be an alternation for superlarge networks, in which the global topology may not be available.

Pheromone routing protocol on a scale-free network

NASA Astrophysics Data System (ADS)

Ling, Xiang; Hu, Mao-Bin; Jiang, Rui; Wang, Ruili; Cao, Xian-Bin; Wu, Qing-Song

2009-12-01

This paper proposes a routing strategy for network systems based on the local information of “pheromone.” The overall traffic capacity of a network system can be evaluated by the critical packet generating rate Rc . Under this critical generating rate, the total packet number in the system first increases and then decreases to reach a balance state. The system behaves differently from that with a local routing strategy based on the node degree or shortest path routing strategy. Moreover, the pheromone routing strategy performs much better than the local routing strategy, which is demonstrated by a larger value of the critical generating rate. This protocol can be an alternation for superlarge networks, in which the global topology may not be available.

Three projects using 4.75 mm. superpave HMA on Route1A, Route 2A, & Route 27.

DOT National Transportation Integrated Search

2012-04-01

In July & August, 2010, MaineDOT applied 4.75 mm. (5/8 inch) Superpave designed hot mix asphalt : overlays in three locations. These overlay projects were on Route 1A, 2A, and 27, located in Forkstown, : New Portland, and Limestone, respectively. Pro...

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 49 Transportation 5 2012-10-01 2012-10-01 false Highway routing designations; preemption. 397.69... § 397.69 Highway routing designations; preemption. (a) Any State or Indian tribe that establishes or modifies a highway routing designation over which NRHM may or may not be transported on or after November...

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 49 Transportation 5 2011-10-01 2011-10-01 false Highway routing designations; preemption. 397.69... § 397.69 Highway routing designations; preemption. (a) Any State or Indian tribe that establishes or modifies a highway routing designation over which NRHM may or may not be transported on or after November...

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 49 Transportation 5 2013-10-01 2013-10-01 false Highway routing designations; preemption. 397.69... § 397.69 Highway routing designations; preemption. (a) Any State or Indian tribe that establishes or modifies a highway routing designation over which NRHM may or may not be transported on or after November...

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 49 Transportation 5 2014-10-01 2014-10-01 false Highway routing designations; preemption. 397.69... § 397.69 Highway routing designations; preemption. (a) Any State or Indian tribe that establishes or modifies a highway routing designation over which NRHM may or may not be transported on or after November...

Retrieving and routing quantum information in a quantum network

NASA Astrophysics Data System (ADS)

Sazim, S.; Chiranjeevi, V.; Chakrabarty, I.; Srinathan, K.

2015-12-01

two implications together, namely routing and secure storage, it is possible to envision applications like quantum mail (qmail) as an outsourced service.

Cross-layer design for intrusion detection and data security in wireless ad hoc sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2007-09-01

A wireless ad hoc sensor network is a configuration for area surveillance that affords rapid, flexible deployment in arbitrary threat environments. There is no infrastructure support and sensor nodes communicate with each other only when they are in transmission range. The nodes are severely resource-constrained, with limited processing, memory and power capacities and must operate cooperatively to fulfill a common mission in typically unattended modes. In a wireless sensor network (WSN), each sensor at a node can observe locally some underlying physical phenomenon and sends a quantized version of the observation to sink (destination) nodes via wireless links. Since the wireless medium can be easily eavesdropped, links can be compromised by intrusion attacks from nodes that may mount denial-of-service attacks or insert spurious information into routing packets, leading to routing loops, long timeouts, impersonation, and node exhaustion. A cross-layer design based on protocol-layer interactions is proposed for detection and identification of various intrusion attacks on WSN operation. A feature set is formed from selected cross-layer parameters of the WSN protocol to detect and identify security threats due to intrusion attacks. A separate protocol is not constructed from the cross-layer design; instead, security attributes and quantified trust levels at and among nodes established during data exchanges complement customary WSN metrics of energy usage, reliability, route availability, and end-to-end quality-of-service (QoS) provisioning. Statistical pattern recognition algorithms are applied that use observed feature-set patterns observed during network operations, viewed as security audit logs. These algorithms provide the "best" network global performance in the presence of various intrusion attacks. A set of mobile (software) agents distributed at the nodes implement the algorithms, by moving among the layers involved in the network response at each active node

Intelligent deflection routing in buffer-less networks.

PubMed

Haeri, Soroush; Trajković, Ljiljana

2015-02-01

Deflection routing is employed to ameliorate packet loss caused by contention in buffer-less architectures such as optical burst-switched networks. The main goal of deflection routing is to successfully deflect a packet based only on a limited knowledge that network nodes possess about their environment. In this paper, we present a framework that introduces intelligence to deflection routing (iDef). iDef decouples the design of the signaling infrastructure from the underlying learning algorithm. It consists of a signaling and a decision-making module. Signaling module implements a feedback management protocol while the decision-making module implements a reinforcement learning algorithm. We also propose several learning-based deflection routing protocols, implement them in iDef using the ns-3 network simulator, and compare their performance.

Route Flap Damping Made Usable

NASA Astrophysics Data System (ADS)

Pelsser, Cristel; Maennel, Olaf; Mohapatra, Pradosh; Bush, Randy; Patel, Keyur

The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.

Iconic memory-based omnidirectional route panorama navigation.

PubMed

Yagi, Yasushi; Imai, Kousuke; Tsuji, Kentaro; Yachida, Masahiko

2005-01-01

A route navigation method for a mobile robot with an omnidirectional image sensor is described. The route is memorized from a series of consecutive omnidirectional images of the horizon when the robot moves to its goal. While the robot is navigating to the goal point, input is matched against the memorized spatio-temporal route pattern by using dual active contour models and the exact robot position and orientation is estimated from the converged shape of the active contour models.

Road screening and distribution route multi-objective robust optimization for hazardous materials based on neural network and genetic algorithm.

PubMed

Ma, Changxi; Hao, Wei; Pan, Fuquan; Xiang, Wang

2018-01-01

Route optimization of hazardous materials transportation is one of the basic steps in ensuring the safety of hazardous materials transportation. The optimization scheme may be a security risk if road screening is not completed before the distribution route is optimized. For road screening issues of hazardous materials transportation, a road screening algorithm of hazardous materials transportation is built based on genetic algorithm and Levenberg-Marquardt neural network (GA-LM-NN) by analyzing 15 attributes data of each road network section. A multi-objective robust optimization model with adjustable robustness is constructed for the hazardous materials transportation problem of single distribution center to minimize transportation risk and time. A multi-objective genetic algorithm is designed to solve the problem according to the characteristics of the model. The algorithm uses an improved strategy to complete the selection operation, applies partial matching cross shift and single ortho swap methods to complete the crossover and mutation operation, and employs an exclusive method to construct Pareto optimal solutions. Studies show that the sets of hazardous materials transportation road can be found quickly through the proposed road screening algorithm based on GA-LM-NN, whereas the distribution route Pareto solutions with different levels of robustness can be found rapidly through the proposed multi-objective robust optimization model and algorithm.

Security Systems Consideration: A Total Security Approach

NASA Astrophysics Data System (ADS)

Margariti, S. V.; Meletiou, G.; Stergiou, E.; Vasiliadis, D. C.; Rizos, G. E.

2007-12-01

The "safety" problem for protection systems is to determine in a given situation whether a subject can acquire a particular right to an object. Security and audit operation face the process of securing the application on computing and network environment; however, storage security has been somewhat overlooked due to other security solutions. This paper identifies issues for data security, threats and attacks, summarizes security concepts and relationships, and also describes storage security strategies. It concludes with recommended storage security plan for a total security solution.

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 1 2011-01-01 2011-01-01 false En route flight paths. 25.123 Section 25... AIRWORTHINESS STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.123 En route flight paths. (a) For the en route configuration, the flight paths prescribed in paragraph (b) and (c) of this section must...

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 1 2014-01-01 2014-01-01 false En route flight paths. 25.123 Section 25... AIRWORTHINESS STANDARDS: TRANSPORT CATEGORY AIRPLANES Flight Performance § 25.123 En route flight paths. (a) For the en route configuration, the flight paths prescribed in paragraph (b) and (c) of this section must...

Route-based travel and shared routes in sympatric spider and woolly monkeys: cognitive and evolutionary implications.

PubMed

Di Fiore, Anthony; Suarez, Scott A

2007-07-01

Many wild primates occupy large home ranges and travel long distances each day. Navigating these ranges to find sufficient food presents a substantial cognitive challenge, but we are still far from understanding either how primates represent spatial information mentally or how they use this information to navigate under natural conditions. In the course of a long-term socioecological study, we investigated and compared the travel paths of sympatric spider monkeys (Ateles belzebuth) and woolly monkeys (Lagothrix poeppigii) in Amazonian Ecuador. During several field seasons spanning an 8-year period, we followed focal individuals or groups of both species continuously for periods of multiple days and mapped their travel paths in detail. We found that both primates typically traveled through their home ranges following repeatedly used paths, or "routes". Many of these routes were common to both species and were stable across study years. Several important routes appeared to be associated with distinct topographic features (e.g., ridgetops), which may constitute easily recognized landmarks useful for spatial navigation. The majority of all location records for both species fell along or near identified routes, as did most of the trees used for fruit feeding. Our results provide strong support for the idea that both woolly and spider monkey use route-based mental maps similar to those proposed by Poucet (Psychol Rev 100:163-182, 1993). We suggest that rather than remembering the specific locations of thousands of individual feeding trees and their phenological schedules, spider and woolly monkeys could nonetheless forage efficiently by committing to memory a series of route segments that, when followed, bring them into contact with many potential feeding sources for monitoring or visitation. Furthermore, because swallowed and defecated seeds are deposited in greater frequency along routes, the repeated use of particular travel paths over generations could profoundly

Selfish Routing

DTIC Science & Technology

2002-05-01

traffic models , thereby identifying types of networks for which the cost of routing selfishly is mild. The inefficiency inherent in an uncoordinated outcome...17 1.6 Bibliographic Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 2 Preliminaries 18 2.1 The Model ...to Other Models 68 4.1 Flows at Approximate Nash Equilibrium . . . . . . . . . . . . . . . . 69 4.2 Finitely Many Users: Splittable Flow

Advanced Algorithms for Local Routing Strategy on Complex Networks

PubMed Central

Lin, Benchuan; Chen, Bokui; Gao, Yachun; Tse, Chi K.; Dong, Chuanfei; Miao, Lixin; Wang, Binghong

2016-01-01

Despite the significant improvement on network performance provided by global routing strategies, their applications are still limited to small-scale networks, due to the need for acquiring global information of the network which grows and changes rapidly with time. Local routing strategies, however, need much less local information, though their transmission efficiency and network capacity are much lower than that of global routing strategies. In view of this, three algorithms are proposed and a thorough investigation is conducted in this paper. These algorithms include a node duplication avoidance algorithm, a next-nearest-neighbor algorithm and a restrictive queue length algorithm. After applying them to typical local routing strategies, the critical generation rate of information packets Rc increases by over ten-fold and the average transmission time 〈T〉 decreases by 70–90 percent, both of which are key physical quantities to assess the efficiency of routing strategies on complex networks. More importantly, in comparison with global routing strategies, the improved local routing strategies can yield better network performance under certain circumstances. This is a revolutionary leap for communication networks, because local routing strategy enjoys great superiority over global routing strategy not only in terms of the reduction of computational expense, but also in terms of the flexibility of implementation, especially for large-scale networks. PMID:27434502

Secure Data Aggregation in Wireless Sensor Network-Fujisaki Okamoto(FO) Authentication Scheme against Sybil Attack.

PubMed

Nirmal Raja, K; Maraline Beno, M

2017-07-01

In the wireless sensor network(WSN) security is a major issue. There are several network security schemes proposed in research. In the network, malicious nodes obstruct the performance of the network. The network can be vulnerable by Sybil attack. When a node illicitly assertions multiple identities or claims fake IDs, the WSN grieves from an attack named Sybil attack. This attack threatens wireless sensor network in data aggregation, synchronizing system, routing, fair resource allocation and misbehavior detection. Henceforth, the research is carried out to prevent the Sybil attack and increase the performance of the network. This paper presents the novel security mechanism and Fujisaki Okamoto algorithm and also application of the work. The Fujisaki-Okamoto (FO) algorithm is ID based cryptographic scheme and gives strong authentication against Sybil attack. By using Network simulator2 (NS2) the scheme is simulated. In this proposed scheme broadcasting key, time taken for different key sizes, energy consumption, Packet delivery ratio, Throughput were analyzed.

AES based secure low energy adaptive clustering hierarchy for WSNs

NASA Astrophysics Data System (ADS)

Kishore, K. R.; Sarma, N. V. S. N.

2013-01-01

Wireless sensor networks (WSNs) provide a low cost solution in diversified application areas. The wireless sensor nodes are inexpensive tiny devices with limited storage, computational capability and power. They are being deployed in large scale in both military and civilian applications. Security of the data is one of the key concerns where large numbers of nodes are deployed. Here, an energy-efficient secure routing protocol, secure-LEACH (Low Energy Adaptive Clustering Hierarchy) for WSNs based on the Advanced Encryption Standard (AES) is being proposed. This crypto system is a session based one and a new session key is assigned for each new session. The network (WSN) is divided into number of groups or clusters and a cluster head (CH) is selected among the member nodes of each cluster. The measured data from the nodes is aggregated by the respective CH's and then each CH relays this data to another CH towards the gateway node in the WSN which in turn sends the same to the Base station (BS). In order to maintain confidentiality of data while being transmitted, it is necessary to encrypt the data before sending at every hop, from a node to the CH and from the CH to another CH or to the gateway node.

1. Aerial view northnortheast, State Route 92 center left and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

1. Aerial view north-northeast, State Route 92 center left and State Route 100 on right, duck pond, reservoir and farm complex buildings center bottom. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

2. Aerial view northeast, State Route 92 bottom left and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

2. Aerial view northeast, State Route 92 bottom left and State Route 100 center, Brandywine Creek State Park center right, duck pond and reservoir center bottom. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

How Effective is Routing for Wireless Networking

DTIC Science & Technology

2016-03-05

Routing (LAR) [31]. The basic mechanism of how link-based routing schemes operate is as follows: a user broadcasts a control message (called a “ hello ...to all of its neighbors. If a series of hello messages are exchanged between two users, a link is considered to exist between them. Routes are then be...description of ETX is as follows. For a given window of time, the number of hello packets that a user receives from a neighbor is counted. A cost is then

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

PubMed Central

Wang, Haiyan; He, Ke

2018-01-01

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

PubMed

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.

Region based route planning - Multi-abstraction route planning based on intermediate level vision processing

NASA Technical Reports Server (NTRS)

Doshi, Rajkumar S.; Lam, Raymond; White, James E.

1989-01-01

Intermediate and high level processing operations are performed on vision data for the organization of images into more meaningful, higher-level topological representations by means of a region-based route planner (RBRP). The RBRP operates in terrain scenarios where some or most of the terrain is occluded, proceeding without a priori maps on the basis of two-dimensional representations and gradient-and-roughness information. Route planning is accomplished by three successive abstractions and yields a detailed point-by-point path by searching only within the boundaries of relatively small regions.

Research on dynamic routing mechanisms in wireless sensor networks.

PubMed

Zhao, A Q; Weng, Y N; Lu, Y; Liu, C Y

2014-01-01

WirelessHART is the most widely applied standard in wireless sensor networks nowadays. However, it does not provide any dynamic routing mechanism, which is important for the reliability and robustness of the wireless network applications. In this paper, a collection tree protocol based, dynamic routing mechanism was proposed for WirelessHART network. The dynamic routing mechanism was evaluated through several simulation experiments in three aspects: time for generating the topology, link quality, and stability of network. Besides, the data transmission efficiency of this routing mechanism was analyzed. The simulation and evaluation results show that this mechanism can act as a dynamic routing mechanism for the TDMA-based wireless sensor network.

Subject Matter Expert Evaluation of Multi-Flight Common Route Advisories

NASA Technical Reports Server (NTRS)

Bilimoria, Karl; Hayashi, Miwa; Sheth, Kapil S.

2017-01-01

Traffic flow management seeks to balance the demand for National Airspace System (NAS) flight resources, such as airspace and airports, with the available supply. When forecasted weather blocks nominal air traffic routes, traffic managers must re-route affected flights for weather avoidance. Depending on the nature and scope of the weather, traffic managers may use pre-coordinated re-routes such as Playbook Routes or Coded Departure Routes, or may design ad hoc local re-routes. The routes of affected flights are modified accordingly. These weather avoidance routes will, of course, be less efficient than the nominal routes due to increased flight time and fuel burn. In current traffic management operations, the transition into a weather avoidance re-routing initiative is typically implemented more aggressively than the transition out of that initiative after the weather has dissipated or moved away. For example, strategic large-scale Playbook re-routes are sometimes left in place (as initially implemented) for many hours before being lifted entirely when the weather dissipates. There is an opportunity to periodically modify the re-routing plan as weather evolves, thereby attenuating its adverse impact on flight time and fuel consumption; this is called delay recovery. Multi-Flight Common Routes (MFCR) is a NASA-developed operational concept and associated decision support tool for delay recovery, designed to assist traffic managers to efficiently update weather avoidance traffic routes after the original re-routes have become stale due to subsequent evolution of the convective weather system. MFCR groups multiple flights to reduce the number of advisories that the traffic manager needs to evaluate, and also merges these flights on a common route segment to provide an orderly flow of re-routed traffic. The advisory is presented to the appropriate traffic manager who evaluates it and has the option to modify it using MFCRs graphical user interface. If the traffic

Predicting the Operational Acceptability of Route Advisories

NASA Technical Reports Server (NTRS)

Evans, Antony; Lee, Paul

2017-01-01

NASA envisions a future Air Traffic Management system that allows safe, efficient growth in global operations, enabled by increasing levels of automation and autonomy. In a safety-critical system, the introduction of increasing automation and autonomy has to be done in stages, making human-system integrated concepts critical in the foreseeable future. One example where this is relevant is for tools that generate more efficient flight routings or reroute advisories. If these routes are not operationally acceptable, they will be rejected by human operators, and the associated benefits will not be realized. Operational acceptance is therefore required to enable the increased efficiency and reduced workload benefits associated with these tools. In this paper, the authors develop a predictor of operational acceptability for reroute advisories. Such a capability has applications in tools that identify more efficient routings around weather and congestion and that better meet airline preferences. The capability is based on applying data mining techniques to flight plan amendment data reported by the Federal Aviation Administration and data on requested reroutes collected from a field trial of the NASA developed Dynamic Weather Routes tool, which advised efficient route changes to American Airlines dispatchers in 2014. 10-Fold cross validation was used for feature, model and parameter selection, while nested cross validation was used to validate the model. The model performed well in predicting controller acceptance or rejection of a route change as indicated by chosen performance metrics. Features identified as relevant to controller acceptance included the historical usage of the advised route, the location of the maneuver start point relative to the boundaries of the airspace sector containing the maneuver start (the maneuver start sector), the reroute deviation from the original flight plan, and the demand level in the maneuver start sector. A random forest with forty

3D Building Evacuation Route Modelling and Visualization

NASA Astrophysics Data System (ADS)

Chan, W.; Armenakis, C.

2014-11-01

The most common building evacuation approach currently applied is to have evacuation routes planned prior to these emergency events. These routes are usually the shortest and most practical path from each building room to the closest exit. The problem with this approach is that it is not adaptive. It is not responsively configurable relative to the type, intensity, or location of the emergency risk. Moreover, it does not provide any information to the affected persons or to the emergency responders while not allowing for the review of simulated hazard scenarios and alternative evacuation routes. In this paper we address two main tasks. The first is the modelling of the spatial risk caused by a hazardous event leading to choosing the optimal evacuation route for a set of options. The second is to generate a 3D visual representation of the model output. A multicriteria decision making (MCDM) approach is used to model the risk aiming at finding the optimal evacuation route. This is achieved by using the analytical hierarchy process (AHP) on the criteria describing the different alternative evacuation routes. The best route is then chosen to be the alternative with the least cost. The 3D visual representation of the model displays the building, the surrounding environment, the evacuee's location, the hazard location, the risk areas and the optimal evacuation pathway to the target safety location. The work has been performed using ESRI's ArcGIS. Using the developed models, the user can input the location of the hazard and the location of the evacuee. The system then determines the optimum evacuation route and displays it in 3D.

Benefits Analysis of Multi-Center Dynamic Weather Routes

NASA Technical Reports Server (NTRS)

Sheth, Kapil; McNally, David; Morando, Alexander; Clymer, Alexis; Lock, Jennifer; Petersen, Julien

2014-01-01

Dynamic weather routes are flight plan corrections that can provide airborne flights more than user-specified minutes of flying-time savings, compared to their current flight plan. These routes are computed from the aircraft's current location to a flight plan fix downstream (within a predefined limit region), while avoiding forecasted convective weather regions. The Dynamic Weather Routes automation has been continuously running with live air traffic data for a field evaluation at the American Airlines Integrated Operations Center in Fort Worth, TX since July 31, 2012, where flights within the Fort Worth Air Route Traffic Control Center are evaluated for time savings. This paper extends the methodology to all Centers in United States and presents benefits analysis of Dynamic Weather Routes automation, if it was implemented in multiple airspace Centers individually and concurrently. The current computation of dynamic weather routes requires a limit rectangle so that a downstream capture fix can be selected, preventing very large route changes spanning several Centers. In this paper, first, a method of computing a limit polygon (as opposed to a rectangle used for Fort Worth Center) is described for each of the 20 Centers in the National Airspace System. The Future ATM Concepts Evaluation Tool, a nationwide simulation and analysis tool, is used for this purpose. After a comparison of results with the Center-based Dynamic Weather Routes automation in Fort Worth Center, results are presented for 11 Centers in the contiguous United States. These Centers are generally most impacted by convective weather. A breakdown of individual Center and airline savings is presented and the results indicate an overall average savings of about 10 minutes of flying time are obtained per flight.

Improved Efficient Routing Strategy on Scale-Free Networks

NASA Astrophysics Data System (ADS)

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.

Osm-Oriented Method of Multimodal Route Planning

NASA Astrophysics Data System (ADS)

Li, X.; Wu, Q.; Chen, L.; Xiong, W.; Jing, N.

2015-07-01

With the increasing pervasiveness of basic facilitate of transportation and information, the need of multimodal route planning is becoming more essential in the fields of communication and transportation, urban planning, logistics management, etc. This article mainly described an OSM-oriented method of multimodal route planning. Firstly, it introduced how to extract the information we need from OSM data and build proper network model and storage model; then it analysed the accustomed cost standard adopted by most travellers; finally, we used shortest path algorithm to calculate the best route with multiple traffic means.

What is Security? A perspective on achieving security

DOE Office of Scientific and Technical Information (OSTI.GOV)

Atencio, Julian J.

This presentation provides a perspective on achieving security in an organization. It touches upon security as a mindset, ability to adhere to rules, cultivating awareness of the reason for a security mindset, the quality of a security program, willingness to admit fault or acknowledge failure, peer review in security, science as a model that can be applied to the security profession, the security vision, security partnering, staleness in the security program, security responsibilities, and achievement of success over time despite the impossibility of perfection.

A Survey of Routing Protocols in Wireless Body Sensor Networks

PubMed Central

Bangash, Javed Iqbal; Abdullah, Abdul Hanan; Anisi, Mohammad Hossein; Khan, Abdul Waheed

2014-01-01

Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses. PMID:24419163

A survey of routing protocols in wireless body sensor networks.

PubMed

Bangash, Javed Iqbal; Abdullah, Abdul Hanan; Anisi, Mohammad Hossein; Khan, Abdul Waheed

2014-01-13

Wireless Body Sensor Networks (WBSNs) constitute a subset of Wireless Sensor Networks (WSNs) responsible for monitoring vital sign-related data of patients and accordingly route this data towards a sink. In routing sensed data towards sinks, WBSNs face some of the same routing challenges as general WSNs, but the unique requirements of WBSNs impose some more constraints that need to be addressed by the routing mechanisms. This paper identifies various issues and challenges in pursuit of effective routing in WBSNs. Furthermore, it provides a detailed literature review of the various existing routing protocols used in the WBSN domain by discussing their strengths and weaknesses.

An Overlay Architecture for Throughput Optimal Multipath Routing

DTIC Science & Technology

2017-01-14

1 An Overlay Architecture for Throughput Optimal Multipath Routing Nathaniel M. Jones, Georgios S. Paschos, Brooke Shrader, and Eytan Modiano...decisions. In this work, we study an overlay architecture for dynamic routing such that only a subset of devices (overlay nodes) need to make dynamic routing...a legacy network. Network overlays are frequently used to deploy new communication architectures in legacy networks [13]. To accomplish this, messages

A flexible routing scheme for patients with topographical disorientation.

PubMed

Torres-Solis, Jorge; Chau, Tom

2007-11-28

Individuals with topographical disorientation have difficulty navigating through indoor environments. Recent literature has suggested that ambient intelligence technologies may provide patients with navigational assistance through auditory or graphical instructions delivered via embedded devices. We describe an automatic routing engine for such an ambient intelligence system. The method routes patients with topographical disorientation through indoor environments by repeatedly computing the route of minimal cost from the current location of the patient to a specified destination. The cost of a given path not only reflects the physical distance between end points, but also incorporates individual patient abilities, the presence of mobility-impeding physical barriers within a building and the dynamic nature of the indoor environment. We demonstrate the method by routing simulated patients with either topographical disorientation or physical disabilities. Additionally, we exemplify the ability to route a patient from source to destination while taking into account changes to the building interior. When compared to a random walk, the proposed routing scheme offers potential cost-savings even when the patient follows only a subset of instructions. The routing method presented reduces the navigational effort for patients with topographical disorientation in indoor environments, accounting for physical abilities of the patient, environmental barriers and dynamic building changes. The routing algorithm and database proposed could be integrated into wearable and mobile platforms within the context of an ambient intelligence solution.

Technologies for user-preferred routing

NASA Astrophysics Data System (ADS)

McNally, B. D.; Sridhar, Banavar

1996-05-01

The 1995 report of the RTCA Board of Directors' Select Committee on Free Flight states that 'insufficient capacity, limited access, and excessive operating restrictions have escalated operating costs, increase delays, and decreased efficiency for all users' of the national airspace system. The Air Transport Association estimates the annual loss to be 3.5 billion dollars. The goal of the user preferred routing research is to develop integrated airborne and ground technologies that enable the highest possible level of unconstrained, user-preferred routing in enroute airspace.

75 FR 29471 - The New York North Shore Helicopter Route

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-26

...-0302; Notice No. 10-08] RIN 2120-AJ75 The New York North Shore Helicopter Route AGENCY: Federal... action would require helicopter operators to use the New York North Shore Route when operating in that area of Long Island, New York. The North Shore Route was added to the New York Helicopter Route [[Page...

Computer-based route-definition system for peripheral bronchoscopy.

PubMed

Graham, Michael W; Gibbs, Jason D; Higgins, William E

2012-04-01

Multi-detector computed tomography (MDCT) scanners produce high-resolution images of the chest. Given a patient's MDCT scan, a physician can use an image-guided intervention system to first plan and later perform bronchoscopy to diagnostic sites situated deep in the lung periphery. An accurate definition of complete routes through the airway tree leading to the diagnostic sites, however, is vital for avoiding navigation errors during image-guided bronchoscopy. We present a system for the robust definition of complete airway routes suitable for image-guided bronchoscopy. The system incorporates both automatic and semiautomatic MDCT analysis methods for this purpose. Using an intuitive graphical user interface, the user invokes automatic analysis on a patient's MDCT scan to produce a series of preliminary routes. Next, the user visually inspects each route and quickly corrects the observed route defects using the built-in semiautomatic methods. Application of the system to a human study for the planning and guidance of peripheral bronchoscopy demonstrates the efficacy of the system.

An Overview of Data Routing Approaches for Wireless Sensor Networks

PubMed Central

Anisi, Mohammad Hossein; Abdullah, Abdul Hanan; Razak, Shukor Abd; Ngadi, Md. Asri

2012-01-01

Recent years have witnessed a growing interest in deploying large populations of microsensors that collaborate in a distributed manner to gather and process sensory data and deliver them to a sink node through wireless communications systems. Currently, there is a lot of interest in data routing for Wireless Sensor Networks (WSNs) due to their unique challenges compared to conventional routing in wired networks. In WSNs, each data routing approach follows a specific goal (goals) according to the application. Although the general goal of every data routing approach in WSNs is to extend the network lifetime and every approach should be aware of the energy level of the nodes, data routing approaches may focus on one (or some) specific goal(s) depending on the application. Thus, existing approaches can be categorized according to their routing goals. In this paper, the main goals of data routing approaches in sensor networks are described. Then, the best known and most recent data routing approaches in WSNs are classified and studied according to their specific goals. PMID:23443040

A Measurement Study of BGP Blackhole Routing Performance

DTIC Science & Technology

2006-09-01

STUDY OF BGP BLACKHOLE ROUTING PERFORMANCE by Nikolaos Stamatelatos September 2006 Thesis Advisor: Geoffrey Xie Second Reader: J. D. Fulp...September 2006 3. REPORT TYPE AND DATES COVERED Master’s Thesis 4. TITLE AND SUBTITLE A Measurement Study of BGP Blackhole Routing Performance 6...distribution is unlimited 12b. DISTRIBUTION CODE 13. ABSTRACT (maximum 200 words) BGP Blackhole routing is a mechanism used to protect networks from DDoS

Simple relationship between the virial-route hypernetted-chain and the compressibility-route Percus-Yevick values of the fourth virial coefficient.

PubMed

Santos, Andrés; Manzano, Gema

2010-04-14

As is well known, approximate integral equations for liquids, such as the hypernetted chain (HNC) and Percus-Yevick (PY) theories, are in general thermodynamically inconsistent in the sense that the macroscopic properties obtained from the spatial correlation functions depend on the route followed. In particular, the values of the fourth virial coefficient B(4) predicted by the HNC and PY approximations via the virial route differ from those obtained via the compressibility route. Despite this, it is shown in this paper that the value of B(4) obtained from the virial route in the HNC theory is exactly three halves the value obtained from the compressibility route in the PY theory, irrespective of the interaction potential (whether isotropic or not), the number of components, and the dimensionality of the system. This simple relationship is confirmed in one-component systems by analytical results for the one-dimensional penetrable-square-well model and the three-dimensional penetrable-sphere model, as well as by numerical results for the one-dimensional Lennard-Jones model, the one-dimensional Gaussian core model, and the three-dimensional square-well model.

Leaving the labour market: the impact of exit routes from employment to retirement on health and wellbeing in old age.

PubMed

Halleröd, Björn; Örestig, Johan; Stattin, Mikael

2013-03-01

The study analyses whether and to what degree specific routes into retirement affect older people, i.e. the relationship between heterogeneous exit patterns and post-retirement health and wellbeing. We used longitudinal data from two points in time; data related to t 0 were collected in 1993, 1994, 1995 and 1996 and data related to t 1 were collected in 2002 and 2003 ( N  = 589). We focused on older people (55+ at t 1 ) who were employed at t 0 and retired at t 1 . We used confirmative factor analysis to identify identical measures of health and wellbeing at both t 0 and t 1 . Hence, we were able to control for pre-retirement health and wellbeing when evaluating the effects of different exit routes. These routes were defined as dependence on incomes from sickness benefit, disability pension, part-time pension, unemployment insurance and active labour market programmes. Our initial structural equation model showed a clear relation between exit routes and post-retirement wellbeing. People who prior to retirement were pushed into social benefit programmes related to health and unemployment were significantly worse off as retirees, especially those with health-related benefits. However, these relationships disappeared once pre-retirement wellbeing was added to the model. Our main conclusion is that post-retirement wellbeing first and foremost is a consequence of accumulation of advantages and disadvantages during the life course. Both labour market exit routes and post-retirement wellbeing can be seen as outcomes of this process. There are no independent effects of the retirement process. Judging from our findings, there is no reason to believe that involvement in social security programmes allowing early retirement on health grounds has any additional negative consequences for health and wellbeing.

6. Aerial view northwest, State Route 100 bottom left and ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

6. Aerial view northwest, State Route 100 bottom left and center, Winterthur Train Station center left, Winterthur Farms dairy barns upper center , duck pond and reservoir center, State Route 92 center right, and Brandywine Creek State Park bottom right. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

Analysis of Multi-Flight Common Routes for Traffic Flow Management

NASA Technical Reports Server (NTRS)

Sheth, Kapil; Clymer, Alexis; Morando, Alex; Shih, Fu-Tai

2016-01-01

This paper presents an approach for creating common weather avoidance reroutes for multiple flights and the associated benefits analysis, which is an extension of the single flight advisories generated using the Dynamic Weather Routes (DWR) concept. These multiple flight advisories are implemented in the National Airspace System (NAS) Constraint Evaluation and Notification Tool (NASCENT), a nation-wide simulation environment to generate time- and fuel-saving alternate routes for flights during severe weather events. These single flight advisories are clustered together in the same Center by considering parameters such as a common return capture fix. The clustering helps propose routes called, Multi-Flight Common Routes (MFCR), that avoid weather and other airspace constraints, and save time and fuel. It is expected that these routes would also provide lower workload for traffic managers and controllers since a common route is found for several flights, and presumably the route clearances would be easier and faster. This study was based on 30-days in 2014 and 2015 each, which had most delays attributed to convective weather. The results indicate that many opportunities exist where individual flight routes can be clustered to fly along a common route to save a significant amount of time and fuel, and potentially reducing the amount of coordination needed.

Service discovery with routing protocols for MANETs

NASA Astrophysics Data System (ADS)

Gu, Xuemai; Shi, Shuo

2005-11-01

Service discovery is becoming an important topic as its use throughout the Internet becomes more widespread. In Mobile Ad hoc Networks (MANETs), the routing protocol is very important because it is special network. To find a path for data, and destination nodes, nodes send packets to each node, creating substantial overhead traffic and consuming much time. Even though a variety of routing protocols have been developed for use in MANETs, they are insufficient for reducing overhead traffic and time. In this paper, we propose SDRP: a new service discovery protocol combined with routing policies in MANETs. The protocol is performed upon a distributed network. We describe a service by a unique ID number and use a group-cast routing policy in advertisement and request. The group-cast routing policy decreases the traffic in networks, and it is efficient to find destination node. In addition, the nodes included in the reply path also cache the advertisement information, and it means when each node finds a node next time, they can know where it is as soon as possible, so they minimize the time. Finally, we compare SDRP with both Flood and MAODV in terms of overload, and average delay. Simulation results show SDRP can spend less response time and accommodate even high mobility network environments.

Network-wide BGP route prediction for traffic engineering

NASA Astrophysics Data System (ADS)

Feamster, Nick; Rexford, Jennifer

2002-07-01

The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering.

School Bus Crash Rates on Routine and Nonroutine Routes

ERIC Educational Resources Information Center

O'Neal, Elizabeth; Ramirez, Marizen; Hamann, Cara; Young, Tracy; Stahlhut, Mary; Peek-Asa, Corinne

2014-01-01

Background: Although prior research has established that school buses are a safe form of transportation, crashes can produce catastrophic consequences. School buses have 2 types of routes: predictable, routine routes that take children to and from school and less predictable, nonroutine routes for school events. No studies have examined school bus…

Operational Evaluatioin of Dynamic Weather Routes at American Airlines

NASA Technical Reports Server (NTRS)

McNally, David; Sheth, Kapil; Gong, Chester; Borchers, Paul; Osborne, Jeff; Keany, Desmond; Scott, Brennan; Smith, Steve; Sahlman, Scott; Lee, Chuhan;

OAM-labeled free-space optical flow routing.

PubMed

Gao, Shecheng; Lei, Ting; Li, Yangjin; Yuan, Yangsheng; Xie, Zhenwei; Li, Zhaohui; Yuan, Xiaocong

2016-09-19

Space-division multiplexing allows unprecedented scaling of bandwidth density for optical communication. Routing spatial channels among transmission ports is critical for future scalable optical network, however, there is still no characteristic parameter to label the overlapped optical carriers. Here we propose a free-space optical flow routing (OFR) scheme by using optical orbital angular moment (OAM) states to label optical flows and simultaneously steer each flow according to their OAM states. With an OAM multiplexer and a reconfigurable OAM demultiplexer, massive individual optical flows can be routed to the demanded optical ports. In the routing process, the OAM beams act as data carriers at the same time their topological charges act as each carrier's labels. Using this scheme, we experimentally demonstrate switching, multicasting and filtering network functions by simultaneously steer 10 input optical flows on demand to 10 output ports. The demonstration of data-carrying OFR with nonreturn-to-zero signals shows that this process enables synchronous processing of massive spatial channels and flexible optical network.

Single-photon routing with whispering-gallery resonators

NASA Astrophysics Data System (ADS)

Huang, Jin-Song; Zhang, Jia-Hao; Wei, L. F.

2018-04-01

Quantum routing of single photons in a system with two waveguides coupled to two whispering-gallery resonators (WGRs) are investigated theoretically. Using a real-space full quantum theory, photonic scattering amplitudes along four ports of the waveguide network are analytically obtained. It is shown that, by adjusting the geometric and physical parameters of the two-WGR configuration, the quantum routing properties of single photons along the present waveguide network can be controlled effectively. The routing capability from input waveguide to another one can significantly exceed 0.5 near the resonance point of scattering spectra, which can be achieved with only one resonator. By properly designing the distance between two WGRs and the waveguide-WGR coupling strengths, the transfer rate between the waveguides can also reach certain sufficiently high values even in the non-resonance regime. Moreover, Fano-like resonances in the scattering spectra are designable. The proposed system may provide a potential application in controlling single-photon quantum routing.

Coordinated Platoon Routing in a Metropolitan Network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing themore » platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.« less

A Survey on Clustering Routing Protocols in Wireless Sensor Networks

PubMed Central

Liu, Xuxun

2012-01-01

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions. PMID:23112649

A survey on clustering routing protocols in wireless sensor networks.

PubMed

Liu, Xuxun

2012-01-01

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

Cognitive load during route selection increases reliance on spatial heuristics.

PubMed

Brunyé, Tad T; Martis, Shaina B; Taylor, Holly A

2018-05-01

Planning routes from maps involves perceiving the symbolic environment, identifying alternate routes and applying explicit strategies and implicit heuristics to select an option. Two implicit heuristics have received considerable attention, the southern route preference and initial segment strategy. This study tested a prediction from decision-making theory that increasing cognitive load during route planning will increase reliance on these heuristics. In two experiments, participants planned routes while under conditions of minimal (0-back) or high (2-back) working memory load. In Experiment 1, we examined how memory load impacts the southern route heuristic. In Experiment 2, we examined how memory load impacts the initial segment heuristic. Results replicated earlier results demonstrating a southern route preference (Experiment 1) and initial segment strategy (Experiment 2) and further demonstrated that evidence for heuristic reliance is more likely under conditions of concurrent working memory load. Furthermore, the extent to which participants maintained efficient route selection latencies in the 2-back condition predicted the magnitude of this effect. Together, results demonstrate that working memory load increases the application of heuristics during spatial decision making, particularly when participants attempt to maintain quick decisions while managing concurrent task demands.

On-Board Switching and Routing Advanced Technology Study

NASA Technical Reports Server (NTRS)

Yegenoglu, F.; Inukai, T.; Kaplan, T.; Redman, W.; Mitchell, C.

1998-01-01

Future satellite communications is expected to be fully integrated into National and Global Information Infrastructures (NII/GII). These infrastructures will carry multi gigabit-per-second data rates, with integral switching and routing of constituent data elements. The satellite portion of these infrastructures must, therefore, be more than pipes through the sky. The satellite portion will also be required to perform very high speed routing and switching of these data elements to enable efficient broad area coverage to many home and corporate users. The technology to achieve the on-board switching and routing must be selected and developed specifically for satellite application within the next few years. This report presents evaluation of potential technologies for on-board switching and routing applications.

49 CFR 1542.201 - Security of the secured area.

Code of Federal Regulations, 2013 CFR

2013-10-01

... SECURITY ADMINISTRATION, DEPARTMENT OF HOMELAND SECURITY CIVIL AVIATION SECURITY AIRPORT SECURITY Operations § 1542.201 Security of the secured area. (a) Each airport operator required to have a security... posted by each airport operator in accordance with its security program not later than November 14, 2003. ...

49 CFR 1542.201 - Security of the secured area.

Code of Federal Regulations, 2010 CFR

2010-10-01

... SECURITY ADMINISTRATION, DEPARTMENT OF HOMELAND SECURITY CIVIL AVIATION SECURITY AIRPORT SECURITY Operations § 1542.201 Security of the secured area. (a) Each airport operator required to have a security... posted by each airport operator in accordance with its security program not later than November 14, 2003. ...

49 CFR 1542.201 - Security of the secured area.

Code of Federal Regulations, 2011 CFR

2011-10-01

... SECURITY ADMINISTRATION, DEPARTMENT OF HOMELAND SECURITY CIVIL AVIATION SECURITY AIRPORT SECURITY Operations § 1542.201 Security of the secured area. (a) Each airport operator required to have a security... posted by each airport operator in accordance with its security program not later than November 14, 2003. ...

49 CFR 1542.201 - Security of the secured area.

Code of Federal Regulations, 2012 CFR

2012-10-01

... SECURITY ADMINISTRATION, DEPARTMENT OF HOMELAND SECURITY CIVIL AVIATION SECURITY AIRPORT SECURITY Operations § 1542.201 Security of the secured area. (a) Each airport operator required to have a security... posted by each airport operator in accordance with its security program not later than November 14, 2003. ...

49 CFR 1542.201 - Security of the secured area.

Code of Federal Regulations, 2014 CFR

2014-10-01

... SECURITY ADMINISTRATION, DEPARTMENT OF HOMELAND SECURITY CIVIL AVIATION SECURITY AIRPORT SECURITY Operations § 1542.201 Security of the secured area. (a) Each airport operator required to have a security... posted by each airport operator in accordance with its security program not later than November 14, 2003. ...

Identifying security checkpoints locations to protect the major U.S. urban areas

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cuellar-Hengartner, Leticia; Watkins, Daniel; Kubicek, Deborah A.

Transit networks are integral to the economy and to society, but at the same time they could allow terrorists to transport weapons of mass destruction into any city. Road networks are especially vulnerable, because they lack natural checkpoints unlike air networks that have security measures in place at all major airports. One approach to mitigate this risk is ensuring that every road route passes through at least one security checkpoint. Using the Ford-Fulkerson maximum-flow algorithm, we generate a minimum set of checkpoint locations within a ring-shaped buffer area surrounding the 50 largest US urban areas. We study how the numbermore » of checkpoints changes as we increase the buffer width to perform a cost-benefit analysis and to identify groups of cities that behave similarly. The set of required checkpoints is surprisingly small (10-124) despite the hundreds of thousands of road arcs in those areas, making it feasible to protect all major cities.« less

Identifying security checkpoints locations to protect the major U.S. urban areas

DOE PAGES

Cuellar-Hengartner, Leticia; Watkins, Daniel; Kubicek, Deborah A.; ...

2015-09-01

Transit networks are integral to the economy and to society, but at the same time they could allow terrorists to transport weapons of mass destruction into any city. Road networks are especially vulnerable, because they lack natural checkpoints unlike air networks that have security measures in place at all major airports. One approach to mitigate this risk is ensuring that every road route passes through at least one security checkpoint. Using the Ford-Fulkerson maximum-flow algorithm, we generate a minimum set of checkpoint locations within a ring-shaped buffer area surrounding the 50 largest US urban areas. We study how the numbermore » of checkpoints changes as we increase the buffer width to perform a cost-benefit analysis and to identify groups of cities that behave similarly. The set of required checkpoints is surprisingly small (10-124) despite the hundreds of thousands of road arcs in those areas, making it feasible to protect all major cities.« less

MODFLOW-LGR-Modifications to the streamflow-routing package (SFR2) to route streamflow through locally refined grids

USGS Publications Warehouse

Mehl, Steffen W.; Hill, Mary C.

2011-01-01

This report documents modifications to the Streamflow-Routing Package (SFR2) to route streamflow through grids constructed using the multiple-refined-areas capability of shared node Local Grid Refinement (LGR) of MODFLOW-2005. MODFLOW-2005 is the U.S. Geological Survey modular, three-dimensional, finite-difference groundwater-flow model. LGR provides the capability to simulate groundwater flow by using one or more block-shaped, higher resolution local grids (child model) within a coarser grid (parent model). LGR accomplishes this by iteratively coupling separate MODFLOW-2005 models such that heads and fluxes are balanced across the shared interfacing boundaries. Compatibility with SFR2 allows for streamflow routing across grids. LGR can be used in two- and three-dimensional, steady-state and transient simulations and for simulations of confined and unconfined groundwater systems.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

DOEpatents

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

2010-11-23

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

A Multi-Agent Framework for Packet Routing in Wireless Sensor Networks

PubMed Central

Ye, Dayon; Zhang, Minji; Yang, Yu

2015-01-01

Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage. PMID:25928063

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

NASA Astrophysics Data System (ADS)

Qadri, Nadia N.; Liotta, Antonio

Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

Selective epidemic vaccination under the performant routing algorithms

NASA Astrophysics Data System (ADS)

Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

2018-04-01

Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

Trade routes and plague transmission in pre-industrial Europe.

PubMed

Yue, Ricci P H; Lee, Harry F; Wu, Connor Y H

2017-10-11

Numerous historical works have mentioned that trade routes were to blame for the spread of plague in European history, yet this relationship has never been tested by quantitative evidence. Here, we resolve the hypothetical role of trade routes through statistical analysis on the geo-referenced major trade routes in the early modern period and the 6,656 geo-referenced plague outbreak records in AD1347-1760. Ordinary Least Square (OLS) estimation results show that major trade routes played a dominant role in spreading plague in pre-industrial Europe. Furthermore, the negative correlation between plague outbreaks and their distance from major trade ports indicates the absence of a permanent plague focus in the inland areas of Europe. Major trade routes decided the major plague outbreak hotspots, while navigable rivers determined the geographic pattern of sporadic plague cases. A case study in Germany indicates that plague penetrated further into Europe through the local trade route network. Based on our findings, we propose the mechanism of plague transmission in historical Europe, which is imperative in demonstrating how pandemics were spread in recent human history.

Alternative security

DOE Office of Scientific and Technical Information (OSTI.GOV)

Weston, B.H.

This book contains the following chapters: The Military and Alternative Security: New Missions for Stable Conventional Security; Technology and Alternative Security: A Cherished Myth Expires; Law and Alternative Security: Toward a Just World Peace; Politics and Alternative Security: Toward a More Democratic, Therefore More Peaceful, World; Economics and Alternative Security: Toward a Peacekeeping International Economy; Psychology and Alternative Security: Needs, Perceptions, and Misperceptions; Religion and Alternative Security: A Prophetic Vision; and Toward Post-Nuclear Global Security: An Overview.

FuGeF: A Resource Bound Secure Forwarding Protocol for Wireless Sensor Networks.

PubMed

Umar, Idris Abubakar; Mohd Hanapi, Zurina; Sali, A; Zulkarnain, Zuriati A

2016-06-22

Resource bound security solutions have facilitated the mitigation of spatio-temporal attacks by altering protocol semantics to provide minimal security while maintaining an acceptable level of performance. The Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing protocol for Wireless Sensor Network (WSN) has been proposed to achieve a minimal selection of malicious nodes by introducing a dynamic collection window period to the protocol's semantics. However, its selection scheme suffers substantial packet losses due to the utilization of a single distance based parameter for node selection. In this paper, we propose a Fuzzy-based Geographic Forwarding protocol (FuGeF) to minimize packet loss, while maintaining performance. The FuGeF utilizes a new form of dynamism and introduces three selection parameters: remaining energy, connectivity cost, and progressive distance, as well as a Fuzzy Logic System (FLS) for node selection. These introduced mechanisms ensure the appropriate selection of a non-malicious node. Extensive simulation experiments have been conducted to evaluate the performance of the proposed FuGeF protocol as compared to DWSIGF variants. The simulation results show that the proposed FuGeF outperforms the two DWSIGF variants (DWSIGF-P and DWSIGF-R) in terms of packet delivery.

A double candidate survivable routing protocol for HAP network

NASA Astrophysics Data System (ADS)

He, Panfeng; Li, Chunyue; Ni, Shuyan

2016-11-01

To improve HAP network invulnerability, and at the same time considering the quasi-dynamic topology in HAP network, a simple and reliable routing protocol is proposed in the paper. The protocol firstly uses a double-candidate strategy for the next-node select to provide better robustness. Then during the maintenance stage, short hello packets instead of long routing packets are used only to check link connectivity in the quasi-dynamic HAP network. The route maintenance scheme based on short hello packets can greatly reduce link spending. Simulation results based on OPNET demonstrate the effectiveness of the proposed routing protocol.

What is the optimal architecture for visual information routing?

PubMed

Wolfrum, Philipp; von der Malsburg, Christoph

2007-12-01

Analyzing the design of networks for visual information routing is an underconstrained problem due to insufficient anatomical and physiological data. We propose here optimality criteria for the design of routing networks. For a very general architecture, we derive the number of routing layers and the fanout that minimize the required neural circuitry. The optimal fanout l is independent of network size, while the number k of layers scales logarithmically (with a prefactor below 1), with the number n of visual resolution units to be routed independently. The results are found to agree with data of the primate visual system.

A Comparison of Zoo Animal Behavior in the Presence of Familiar and Unfamiliar People.

PubMed

Martin, Rosemary Anne; Melfi, Vicky

2016-01-01

As recorded in domestic nonhuman animals, regular interactions between animals in zoos and keepers and the resulting relationship formed (human-animal relationship [HAR]) are likely to influence the animals' behaviors with associated welfare consequences. HAR formation requires that zoo animals distinguish between familiar and unfamiliar people. This ability was tested by comparing zoo animal behavioral responses to familiar (routine) keepers and unfamiliar keepers (participants in the "Keeper for the Day" program). Study subjects included 1 African elephant (Loxodonta Africana), 3 Rothschild's giraffes (Giraffa camelopardalis rothschildi), 2 Brazilian tapir (Tapirus terrestris), and 2 slender-tailed meerkats (Suricata suricatta). Different behavior was evident and observed as decreased avoidance behavior toward familiar keepers (t7 = 6.00, p <  .001). This finding suggests the zoo animals have a lower level of fear toward familiar keepers. Keeper familiarity did not significantly affect any other behavioral measure. This finding suggests that in the current study, unfamiliar keeper presence did not appear to have detrimental effects. Furthermore, unfamiliar keeper-animal interactions could provide an increased number of positive human-animal interactions and potentially enhance animal welfare.

Supracervical hysterectomy - the vaginal route.

PubMed

Wilczyński, Miłosz; Cieślak, Jarosław; Malinowski, Andrzej

2014-06-01

Removal of the cervix during hysterectomy is not mandatory. There has been no irrefutable evidence so far that total hysterectomy is more beneficial to patients in terms of pelvic organ function. The procedure that leaves the cervix intact is called a subtotal hysterectomy. Traditional approaches to this surgery include laparoscopic and abdominal routes. Vaginal total hysterectomy has been proven to present many advantages over the other approaches. Therefore, it seems that this route should also be applied in the case of subtotal hysterectomy. We present 9 cases of patients who underwent subtotal hysterectomy performed through the vagina for benign gynecological diseases.

Improved efficient routing strategy on two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Han, Weizhan; Guo, Qing; Zhang, Shuai; Wang, Junfang; Wang, Zhihao

2016-10-01

The traffic dynamics of multi-layer networks has become a hot research topic since many networks are comprised of two or more layers of subnetworks. Due to its low traffic capacity, the traditional shortest path routing (SPR) protocol is susceptible to congestion on two-layer complex networks. In this paper, we propose an efficient routing strategy named improved global awareness routing (IGAR) strategy which is based on the betweenness centrality of nodes in the two layers. With the proposed strategy, the routing paths can bypass hub nodes of both layers to enhance the transport efficiency. Simulation results show that the IGAR strategy can bring much better traffic capacity than the SPR and the global awareness routing (GAR) strategies. Because of the significantly improved traffic performance, this study is helpful to alleviate congestion of the two-layer complex networks.

Identifying and prioritizing ungulate migration routes for landscape-level conservation

USGS Publications Warehouse

Sawyer, H.; Kauffman, M.J.; Nielson, R.M.; Horne, J.S.

2009-01-01

As habitat loss and fragmentation increase across ungulate ranges, identifying and prioritizing migration routes for conservation has taken on new urgency. Here we present a general framework using the Brownian bridge movement model (BBMM) that: (1) provides a probabilistic estimate of the migration routes of a sampled population, (2) distinguishes between route segments that function as stopover sites vs. those used primarily as movement corridors, and (3) prioritizes routes for conservation based upon the proportion of the sampled population that uses them. We applied this approach to a migratory mule deer (Odocoileus hemionus) population in a pristine area of southwest Wyoming, USA, where 2000 gas wells and 1609 km of pipelines and roads have been proposed for development. Our analysis clearly delineated where migration routes occurred relative to proposed development and provided guidance for on-the-ground conservation efforts. Mule deer migration routes were characterized by a series of stopover sites where deer spent most of their time, connected by movement corridors through which deer moved quickly. Our findings suggest management strategies that differentiate between stopover sites and movement corridors may be warranted. Because some migration routes were used by more mule deer than others, proportional level of use may provide a reasonable metric by which routes can be prioritized for conservation. The methods we outline should be applicable to a wide range of species that inhabit regions where migration routes are threatened or poorly understood. ?? 2009 by the Ecological Society of America.

Identifying and prioritizing ungulate migration routes for landscape-level conservation

USGS Publications Warehouse

Sawyer, Hall; Kauffman, Matthew J.; Nielson, Ryan M.; Horne, Jon S.

2009-01-01

As habitat loss and fragmentation increase across ungulate ranges, identifying and prioritizing migration routes for conservation has taken on new urgency. Here we present a general framework using the Brownian bridge movement model (BBMM) that: (1) provides a probabilistic estimate of the migration routes of a sampled population, (2) distinguishes between route segments that function as stopover sites vs. those used primarily as movement corridors, and (3) prioritizes routes for conservation based upon the proportion of the sampled population that uses them. We applied this approach to a migratory mule deer (Odocoileus hemionus) population in a pristine area of southwest Wyoming, USA, where 2000 gas wells and 1609 km of pipelines and roads have been proposed for development. Our analysis clearly delineated where migration routes occurred relative to proposed development and provided guidance for on-the-ground conservation efforts. Mule deer migration routes were characterized by a series of stopover sites where deer spent most of their time, connected by movement corridors through which deer moved quickly. Our findings suggest management strategies that differentiate between stopover sites and movement corridors may be warranted. Because some migration routes were used by more mule deer than others, proportional level of use may provide a reasonable metric by which routes can be prioritized for conservation. The methods we outline should be applicable to a wide range of species that inhabit regions where migration routes are threatened or poorly understood.

An optimal routing strategy on scale-free networks

NASA Astrophysics Data System (ADS)

Yang, Yibo; Zhao, Honglin; Ma, Jinlong; Qi, Zhaohui; Zhao, Yongbin

Traffic is one of the most fundamental dynamical processes in networked systems. With the traditional shortest path routing (SPR) protocol, traffic congestion is likely to occur on the hub nodes on scale-free networks. In this paper, we propose an improved optimal routing (IOR) strategy which is based on the betweenness centrality and the degree centrality of nodes in the scale-free networks. With the proposed strategy, the routing paths can accurately bypass hub nodes in the network to enhance the transport efficiency. Simulation results show that the traffic capacity as well as some other indexes reflecting transportation efficiency are further improved with the IOR strategy. Owing to the significantly improved traffic performance, this study is helpful to design more efficient routing strategies in communication or transportation systems.

Dynamic real-time routing for evacuation response planning and execution.

DOT National Transportation Integrated Search

2011-01-01

This study addresses the problem of dynamic routing operations in the emergency response context, primarily in terms : of the routing of response vehicles and evacuees. The study focuses on identifying the paths used for routing response : vehicles a...

From Secure Memories to Smart Card Security

NASA Astrophysics Data System (ADS)

Handschuh, Helena; Trichina, Elena

Non-volatile memory is essential in most embedded security applications. It will store the key and other sensitive materials for cryptographic and security applications. In this chapter, first an overview is given of current flash memory architectures. Next the standard security features which form the basis of so-called secure memories are described in more detail. Smart cards are a typical embedded application that is very vulnerable to attacks and that at the same time has a high need for secure non-volatile memory. In the next part of this chapter, the secure memories of so-called flash-based high-density smart cards are described. It is followed by a detailed analysis of what the new security challenges for such objects are.

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

DOE Office of Scientific and Technical Information (OSTI.GOV)

Konjevod, Goran; Richa, Andréa W.; Xia, Donglin

In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names aremore » independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.« less

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

DOE PAGES

Konjevod, Goran; Richa, Andréa W.; Xia, Donglin

2016-06-15

In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names aremore » independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.« less

Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

PubMed Central

Zhang, Hang; Maddula, Soumya V.; Maloney, Laurence T.

2010-01-01

We designed an economic task to investigate human planning of routes in landscapes where travel in different kinds of terrain incurs different costs. Participants moved their finger across a touch screen from a starting point to a destination. The screen was divided into distinct kinds of terrain and travel within each kind of terrain imposed a cost proportional to distance traveled. We varied costs and spatial configurations of terrains and participants received fixed bonuses minus the total cost of the routes they chose. We first compared performance to a model maximizing gain. All but one of 12 participants failed to adopt least-cost routes and their failure to do so reduced their winnings by about 30% (median value). We tested in detail whether participants’ choices of routes satisfied three necessary conditions (heuristics) for a route to maximize gain. We report failures of one heuristic for 7 out of 12 participants. Last of all, we modeled human performance with the assumption that participants assign subjective utilities to costs and maximize utility. For 7 out 12 participants, the fitted utility function was an accelerating power function of actual cost and for the remaining 5, a decelerating power function. We discuss connections between utility aggregation in route planning and decision under risk. Our task could be adapted to investigate human strategy and optimality of route planning in full-scale landscapes. PMID:21833269

Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

PubMed Central

Sun, Yan; Lang, Maoxiang; Wang, Danzhu

2016-01-01

The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

Innovative routing and scheduling concepts for transit systems.

DOT National Transportation Integrated Search

1984-01-01

The objective of this research was to investigate innovative routing and scheduling concepts to determine how transit systems in Virginia may improve ridership and reduce operating costs. Information on innovative routing and scheduling concepts was ...

Methodology development for quantitative optimization of security enhancement in medical information systems -Case study in a PACS and a multi-institutional radiotherapy database-.

PubMed

Haneda, Kiyofumi; Umeda, Tokuo; Koyama, Tadashi; Harauchi, Hajime; Inamura, Kiyonari

2002-01-01

The target of our study is to establish the methodology for analyzing level of security requirements, for searching suitable security measures and for optimizing security distribution to every portion of medical practice. Quantitative expression must be introduced to our study as possible for the purpose of easy follow up of security procedures and easy evaluation of security outcomes or results. Results of system analysis by fault tree analysis (FTA) clarified that subdivided system elements in detail contribute to much more accurate analysis. Such subdivided composition factors very much depended on behavior of staff, interactive terminal devices, kinds of service, and routes of network. As conclusion, we found the methods to analyze levels of security requirements for each medical information systems employing FTA, basic events for each composition factor and combination of basic events. Methods for searching suitable security measures were found. Namely risk factors for each basic event, number of elements for each composition factor and candidates of security measure elements were found. Method to optimize the security measures for each medical information system was proposed. Namely optimum distribution of risk factors in terms of basic events were figured out, and comparison of them between each medical information systems became possible.

Power Conservation through Energy Efficient Routing in Wireless Sensor Networks.

PubMed

Kandris, Dionisis; Tsioumas, Panagiotis; Tzes, Anthony; Nikolakopoulos, George; Vergados, Dimitrios D

2009-01-01

The power awareness issue is the primary concern within the domain of Wireless Sensor Networks (WSNs). Most power dissipation ocurrs during communication, thus routing protocols in WSNs mainly aim at power conservation. Moreover, a routing protocol should be scalable, so that its effectiveness does not degrade as the network size increases. In response to these issues, this work describes the development of an efficient routing protocol, named SHPER (Scaling Hierarchical Power Efficient Routing).

An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks

PubMed Central

Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

2014-01-01

This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter—a small, random variation in the timing of message emission—is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality. PMID:25111238

Research on the optimization of vehicle distribution routes in logistics enterprises

NASA Astrophysics Data System (ADS)

Fan, Zhigou; Ma, Mengkun

2018-01-01

With the rapid development of modern logistics, the vehicle routing problem has become one of the urgent problems in the logistics industry. The rationality of distribution route planning directly affects the efficiency and quality of logistics distribution. This paper first introduces the definition of logistics distribution and the three methods of optimizing the distribution routes, and then analyzes the current vehicle distribution route by using a representative example, finally puts forward the optimization schemes of logistics distribution route.

Tour time in a two-route traffic system controlled by signals

NASA Astrophysics Data System (ADS)

Nagatani, Takashi; Naito, Yuichi

2011-11-01

We study the dynamic behavior of vehicular traffic in a two-route system with a series of signals (traffic lights) at low density where the number of signals on route A is different from that on route B. We investigate the dependence of the tour time on the route for some strategies of signal control. The nonlinear dynamic model of a two-route traffic system controlled by signals is presented by nonlinear maps. The vehicular traffic exhibits a very complex behavior, depending on the cycle time, the phase difference, and the irregularity. The dependence of the tour time on the route choice is clarified for the signal strategies.

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

NASA Technical Reports Server (NTRS)

Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

2010-01-01

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Route Monopolie and Optimal Nonlinear Pricing

NASA Technical Reports Server (NTRS)

Tournut, Jacques

2003-01-01

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

PubMed Central

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

2017-01-01

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

PubMed

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

2017-05-22

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

Pheromone Static Routing Strategy for Complex Networks

NASA Astrophysics Data System (ADS)

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.

8. View southeast, Route 100 (Montchanin Road) to left duck ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

8. View southeast, Route 100 (Montchanin Road) to left duck and large stand of old growth oak trees at back entrance to Winterthur center right. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

Short-term memory, executive control, and children's route learning.

PubMed

Purser, Harry R M; Farran, Emily K; Courbois, Yannick; Lemahieu, Axelle; Mellier, Daniel; Sockeel, Pascal; Blades, Mark

2012-10-01

The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11years and to relate route-learning performance to the components of Baddeley's model of working memory. Children carried out tasks that included measures of verbal and visuospatial short-term memory and executive control and also measures of verbal and visuospatial long-term memory; the route-learning task was conducted using a maze in a virtual environment. In contrast to previous research, correlations were found between both visuospatial and verbal memory tasks-the Corsi task, short-term pattern span, digit span, and visuospatial long-term memory-and route-learning performance. However, further analyses indicated that these relationships were mediated by executive control demands that were common to the tasks, with long-term memory explaining additional unique variance in route learning. Copyright © 2012 Elsevier Inc. All rights reserved.

Common object request broker architecture (CORBA)-based security services for the virtual radiology environment.

PubMed

Martinez, R; Cole, C; Rozenblit, J; Cook, J F; Chacko, A K

2000-05-01

includes (a) radiologist schedules; (b) modality worklists; (c) routed case information; (d) DIN-PACS and Composite Health Care system (CHCS) messages, and Meta-Manager administrative and security information; and (e) patient case information. (3) Access control and communications security is required in the VRE to control who uses the VRE and Meta-Manager facilities and to secure the messages between VRE components. The CORBA Security Service Specification version 1.5 is designed to allow up to TCSEC's B2-level security for distributed objects. The CORBA Security Service Specification defines the functionality of several security features: identification and authentication, authorization and access control, security auditing, communication security, nonrepudiation, and security administration. This report describes the enhanced security features for the VRE and their implementation using commercial CORBA Security Service software products.

Standardization of databases for AMDB taxi routing functions

NASA Astrophysics Data System (ADS)

Pschierer, C.; Sindlinger, A.; Schiefele, J.

2010-04-01

Input, management, and display of taxi routes on airport moving map displays (AMM) have been covered in various studies in the past. The demonstrated applications are typically based on Aerodrome Mapping Databases (AMDB). Taxi routing functions require specific enhancements, typically in the form of a graph network with nodes and edges modeling all connectivities within an airport, which are not supported by the current AMDB standards. Therefore, the data schemas and data content have been defined specifically for the purpose and test scenarios of these studies. A standardization of the data format for taxi routing information is a prerequisite for turning taxi routing functions into production. The joint RTCA/EUROCAE special committee SC-217, responsible for updating and enhancing the AMDB standards DO-272 [1] and DO-291 [2], is currently in the process of studying different alternatives and defining reasonable formats. Requirements for taxi routing data are primarily driven by depiction concepts for assigned and cleared taxi routes, but also by database size and the economic feasibility. Studied concepts are similar to the ones described in the GDF (geographic data files) specification [3], which is used in most car navigation systems today. They include - A highly aggregated graph network of complex features - A modestly aggregated graph network of simple features - A non-explicit topology of plain AMDB taxi guidance line elements This paper introduces the different concepts and their advantages and disadvantages.