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.

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.

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

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.

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.

The "path" not taken: exploring structural differences in mapped- versus shortest-network-path school travel routes.

PubMed

Buliung, Ron N; Larsen, Kristian; Faulkner, Guy E J; Stone, Michelle R

2013-09-01

School route measurement often involves estimating the shortest network path. We challenged the relatively uncritical adoption of this method in school travel research and tested the route discordance hypothesis that several types of difference exist between shortest network paths and reported school routes. We constructed the mapped and shortest path through network routes for a sample of 759 children aged 9 to 13 years in grades 5 and 6 (boys = 45%, girls = 54%, unreported gender = 1%), in Toronto, Ontario, Canada. We used Wilcoxon signed-rank tests to compare reported with shortest-path route measures including distance, route directness, intersection crossings, and route overlap. Measurement difference was explored by mode and location. We found statistical evidence of route discordance for walkers and children who were driven and detected it more often for inner suburban cases. Evidence of route discordance varied by mode and school location. We found statistically significant differences for route structure and built environment variables measured along reported and geographic information systems-based shortest-path school routes. Uncertainty produced by the shortest-path approach challenges its conceptual and empirical validity in school travel research.

The “Path” Not Taken: Exploring Structural Differences in Mapped- Versus Shortest-Network-Path School Travel Routes

PubMed Central

Larsen, Kristian; Faulkner, Guy E. J.; Stone, Michelle R.

2013-01-01

Objectives. School route measurement often involves estimating the shortest network path. We challenged the relatively uncritical adoption of this method in school travel research and tested the route discordance hypothesis that several types of difference exist between shortest network paths and reported school routes. Methods. We constructed the mapped and shortest path through network routes for a sample of 759 children aged 9 to 13 years in grades 5 and 6 (boys = 45%, girls = 54%, unreported gender = 1%), in Toronto, Ontario, Canada. We used Wilcoxon signed-rank tests to compare reported with shortest-path route measures including distance, route directness, intersection crossings, and route overlap. Measurement difference was explored by mode and location. Results. We found statistical evidence of route discordance for walkers and children who were driven and detected it more often for inner suburban cases. Evidence of route discordance varied by mode and school location. Conclusions. We found statistically significant differences for route structure and built environment variables measured along reported and geographic information systems–based shortest-path school routes. Uncertainty produced by the shortest-path approach challenges its conceptual and empirical validity in school travel research. PMID:23865648

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 compared to the shortest routes (walking: OR = 1.04, 95% CI = 1.01-1.07; cycling: OR = 1.03, 95% CI = 1.01-1.05). This study showed a novel approach to examine built environmental exposure during active transport to school. Most of the results of the study suggest that children avoid to walk or cycle along busy roads on their way to school.

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.

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

Differences in physical environmental characteristics between adolescents' actual and shortest cycling routes: a study using a Google Street View-based audit.

PubMed

Verhoeven, Hannah; Van Hecke, Linde; Van Dyck, Delfien; Baert, Tim; Van de Weghe, Nico; Clarys, Peter; Deforche, Benedicte; Van Cauwenberg, Jelle

2018-05-29

The objective evaluation of the physical environmental characteristics (e.g. speed limit, cycling infrastructure) along adolescents' actual cycling routes remains understudied, although it may provide important insights into why adolescents prefer one cycling route over another. The present study aims to gain insight into the physical environmental characteristics determining the route choice of adolescent cyclists by comparing differences in physical environmental characteristics between their actual cycling routes and the shortest possible cycling routes. Adolescents (n = 204; 46.5% boys; 14.4 ± 1.2 years) recruited at secondary schools in and around Ghent (city in Flanders, northern part of Belgium) were instructed to wear a Global Positioning System device in order to identify cycling trips. For all identified cycling trips, the shortest possible route that could have been taken was calculated. Actual cycling routes that were not the shortest possible cycling routes were divided into street segments. Segments were audited with a Google Street View-based tool to assess physical environmental characteristics along actual and shortest cycling routes. Out of 160 actual cycling trips, 73.1% did not differ from the shortest possible cycling route. For actual cycling routes that were not the shortest cycling route, a speed limit of 30 km/h, roads having few buildings with windows on the street side and roads without cycle lane were more frequently present compared to the shortest possible cycling routes. A mixed land use, roads with commercial destinations, arterial roads, cycle lanes separated from traffic by white lines, small cycle lanes and cycle lanes covered by lighting were less frequently present along actual cycling routes compared to the shortest possible cycling routes. Results showed that distance mainly determines the route along which adolescents cycle. In addition, adolescents cycled more along residential streets (even if no cycle lane was present) and less along busy, arterial roads. Local authorities should provide shortcuts free from motorised traffic to meet adolescents' preference to cycle along the shortest route and to avoid cycling along arterial roads.

An improved global dynamic routing strategy for scale-free network with tunable clustering

NASA Astrophysics Data System (ADS)

Sun, Lina; Huang, Ning; Zhang, Yue; Bai, Yannan

2016-08-01

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an improved global dynamic routing strategy is proposed, which considers the congestion of all nodes on the shortest path and incorporates the waiting time of the most congested node into the path. We investigate the effectiveness of the proposed routing for scale-free network with different clustering coefficients. The shortest path routing strategy and the traffic awareness routing strategy only considering the waiting time of neighbor node are analyzed comparatively. Simulation results show that network capacity is greatly enhanced compared with the shortest path; congestion state increase is relatively slow compared with the traffic awareness routing strategy. Clustering coefficient increase will not only reduce the network throughput, but also result in transmission average path length increase for scale-free network with tunable clustering. The proposed routing is favorable to ease network congestion and network routing strategy design.

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.

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

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

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.

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.

Putting emotions in routes: the influence of emotionally laden landmarks on spatial memory.

PubMed

Ruotolo, F; Claessen, M H G; van der Ham, I J M

2018-04-16

The aim of this study was to assess how people memorize spatial information of emotionally laden landmarks along a route and if the emotional value of the landmarks affects the way metric and configurational properties of the route itself are represented. Three groups of participants were asked to watch a movie of a virtual walk along a route. The route could contain positive, negative, or neutral landmarks. Afterwards, participants were asked to: (a) recognize the landmarks; (b) imagine to walk distances between landmarks; (c) indicate the position of the landmarks along the route; (d) judge the length of the route; (e) draw the route. Results showed that participants who watched the route with positive landmarks were more accurate in locating the landmarks along the route and drawing the route. On the other hand, participants in the negative condition judged the route as longer than participants in the other two conditions and were less accurate in mentally reproducing distances between landmarks. The data will be interpreted in the light of the "feelings-as-information theory" by Schwarz (2010) and the most recent evidence about the effect of emotions on spatial memory. In brief, the evidence collected in this study supports the idea that spatial cognition emerges from the interaction between an organism and contextual characteristics.

Air traffic management evaluation tool

NASA Technical Reports Server (NTRS)

Sridhar, Banavar (Inventor); Chatterji, Gano Broto (Inventor); Schipper, John F. (Inventor); Bilimoria, Karl D. (Inventor); Grabbe, Shon (Inventor); Sheth, Kapil S. (Inventor)

2012-01-01

Methods for evaluating and implementing air traffic management tools and approaches for managing and avoiding an air traffic incident before the incident occurs. A first system receives parameters for flight plan configurations (e.g., initial fuel carried, flight route, flight route segments followed, flight altitude for a given flight route segment, aircraft velocity for each flight route segment, flight route ascent rate, flight route descent route, flight departure site, flight departure time, flight arrival time, flight destination site and/or alternate flight destination site), flight plan schedule, expected weather along each flight route segment, aircraft specifics, airspace (altitude) bounds for each flight route segment, navigational aids available. The invention provides flight plan routing and direct routing or wind optimal routing, using great circle navigation and spherical Earth geometry. The invention provides for aircraft dynamics effects, such as wind effects at each altitude, altitude changes, airspeed changes and aircraft turns to provide predictions of aircraft trajectory (and, optionally, aircraft fuel use). A second system provides several aviation applications using the first system. Several classes of potential incidents are analyzed and averted, by appropriate change en route of one or more parameters in the flight plan configuration, as provided by a conflict detection and resolution module and/or traffic flow management modules. These applications include conflict detection and resolution, miles-in trail or minutes-in-trail aircraft separation, flight arrival management, flight re-routing, weather prediction and analysis and interpolation of weather variables based upon sparse measurements. The invention combines these features to provide an aircraft monitoring system and an aircraft user system that interact and negotiate changes with each other.

Enhancement of Beaconless Location-Based Routing with Signal Strength Assistance for Ad-Hoc Networks

NASA Astrophysics Data System (ADS)

Chen, Guowei; Itoh, Kenichi; Sato, Takuro

Routing in Ad-hoc networks is unreliable due to the mobility of the nodes. Location-based routing protocols, unlike other protocols which rely on flooding, excel in network scalability. Furthermore, new location-based routing protocols, like, e. g. BLR [1], IGF [2], & CBF [3] have been proposed, with the feature of not requiring beacons in MAC-layer, which improve more in terms of scalability. Such beaconless routing protocols can work efficiently in dense network areas. However, these protocols' algorithms have no ability to avoid from routing into sparse areas. In this article, historical signal strength has been added as a factor into the BLR algorithm, which avoids routing into sparse area, and consequently improves the global routing efficiency.

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.

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.

An Opportunistic Routing Mechanism Combined with Long-Term and Short-Term Metrics for WMN

PubMed Central

Piao, Xianglan; Qiu, Tie

2014-01-01

WMN (wireless mesh network) is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count) does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing) and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX. PMID:25250379

An opportunistic routing mechanism combined with long-term and short-term metrics for WMN.

PubMed

Sun, Weifeng; Wang, Haotian; Piao, Xianglan; Qiu, Tie

2014-01-01

WMN (wireless mesh network) is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count) does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing) and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX.

A constrained multinomial Probit route choice model in the metro network: Formulation, estimation and application

PubMed Central

Zhang, Yongsheng; Wei, Heng; Zheng, Kangning

2017-01-01

Considering that metro network expansion brings us with more alternative routes, it is attractive to integrate the impacts of routes set and the interdependency among alternative routes on route choice probability into route choice modeling. Therefore, the formulation, estimation and application of a constrained multinomial probit (CMNP) route choice model in the metro network are carried out in this paper. The utility function is formulated as three components: the compensatory component is a function of influencing factors; the non-compensatory component measures the impacts of routes set on utility; following a multivariate normal distribution, the covariance of error component is structured into three parts, representing the correlation among routes, the transfer variance of route, and the unobserved variance respectively. Considering multidimensional integrals of the multivariate normal probability density function, the CMNP model is rewritten as Hierarchical Bayes formula and M-H sampling algorithm based Monte Carlo Markov Chain approach is constructed to estimate all parameters. Based on Guangzhou Metro data, reliable estimation results are gained. Furthermore, the proposed CMNP model also shows a good forecasting performance for the route choice probabilities calculation and a good application performance for transfer flow volume prediction. PMID:28591188

Life cycle assessment of cellulose nanofibrils production by mechanical treatment and two different pretreatment processes.

PubMed

Arvidsson, Rickard; Nguyen, Duong; Svanström, Magdalena

2015-06-02

Nanocellulose is a bionanomaterial with many promising applications, but high energy use in production has been described as a potential obstacle for future use. In fact, life cycle assessment studies have indicated high life cycle energy use for nanocellulose. In this study, we assess the cradle-to-gate environmental impacts of three production routes for a particular type of nanocellulose called cellulose nanofibrils (CNF) made from wood pulp. The three production routes are (1) the enzymatic production route, which includes an enzymatic pretreatment, (2) the carboxymethylation route, which includes a carboxymethylation pretreatment, and (3) one route without pretreatment, here called the no pretreatment route. The results show that CNF produced via the carboxymethylation route clearly has the highest environmental impacts due to large use of solvents made from crude oil. The enzymatic and no pretreatment routes both have lower environmental impacts, of similar magnitude. A sensitivity analysis showed that the no pretreatment route was sensitive to the electricity mix, and the carboxymethylation route to solvent recovery. When comparing the results to those of other carbon nanomaterials, it was shown that in particular CNF produced via the enzymatic and no pretreatment routes had comparatively low environmental impacts.

An Evaluation of Controller and Pilot Performance, Workload and Acceptability under a NextGen Concept for Dynamic Weather Adapted Arrival Routing

NASA Technical Reports Server (NTRS)

Johnson, Walter W.; Lachter, Joel; Brandt, Summer; Koteskey, Robert; Dao, Arik-Quang; Kraut, Josh; Ligda, Sarah; Battiste, Vernol

2012-01-01

In todays terminal operations, controller workload increases and throughput decreases when fixed standard terminal arrival routes (STARs) are impacted by storms. To circumvent this operational constraint, Prete, Krozel, Mitchell, Kim and Zou (2008) proposed to use automation to dynamically adapt arrival and departure routing based on weather predictions. The present study examined this proposal in the context of a NextGen trajectory-based operation concept, focusing on the acceptability and its effect on the controllers ability to manage traffic flows. Six controllers and twelve transport pilots participated in a human-in-the-loop simulation of arrival operations into Louisville International Airport with interval management requirements. Three types of routing structures were used: Static STARs (similar to current routing, which require the trajectories of individual aircraft to be modified to avoid the weather), Dynamic routing (automated adaptive routing around weather), and Dynamic Adjusted routing (automated adaptive routing around weather with aircraft entry time adjusted to account for differences in route length). Spacing Responsibility, whether responsibility for interval management resided with the controllers (as today), or resided with the pilot (who used a flight deck based automated spacing algorithm), was also manipulated. Dynamic routing as a whole was rated superior to static routing, especially by pilots, both in terms of workload reduction and flight path safety. A downside of using dynamic routing was that the paths flown in the dynamic conditions tended to be somewhat longer than the paths flown in the static condition.

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. The information carried by CGR contact plan messages is useful not only for dynamic route computation, but also for the implementation of rate control, congestion forecasting, transmission episode initiation and termination, timeout interval computation, and retransmission timer suspension and resumption.

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks.

PubMed

Katiravan, Jeevaa; Sylvia, D; Rao, D Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network.

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

Energy Efficient Link Aware Routing with Power Control in Wireless Ad Hoc Networks

PubMed Central

Katiravan, Jeevaa; Sylvia, D.; Rao, D. Srinivasa

2015-01-01

In wireless ad hoc networks, the traditional routing protocols make the route selection based on minimum distance between the nodes and the minimum number of hop counts. Most of the routing decisions do not consider the condition of the network such as link quality and residual energy of the nodes. Also, when a link failure occurs, a route discovery mechanism is initiated which incurs high routing overhead. If the broadcast nature and the spatial diversity of the wireless communication are utilized efficiently it becomes possible to achieve improvement in the performance of the wireless networks. In contrast to the traditional routing scheme which makes use of a predetermined route for packet transmission, such an opportunistic routing scheme defines a predefined forwarding candidate list formed by using single network metrics. In this paper, a protocol is proposed which uses multiple metrics such as residual energy and link quality for route selection and also includes a monitoring mechanism which initiates a route discovery for a poor link, thereby reducing the overhead involved and improving the throughput of the network while maintaining network connectivity. Power control is also implemented not only to save energy but also to improve the network performance. Using simulations, we show the performance improvement attained in the network in terms of packet delivery ratio, routing overhead, and residual energy of the network. PMID:26167529

49 CFR 209.501 - Review of rail transportation safety and security route analysis.

Code of Federal Regulations, 2010 CFR

2010-10-01

... establish that the route chosen by the carrier poses the least overall safety and security risk, the... analysis, including a clear description of the risks on the selected route that have not been... commercially practicable alternative route poses fewer overall safety and security risks than the route...

5. Aerial view west, Adams Dam Road bottom center, State ...

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

5. Aerial view west, Adams Dam Road bottom center, State Route 100 center, duck pond and reservoir center, State Route 100 center right, State Route 92 below center right, Brandywine Creek State Park center bottom. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

75 FR 68701 - Establishment and Amendment of Area Navigation (RNAV) Routes; Alaska

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-09

... 7012), a new T- route (T-267) is established, which will circumvent the ocean near Kotzebue, AK... Frederick's Point Non- directional Beacon, for connectivity between Juneau and Ketchikan, AK. Two T-routes... revised to provide a more direct route between Anchorage and Galena, AK. The RNAV routes described in this...

Not just passengers: pigeons, Columba livia, can learn homing routes while flying with a more experienced conspecific.

PubMed

Pettit, Benjamin; Flack, Andrea; Freeman, Robin; Guilford, Tim; Biro, Dora

2013-01-07

For animals that travel in groups, the directional choices of conspecifics are potentially a rich source of information for spatial learning. In this study, we investigate how the opportunity to follow a locally experienced demonstrator affects route learning by pigeons over repeated homing flights. This test of social influences on navigation takes advantage of the individually distinctive routes that pigeons establish when trained alone. We found that pigeons learn routes just as effectively while flying with a partner as control pigeons do while flying alone. However, rather than learning the exact route of the demonstrator, the paired routes shifted over repeated flights, which suggests that the birds with less local experience also took an active role in the navigational task. The efficiency of the original routes was a key factor in how far they shifted, with less efficient routes undergoing the greatest changes. In this context, inefficient routes are unlikely to be maintained through repeated rounds of social transmission, and instead more efficient routes are achieved because of the interaction between social learning and information pooling.

A new approach developed to study variability in North African dust transport routes over the Atlantic during 2001-2015

NASA Astrophysics Data System (ADS)

Meng, L.; Gao, H. W.; Yu, Y.; Yao, X. H.; Gao, Y.; Zhang, C.; Fan, Lei

2017-10-01

We investigated the variability in the North African dust transport routes over the Atlantic (NAD routes) by extracting the dust transport central axis using Moderate Resolution Imaging Spectroradiometer aerosol data for 2001-2015. The results showed that the NAD routes can be classified into two regimes, a southern route centered at the southernmost position of 6.08 ± 1.12°N during November to March and a northern route centered at the northernmost position of 18.21 ± 1.04°N during April to October. In the southern route, large intervariation was correlated with the Intertropical Convergence Zone (ITCZ) and North Atlantic Oscillation (NAO), but the ITCZ and NAO jointly explained only 38% of the variation. In the northern route, the ITCZ alone explained 67% of the intervariation. The extracted trends during 2001-2015 exhibited a northward shift of 1.68° for the southern route and of 0.52° for the northern route. The causes for the shift were also examined.

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

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.

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.

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 manager finds the advisory to be operationally appropriate, he or she would coordinate with the Area Supervisor(s) of the sectors that currently control the flights in the advisory. When the traffic manager accepts the MFCR advisory via the user interface, the corresponding flight plan amendments would be sent to the displays of the appropriate sector controllers, using the Airborne Re-Routing (ABRR) capability which is scheduled for nationwide operation in 2017. The sector controllers would then offer this time-saving route modification to the pilots of the affected flights via datalink (or voice), and implement the corresponding flight plan amendment if the pilots accept it. MFCR is implemented as an application in the software environment of the Future Air traffic management Concepts Evaluation Tool (FACET). This paper focuses on an initial subject matter expert (SME) evaluation of MFCR. The evaluation covers MFCRs operational concept, algorithm, and user interface.

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.

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.

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.

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

77 FR 9841 - Modification of Area Navigation Route T-288; WY

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-21

...-1193; Airspace Docket No. 11-ANM-14] Modification of Area Navigation Route T-288; WY AGENCY: Federal...) route T-288 by extending the route westward from the Rapid City, SD, VORTAC to the Gillette, WY, VOR/DME... published in the Federal Register a notice of proposed rulemaking (NPRM) to modify RNAV route T-288 by...

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

Memory for Verbally Presented Routes: A Comparison of Strategies Used by Blind and Sighted People.

ERIC Educational Resources Information Center

Easton, R. D.; Bentzen, B. L.

1987-01-01

Congenitally-blind (N=16) and sighted (N=16) young adults listened to descriptions of routes and then finger traced routes through a raised line matrix. Route tracing speed and accuracy revealed that spatial sentence verification interfered with route memory more than abstract/verbal sentence verification for all subjects. (Author/CB)

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…

Nonword Reading: Comparing Dual-Route Cascaded and Connectionist Dual-Process Models with Human Data

ERIC Educational Resources Information Center

Pritchard, Stephen C.; Coltheart, Max; Palethorpe, Sallyanne; Castles, Anne

2012-01-01

Two prominent dual-route computational models of reading aloud are the dual-route cascaded (DRC) model, and the connectionist dual-process plus (CDP+) model. While sharing similarly designed lexical routes, the two models differ greatly in their respective nonlexical route architecture, such that they often differ on nonword pronunciation. Neither…

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

75 FR 6095 - Revision of Area Navigation (RNAV) Route Q-108; Florida

Federal Register 2010, 2011, 2012, 2013, 2014

2010-02-08

...-0885; Airspace Docket No. 09-ASO-17] Revision of Area Navigation (RNAV) Route Q-108; Florida AGENCY... an error in the legal description for RNAV route Q-108 that was published in the Federal Register on... Area Navigation (RNAV) Route Q-108 in northern Florida by realigning the route structure. In the legal...

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

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

The development of a practical pipe auto-routing system in a shipbuilding CAD environment using network optimization

NASA Astrophysics Data System (ADS)

Kim, Shin-Hyung; Ruy, Won-Sun; Jang, Beom Seon

2013-09-01

An automatic pipe routing system is proposed and implemented. Generally, the pipe routing design as a part of the shipbuilding process requires a considerable number of man hours due to the complexity which comes from physical and operational constraints and the crucial influence on outfitting construction productivity. Therefore, the automation of pipe routing design operations and processes has always been one of the most important goals for improvements in shipbuilding design. The proposed system is applied to a pipe routing design in the engine room space of a commercial ship. The effectiveness of this system is verified as a reasonable form of support for pipe routing design jobs. The automatic routing result of this system can serve as a good basis model in the initial stages of pipe routing design, allowing the designer to reduce their design lead time significantly. As a result, the design productivity overall can be improved with this automatic pipe routing system

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

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

The extended TRIP supporting VoIP routing reservation with distributed QoS

NASA Astrophysics Data System (ADS)

Wang, Furong; Wu, Ye

2004-04-01

In this paper, an existing protocol, i.e. TRIP (Telephony Routing over IP) is developed to provide distributed QoS when making resource reservations for VoIP services such as H.323, SIP. Enhanced LSs (location servers) are deployed in ITADs (IP Telephony Administrative Domains) to take in charge of intra-domain routing policy because of small propagation price. It is an easy way to find an IP telephone route for intra-domain VoIP media association and simultaneously possess intra-domain load balancing features. For those routing reservations bridging domains, inter-domain routing policy is responsible for finding the shortest inter-domain route with enough resources. I propose the routing preference policy based on QoS price when the session traffic is shaped by a token bucket, related QoS messages, and message cooperation.

Influence of walking route choice on primary school children's exposure to air pollution--A proof of concept study using simulation.

PubMed

Mölter, Anna; Lindley, Sarah

2015-10-15

This study developed a walking network for the Greater Manchester area (UK). The walking network allows routes to be calculated either based on the shortest duration or based on the lowest cumulative nitrogen dioxide (NO2) or particulate matter (PM10) exposure. The aim of this study was to analyse the costs and benefits of faster routes versus lower pollution exposure for walking routes to primary schools. Random samples of primary schools and residential addresses were used to generate 100,000 hypothetical school routes. For 60% (59,992) and 40% (40,460) an alternative low NO2 and PM10 route was found, respectively. The median change in travel time (NO2: 4.5s, PM10: 0.5s) and average route exposure (NO2: -0.40 μg/m(3), PM10: -0.03 μg/m(3)) was small. However, quantile regression analysis indicated that for 50% of routes a 1% increase in travel time was associated with a 1.5% decrease in NO2 and PM10 exposure. The results of this study suggest that the relative decrease in pollution exposure on low pollution routes tends to be greater than the relative increase in route length. This supports the idea that a route planning tool identifying less polluted routes to primary schools could help deliver potential health benefits for children. Copyright © 2015 Elsevier B.V. All rights reserved.

Impact of emergency medical services stroke routing protocols on Primary Stroke Center certification in California.

PubMed

Schuberg, Sam; Song, Sarah; Saver, Jeffrey L; Mack, William J; Cen, Steven Y; Sanossian, Nerses

2013-12-01

Organized stroke systems of care include Primary Stroke Center (PSC) certification and preferential emergency medical services (EMS) routing of suspected patients with stroke to designated PSCs. Stroke EMS routing is not nationally governed; in California, routing is determined by county. EMS routing policies might provide an incentive for PSC accreditation. We evaluated the relationship between independent adoption of EMS routing protocols and PSC designation acquisition in California. Dates of PSC certification were obtained through The Joint Commissions Website and confirmatory calls to stroke coordinators. Starting date of county EMS PSC routing policies was obtained from county EMS agencies. We provide descriptive analysis of number of hospitals achieving PSC designation relative to implementation of EMS routing policies for all counties with PSCs. By June 2012, there were 131 California PSCs in 27 counties, and 22 of 58 counties had implemented EMS routing policies. The greatest number of PSCs was in Los Angeles (30) followed by San Diego (11), Orange (9), and Santa Clara (9) counties. Achievement of PSC designation occurred more frequently immediately before and after EMS routing: 51 PSCs (39%) within 1 year; 85 PSCs (65%) within 2 years. The yearly rate of eligible hospital conversion to PSC designation accelerated concurrent with EMS diversion policy adoption from 3.8% before to 16.2% during and decelerated afterward to 7.6%. Implementation of EMS routing policies may be an important factor driving PSC certification. National adoption of stroke routing policies may lead to more PSCs, positively impacting patient care.

77 FR 22053 - Self-Regulatory Organizations; EDGX Exchange, Inc.; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-12

... reference to orders routed to the PSX to include the ROUE \\7\\ routing strategy in addition to the ROUC routing strategy. The Exchange proposes to continue to assess a charge of $0.0025 per share. \\7\\ See... to orders routed to the BATS BYX Exchange to include the ROUE routing strategy in addition to the...

76 FR 9395 - Self-Regulatory Organizations; The NASDAQ Stock Market LLC; Notice of Filing and Immediate...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-17

... to other venues on the SOLV System routing table, or (ii) check the NASDAQ book first and then route to destinations on the SOLV System routing table.\\3\\ Under the second option, the applicable routing.... \\3\\ As provided in Rule 4758(a)(1)(A), the term ``System routing table'' refers to the proprietary...

View east along Wolf Den Road showing residences on the ...

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

View east along Wolf Den Road showing residences on the north side of the road - 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

View northwest along Wolf Den Road showing residences on the ...

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

View northwest along Wolf Den Road showing residences on the north side of the road - 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

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.

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

Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)

NASA Astrophysics Data System (ADS)

Ramdhani, M. N.; Baihaqi, I.; Siswanto, N.

2018-04-01

Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle’s assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter’s has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result’s model has the maximum of two journeys for each route.

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks

PubMed Central

Abba, Sani; Lee, Jeong-A

2015-01-01

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network. PMID:26295236

An Autonomous Self-Aware and Adaptive Fault Tolerant Routing Technique for Wireless Sensor Networks.

PubMed

Abba, Sani; Lee, Jeong-A

2015-08-18

We propose an autonomous self-aware and adaptive fault-tolerant routing technique (ASAART) for wireless sensor networks. We address the limitations of self-healing routing (SHR) and self-selective routing (SSR) techniques for routing sensor data. We also examine the integration of autonomic self-aware and adaptive fault detection and resiliency techniques for route formation and route repair to provide resilience to errors and failures. We achieved this by using a combined continuous and slotted prioritized transmission back-off delay to obtain local and global network state information, as well as multiple random functions for attaining faster routing convergence and reliable route repair despite transient and permanent node failure rates and efficient adaptation to instantaneous network topology changes. The results of simulations based on a comparison of the ASAART with the SHR and SSR protocols for five different simulated scenarios in the presence of transient and permanent node failure rates exhibit a greater resiliency to errors and failure and better routing performance in terms of the number of successfully delivered network packets, end-to-end delay, delivered MAC layer packets, packet error rate, as well as efficient energy conservation in a highly congested, faulty, and scalable sensor network.

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.

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

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

A two-hop based adaptive routing protocol for real-time wireless sensor networks.

PubMed

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

One of the most important and challenging issues in wireless sensor networks (WSNs) is to optimally manage the limited energy of nodes without degrading the routing efficiency. In this paper, we propose an energy-efficient adaptive routing mechanism for WSNs, which saves energy of nodes by removing the much delayed packets without degrading the real-time performance of the used routing protocol. It uses the adaptive transmission power algorithm which is based on the attenuation of the wireless link to improve the energy efficiency. The proposed routing mechanism can be associated with any geographic routing protocol and its performance is evaluated by integrating with the well known two-hop based real-time routing protocol, PATH and the resulting protocol is energy-efficient adaptive routing protocol (EE-ARP). The EE-ARP performs well in terms of energy consumption, deadline miss ratio, packet drop and end-to-end delay.

(ZrO 2) 0.85( REO 1.5) 0.15 ( RE=Sc, Y) solid solutions prepared via three Pechini-type gel routes: 1—gel formation and calcination behaviors

NASA Astrophysics Data System (ADS)

Zhang, Yawen; Li, Ang; Yan, Zhengguang; Xu, Gang; Liao, Chunsheng; Yan, Chunhua

2003-02-01

(ZrO2)0.85(REO1.5)0.15 (RE=Sc, Y) nanoparticles with pure cubic fluorite structure have been synthesized by three Pechini-type gel routes, viz. poly(vinyl alcohol) containing-process (route I), poly(ethylene glycol) and formic acid-containing process (route II), and in situ polymerizable complex method (route III). The coordination modes between metal ions and polymers in the gels are shown to be highly correlative with the synthesis route used. The gels prepared by route III have the strongest coordination throughout their network and therefore the best chemical homogeneity. The altered variety of polymer and cross-linking within the gels adopted by these three routes has made the as-synthesized samples show appreciable differences in thermal behavior, powder reactivity and nanoparticle properties.

A workstation-based evaluation of a far-field route planner for helicopters

NASA Technical Reports Server (NTRS)

Warner, David N., Jr.; Moran, Francis J.

1991-01-01

Helicopter flight missions at very low, nap of the Earth, altitudes place a heavy workload on the pilot. To aid in reducing this workload, Ames Research Center has been investigating various types of automated route planners. As part of an automated preflight mission planner, a route planner algorithm aids in selecting the overall (far-field) route to be flown. During the mission, the route planner can be used to replan a new route in case of unexpected threats or change in mission requirements. An evaluation of a candidate route planning algorithm, based on dynamic programming techniques is described. This algorithm meets most of the requirements for route planning, both preflight and during the mission. In general, the requirements are to minimize the distance and/or fuel and the deviation from a flight time schedule, and must be flyable within the constraints of available fuel and time.

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.

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

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.

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

Airspace Technology Demonstration 3 (ATD-3): Multi-Flight Common Route (MFCR) Technology Transfer Document Summary Version 1.0

NASA Technical Reports Server (NTRS)

Sheth, Kapil; Bilimoria, Karl; Amer, Maryam M.; Wang, Easter M.

2017-01-01

This summary document and accompanying technology artifacts satisfy the second of three Research Transition Products (RTPs) defined in the ATD-3 Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA's Multi-Flight Common Route (MFCR) research for efficient route corrections for en-route weather avoidance. The MFCR concept builds on the experience of the legacy Dynamic Weather Routes (DWR) and focuses on a better balance of potential savings with ATC acceptability, common route corrections options for multiple flights on similar routings, and better use of existing and/or modern automation for communication and coordination of route change options. All of these capabilities are expected to improve system performance significantly in terms of actual delay-reducing clearances issued to flights compared to that of the DWR tool and operating concept.

77 FR 30564 - Self-Regulatory Organizations; EDGX Exchange, Inc.; Order Approving a Proposed Rule Change...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-23

... to Rule 2.11 That Establish the Authority To Cancel Orders and Describe the Operation of an Error... routing broker-dealer, Direct Edge ECN LLC d/b/a DE Route (``DE Route'') to cancel orders if and when a... Center \\5\\ that causes EDGX or DE Route to cancel orders, if the Exchange or DE Route determines that...

77 FR 30562 - Self-Regulatory Organizations; EDGA Exchange, Inc.; Order Approving a Proposed Rule Change...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-23

... to Rule 2.11 That Establish the Authority To Cancel Orders and Describe the Operation of an Error... and its routing broker-dealer, Direct Edge ECN LLC d/b/a DE Route (``DE Route'') to cancel orders if... Center \\5\\ that causes EDGA or DE Route to cancel orders, if the Exchange or DE Route determines that...

View southwest along Brown Road showing residential and commercial buildings ...

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

View southwest along Brown Road showing residential and commercial buildings on the north and south sides of the road - 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

Spectrum efficient distance-adaptive paths for fixed and fixed-alternate routing in elastic optical networks

NASA Astrophysics Data System (ADS)

Agrawal, Anuj; Bhatia, Vimal; Prakash, Shashi

2018-01-01

Efficient utilization of spectrum is a key concern in the soon to be deployed elastic optical networks (EONs). To perform routing in EONs, various fixed routing (FR), and fixed-alternate routing (FAR) schemes are ubiquitously used. FR, and FAR schemes calculate a fixed route, and a prioritized list of a number of alternate routes, respectively, between different pairs of origin o and target t nodes in the network. The route calculation performed using FR and FAR schemes is predominantly based on either the physical distance, known as k -shortest paths (KSP), or on the hop count (HC). For survivable optical networks, FAR usually calculates link-disjoint (LD) paths. These conventional routing schemes have been efficiently used for decades in communication networks. However, in this paper, it has been demonstrated that these commonly used routing schemes cannot utilize the network spectral resources optimally in the newly introduced EONs. Thus, we propose a new routing scheme for EON, namely, k -distance adaptive paths (KDAP) that efficiently utilizes the benefit of distance-adaptive modulation, and bit rate-adaptive superchannel capability inherited by EON to improve spectrum utilization. In the proposed KDAP, routes are found and prioritized on the basis of bit rate, distance, spectrum granularity, and the number of links used for a particular route. To evaluate the performance of KSP, HC, LD, and the proposed KDAP, simulations have been performed for three different sized networks, namely, 7-node test network (TEST7), NSFNET, and 24-node US backbone network (UBN24). We comprehensively assess the performance of various conventional, and the proposed routing schemes by solving both the RSA and the dual RSA problems under homogeneous and heterogeneous traffic requirements. Simulation results demonstrate that there is a variation amongst the performance of KSP, HC, and LD, depending on the o - t pair, and the network topology and its connectivity. However, the proposed KDAP always performs better for all the considered networks and traffic scenarios, as compared to the conventional routing schemes, namely, KSP, HC, and LD. The proposed KDAP achieves up to 60 % , and 10.46 % improvement in terms of spectrum utilization, and resource utilization ratio, respectively, over the conventional routing schemes.

Computationally-Efficient Minimum-Time Aircraft Routes in the Presence of Winds

NASA Technical Reports Server (NTRS)

Jardin, Matthew R.

2004-01-01

A computationally efficient algorithm for minimizing the flight time of an aircraft in a variable wind field has been invented. The algorithm, referred to as Neighboring Optimal Wind Routing (NOWR), is based upon neighboring-optimal-control (NOC) concepts and achieves minimum-time paths by adjusting aircraft heading according to wind conditions at an arbitrary number of wind measurement points along the flight route. The NOWR algorithm may either be used in a fast-time mode to compute minimum- time routes prior to flight, or may be used in a feedback mode to adjust aircraft heading in real-time. By traveling minimum-time routes instead of direct great-circle (direct) routes, flights across the United States can save an average of about 7 minutes, and as much as one hour of flight time during periods of strong jet-stream winds. The neighboring optimal routes computed via the NOWR technique have been shown to be within 1.5 percent of the absolute minimum-time routes for flights across the continental United States. On a typical 450-MHz Sun Ultra workstation, the NOWR algorithm produces complete minimum-time routes in less than 40 milliseconds. This corresponds to a rate of 25 optimal routes per second. The closest comparable optimization technique runs approximately 10 times slower. Airlines currently use various trial-and-error search techniques to determine which of a set of commonly traveled routes will minimize flight time. These algorithms are too computationally expensive for use in real-time systems, or in systems where many optimal routes need to be computed in a short amount of time. Instead of operating in real-time, airlines will typically plan a trajectory several hours in advance using wind forecasts. If winds change significantly from forecasts, the resulting flights will no longer be minimum-time. The need for a computationally efficient wind-optimal routing algorithm is even greater in the case of new air-traffic-control automation concepts. For air-traffic-control automation, thousands of wind-optimal routes may need to be computed and checked for conflicts in just a few minutes. These factors motivated the need for a more efficient wind-optimal routing algorithm.

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.

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.

How well do modelled routes to school record the environments children are exposed to?: a cross-sectional comparison of GIS-modelled and GPS-measured routes to school

PubMed Central

2014-01-01

Background The school journey may make an important contribution to children’s physical activity and provide exposure to food and physical activity environments. Typically, Geographic Information Systems (GIS) have been used to model assumed routes to school in studies, but these may differ from those actually chosen. We aimed to identify the characteristics of children and their environments that make the modelled route more or less representative of that actually taken. We compared modelled GIS routes and actual Global Positioning Systems (GPS) measured routes in a free-living sample of children using varying travel modes. Methods Participants were 175 13-14 yr old children taking part in the Sport, Physical activity and Eating behaviour: Environmental Determinants in Young people (SPEEDY) study who wore GPS units for up to 7 days. Actual routes to/from school were extracted from GPS data, and shortest routes between home and school along a road network were modelled in a GIS. Differences between them were assessed according to length, percentage overlap, and food outlet exposure using multilevel regression models. Results GIS routes underestimated route length by 21.0% overall, ranging from 6.1% among walkers to 23.2% for bus users. Among pedestrians food outlet exposure was overestimated by GIS routes by 25.4%. Certain characteristics of children and their neighbourhoods that improved the concordance between GIS and GPS route length and overlap were identified. Living in a village raised the odds of increased differences in length (odds ratio (OR) 3.36 (1.32-8.58)), while attending a more urban school raised the odds of increased percentage overlap (OR 3.98 (1.49-10.63)). However none were found for food outlet exposure. Journeys home from school increased the difference between GIS and GPS routes in terms of food outlet exposure, and this measure showed considerable within-person variation. Conclusions GIS modelled routes between home and school were not truly representative of accurate GPS measured exposure to obesogenic environments, particularly for pedestrians. While route length may be fairly well described, especially for urban populations, those living close to school, and those travelling by foot, the additional expense of acquiring GPS data seems important when assessing exposure to route environments. PMID:24529075

How well do modelled routes to school record the environments children are exposed to? A cross-sectional comparison of GIS-modelled and GPS-measured routes to school.

PubMed

Harrison, Flo; Burgoine, Thomas; Corder, Kirsten; van Sluijs, Esther M F; Jones, Andy

2014-02-14

The school journey may make an important contribution to children's physical activity and provide exposure to food and physical activity environments. Typically, Geographic Information Systems (GIS) have been used to model assumed routes to school in studies, but these may differ from those actually chosen. We aimed to identify the characteristics of children and their environments that make the modelled route more or less representative of that actually taken. We compared modelled GIS routes and actual Global Positioning Systems (GPS) measured routes in a free-living sample of children using varying travel modes. Participants were 175 13-14 yr old children taking part in the Sport, Physical activity and Eating behaviour: Environmental Determinants in Young people (SPEEDY) study who wore GPS units for up to 7 days. Actual routes to/from school were extracted from GPS data, and shortest routes between home and school along a road network were modelled in a GIS. Differences between them were assessed according to length, percentage overlap, and food outlet exposure using multilevel regression models. GIS routes underestimated route length by 21.0% overall, ranging from 6.1% among walkers to 23.2% for bus users. Among pedestrians food outlet exposure was overestimated by GIS routes by 25.4%. Certain characteristics of children and their neighbourhoods that improved the concordance between GIS and GPS route length and overlap were identified. Living in a village raised the odds of increased differences in length (odds ratio (OR) 3.36 (1.32-8.58)), while attending a more urban school raised the odds of increased percentage overlap (OR 3.98 (1.49-10.63)). However none were found for food outlet exposure. Journeys home from school increased the difference between GIS and GPS routes in terms of food outlet exposure, and this measure showed considerable within-person variation. GIS modelled routes between home and school were not truly representative of accurate GPS measured exposure to obesogenic environments, particularly for pedestrians. While route length may be fairly well described, especially for urban populations, those living close to school, and those travelling by foot, the additional expense of acquiring GPS data seems important when assessing exposure to route environments.

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.

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data: Preprint

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

Zhu, Lei; Holden, Jacob; Gonder, Jeff

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigationmore » systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.« less

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data

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

Zhu, Lei; Holden, Jacob; Gonder, Jeffrey D

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigationmore » systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.« less

Effect of strain and deformation route on grain boundary characteristics and recrystallization behavior of aluminum

NASA Astrophysics Data System (ADS)

Sakai, Tetsuo; Utsunomiya, Hiroshi; Takahashi, Yasuo

2014-08-01

The effect of strain and deformation route on the recrystallization behavior of aluminum sheets has been investigated using well lubricated cold rolling and continuous equal channel angular extrusion. Three different deformation routes in plane strain corresponding to (1) simple shear, (2) compression, and (3) the combination of simple shear and compression were performed on 1100 aluminum sheet. Fixed amounts of the equivalent strain of 1.28 and 1.06 were accumulated in each route. In case of the combined deformation route, the ratio of shear strain to the total equivalent strain was varied. The recrystallized grain size was finer if the combined deformation route was employed instead of the monotonic route under the same amount of equivalent strain at either strain level. The density of high angle grain boundaries that act as nucleation sites for recrystallization was higher in materials deformed by the combined route. The orientation imaging micrographs revealed that the change in deformation route is effective for introducing a larger number of new high angle grain boundaries with relatively low misorientation angle.

Maritime Route Delineation using AIS Data from the Atlantic Coast of the US

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

Breithaupt, Stephen A.; Copping, Andrea; Tagestad, Jerry

2016-09-28

This study examines maritime routes between ports along the Atlantic coast of the US, utilising Automated Identification System (AIS) data for the years 2010 through 2012. The delineation of vessel routes conducted in this study was motivated by development planned for offshore Wind Energy Areas (WEAs) along the Atlantic coast of the US and the need to evaluate the effect of these development areas on commercial shipping. To this end, available AIS data were processed to generate commercial vessel tracks for individual vessels, though cargo vessels are the focus in this study. The individual vessel tracks were sampled at transectsmore » placed along the Atlantic coast. The transect samples were analysed and partitioned by voyages between Atlantic ports to facilitate computation of vessel routes between ports. The route boundary analysis utilised a definition from UK guidance in which routes' boundaries encompassed 95% of the vessel traffic between ports. In addition to delineating route boundaries, we found multi-modal transverse distributions of vessels for well-travelled routes, which indicated preference for lanes of travel within the delineated routes.« less

Metro passengers’ route choice model and its application considering perceived transfer threshold

PubMed Central

Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

2017-01-01

With the rapid development of the Metro network in China, the greatly increased route alternatives make passengers’ route choice behavior and passenger flow assignment more complicated, which presents challenges to the operation management. In this paper, a path sized logit model is adopted to analyze passengers’ route choice preferences considering such parameters as in-vehicle time, number of transfers, and transfer time. Moreover, the “perceived transfer threshold” is defined and included in the utility function to reflect the penalty difference caused by transfer time on passengers’ perceived utility under various numbers of transfers. Next, based on the revealed preference data collected in the Guangzhou Metro, the proposed model is calibrated. The appropriate perceived transfer threshold value and the route choice preferences are analyzed. Finally, the model is applied to a personalized route planning case to demonstrate the engineering practicability of route choice behavior analysis. The results show that the introduction of the perceived transfer threshold is helpful to improve the model’s explanatory abilities. In addition, personalized route planning based on route choice preferences can meet passengers’ diversified travel demands. PMID:28957376

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

Trajectory-adaptive route choice models : specification, choice set generation, and estimation.

DOT National Transportation Integrated Search

2013-03-01

The objective of the research is to investigate adaptive route choice behavior using individuallevel route choice data from GPS (Global Positioning System) observations in a real-life : network, where a traveler could revise the route choice based up...

77 FR 16106 - Self-Regulatory Organizations; International Securities Exchange, LLC; Notice of Filing of...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-19

... component of stock-option orders. The Exchange will route orders to the broker- dealers using routing logic... Exchange's routing logic will only route orders to the broker-dealers with whom they have agreements. In...

A Functional Near-Infrared Spectroscopy Study of Lexical Decision Task Supports the Dual Route Model and the Phonological Deficit Theory of Dyslexia

ERIC Educational Resources Information Center

Sela, Itamar; Izzetoglu, Meltem; Izzetoglu, Kurtulus; Onaral, Banu

2014-01-01

The dual route model (DRM) of reading suggests two routes of reading development: the phonological and the orthographic routes. It was proposed that although the two routes are active in the process of reading; the first is more involved at the initial stages of reading acquisition, whereas the latter needs more reading training to mature. A…

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.

Comparison Between Three Different Types of Routing Algorithms of Network on Chip

NASA Astrophysics Data System (ADS)

Soni, Neetu; Deshmukh, Khemraj

Network on Chip (NoC) is an on-chip communication technology in which a large number of processing elements and storage blocks are integrated on a single chip. Due to scalability, adaptive nature, well resource utilization NoCs have become popular in and has efficiently replaced SoCs. NoCs performance depends mainly on the type of routing algorithm chosen. In this paper three different types of routing algorithms are being compared firstly one is deterministic routing (XY routing algorithm), secondly three partially adaptive routing (West-first, North-last and Negative-first) and two adaptive routing (DyAD, OE) are being compared with respect to Packet Injection Rate (PIR) of load for random traffic pattern for 4 × 4 mesh topology. All these comparison and simulation is done in NOXIM 2.3.1 simulator which is a cycle accurate systemC based simulator. The distribution of packets is Poisson type with Buffer depth (number of buffers) of input channel FIFO is 8. Packet size is taken as 8 bytes. The simulation time is taken 50,000 cycles. We found that XY routing is better when the PIR is low. The partially adaptive routing is good when the PIR is moderate. DyAD routing is suited when the load i.e. PIR is high.

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.

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

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.

Impact of flow routing on catchment area calculations, slope estimates, and numerical simulations of landscape development

NASA Astrophysics Data System (ADS)

Shelef, Eitan; Hilley, George E.

2013-12-01

Flow routing across real or modeled topography determines the modeled discharge and wetness index and thus plays a central role in predicting surface lowering rate, runoff generation, likelihood of slope failure, and transition from hillslope to channel forming processes. In this contribution, we compare commonly used flow-routing rules as well as a new routing rule, to commonly used benchmarks. We also compare results for different routing rules using Airborne Laser Swath Mapping (ALSM) topography to explore the impact of different flow-routing schemes on inferring the generation of saturation overland flow and the transition between hillslope to channel forming processes, as well as on location of saturation overland flow. Finally, we examined the impact of flow-routing and slope-calculation rules on modeled topography produced by Geomorphic Transport Law (GTL)-based simulations. We found that different rules produce substantive differences in the structure of the modeled topography and flow patterns over ALSM data. Our results highlight the impact of flow-routing and slope-calculation rules on modeled topography, as well as on calculated geomorphic metrics across real landscapes. As such, studies that use a variety of routing rules to analyze and simulate topography are necessary to determine those aspects that most strongly depend on a chosen routing rule.

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 Kalinin-Miljukov model. The latter applies the lag-and-route model’s single-reservoir inversion scheme sequentially to its cascade of linear reservoirs, the number of which is related to the stream's hydromorphology. For this purpose, we used the example of Bruen & Dooge (2007), who back-routed flow hydrographs in a 100-km long prismatic channel using a scheme for the reverse solution of the St. Venant equations of flood wave motion. The lag-and-route reverse routing model recovered the inflow hydrograph with comparable accuracy to that of the multi-reservoir, inverted Kalinin-Miljukov model, both performing as well as the box-scheme for reverse routing with the St. Venant equations. In conclusion, the success in the regaining of the inflow signal by the devised single-reservoir reverse routing procedure, with multipoint low-pass filtering, can be attributed to its simple computational structure that endows it with remarkable robustness and exceptional efficiency.

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.

Meeting Air Transportation Demand in 2025 by Using Larger Aircraft and Alternative Routing to Complement NextGen Operational Improvements

NASA Technical Reports Server (NTRS)

Smith, Jeremy C.; Guerreiro, Nelson M.; Viken, Jeffrey K.; Dollyhigh, Samuel M.; Fenbert, James W.

2010-01-01

A study was performed that investigates the use of larger aircraft and alternative routing to complement the capacity benefits expected from the Next Generation Air Transportation System (NextGen) in 2025. National Airspace System (NAS) delays for the 2025 demand projected by the Transportation Systems Analysis Models (TSAM) were assessed using NASA s Airspace Concept Evaluation System (ACES). The shift in demand from commercial airline to automobile and from one airline route to another was investigated by adding the route delays determined from the ACES simulation to the travel times used in the TSAM and re-generating new flight scenarios. The ACES simulation results from this study determined that NextGen Operational Improvements alone do not provide sufficient airport capacity to meet the projected demand for passenger air travel in 2025 without significant system delays. Using larger aircraft with more seats on high-demand routes and introducing new direct routes, where demand warrants, significantly reduces delays, complementing NextGen improvements. Another significant finding of this study is that the adaptive behavior of passengers to avoid congested airline-routes is an important factor when projecting demand for transportation systems. Passengers will choose an alternative mode of transportation or alternative airline routes to avoid congested routes, thereby reducing delays to acceptable levels for the 2025 scenario; the penalty being that alternative routes and the option to drive increases overall trip time by 0.4% and may be less convenient than the first-choice route.

L-connect routing of die surface pads to the die edge for stacking in a 3D array

DOEpatents

Petersen, Robert W.

2000-01-01

Integrated circuit chips and method of routing the interface pads from the face of the chip or die to one or more sidewall surfaces of the die. The interconnection is routed from the face of the die to one or more edges of the die, then routed over the edge of the die and onto the side surface. A new pad is then formed on the sidewall surface, which allows multiple die or chips to be stacked in a three-dimensional array, while enabling follow-on signal routing from the sidewall pads. The routing of the interconnects and formation of the sidewall pads can be carried out in an L-connect or L-shaped routing configuration, using a metalization process such as laser pantography.

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.

76 FR 57902 - Amendment and Establishment of Air Traffic Service Routes; Northeast United States

Federal Register 2010, 2011, 2012, 2013, 2014

2011-09-19

... routes. The existing routes being amended are Q-42, J-60, V-16, V-229 and V-449. The new routes are Q-62... (RNAV) route Q-42, and VOR Federal airways V-16, V-229 and V-449 (76 FR 28379). In addition, the FAA... was an error in the description of Federal airway V-229 as published in the NPRM. The FAA reviewed the...

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

Defense Transportation Regulation Part 2, Cargo Movement.

DTIC Science & Technology

1998-08-01

Stop-Off Unloading Point (DD Form 1371) 202-18 202-7 Route Order Amendment (DD Form 2017 ) 202-19 204-1 Hazardous Materials Classification...DRO/IRO/SRO amendments will be submitted to the appropriate MTMC routing authority or theater CINC using DD Form 2017 , Route Order Amendment...Figure 202-5. 7. An example of a DD Form 2017 , Route Order Amendment, is provided in Figure 202.7. D. EXCEPTION Exceptions to assignment of routing

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 which may outline guiding principles for routing-related survey research in future. PMID:28933763

Assessing the risk of ships striking large whales in marine spatial planning.

PubMed

Redfern, J V; McKenna, M F; Moore, T J; Calambokidis, J; Deangelis, M L; Becker, E A; Barlow, J; Forney, K A; Fiedler, P C; Chivers, S J

2013-04-01

Marine spatial planning provides a comprehensive framework for managing multiple uses of the marine environment and has the potential to minimize environmental impacts and reduce conflicts among users. Spatially explicit assessments of the risks to key marine species from human activities are a requirement of marine spatial planning. We assessed the risk of ships striking humpback (Megaptera novaeangliae), blue (Balaenoptera musculus), and fin (Balaenoptera physalus) whales in alternative shipping routes derived from patterns of shipping traffic off Southern California (U.S.A.). Specifically, we developed whale-habitat models and assumed ship-strike risk for the alternative shipping routes was proportional to the number of whales predicted by the models to occur within each route. This definition of risk assumes all ships travel within a single route. We also calculated risk assuming ships travel via multiple routes. We estimated the potential for conflict between shipping and other uses (military training and fishing) due to overlap with the routes. We also estimated the overlap between shipping routes and protected areas. The route with the lowest risk for humpback whales had the highest risk for fin whales and vice versa. Risk to both species may be ameliorated by creating a new route south of the northern Channel Islands and spreading traffic between this new route and the existing route in the Santa Barbara Channel. Creating a longer route may reduce the overlap between shipping and other uses by concentrating shipping traffic. Blue whales are distributed more evenly across our study area than humpback and fin whales; thus, risk could not be ameliorated by concentrating shipping traffic in any of the routes we considered. Reducing ship-strike risk for blue whales may be necessary because our estimate of the potential number of strikes suggests that they are likely to exceed allowable levels of anthropogenic impacts established under U.S. laws. Conservation Biology © 2013 Society for Conservation Biology No claim to original US government works.

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 which may outline guiding principles for routing-related survey research in future.

76 FR 52229 - Establishment of Area Navigation Route Q-37; Texas

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-22

... route around potentially constrained airspace during convective weather events in west Texas. DATES... around potentially constrained airspace during convective weather events in west Texas. Additionally, the new route is being integrated into the existing severe weather national playbook routes to Houston, TX...

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

75 FR 68022 - Notice of Final Federal Agency Actions on Proposed Highway in Illinois

Federal Register 2010, 2011, 2012, 2013, 2014

2010-11-04

... Crossing over the Fox River between Illinois Route 31 and Illinois Route 25 in Kane County, Illinois. Those... trail across the Fox River from Illinois Route 31 (IL 31) to Illinois Route 25 (IL 25); a distance of 0...

75 FR 63534 - Seventh Meeting-Special Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-15

... 222: Inmarsat Aeronautical Mobile Satellite (Route) Services AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of RTCA Special Committee 222: Inmarsat Aeronautical Mobile Satellite (Route... Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services. DATES: The meeting will be held...

75 FR 15770 - Fifth Meeting-Special Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-30

...: Inmarsat Aeronautical Mobile Satellite (Route) Services AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of RTCA Special Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services... Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services. DATES: The meeting will be held...

75 FR 39724 - Sixth Meeting-Special Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-12

...: Inmarsat Aeronautical Mobile Satellite (Route) Services AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of RTCA Special Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services... Committee 222: Inmarsat Aeronautical Mobile Satellite (Route) Services. DATES: The meeting will be held...

A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

NASA Astrophysics Data System (ADS)

Onut, S.; Kamber, M. R.; Altay, G.

2014-03-01

Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time.

An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks.

PubMed

Singh, Kishor; Moh, Sangman

2017-09-04

Routing in cognitive radio ad hoc networks (CRAHNs) is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR) protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay.

Speedy routing recovery protocol for large failure tolerance in wireless sensor networks.

PubMed

Lee, Joa-Hyoung; Jung, In-Bum

2010-01-01

Wireless sensor networks are expected to play an increasingly important role in data collection in hazardous areas. However, the physical fragility of a sensor node makes reliable routing in hazardous areas a challenging problem. Because several sensor nodes in a hazardous area could be damaged simultaneously, the network should be able to recover routing after node failures over large areas. Many routing protocols take single-node failure recovery into account, but it is difficult for these protocols to recover the routing after large-scale failures. In this paper, we propose a routing protocol, referred to as ARF (Adaptive routing protocol for fast Recovery from large-scale Failure), to recover a network quickly after failures over large areas. ARF detects failures by counting the packet losses from parent nodes, and upon failure detection, it decreases the routing interval to notify the neighbor nodes of the failure. Our experimental results indicate that ARF could provide recovery from large-area failures quickly with less packets and energy consumption than previous protocols.

An Energy-Efficient and Robust Multipath Routing Protocol for Cognitive Radio Ad Hoc Networks

PubMed Central

Singh, Kishor

2017-01-01

Routing in cognitive radio ad hoc networks (CRAHNs) is a daunting task owing to dynamic topology, intermittent connectivity, spectrum heterogeneity, and energy constraints. Other prominent aspects such as channel stability, path reliability, and route discovery frequency should also be exploited. Several routing protocols have been proposed for CRAHNs in the literature. By stressing on one of the aspects more than any other, however, they do not satisfy all requirements of throughput, energy efficiency, and robustness. In this paper, we propose an energy-efficient and robust multipath routing (ERMR) protocol for CRAHNs by considering all prominent aspects including residual energy and channel stability in design. Even when the current routing path fails, the alternative routing path is immediately utilized. In establishing primary and alternative routing paths, both residual energy and channel stability are exploited simultaneously. Our simulation study shows that the proposed ERMR outperforms the conventional protocol in terms of network throughput, packet delivery ratio, energy consumption, and end-to-end delay. PMID:28869551

Mapping cattle trade routes in southern Somalia: a method for mobile livestock keeping systems.

PubMed

Tempia, S; Braidotti, F; Aden, H H; Abdulle, M H; Costagli, R; Otieno, F T

2010-12-01

The Somali economy is the only one in the world in which more than half the population is dependent on nomadic pastoralism. Trade typically involves drovers trekking animals over long distances to markets. A pilot approach for mapping trade routes was undertaken, using the Afmadow to Garissa routes in southern Somalia. The methodology included conducting a workshop with traders to gather preliminary information about the most-used routes and general husbandry practices and training selected drovers to collect data about key features along the routes, using hand-held global positioning system (GPS) devices, radio collar GPS and pictorial data forms. Collected data were then integrated into geographic information systems for analysis. The resultant spatial maps describe the Afmadow to Garissa routes, the speed of livestock movement along these routes and relevant environmental and social features affecting this speed. These data are useful for identifying critical control points for health screening along the routes, which may enable the establishment of a livestock certification system in nomadic pastoral environments.

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.

Collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation

NASA Astrophysics Data System (ADS)

Yang, Shangwen; Guo, Baohua; Xiao, Xuefei; Gao, Haichao

2018-01-01

To allocate the en-routes and slots to the flights with collaborative decision making, a collaborative en-route and slot allocation algorithm based on fuzzy comprehensive evaluation was proposed. Evaluation indexes include flight delay costs, delay time and the number of turning points. Analytic hierarchy process is applied to determining index weights. Remark set for current two flights not yet obtained the en-route and slot in flight schedule is established. Then, fuzzy comprehensive evaluation is performed, and the en-route and slot for the current two flights are determined. Continue selecting the flight not yet obtained an en-route and a slot in flight schedule. Perform fuzzy comprehensive evaluation until all flights have obtained the en-routes and slots. MatlabR2007b was applied to numerical test based on the simulated data of a civil en-route. Test results show that, compared with the traditional strategy of first come first service, the algorithm gains better effect. The effectiveness of the algorithm was verified.

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.

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.

A Novel Addressing Scheme for PMIPv6 Based Global IP-WSNs

PubMed Central

Islam, Md. Motaharul; Huh, Eui-Nam

2011-01-01

IP based Wireless Sensor Networks (IP-WSNs) are being used in healthcare, home automation, industrial control and agricultural monitoring. In most of these applications global addressing of individual IP-WSN nodes and layer-three routing for mobility enabled IP-WSN with special attention to reliability, energy efficiency and end to end delay minimization are a few of the major issues to be addressed. Most of the routing protocols in WSN are based on layer-two approaches. For reliability and end to end communication enhancement the necessity of layer-three routing for IP-WSNs is generating significant attention among the research community, but due to the hurdle of maintaining routing state and other communication overhead, it was not possible to introduce a layer-three routing protocol for IP-WSNs. To address this issue we propose in this paper a global addressing scheme and layer-three based hierarchical routing protocol. The proposed addressing and routing approach focuses on all the above mentioned issues. Simulation results show that the proposed addressing and routing approach significantly enhances the reliability, energy efficiency and end to end delay minimization. We also present architecture, message formats and different routing scenarios in this paper. PMID:22164084

A novel addressing scheme for PMIPv6 based global IP-WSNs.

PubMed

Islam, Md Motaharul; Huh, Eui-Nam

2011-01-01

IP based Wireless Sensor Networks (IP-WSNs) are being used in healthcare, home automation, industrial control and agricultural monitoring. In most of these applications global addressing of individual IP-WSN nodes and layer-three routing for mobility enabled IP-WSN with special attention to reliability, energy efficiency and end to end delay minimization are a few of the major issues to be addressed. Most of the routing protocols in WSN are based on layer-two approaches. For reliability and end to end communication enhancement the necessity of layer-three routing for IP-WSNs is generating significant attention among the research community, but due to the hurdle of maintaining routing state and other communication overhead, it was not possible to introduce a layer-three routing protocol for IP-WSNs. To address this issue we propose in this paper a global addressing scheme and layer-three based hierarchical routing protocol. The proposed addressing and routing approach focuses on all the above mentioned issues. Simulation results show that the proposed addressing and routing approach significantly enhances the reliability, energy efficiency and end to end delay minimization. We also present architecture, message formats and different routing scenarios in this paper.

The Effects of Attentional Engagement on Route Learning Performance in a Virtual Environment: An Aging Study

PubMed Central

Hartmeyer, Steffen; Grzeschik, Ramona; Wolbers, Thomas; Wiener, Jan M.

2017-01-01

Route learning is a common navigation task affected by cognitive aging. Here we present a novel experimental paradigm to investigate whether age-related declines in executive control of attention contributes to route learning deficits. A young and an older participant group was repeatedly presented with a route through a virtual maze comprised of 12 decision points (DP) and non-decision points (non-DP). To investigate attentional engagement with the route learning task, participants had to respond to auditory probes at both DP and non-DP. Route knowledge was assessed by showing participants screenshots or landmarks from DPs and non-DPs and asking them to indicate the movement direction required to continue the route. Results demonstrate better performance for DPs than for non-DPs and slower responses to auditory probes at DPs compared to non-DPs. As expected we found slower route learning and slower responses to the auditory probes in the older participant group. Interestingly, differences in response times to the auditory probes between DPs and non-DPs can predict the success of route learning in both age groups and may explain slower knowledge acquisition in the older participant group. PMID:28775689

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.

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.

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

Traversable highways report 2002 : a report on the status of prospective State Highway Routes over traversable facilities maintained by other agencies.

DOT National Transportation Integrated Search

2002-10-01

Traversable Highways are routes that have been approved by the Legislation as future State : Highway Routes. These routes when constructed to the Department of Transportation (Caltrans) : standards, the California Transportation Commission (CTC) shal...

The Role of Spatial Ability in the Relationship Between Video Game Experience and Route Effectiveness Among Unmanned Vehicle Operators

DTIC Science & Technology

2008-12-01

1  THE ROLE OF SPATIAL ABILITY IN THE RELATIONSHIP BETWEEN VIDEO GAME EXPERIENCE AND ROUTE EFFECTIVENESS AMONG UNMANNED VEHICLE OPERATORS...ABSTRACT Effective route planning is essential to the successful operation of unmanned vehicles. Video game experience has been shown to affect...route planning and execution, but why video game experience helps has not been addressed. One answer may be that spatial skills, necessary for route

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.

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.

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.

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks.

PubMed

Chang, Yuchao; Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Yuan, Baoqing Li andXiaobing

2017-07-19

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum-minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms.

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 a constrained shortest-path Dijkstra algorithm that has an assigned impedance factor. The route constraints modify the various impedance weights to bias or prefer particular network characteristics as desired by the user. Both the basic route model and the constrained impedance function calculations are determined by a series of network characteristics and shipment types. The study examines solutions under various constraints modeled by WebTRAGIS including possible routes from select shut-down reactor sites in the US to specific locations in the US. For purposes of illustration, the designated destinations are Oak Ridge National Laboratory in Tennessee and the Savannah River Site in South Carolina. To the degree that routes express sameness or variety under constraints serves to illustrate either a) the determinism of particular transport modes by either configuration or regulatory compliance, and/or b) the variety of constrained routes that are regulation compliant but may not be operationally feasible.« less

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.

Green-wave control of an unbalanced two-route traffic system with signals

NASA Astrophysics Data System (ADS)

Tobita, Kazuhiro; Nagatani, Takashi

2013-11-01

We introduce the preference parameter into the two-route dynamic model proposed by Wahle et al. The parameter represents the driver’s preference for the route choice. When the driver prefers a route, the traffic flow on route A does not balance with that on route B. We study the signal control for the unbalanced two-route traffic flow at the tour-time feedback strategy where the vehicles move ahead through a series of signals. The traffic signals are controlled by both cycle time and phase shift (offset time). We find that the mean tour time can be balanced by selecting the offset time successfully. We derive the relationship between the mean tour time and offset time (phase shift). Also, the dependences of the mean density and mean current on the offset time are derived.

Dynamic autonomous routing technology for IP-based satellite ad hoc networks

NASA Astrophysics Data System (ADS)

Wang, Xiaofei; Deng, Jing; Kostas, Theresa; Rajappan, Gowri

2014-06-01

IP-based routing for military LEO/MEO satellite ad hoc networks is very challenging due to network and traffic heterogeneity, network topology and traffic dynamics. In this paper, we describe a traffic priority-aware routing scheme for such networks, namely Dynamic Autonomous Routing Technology (DART) for satellite ad hoc networks. DART has a cross-layer design, and conducts routing and resource reservation concurrently for optimal performance in the fluid but predictable satellite ad hoc networks. DART ensures end-to-end data delivery with QoS assurances by only choosing routing paths that have sufficient resources, supporting different packet priority levels. In order to do so, DART incorporates several resource management and innovative routing mechanisms, which dynamically adapt to best fit the prevailing conditions. In particular, DART integrates a resource reservation mechanism to reserve network bandwidth resources; a proactive routing mechanism to set up non-overlapping spanning trees to segregate high priority traffic flows from lower priority flows so that the high priority flows do not face contention from low priority flows; a reactive routing mechanism to arbitrate resources between various traffic priorities when needed; a predictive routing mechanism to set up routes for scheduled missions and for anticipated topology changes for QoS assurance. We present simulation results showing the performance of DART. We have conducted these simulations using the Iridium constellation and trajectories as well as realistic military communications scenarios. The simulation results demonstrate DART's ability to discriminate between high-priority and low-priority traffic flows and ensure disparate QoS requirements of these traffic flows.

Comparison of transhepatic and extrahepatic routes for EUS-guided rendezvous procedure for distal CBD obstruction.

PubMed

Dhir, Vinay; Bhandari, Suryaprakash; Bapat, Mukta; Joshi, Nitin; Vivekanandarajah, Suhirdan; Maydeo, Amit

2013-04-01

EUS-guided rendezvous procedure (EUS-RV) can be done by the transhepatic (TH) or the extrahepatic (EH) route. There is no data on the preferred access route when both routes are available. To compare the success, complications, and duration of hospitalization for patients undergoing EUS-RV by the TH or the EH route. Patients with distal common bile duct (CBD) obstruction, who failed selective cannulation, underwent EUS-RV by the TH route through the stomach or the EH route through the duodenum. A total of 35 patients were analysed (17 TH, 18 EH). The mean procedure time was significantly longer for the TH group (34.4 vs. 25.7 min; p = 0.0004). There was no difference in the technical success (94.1 vs. 100%). However, the TH group had a higher incidence of post-procedure pain (44.1 vs. 5.5%; p = 0.017), bile leak (11.7 vs. 0; p = 0.228), and air under diaphragm (11.7 vs. 0; p = 0.228). All bile leaks were small and managed conservatively. Duration of hospitalization was significantly higher for the TH group (2.52 vs. 0.17 days; p = 0.015). EUS-RV has similar success rate by the TH or the EH route. However, the TH route has higher post-procedure pain, longer procedure time, and longer duration of hospitalization. The EH route should be preferred for EUS-RV in patients with distal CBD obstruction when both access routes are technically feasible.

Intrusion Detection for Defense at the MAC and Routing Layers of Wireless Networks

DTIC Science & Technology

2007-01-01

Space DoS Denial of Service DSR Dynamic Source Routing IDS Intrusion Detection System LAR Location-Aided Routing MAC Media Access Control MACA Multiple...different mobility parameters. 10 They simulate interaction between three MAC protocols ( MACA , 802.11 and CSMA) and three routing protocols (AODV, DSR

Values, Practice, Science, and AAC

ERIC Educational Resources Information Center

Mirenda, Pat

2017-01-01

The evolution of evidence-based practice in augmentative and alternative communication (AAC) has occurred via two different but related routes: the conventional research-to-practice route and the more common practice-to-research route. This article defines both routes with examples of each and discusses potential problems that may arise when…

75 FR 56919 - Port Access Route Study: The Approaches to San Francisco

Federal Register 2010, 2011, 2012, 2013, 2014

2010-09-17

... Access Route Study: The Approaches to San Francisco AGENCY: Coast Guard, DHS. ACTION: Notice of public... the study entitled ``Port Access Route Study: Off San Francisco'' that was published in the Federal... Access Route Study (PARS) to evaluate the continued applicability of and the potential need for...

Universal Cable Brackets

NASA Technical Reports Server (NTRS)

Vanvalkenburgh, C.

1985-01-01

Concept allows routing easily changed. No custom hardware required in concept. Instead, standard brackets cut to length and installed at selected locations along cable route. If cable route is changed, brackets simply moved to new locations. Concept for "universal" cable brackets make it easy to route electrical cable around and through virtually any structure.

27 CFR 9.127 - Cayuga Lake.

Code of Federal Regulations, 2013 CFR

2013-04-01

... of State Route 90 with State Route 326. (3) Then south along the primary, all-weather, hard surface.../southeast along State Route 90 until it intersects the light-duty, all-weather, hard or improved surface..., hard or improved surface road, approximately 4 miles, until it intersects State Route 34B, just south...

27 CFR 9.127 - Cayuga Lake.

Code of Federal Regulations, 2014 CFR

2014-04-01

... of State Route 90 with State Route 326. (3) Then south along the primary, all-weather, hard surface.../southeast along State Route 90 until it intersects the light-duty, all-weather, hard or improved surface..., hard or improved surface road, approximately 4 miles, until it intersects State Route 34B, just south...

27 CFR 9.127 - Cayuga Lake.

Code of Federal Regulations, 2012 CFR

2012-04-01

... of State Route 90 with State Route 326. (3) Then south along the primary, all-weather, hard surface.../southeast along State Route 90 until it intersects the light-duty, all-weather, hard or improved surface..., hard or improved surface road, approximately 4 miles, until it intersects State Route 34B, just south...

29 CFR 1910.35 - Compliance with alternate exit-route codes.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 1910.35 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION, DEPARTMENT OF LABOR OCCUPATIONAL SAFETY AND HEALTH STANDARDS Exit Routes and Emergency Planning § 1910.35...-route provisions of NFPA 101, Life Safety Code, 2009 edition, or the exit-route provisions of the...

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

3. Aerial view southeast, State Route 92 bottom left, Adams ...

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

3. Aerial view southeast, State Route 92 bottom left, Adams Dam Road center, Brandywine Creek State Park and J. Chandler Farm in center left, duck pond bottom right and reservoir bottom left. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

76 FR 37261 - Establishment of Helicopter Area Navigation (RNAV) Routes; Northeast United States

Federal Register 2010, 2011, 2012, 2013, 2014

2011-06-27

...; Northeast United States AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Final rule. SUMMARY...) structure and designates two helicopter RNAV routes (TK-routes) in the northeast corridor between the... Register a notice of proposed rulemaking to establish two helicopter RNAV routes in Northeast United States...

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

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2012 CFR

2012-01-01

... 14 Aeronautics and Space 4 2012-01-01 2012-01-01 false Role of staff in route proceedings. 399.63... of staff in route proceedings. (a) General. This policy statement establishes the standards applicable to staff participation in oral hearing cases involving award of route authority. (b) Standards...

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false Role of staff in route proceedings. 399.63... of staff in route proceedings. (a) General. This policy statement establishes the standards applicable to staff participation in oral hearing cases involving award of route authority. (b) Standards...

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2013 CFR

2013-01-01

... 14 Aeronautics and Space 4 2013-01-01 2013-01-01 false Role of staff in route proceedings. 399.63... of staff in route proceedings. (a) General. This policy statement establishes the standards applicable to staff participation in oral hearing cases involving award of route authority. (b) Standards...

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2014 CFR

2014-01-01

... 14 Aeronautics and Space 4 2014-01-01 2014-01-01 false Role of staff in route proceedings. 399.63... of staff in route proceedings. (a) General. This policy statement establishes the standards applicable to staff participation in oral hearing cases involving award of route authority. (b) Standards...

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.

Method and System for Air Traffic Rerouting for Airspace Constraint Resolution

NASA Technical Reports Server (NTRS)

Erzberger, Heinz (Inventor); Morando, Alexander R. (Inventor); Sheth, Kapil S. (Inventor); McNally, B. David (Inventor); Clymer, Alexis A. (Inventor); Shih, Fu-tai (Inventor)

2017-01-01

A dynamic constraint avoidance route system automatically analyzes routes of aircraft flying, or to be flown, in or near constraint regions and attempts to find more time and fuel efficient reroutes around current and predicted constraints. The dynamic constraint avoidance route system continuously analyzes all flight routes and provides reroute advisories that are dynamically updated in real time. The dynamic constraint avoidance route system includes a graphical user interface that allows users to visualize, evaluate, modify if necessary, and implement proposed reroutes.

Tour Recommendation Guide- Personalized travel sequence recommendation

NASA Astrophysics Data System (ADS)

Sivakumar, Akshitha; Prabadevi, B.

2017-11-01

Presents a personalized travel sequence for the given area the individual wants to visit. It not only helps to personalize the travel but also recommend a travel sequence based on the area mentioned. Firstly the frequently visited routes are ranked then top ranked routes are chosen based on previous travel records. The data is being collected using data mining and the famous routes are ranked based on user and the route. It helps in bridging the gap between user travel preference and routes.

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.

Familiar route loyalty implies visual pilotage in the homing pigeon

PubMed Central

Biro, Dora; Meade, Jessica; Guilford, Tim

2004-01-01

Wide-ranging animals, such as birds, regularly traverse large areas of the landscape efficiently in the course of their local movement patterns, which raises fundamental questions about the cognitive mechanisms involved. By using precision global-positioning-system loggers, we show that homing pigeons (Columba livia) not only come to rely on highly stereotyped yet surprisingly inefficient routes within the local area but are attracted directly back to their individually preferred routes even when released from novel sites off-route. This precise route loyalty demonstrates a reliance on familiar landmarks throughout the flight, which was unexpected under current models of avian navigation. We discuss how visual landmarks may be encoded as waypoints within familiar route maps. PMID:15572457

Do People Use the Shortest Path? An Empirical Test of Wardrop’s First Principle

PubMed Central

Zhu, Shanjiang; Levinson, David

2015-01-01

Most recent route choice models, following either the random utility maximization or rule-based paradigm, require explicit enumeration of feasible routes. The quality of model estimation and prediction is sensitive to the appropriateness of the consideration set. However, few empirical studies of revealed route characteristics have been reported in the literature. This study evaluates the widely applied shortest path assumption by evaluating routes followed by residents of the Minneapolis—St. Paul metropolitan area. Accurate Global Positioning System (GPS) and Geographic Information System (GIS) data were employed to reveal routes people used over an eight to thirteen week period. Most people did not choose the shortest path. Using three weeks of that data, we find that current route choice set generation algorithms do not reveal the majority of paths that individuals took. Findings from this study may guide future efforts in building better route choice models. PMID:26267756

Mathematical simulation for compensation capacities area of pipeline routes in ship systems

NASA Astrophysics Data System (ADS)

Ngo, G. V.; Sakhno, K. N.

2018-05-01

In this paper, the authors considered the problem of manufacturability’s enhancement of ship systems pipeline at the designing stage. The analysis of arrangements and possibilities for compensation of deviations for pipeline routes has been carried out. The task was set to produce the “fit pipe” together with the rest of the pipes in the route. It was proposed to compensate for deviations by movement of the pipeline route during pipe installation and to calculate maximum values of these displacements in the analyzed path. Theoretical bases of deviation compensation for pipeline routes using rotations of parallel section pairs of pipes are assembled. Mathematical and graphical simulations of compensation area capacities of pipeline routes with various configurations are completed. Prerequisites have been created for creating an automated program that will allow one to determine values of the compensatory capacities area for pipeline routes and to assign quantities of necessary allowances.

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

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.

Control of single-photon routing in a T-shaped waveguide by another atom

NASA Astrophysics Data System (ADS)

Huang, Jin-Song; Wang, Jing-Wen; Wang, Yan; Li, Yan-Ling; Huang, You-Wen

2018-04-01

Quantum routers with a high routing rate of much more than 0.5 are of great importance for quantum networks. We provide a scheme to perform bidirectional high routing-rate transfer in a T-shaped coupled-resonator waveguide (CRW), which extends a recent unidirectional scheme proposed by Lu et al. (Opt Express 23:22955, 2015). By locating an extra two-level atom in the infinite CRW channel of the T-shaped CRW with a three-level system, an effective potential is generated. Our numerical results show that high routing capability from the infinite CRW channel to the semi-infinite channel can be achieved, and routing capability from the semi-infinite CRW channel to the infinite channel can also be significantly enhanced, with the help of the effective potential. Therefore, the proposed double-atom configuration could be utilized as a bidirectional quantum routing controller to implement high transfer rate routing of single photons.

Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

NASA Astrophysics Data System (ADS)

Zhang, Yuanfei; Pei, Qianwen; Dai, Feifei; Zhang, Lei

2017-10-01

Vehicular ad-hoc network (VANET) is a core component of intelligent traffic management system which could provide various of applications such as accident prediction, route reporting, etc. Due to the problems caused by traffic congestion, route reporting becomes a prospective application which can help a driver to get optimal route to save her travel time. Before enjoying the convenience of route reporting, security and privacy-preserving issues need to be concerned. In this paper, we propose a new secure and privacy-preserving route reporting scheme for VANETs. In our scheme, only an authenticated vehicle can use the route reporting service provided by the traffic management center. Further, a vehicle may receive the response from the traffic management center with low latency and without violating the privacy of the vehicle. Experiment results show that our scheme is much more efficiency than the existing one.

Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation

NASA Astrophysics Data System (ADS)

Liu, Qiang; Wang, Chengen

2012-08-01

Computer-aided design of pipe routing is of fundamental importance for complex equipments' developments. In this article, non-rectilinear branch pipe routing with multiple terminals that can be formulated as a Euclidean Steiner Minimal Tree with Obstacles (ESMTO) problem is studied in the context of an aeroengine-integrated design engineering. Unlike the traditional methods that connect pipe terminals sequentially, this article presents a new branch pipe routing algorithm based on the Steiner tree theory. The article begins with a new algorithm for solving the ESMTO problem by using particle swarm optimisation (PSO), and then extends the method to the surface cases by using geodesics to meet the requirements of routing non-rectilinear pipes on the surfaces of aeroengines. Subsequently, the adaptive region strategy and the basic visibility graph method are adopted to increase the computation efficiency. Numeral computations show that the proposed routing algorithm can find satisfactory routing layouts while running in polynomial time.

Benchmark dataset for undirected and Mixed Capacitated Arc Routing Problems under Time restrictions with Intermediate Facilities.

PubMed

Willemse, Elias J; Joubert, Johan W

2016-09-01

In this article we present benchmark datasets for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities (MCARPTIF). The problem is a generalisation of the Capacitated Arc Routing Problem (CARP), and closely represents waste collection routing. Four different test sets are presented, each consisting of multiple instance files, and which can be used to benchmark different solution approaches for the MCARPTIF. An in-depth description of the datasets can be found in "Constructive heuristics for the Mixed Capacity Arc Routing Problem under Time Restrictions with Intermediate Facilities" (Willemseand Joubert, 2016) [2] and "Splitting procedures for the Mixed Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemseand Joubert, in press) [4]. The datasets are publicly available from "Library of benchmark test sets for variants of the Capacitated Arc Routing Problem under Time restrictions with Intermediate Facilities" (Willemse and Joubert, 2016) [3].

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.

Bees do not use nearest-neighbour rules for optimization of multi-location routes.

PubMed

Lihoreau, Mathieu; Chittka, Lars; Le Comber, Steven C; Raine, Nigel E

2012-02-23

Animals collecting patchily distributed resources are faced with complex multi-location routing problems. Rather than comparing all possible routes, they often find reasonably short solutions by simply moving to the nearest unvisited resources when foraging. Here, we report the travel optimization performance of bumble-bees (Bombus terrestris) foraging in a flight cage containing six artificial flowers arranged such that movements between nearest-neighbour locations would lead to a long suboptimal route. After extensive training (80 foraging bouts and at least 640 flower visits), bees reduced their flight distances and prioritized shortest possible routes, while almost never following nearest-neighbour solutions. We discuss possible strategies used during the establishment of stable multi-location routes (or traplines), and how these could allow bees and other animals to solve complex routing problems through experience, without necessarily requiring a sophisticated cognitive representation of space.

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

78 FR 68777 - Proposed Establishment of Area Navigation (RNAV) Routes; Atlanta, GA

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-15

... Atlanta, GA area. The new routes would support the Atlanta Optimization of Airspace and Procedures in a Metroplex (OAPM) project. The proposed routes would have connectivity to the current airway structure and... support the Atlanta OAPM project and provide routes through, around and over the Atlanta Metroplex area...

46 CFR 180.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 7 2012-10-01 2012-10-01 false Survival craft-vessels operating on oceans routes. 180... § 180.202 Survival craft—vessels operating on oceans routes. (a) Each vessel certificated to operate on an oceans route in cold water must either: (1) Be provided with inflatable buoyant apparatus of an...

46 CFR 117.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 4 2013-10-01 2013-10-01 false Survival craft-vessels operating on oceans routes. 117... operating on oceans routes. (a) Except as allowed by paragraph (b) of this section, each vessel certificated to operate on an oceans route in cold water must be provided with inflatable liferafts of an...

46 CFR 117.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 4 2014-10-01 2014-10-01 false Survival craft-vessels operating on oceans routes. 117... operating on oceans routes. (a) Except as allowed by paragraph (b) of this section, each vessel certificated to operate on an oceans route in cold water must be provided with inflatable liferafts of an...

46 CFR 180.202 - Survival craft-vessels operating on oceans 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 oceans routes. 180... § 180.202 Survival craft—vessels operating on oceans routes. (a) Each vessel certificated to operate on an oceans route in cold water must either: (1) Be provided with inflatable buoyant apparatus of an...

46 CFR 180.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 46 Shipping 7 2013-10-01 2013-10-01 false Survival craft-vessels operating on oceans routes. 180... § 180.202 Survival craft—vessels operating on oceans routes. (a) Each vessel certificated to operate on an oceans route in cold water must either: (1) Be provided with inflatable buoyant apparatus of an...

46 CFR 180.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 7 2011-10-01 2011-10-01 false Survival craft-vessels operating on oceans routes. 180... § 180.202 Survival craft—vessels operating on oceans routes. (a) Each vessel certificated to operate on an oceans route in cold water must either: (1) Be provided with inflatable buoyant apparatus of an...

46 CFR 117.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 46 Shipping 4 2012-10-01 2012-10-01 false Survival craft-vessels operating on oceans routes. 117... operating on oceans routes. (a) Except as allowed by paragraph (b) of this section, each vessel certificated to operate on an oceans route in cold water must be provided with inflatable liferafts of an...

46 CFR 180.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 7 2014-10-01 2014-10-01 false Survival craft-vessels operating on oceans routes. 180... § 180.202 Survival craft—vessels operating on oceans routes. (a) Each vessel certificated to operate on an oceans route in cold water must either: (1) Be provided with inflatable buoyant apparatus of an...

46 CFR 117.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 46 Shipping 4 2011-10-01 2011-10-01 false Survival craft-vessels operating on oceans routes. 117... operating on oceans routes. (a) Except as allowed by paragraph (b) of this section, each vessel certificated to operate on an oceans route in cold water must be provided with inflatable liferafts of an...

46 CFR 117.202 - Survival craft-vessels operating on oceans routes.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false Survival craft-vessels operating on oceans routes. 117... operating on oceans routes. (a) Except as allowed by paragraph (b) of this section, each vessel certificated to operate on an oceans route in cold water must be provided with inflatable liferafts of an...

APPLICATION AND USE OF DOSE ESTIMATING EXPOSURE MODEL (DEEM) FOR 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...

77 FR 65461 - Amendment of Area Navigation Route Q-1; CA

Federal Register 2010, 2011, 2012, 2013, 2014

2012-10-29

... existing ENVIE, CA, and EBINY, OR, waypoints for traffic flow metering with the Oakland Air Route Traffic... FAA is adding two waypoints along to route for air traffic control purposes. In addition, the route... is a routine matter that will only affect air traffic procedures and air navigation, it is certified...

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…

14 CFR 71.15 - Designation of jet routes and VOR Federal airways.

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 2 2011-01-01 2011-01-01 false Designation of jet routes and VOR Federal airways. 71.15 Section 71.15 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF... ROUTES; AND REPORTING POINTS § 71.15 Designation of jet routes and VOR Federal airways. Unless otherwise...

14 CFR 71.15 - Designation of jet routes and VOR Federal airways.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false Designation of jet routes and VOR Federal airways. 71.15 Section 71.15 Aeronautics and Space FEDERAL AVIATION ADMINISTRATION, DEPARTMENT OF... ROUTES; AND REPORTING POINTS § 71.15 Designation of jet routes and VOR Federal airways. Unless otherwise...

9. UNDERSIDE, SHOWING NORTH ROCK OUTCROP ON WHICH ROUTE 31 ...

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

9. UNDERSIDE, SHOWING NORTH ROCK OUTCROP ON WHICH ROUTE 31 RESTS, NORTH PIER AGAINST ROCK, AND SOUTH PIER. LOOKING SOUTHEAST. - Route 31 Bridge, New Jersey Route 31, crossing disused main line of Central Railroad of New Jersey (C.R.R.N.J.) (New Jersey Transit's Raritan Valley Line), Hampton, Hunterdon County, NJ

Method and apparatus for identification of hazards along an intended travel route

NASA Technical Reports Server (NTRS)

Kronfeld, Kevin M. (Inventor); Lapis, Mary Beth (Inventor); Walling, Karen L. (Inventor); Chackalackal, Mathew S. (Inventor)

2003-01-01

Targets proximate to a travel route plan were evaluated to determine hazardousness. Projected geometric representation of a vehicle determines intrusion of hazardous targets along travel route plan. Geometric representation of hazardous targets projected along motion vector to determine intrusion upon travel route plan. Intrusion assessment presented on user display.

48 CFR 752.7002 - Travel and transportation.

Code of Federal Regulations, 2014 CFR

2014-10-01

... required by scheduled commercial air carrier using the most expeditious route. One stopover en route for a... time at post. (h) Delays en route. The Contractor may grant to travelers under this contract reasonable delays en route while in travel status when such delays are caused by events beyond the control of such...

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

75 FR 64387 - Self-Regulatory Organizations; BATS Exchange, Inc.; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-19

... Exchange routing functionality and to describe available routing strategies in greater detail. The text of... received on the proposed rule change. The text of these statements may be examined at the places specified... Exchange routing functionality and to describe available routing strategies in greater detail. Also...

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

Brain Routes for Reading in Adults with and without Autism: EMEG Evidence

ERIC Educational Resources Information Center

Moseley, Rachel L.; Pulvermüller, Friedemann; Mohr, Bettina; Lombardo, Michael V.; Baron-Cohen, Simon; Shtyrov, Yury

2014-01-01

Reading utilises at least two neural pathways. The temporal lexical route visually maps whole words to their lexical entries, whilst the nonlexical route decodes words phonologically via parietal cortex. Readers typically employ the lexical route for familiar words, but poor comprehension plus precocity at mechanically "sounding out"…

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

75 FR 29652 - Amendment of Area Navigation Route Q-15; California

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-27

...-0028; Airspace Docket No. 10-AWP-1] Amendment of Area Navigation Route Q-15; California AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Final rule. SUMMARY: This action amends Area Navigation Route Q... Register a notice of proposed rulemaking (NPRM) to amend Area Navigation Route Q- 15 in California (75 FR...

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.

Greedy data transportation scheme with hard packet deadlines for wireless ad hoc networks.

PubMed

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

PubMed Central

Lee, HyungJune

2014-01-01

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services. PMID:25258736

Assessment of Novel Routes of Biomethane Utilization in a Life Cycle Perspective

PubMed Central

Moghaddam, Elham Ahmadi; Ahlgren, Serina; Nordberg, Åke

2016-01-01

Biomethane, as a replacement for natural gas, reduces the use of fossil-based sources and supports the intended change from fossil to bio-based industry. The study assessed different biomethane utilization routes for production of methanol, dimethyl ether (DME), and ammonia, as fuel or platform chemicals and combined heat and power (CHP). Energy efficiency and environmental impacts of the different pathways was studied in a life cycle perspective covering the technical system from biomass production to the end product. Among the routes studied, CHP had the highest energy balance and least environmental impact. DME and methanol performed competently in energy balance and environmental impacts in comparison with the ammonia route. DME had the highest total energy output, as fuel, heat, and steam, among the different routes studied. Substituting the bio-based routes for fossil-based alternatives would give a considerable reduction in environmental impacts such as global warming potential and acidification potential for all routes studied, especially CHP, DME, and methanol. Eutrophication potential was mainly a result of biomass and biomethane production, with marginal differences between the different routes. PMID:28066762

A Study of Driver's Route Choice Behavior Based on Evolutionary Game Theory

PubMed Central

Jiang, Xiaowei; Ji, Yanjie; Deng, Wei

2014-01-01

This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent. PMID:25610455

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

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.

A study of driver's route choice behavior based on evolutionary game theory.

PubMed

Jiang, Xiaowei; Ji, Yanjie; Du, Muqing; Deng, Wei

2014-01-01

This paper proposes a route choice analytic method that embeds cumulative prospect theory in evolutionary game theory to analyze how the drivers adjust their route choice behaviors under the influence of the traffic information. A simulated network with two alternative routes and one variable message sign is built to illustrate the analytic method. We assume that the drivers in the transportation system are bounded rational, and the traffic information they receive is incomplete. An evolutionary game model is constructed to describe the evolutionary process of the drivers' route choice decision-making behaviors. Here we conclude that the traffic information plays an important role in the route choice behavior. The driver's route decision-making process develops towards different evolutionary stable states in accordance with different transportation situations. The analysis results also demonstrate that employing cumulative prospect theory and evolutionary game theory to study the driver's route choice behavior is effective. This analytic method provides an academic support and suggestion for the traffic guidance system, and may optimize the travel efficiency to a certain extent.

A neural networks-based hybrid routing protocol for wireless mesh networks.

PubMed

Kojić, Nenad; Reljin, Irini; Reljin, Branimir

2012-01-01

The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic-i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance.

Perspectives on Subcutaneous Route of Administration as an Immunogenicity Risk Factor for Therapeutic Proteins.

PubMed

Hamuro, Lora; Kijanka, Grzegorz; Kinderman, Francis; Kropshofer, Harald; Bu, De-Xiu; Zepeda, Monica; Jawa, Vibha

2017-10-01

An increasing number of therapeutic proteins are being developed for delivery through the subcutaneous (SC) route of administration. Relative to intravenous (IV) administration, the SC route offers more convenience to patients, flexibility in dosing, and potential to reduce health care costs. There is a perception that SC administration can pose a higher immunogenicity risk than IV administration for a given protein. To evaluate whether there is a difference in therapeutic protein immunogenicity associated with administration routes, a more detailed understanding of the interactions with the immune system by each route is needed. Few approved therapeutic proteins have available clinical immunogenicity data sets in the public domain that represent both IV and SC administration routes. This has prevented a direct comparison of the 2 routes of administration across a large sample size. Of the 6 marketed products where SC and IV route-related incidences of anti-drug antibody (ADA) were available, 4 were associated with higher immunogenicity incidence with SC. In other cases, there was no apparent difference between the SC and IV routes. Overall, the ADA incidence was low (<15%) with no impact on safety or efficacy. The challenges associated with identifying specific risk factors unique to SC administration are discussed. Copyright © 2017 American Pharmacists Association®. Published by Elsevier Inc. All rights reserved.

A Neural Networks-Based Hybrid Routing Protocol for Wireless Mesh Networks

PubMed Central

Kojić, Nenad; Reljin, Irini; Reljin, Branimir

2012-01-01

The networking infrastructure of wireless mesh networks (WMNs) is decentralized and relatively simple, but they can display reliable functioning performance while having good redundancy. WMNs provide Internet access for fixed and mobile wireless devices. Both in urban and rural areas they provide users with high-bandwidth networks over a specific coverage area. The main problems affecting these networks are changes in network topology and link quality. In order to provide regular functioning, the routing protocol has the main influence in WMN implementations. In this paper we suggest a new routing protocol for WMN, based on good results of a proactive and reactive routing protocol, and for that reason it can be classified as a hybrid routing protocol. The proposed solution should avoid flooding and creating the new routing metric. We suggest the use of artificial logic—i.e., neural networks (NNs). This protocol is based on mobile agent technologies controlled by a Hopfield neural network. In addition to this, our new routing metric is based on multicriteria optimization in order to minimize delay and blocking probability (rejected packets or their retransmission). The routing protocol observes real network parameters and real network environments. As a result of artificial logic intelligence, the proposed routing protocol should maximize usage of network resources and optimize network performance. PMID:22969360

Energy consumption and control response evaluations of AODV routing in WSANs for building-temperature control.

PubMed

Booranawong, Apidet; Teerapabkajorndet, Wiklom; Limsakul, Chusak

2013-06-27

The main objective of this paper is to investigate the effects of routing protocols on wireless sensor and actuator networks (WSANs), focusing on the control system response and the energy consumption of nodes in a network. We demonstrate that routing algorithms designed without considering the relationship between communication and control cannot be appropriately used in wireless networked control applications. For this purpose, an ad-hoc on-demand distance vector (AODV) routing, an IEEE 802.15.4, and a building-temperature control system are employed for this exploration. The findings from our scenarios show that the AODV routing can select a path with a high traffic load for data transmission. It takes a long time before deciding to change a new route although it experiences the unsuccessful transmission of packets. As a result, the desirable control target cannot be achieved in time, and nodes consume more energy due to frequent packet collisions and retransmissions. Consequently, we propose a simple routing solution to alleviate these research problems by modifying the original AODV routing protocol. The delay-threshold is considered to avoid any congested connection during routing procedures. The simulation results demonstrate that our solution can be appropriately applied in WSANs. Both the energy consumption and the control system response are improved.

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

Endoscopic Ultrasound-guided Rendezvous Technique after Failed Endoscopic Retrograde Cholangiopancreatography: Which Approach Route Is the Best?

PubMed Central

Okuno, Nozomi; Hara, Kazuo; Mizuno, Nobumasa; Hijioka, Susumu; Tajika, Masahiro; Tanaka, Tsutomu; Ishihara, Makoto; Hirayama, Yutaka; Onishi, Sachiyo; Niwa, Yasumasa; Yamao, Kenji

2017-01-01

Objective The endoscopic ultrasound-guided rendezvous technique (EUS-RV) is a salvage method for failed selective biliary cannulation. Three puncture routes have been reported, with many comparisons between the intra-hepatic and extra-hepatic biliary ducts. We used the trans-esophagus (TE) and trans-jejunum (TJ) routes. In the present study, the utility of EUS-RV for biliary access was evaluated, focusing on the approach routes. Methods and Patients In 39 patients, 42 puncture routes were evaluated in detail. EUS-RV was performed between January 2010 and December 2014. The patients were prospectively enrolled, and their clinical data were retrospectively collected. Results The patients' median age was 71 (range 29-84) years. The indications for endoscopic retrograde cholangiopancreatography (ERCP) were malignant biliary obstruction in 24 patients and benign biliary disease in 15. The technical success rate was 78.6% (33/42) and was similar among approach routes (p=0.377). The overall complication rate was 16.7% (7/42) and was similar among approach routes (p=0.489). However, mediastinal emphysema occurred in 2 TE route EUS-RV patients. No EUS-RV-related deaths occurred. Conclusion EUS-RV proved reliable after failed ERCP. The selection of the appropriate route based on the patient's condition is crucial. PMID:28943555

Dynamic Hierarchical Energy-Efficient Method Based on Combinatorial Optimization for Wireless Sensor Networks

PubMed Central

Tang, Hongying; Cheng, Yongbo; Zhao, Qin; Li, Baoqing; Yuan, Xiaobing

2017-01-01

Routing protocols based on topology control are significantly important for improving network longevity in wireless sensor networks (WSNs). Traditionally, some WSN routing protocols distribute uneven network traffic load to sensor nodes, which is not optimal for improving network longevity. Differently to conventional WSN routing protocols, we propose a dynamic hierarchical protocol based on combinatorial optimization (DHCO) to balance energy consumption of sensor nodes and to improve WSN longevity. For each sensor node, the DHCO algorithm obtains the optimal route by establishing a feasible routing set instead of selecting the cluster head or the next hop node. The process of obtaining the optimal route can be formulated as a combinatorial optimization problem. Specifically, the DHCO algorithm is carried out by the following procedures. It employs a hierarchy-based connection mechanism to construct a hierarchical network structure in which each sensor node is assigned to a special hierarchical subset; it utilizes the combinatorial optimization theory to establish the feasible routing set for each sensor node, and takes advantage of the maximum–minimum criterion to obtain their optimal routes to the base station. Various results of simulation experiments show effectiveness and superiority of the DHCO algorithm in comparison with state-of-the-art WSN routing algorithms, including low-energy adaptive clustering hierarchy (LEACH), hybrid energy-efficient distributed clustering (HEED), genetic protocol-based self-organizing network clustering (GASONeC), and double cost function-based routing (DCFR) algorithms. PMID:28753962

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.

A theoretical study on reaction mechanisms and kinetics of thiophene hydrodesulfurization over MoS 2 catalysts

DOE PAGES

Jin, Qiu; Chen, Biaohua; Ren, Zhibo; ...

2018-02-10

In the present study, thiophene hydrodesulphurization (HDS) over the Mo-edge, the S-edge, and the Mo-S connection edge of MoS 2 catalyst with 50% sulfur coverage was studied using first-principles based microkinetic modeling. Two parallel HDS routes, i.e., direct desulfurization (DDS) and hydrogenation (HYD) were taken into account. It has been found that the major reaction route of thiophene HDS on the Mo- and the Mo-S edges is temperature dependent. In the low temperature range of 500–600 K, the HYD route is dominant, leading to the C 4H 8 formation. As the temperature increases, the DDS route becomes competitive with themore » HYD route. At the temperature above 650 K, the DDS route will be the dominant HDS reaction route on the Mo- and the Mo-S edges. The DDS route leading to the formation of C 4H 6 is the major thiophene HDS reaction route on the S-edge in the entire temperature range of 500–750 K. The microkinetic modeling results show the overall HDS activity on the S-edge is lower than it on the Mo- and the Mo-S edges. The Mo-S edge also provides a preferential reaction pathway, which facilitates 2-hydrothiophene migration from the Mo-edge to the S-edge, followed by remaining elementary steps with lower activation barriers in the DDS route.« less

Indoor 3D Route Modeling Based On Estate Spatial Data

NASA Astrophysics Data System (ADS)

Zhang, H.; Wen, Y.; Jiang, J.; Huang, W.

2014-04-01

Indoor three-dimensional route model is essential for space intelligence navigation and emergency evacuation. This paper is motivated by the need of constructing indoor route model automatically and as far as possible. By comparing existing building data sources, this paper firstly explained the reason why the estate spatial management data is chosen as the data source. Then, an applicable method of construction three-dimensional route model in a building is introduced by establishing the mapping relationship between geographic entities and their topological expression. This data model is a weighted graph consist of "node" and "path" to express the spatial relationship and topological structure of a building components. The whole process of modelling internal space of a building is addressed by two key steps: (1) each single floor route model is constructed, including path extraction of corridor using Delaunay triangulation algorithm with constrained edge, fusion of room nodes into the path; (2) the single floor route model is connected with stairs and elevators and the multi-floor route model is eventually generated. In order to validate the method in this paper, a shopping mall called "Longjiang New City Plaza" in Nanjing is chosen as a case of study. And the whole building space is constructed according to the modelling method above. By integrating of existing path finding algorithm, the usability of this modelling method is verified, which shows the indoor three-dimensional route modelling method based on estate spatial data in this paper can support indoor route planning and evacuation route design very well.

A theoretical study on reaction mechanisms and kinetics of thiophene hydrodesulfurization over MoS 2 catalysts

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

Jin, Qiu; Chen, Biaohua; Ren, Zhibo

In the present study, thiophene hydrodesulphurization (HDS) over the Mo-edge, the S-edge, and the Mo-S connection edge of MoS 2 catalyst with 50% sulfur coverage was studied using first-principles based microkinetic modeling. Two parallel HDS routes, i.e., direct desulfurization (DDS) and hydrogenation (HYD) were taken into account. It has been found that the major reaction route of thiophene HDS on the Mo- and the Mo-S edges is temperature dependent. In the low temperature range of 500–600 K, the HYD route is dominant, leading to the C 4H 8 formation. As the temperature increases, the DDS route becomes competitive with themore » HYD route. At the temperature above 650 K, the DDS route will be the dominant HDS reaction route on the Mo- and the Mo-S edges. The DDS route leading to the formation of C 4H 6 is the major thiophene HDS reaction route on the S-edge in the entire temperature range of 500–750 K. The microkinetic modeling results show the overall HDS activity on the S-edge is lower than it on the Mo- and the Mo-S edges. The Mo-S edge also provides a preferential reaction pathway, which facilitates 2-hydrothiophene migration from the Mo-edge to the S-edge, followed by remaining elementary steps with lower activation barriers in the DDS route.« less

LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring.

PubMed

Tseng, Chinyang Henry

2016-05-31

In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee's AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee's routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node's distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee's AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV.

Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis.

PubMed

Alanazi, Adwan; Elleithy, Khaled

2015-09-02

Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol.

Airspace Technology Demonstration 3 (ATD-3): Dynamic Weather Routes (DWR) Technology Transfer Document Summary Version 1.0

NASA Technical Reports Server (NTRS)

Sheth, Kapil; Wang, Easter Mayan Chan

2016-01-01

Airspace Technology Demonstration #3 (ATD-3) is part of NASA's Airspace Operations and Safety Program (AOSP) - specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multiyear research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the first of three Research Transition Products (RTPs) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA's legacy Dynamic Weather Routes (DWR) work for efficient routing for en-route weather avoidance. DWR is a ground-based trajectory automation system that continuously and automatically analyzes active airborne aircraft in en route airspace to identify opportunities for simple corrections to flight plan routes that can save significant flying time, at least five minutes wind-corrected, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. The key benefit of the DWR concept is to let automation continuously and automatically analyze active flights to find those where simple route corrections can save significant time and fuel. Operators are busy during weather events. It is more effective to let automation find the opportunities for high-value route corrections.

Intraosseous vascular access in disasters and mass casualty events: A review of the literature.

PubMed

Burgert, James M

2016-01-01

The intraosseous (IO) route of vascular access has been increasingly used to administer resuscitative fluids and drugs to patients in whom reliable intravenous (IV) access could not be rapidly or easily obtained. It is unknown that to what extent the IO route has been used to gain vascular access during disasters and mass casualty events. The purpose of this review was to examine the existing literature to answer the research question, "What is the utility of the IO route compared to other routes for establishing vascular access in patients resulting from disasters and mass casualty events?" Keyword-based online database search of PubMed, CINAHL, and the Cochrane Database of Systematic Reviews. University-based academic research cell. Included evidence were randomized and nonrandomized trials, systematic reviews with and without meta-analysis, case series, and case reports. Excluded evidence included narrative reviews and expert opinion. Not applicable. Of 297 evidence sources located, 22 met inclusion criteria. Located evidence was organized into four categories including chemical agent poisoning, IO placement, while wearing chemical protective clothing (PPE), military trauma, and infectious disease outbreak. Evidence indicates that the IO route of infusion is pharmacokinetically equal to the IV route and superior to the intramuscular (IM) and endotracheal routes for the administration of antidotal drugs in animal models of chemical agent poisoning while wearing full chemical PPE. The IO route is superior to the IM route for antidote administration during hypovolemic shock. Civilian casualties of explosive attacks and mass shootings would likely benefit from expanded use of the IO route and military resuscitation strategies. The IO route is useful for fluid resuscitation in the management of diarrheal and hemorrhagic infectious disease outbreaks.

LBMR: Load-Balanced Multipath Routing for Wireless Data-Intensive Transmission in Real-Time Medical Monitoring

PubMed Central

Tseng, Chinyang Henry

2016-01-01

In wireless networks, low-power Zigbee is an excellent network solution for wireless medical monitoring systems. Medical monitoring generally involves transmission of a large amount of data and easily causes bottleneck problems. Although Zigbee’s AODV mesh routing provides extensible multi-hop data transmission to extend network coverage, it originally does not, and needs to support some form of load balancing mechanism to avoid bottlenecks. To guarantee a more reliable multi-hop data transmission for life-critical medical applications, we have developed a multipath solution, called Load-Balanced Multipath Routing (LBMR) to replace Zigbee’s routing mechanism. LBMR consists of three main parts: Layer Routing Construction (LRC), a Load Estimation Algorithm (LEA), and a Route Maintenance (RM) mechanism. LRC assigns nodes into different layers based on the node’s distance to the medical data gateway. Nodes can have multiple next-hops delivering medical data toward the gateway. All neighboring layer-nodes exchange flow information containing current load, which is the used by the LEA to estimate future load of next-hops to the gateway. With LBMR, nodes can choose the neighbors with the least load as the next-hops and thus can achieve load balancing and avoid bottlenecks. Furthermore, RM can detect route failures in real-time and perform route redirection to ensure routing robustness. Since LRC and LEA prevent bottlenecks while RM ensures routing fault tolerance, LBMR provides a highly reliable routing service for medical monitoring. To evaluate these accomplishments, we compare LBMR with Zigbee’s AODV and another multipath protocol, AOMDV. The simulation results demonstrate LBMR achieves better load balancing, less unreachable nodes, and better packet delivery ratio than either AODV or AOMDV. PMID:27258297

Real-Time QoS Routing Protocols in Wireless Multimedia Sensor Networks: Study and Analysis

PubMed Central

Alanazi, Adwan; Elleithy, Khaled

2015-01-01

Many routing protocols have been proposed for wireless sensor networks. These routing protocols are almost always based on energy efficiency. However, recent advances in complementary metal-oxide semiconductor (CMOS) cameras and small microphones have led to the development of Wireless Multimedia Sensor Networks (WMSN) as a class of wireless sensor networks which pose additional challenges. The transmission of imaging and video data needs routing protocols with both energy efficiency and Quality of Service (QoS) characteristics in order to guarantee the efficient use of the sensor nodes and effective access to the collected data. Also, with integration of real time applications in Wireless Senor Networks (WSNs), the use of QoS routing protocols is not only becoming a significant topic, but is also gaining the attention of researchers. In designing an efficient QoS routing protocol, the reliability and guarantee of end-to-end delay are critical events while conserving energy. Thus, considerable research has been focused on designing energy efficient and robust QoS routing protocols. In this paper, we present a state of the art research work based on real-time QoS routing protocols for WMSNs that have already been proposed. This paper categorizes the real-time QoS routing protocols into probabilistic and deterministic protocols. In addition, both categories are classified into soft and hard real time protocols by highlighting the QoS issues including the limitations and features of each protocol. Furthermore, we have compared the performance of mobility-aware query based real-time QoS routing protocols from each category using Network Simulator-2 (NS2). This paper also focuses on the design challenges and future research directions as well as highlights the characteristics of each QoS routing protocol. PMID:26364639

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 the appropriate routing protocol for two kinds of communication services (data and voice).

Exploring bikeability in a metropolitan setting: stimulating and hindering factors in commuting route environments

PubMed Central

2012-01-01

Background Route environments may influence people's active commuting positively and thereby contribute to public health. Assessments of route environments are, however, needed in order to better understand the possible relationship between active commuting and the route environment. The aim of this study was, therefore, to assess the potential associations between perceptions of whether the route environment on the whole hinders or stimulates bicycle commuting and perceptions of environmental factors. Methods The Active Commuting Route Environment Scale (ACRES) was used for the assessment of bicycle commuters' perceptions of their route environments in the inner urban parts of Greater Stockholm, Sweden. Bicycle commuters (n = 827) were recruited by advertisements in newspapers. Simultaneous multiple regression analyses were used to assess the relation between predictor variables (such as levels of exhaust fumes, noise, traffic speed, traffic congestion and greenery) and the outcome variable (hindering - stimulating route environments). Two models were run, (Model 1) without and (Model 2) with the item traffic: unsafe or safe included as a predictor. Results Overall, about 40% of the variance of hindering - stimulating route environments was explained by the environmental predictors in our models (Model 1, R2 = 0.415, and Model 2, R 2= 0.435). The regression equation for Model 1 was: y = 8.53 + 0.33 ugly or beautiful + 0.14 greenery + (-0.14) course of the route + (-0.13) exhaust fumes + (-0.09) congestion: all types of vehicles (p ≤ 0.019). The regression equation for Model 2 was y = 6.55 + 0.31 ugly or beautiful + 0.16 traffic: unsafe or safe + (-0.13) exhaust fumes + 0.12 greenery + (-0.12) course of the route (p ≤ 0.001). Conclusions The main results indicate that beautiful, green and safe route environments seem to be, independently of each other, stimulating factors for bicycle commuting in inner urban areas. On the other hand, exhaust fumes, traffic congestion and low 'directness' of the route seem to be hindering factors. Furthermore, the overall results illustrate the complexity of a research area at the beginning of exploration. PMID:22401492

Cluster Based Location-Aided Routing Protocol for Large Scale Mobile Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Wang, Yi; Dong, Liang; Liang, Taotao; Yang, Xinyu; Zhang, Deyun

Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.

Geographic Perspectives with Elementary Students: The Silk Road

ERIC Educational Resources Information Center

Bisland, Beverly Milner

2006-01-01

The purpose of this study is to investigate elementary students' explanations of how physical features of the land influence the location of humanly defined structures including trade routes, such as the silk routes. The silk routes were a series of caravan trade routes that extended from Turkey to China and were located as far south as India and…

27 CFR 9.47 - Hudson River Region.

Code of Federal Regulations, 2010 CFR

2010-04-01

...-Greene County line to N.Y. Route 214. (6) The boundary proceeds southerly along the eastern side of N.Y... eastern side of N.Y. Route 28 to the junction with N.Y. Route 28A. (8) The boundary proceeds southerly along the eastern side of N.Y. Route 28A to the intersection with the secondary, hard surface...

46 CFR 117.208 - Survival craft-vessels operating on rivers routes.

Code of Federal Regulations, 2010 CFR

2010-10-01

... certificated to operate on a rivers route in cold water must be provided with life floats of an aggregate... vessel certificated to operate on a rivers route in warm water is not required to carry survival craft... carry survival craft. (d) For a vessel certificated to operate on a rivers route in shallow water where...

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

4. Aerial view southwest, Adams Dam Road bottom left, State ...

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

4. Aerial view southwest, Adams Dam Road bottom left, State Route 100 center, back gates to Winterthur and Wilmington Country Club upper center, duck pond and reservoir bottom right and center, and State Route 92 center bottom. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

77 FR 39749 - Self-Regulatory Organizations; EDGX Exchange, Inc.; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-07-05

... Rule 11.9(b) are already written broadly enough to allow for both sequential or simultaneous routing of... or sequential routing as to these strategies. \\4\\ Regarding simultaneous routing, the Exchange may.... Simultaneous routing is an improvement on the current sequential manner in which orders are filled because it...

Colonization of mature laying hens with salmonella enteritidis by oral or intracloacal inoculation

USDA-ARS?s Scientific Manuscript database

A major route of Salmonella Enteritidis (SE) infection is the fecal-oral route. Evidence of SE in internal organs of laying hens once they are inoculated via the oral (OR) or intracloacal (IC) route has not been reliably demonstrated. The current study evaluated OR or IC route of inoculation of a na...

Re-Purposing Google Maps Visualisation for Teaching Logistics Systems

ERIC Educational Resources Information Center

Cheong, France; Cheong, Christopher; Jie, Ferry

2012-01-01

Routing is the process of selecting appropriate paths and ordering waypoints in a network. It plays an important part in logistics and supply chain management as choosing the optimal route can minimise distribution costs. Routing optimisation, however, is a difficult problem to solve and computer software is often used to determine the best route.…

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

77 FR 71492 - Amendment of Area Navigation Route Q-1; CA

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-03

...-1049; Airspace Docket No. 12-ANM-12] RIN 2120-AA66 Amendment of Area Navigation Route Q-1; CA AGENCY...) route Q-1. This action corrects the spelling of the TOCOS waypoint. DATES: Effective date 0901 UTC... published a final rule, technical amendment in the Federal Register amending the description of RNAV route Q...

The influence of advertisements on the conspicuity of routing information.

PubMed

Boersema, T; Zwaga, H J

1985-12-01

An experiment is described in which the influence of advertisements on the conspicuity of routing information was investigated. Stimulus material consisted of colour slides of 12 railway station scenes. In two of these scenes, number and size of advertisements were systematically varied. Subjects were instructed to locate routing signs in the scenes. Performance on the location task was used as a measure of the routing sign conspicuity. The results show that inserting an advertisement lessens the conspicuity of the routing information. This effect becomes stronger if more or larger advertisements are added.

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.

Mobile Router Technology Development

NASA Technical Reports Server (NTRS)

Ivancic, William D.; Stewart, David H.; Bell, Terry L.; Kachmar, Brian A.; Shell, Dan; Leung, Kent

2002-01-01

Cisco Systems and NASA have been performing joint research on mobile routing technology under a NASA Space Act Agreement. Cisco developed mobile router technology and provided that technology to NASA for applications to aeronautic and space-based missions. NASA has performed stringent performance testing of the mobile router, including the interaction of routing and transport-level protocols. This paper describes mobile routing, the mobile router, and some key configuration parameters. In addition, the paper describes the mobile routing test network and test results documenting the performance of transport protocols in dynamic routing environments.

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

An efficient routing strategy for traffic dynamics on two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Wang, Huiling; Zhang, Zhuxi; Zhang, Yi; Duan, Congwen; Qi, Zhaohui; Liu, Yu

2018-05-01

In order to alleviate traffic congestion on multilayer networks, designing an efficient routing strategy is one of the most important ways. In this paper, a novel routing strategy is proposed to reduce traffic congestion on two-layer networks. In the proposed strategy, the optimal paths in the physical layer are chosen by comprehensively considering the roles of nodes’ degrees of the two layers. Both numerical and analytical results indicate that our routing strategy can reasonably redistribute the traffic load of the physical layer, and thus the traffic capacity of two-layer complex networks are significantly enhanced compared with the shortest path routing (SPR) and the global awareness routing (GAR) strategies. This study may shed some light on the optimization of networked traffic dynamics.

A comparative study of routing protocols of heterogeneous wireless sensor networks.

PubMed

Han, Guangjie; Jiang, Xu; Qian, Aihua; Rodrigues, Joel J P C; Cheng, Long

2014-01-01

Recently, heterogeneous wireless sensor network (HWSN) routing protocols have drawn more and more attention. Various HWSN routing protocols have been proposed to improve the performance of HWSNs. Among these protocols, hierarchical HWSN routing protocols can improve the performance of the network significantly. In this paper, we will evaluate three hierarchical HWSN protocols proposed recently--EDFCM, MCR, and EEPCA--together with two previous classical routing protocols--LEACH and SEP. We mainly focus on the round of the first node dies (also called the stable period) and the number of packets sent to sink, which is an important aspect to evaluate the monitoring ability of a protocol. We conduct a lot of experiments and simulations on Matlab to analyze the performance of the five routing protocols.

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.

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.

Flight plan optimization

NASA Astrophysics Data System (ADS)

Dharmaseelan, Anoop; Adistambha, Keyne D.

2015-05-01

Fuel cost accounts for 40 percent of the operating cost of an airline. Fuel cost can be minimized by planning a flight on optimized routes. The routes can be optimized by searching best connections based on the cost function defined by the airline. The most common algorithm that used to optimize route search is Dijkstra's. Dijkstra's algorithm produces a static result and the time taken for the search is relatively long. This paper experiments a new algorithm to optimize route search which combines the principle of simulated annealing and genetic algorithm. The experimental results of route search, presented are shown to be computationally fast and accurate compared with timings from generic algorithm. The new algorithm is optimal for random routing feature that is highly sought by many regional operators.

Understanding cost drivers and economic potential of two variants of ionic liquid pretreatment for cellulosic biofuel production

PubMed Central

2014-01-01

Background Ionic liquid (IL) pretreatment could enable an economically viable route to produce biofuels by providing efficient means to extract sugars and lignin from lignocellulosic biomass. However, to realize this, novel IL-based processes need to be developed in order to minimize the overall production costs and accelerate commercial viability. In this study, two variants of IL-based processes are considered: one based on complete removal of the IL prior to hydrolysis using a water-wash (WW) step and the other based on a “one-pot” (OP) process that does not require IL removal prior to saccharification. Detailed techno-economic analysis (TEA) of these two routes was carried out to understand the cost drivers, economic potential (minimum ethanol selling price, MESP), and relative merits and challenges of each route. Results At high biomass loading (50%), both routes exhibited comparable economic performance with an MESP of $6.3/gal. With the possible advances identified (reduced water or acid/base consumption, improved conversion in pretreatment, and lignin valorization), the MESP could be reduced to around $3/gal ($3.2 in the WW route and $2.8 in the OP route). Conclusions It was found that, to be competitive at industrial scale, lowered cost of ILs used and higher biomass loadings (50%) are essential for both routes, and in particular for the OP route. Overall, while the economic potential of both routes appears to be comparable at higher biomass loadings, the OP route showed the benefit of lower water consumption at the plant level, an important cost and sustainability consideration for biorefineries. PMID:24932217

A dynamic routing strategy with limited buffer on scale-free network

NASA Astrophysics Data System (ADS)

Wang, Yufei; Liu, Feng

2016-04-01

In this paper, we propose an integrated routing strategy based on global static topology information and local dynamic data packet queue lengths to improve the transmission efficiency of scale-free networks. The proposed routing strategy is a combination of a global static routing strategy (based on the shortest path algorithm) and local dynamic queue length management, in which, instead of using an infinite buffer, the queue length of each node i in the proposed routing strategy is limited by a critical queue length Qic. When the network traffic is lower and the queue length of each node i is shorter than its critical queue length Qic, it forwards packets according to the global routing table. With increasing network traffic, when the buffers of the nodes with higher degree are full, they do not receive packets due to their limited buffers and the packets have to be delivered to the nodes with lower degree. The global static routing strategy can shorten the transmission time that it takes a packet to reach its destination, and the local limited queue length can balance the network traffic. The optimal critical queue lengths of nodes have been analysed. Simulation results show that the proposed routing strategy can get better performance than that of the global static strategy based on topology, and almost the same performance as that of the global dynamic routing strategy with less complexity.

Getting to Know a Place: Built Environment Walkability and Children’s Spatial Representation of Their Home-School (h–s) Route

PubMed Central

Moran, Mika R.; Eizenberg, Efrat; Plaut, Pnina

2017-01-01

The literature on environmental walkability to date has mainly focused on walking and related health outcomes. While previous studies suggest associations between walking and spatial knowledge, the associations between environmental walkability and spatial knowledge is yet to be explored. The current study addresses this lacuna in research by exploring children’s mental representations of their home-school (h–s) route, vis-à-vis objectively measured environmental attributes along the actual routes. Ninety-two children aged 10–12 years old (5th and 6th graders) drew sketch maps depicting their h–s route and drew the actual route on a neighborhood map, in addition to completing a brief survey. h–s routes went through Geographic Information Systems (GIS) analysis, yielding an en-route walkability index and its components. Children in traditional neighborhoods outperformed in the route’s orientation and structure, but not in the richness of the drawn maps. The orientation and structure of the drawn routes was related to objectively measured walkability, density, street connectivity and commercial land-uses along h–s routes. These associations remained significant among children who walked to school, but not among those who were driven to school. These findings highlight the importance of urban form and school travel mode in acquiring navigation skills and getting to know one’s neighborhood. PMID:28587315

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.

Using virtual environments to investigate wayfinding in 8- to 12-year-olds and adults.

PubMed

Lingwood, Jamie; Blades, Mark; Farran, Emily K; Courbois, Yannick; Matthews, Danielle

2018-02-01

Wayfinding is the ability to learn and recall a route through an environment. Theories of wayfinding suggest that for children to learn a route successfully, they must have repeated experience of it, but in this experiment we investigated whether children could learn a route after only a single experience of the route. A total of 80 participants from the United Kingdom in four groups of 20 8-year-olds, 10-year-olds, 12-year-olds, and adults were shown a route through a 12-turn maze in a virtual environment. At each junction, there was a unique object that could be used as a landmark. Participants were "walked" along the route just once (without any verbal prompts) and then were asked to retrace the route from the start without any help. Nearly three quarters of the 12-year-olds, half of the 10-year-olds, and a third of the 8-year-olds retraced the route without any errors the first time they traveled it on their own. This finding suggests that many young children can learn routes, even with as many as 12 turns, very quickly and without the need for repeated experience. The implications for theories of wayfinding that emphasize the need for extensive experience are discussed. Copyright © 2017 The Authors. Published by Elsevier Inc. All rights reserved.

Non-injection routes for allergen immunotherapy: focus on sublingual immunotherapy.

PubMed

Passalacqua, Giovanni; Guerra, Laura; Pasquali, Mercedes; Canonica, Giorgio Walter

2006-01-01

Allergen specific immunotherapy, together with drugs and allergen avoidance, is a cornerstone in the management of respiratory allergy. The non-injection or local routes were developed with the main goal of improving the safety and minimizing the risk of those side effects, which can accompany the injection route. The pure oral route and the bronchial route showed, in the clinical trials, only a marginal efficacy with not negligible side effects. Therefore, these routes are no longer recommended for clinical use. The nasal route proved effective and safe, but its efficacy is strictly limited to the nose. Moreover, the practical problems with administration have made the use of nasal immunotherapy progressively declining. The efficacy of the sublingual route is confirmed by numerous controlled trials, and a meta analysis (in allergic rhinitis). The safety profile, as derived from clinical trials and post marketing surveillance studies, is satisfactory, with mild gastrointestinal complaints being the more frequent side effect reported. Recent studies have also demonstrated that SLIT has a long-lasting effect and a preventive effect on the onset of new skin sensitizations, and interesting data on adherence and mechanisms of action have become recently available. Based on these experimental data, SLIT is now officially accepted as a viable alternative to the subcutaneous route in adults and children. Several points still need to be elucidated, including: mechanisms of action, optimal dosages, and indications in pediatric patients.

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;

76 FR 79137 - Proposed Establishment of Area Navigation (RNAV) Routes; Seattle, WA

Federal Register 2010, 2011, 2012, 2013, 2014

2011-12-21

... Federal Regulations (14 CFR) part 71 to establish nine new high altitude RNAV routes (Q-140, Q-142, Q-144... action would enhance en route navigation for users, and expand the use of RNAV within the NAS. High altitude RNAV routes are published in paragraph 2006 of FAA Order 7400.9V dated August 9, 2011, and...

76 FR 72480 - Self-Regulatory Organizations; NASDAQ OMX PHLX LLC; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-11-23

..., 2009) (SR-Phlx-2009-32). The instant proposed fees will apply only to option orders entered into, and... includes Routing Fees for routing and executing Customer and Professional orders to away markets. The... assesses a Customer Routing Fee of $0.36 per contract for option orders that are routed to BATS. This fee...

78 FR 29615 - Establishment of Area Navigation (RNAV) Routes; Washington, DC

Federal Register 2010, 2011, 2012, 2013, 2014

2013-05-21

...). Q-72 extends between the HACKS, WV, intersection and the RAMAY, VA, WP. It provides an alternate route for jet route J-149 via a direct routing to the HACKS intersection, thus reducing miles flown for...]12'20'' W.) Q72 HACKS, WV to RAMAY, VA [New] HACKS, WV FIX (Lat. 39[deg]07'46'' N., long. 081[deg]05...

78 FR 67432 - Self-Regulatory Organizations; EDGA Exchange, Inc.; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-11-12

...) Increase the fee for orders yielding Flag K, which routes to NASDAQ OMX PSX (``PSX'') using ROUC or ROUE... for orders yielding Flag K, which routes to PSX using ROUC or ROUE routing strategies; and (ii) decrease the fee for orders yielding Flag RW, which routes to CBSX and adds liquidity. Flag K In securities...

Cross Layered Multi-Meshed Tree Scheme for Cognitive Networks

DTIC Science & Technology

2011-06-01

Meshed Tree Routing protocol wireless ad hoc networks ,” Second IEEE International Workshop on Enabling Technologies and Standards for Wireless Mesh ...and Sensor Networks , 2004 43. Chen G.; Stojmenovic I., “Clustering and routing in mobile wireless networks ,” Technical Report TR-99-05, SITE, June...Cross-layer optimization, intra-cluster routing , packet forwarding, inter-cluster routing , mesh network communications,

49 CFR 37.73 - Purchase or lease of used non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2013 CFR

2013-10-01

... public entities operating fixed route systems. 37.73 Section 37.73 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system purchasing or leasing, after August 25, 1990, a used bus or other used...

49 CFR 37.73 - Purchase or lease of used non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2010 CFR

2010-10-01

... public entities operating fixed route systems. 37.73 Section 37.73 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system purchasing or leasing, after August 25, 1990, a used bus or other used...

49 CFR 37.75 - Remanufacture of non-rail vehicles and purchase or lease of remanufactured non-rail vehicles by...

Code of Federal Regulations, 2013 CFR

2013-10-01

... lease of remanufactured non-rail vehicles by public entities operating fixed route systems. 37.75... operating fixed route systems. (a) This section applies to any public entity operating a fixed route system.... (d) If a public entity operates a fixed route system, any segment of which is included on the...

49 CFR 37.75 - Remanufacture of non-rail vehicles and purchase or lease of remanufactured non-rail vehicles by...

Code of Federal Regulations, 2011 CFR

2011-10-01

... lease of remanufactured non-rail vehicles by public entities operating fixed route systems. 37.75... operating fixed route systems. (a) This section applies to any public entity operating a fixed route system.... (d) If a public entity operates a fixed route system, any segment of which is included on the...

49 CFR 37.73 - Purchase or lease of used non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2011 CFR

2011-10-01

... public entities operating fixed route systems. 37.73 Section 37.73 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system purchasing or leasing, after August 25, 1990, a used bus or other used...

49 CFR 37.73 - Purchase or lease of used non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2014 CFR

2014-10-01

... public entities operating fixed route systems. 37.73 Section 37.73 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system purchasing or leasing, after August 25, 1990, a used bus or other used...

49 CFR 37.73 - Purchase or lease of used non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2012 CFR

2012-10-01

... public entities operating fixed route systems. 37.73 Section 37.73 Transportation Office of the Secretary... operating fixed route systems. (a) Except as provided elsewhere in this section, each public entity operating a fixed route system purchasing or leasing, after August 25, 1990, a used bus or other used...

49 CFR 37.75 - Remanufacture of non-rail vehicles and purchase or lease of remanufactured non-rail vehicles by...

Code of Federal Regulations, 2012 CFR

2012-10-01

... lease of remanufactured non-rail vehicles by public entities operating fixed route systems. 37.75... operating fixed route systems. (a) This section applies to any public entity operating a fixed route system.... (d) If a public entity operates a fixed route system, any segment of which is included on the...

49 CFR 37.75 - Remanufacture of non-rail vehicles and purchase or lease of remanufactured non-rail vehicles by...

Code of Federal Regulations, 2010 CFR

2010-10-01

... lease of remanufactured non-rail vehicles by public entities operating fixed route systems. 37.75... operating fixed route systems. (a) This section applies to any public entity operating a fixed route system.... (d) If a public entity operates a fixed route system, any segment of which is included on the...

49 CFR 37.75 - Remanufacture of non-rail vehicles and purchase or lease of remanufactured non-rail vehicles by...

Code of Federal Regulations, 2014 CFR

2014-10-01

... lease of remanufactured non-rail vehicles by public entities operating fixed route systems. 37.75... operating fixed route systems. (a) This section applies to any public entity operating a fixed route system.... (d) If a public entity operates a fixed route system, any segment of which is included on the...

76 FR 40976 - Self-Regulatory Organizations; Notice of Filing and Immediate Effectiveness of Proposed Rule...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-12

... Exchange proposes to correct Rule 1080(m) to reflect the priority of routed orders that are not executed on... routed orders in Rule 1080. Currently, Rule 1080(m) governs the routing of orders on the Exchange and... or not available for routing. Customer FIND and SRCH Orders, as defined in Rule 1080(m)(iv...

78 FR 22189 - Establishment of Area Navigation (RNAV) Routes; OR

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-15

... two new low-altitude RNAV routes, designated T-302 and T-304, in the state of Oregon. The routes... establish T-302 and T-304 in the state of Oregon (78 FR 4354, January 22, 2013). Interested parties were..., Code of Federal Regulations (14 CFR) part 71 by establishing RNAV routes T-302 and T-304 in Oregon. The...

Parallel algorithms for placement and routing in VLSI design. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1991-01-01

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Self-adaptive trust based ABR protocol for MANETs using Q-learning.

PubMed

Kumar, Anitha Vijaya; Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation.

Self-Adaptive Trust Based ABR Protocol for MANETs Using Q-Learning

PubMed Central

Jeyapal, Akilandeswari

2014-01-01

Mobile ad hoc networks (MANETs) are a collection of mobile nodes with a dynamic topology. MANETs work under scalable conditions for many applications and pose different security challenges. Due to the nomadic nature of nodes, detecting misbehaviour is a complex problem. Nodes also share routing information among the neighbours in order to find the route to the destination. This requires nodes to trust each other. Thus we can state that trust is a key concept in secure routing mechanisms. A number of cryptographic protection techniques based on trust have been proposed. Q-learning is a recently used technique, to achieve adaptive trust in MANETs. In comparison to other machine learning computational intelligence techniques, Q-learning achieves optimal results. Our work focuses on computing a score using Q-learning to weigh the trust of a particular node over associativity based routing (ABR) protocol. Thus secure and stable route is calculated as a weighted average of the trust value of the nodes in the route and associativity ticks ensure the stability of the route. Simulation results show that Q-learning based trust ABR protocol improves packet delivery ratio by 27% and reduces the route selection time by 40% over ABR protocol without trust calculation. PMID:25254243

Intelligent QoS routing algorithm based on improved AODV protocol for Ad Hoc networks

NASA Astrophysics Data System (ADS)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

Prospect theory based estimation of drivers' risk attitudes in route choice behaviors.

PubMed

Zhou, Lizhen; Zhong, Shiquan; Ma, Shoufeng; Jia, Ning

2014-12-01

This paper applied prospect theory (PT) to describe drivers' route choice behavior under Variable Message Sign (VMS), which presented visual traffic information to assist them to make route choice decisions. A quite rich empirical data from questionnaire and field spot was used to estimate parameters of PT. In order to make the parameters more realistic with drivers' attitudes, they were classified into different types by significant factors influencing their behaviors. Based on the travel time distribution of alternative routes and route choice results from questionnaire, the parameterized value function of each category was figured out, which represented drivers' risk attitudes and choice characteristics. The empirical verification showed that the estimates were acceptable and effective. The result showed drivers' risk attitudes and route choice characteristics could be captured by PT under real-time information shown on VMS. For practical application, once drivers' route choice characteristics and parameters were identified, their route choice behavior under different road conditions could be predicted accurately, which was the basis of traffic guidance measures formulation and implementation for targeted traffic management. Moreover, the heterogeneous risk attitudes among drivers should be considered when releasing traffic information and regulating traffic flow. Copyright © 2014 Elsevier Ltd. All rights reserved.

Acquisition of business intelligence from human experience in route planning

NASA Astrophysics Data System (ADS)

Bello Orgaz, Gema; Barrero, David F.; R-Moreno, María D.; Camacho, David

2015-04-01

The logistic sector raises a number of highly challenging problems. Probably one of the most important ones is the shipping planning, i.e. plan the routes that the shippers have to follow to deliver the goods. In this article, we present an artificial intelligence-based solution that has been designed to help a logistic company to improve its routes planning process. In order to achieve this goal, the solution uses the knowledge acquired by the company drivers to propose optimised routes. Hence, the proposed solution gathers the experience of the drivers, processes it and optimises the delivery process. The solution uses data mining to extract knowledge from the company information systems and prepares it for analysis with a case-based reasoning (CBR) algorithm. The CBR obtains critical business intelligence knowledge from the drivers experience that is needed by the planner. The design of the routes is done by a genetic algorithm that, given the processed information, optimises the routes following several objectives, such as minimise the distance or time. Experimentation shows that the proposed approach is able to find routes that improve, on average, the routes made by the human experts.

Learning a Nonmediated Route for Response Selection in Task Switching

PubMed Central

Schneider, Darryl W.; Logan, Gordon D.

2015-01-01

Two modes of response selection—a mediated route involving categorization and a nonmediated route involving instance-based memory retrieval—have been proposed to explain response congruency effects in task-switching situations. In the present study, we sought a better understanding of the development and characteristics of the nonmediated route. In two experiments involving training and transfer phases, we investigated practice effects at the level of individual target presentations, transfer effects associated with changing category–response mappings, target-specific effects from comparisons of old and new targets during transfer, and the percentage of early responses associated with task-nonspecific response selection (the target preceded the task cue on every trial). The training results suggested that the nonmediated route is quickly learned in the context of target–cue order and becomes increasingly involved in response selection with practice. The transfer results suggested that the target–response instances underlying the nonmediated route involve abstract response labels coding response congruency that can be rapidly remapped to alternative responses but not rewritten when category–response mappings change after practice. Implications for understanding the nonmediated route and its relationship with the mediated route are discussed. PMID:25663003

Effects of a new walking and cycling route on leisure-time physical activity of Brazilian adults: A longitudinal quasi-experiment.

PubMed

Pazin, Joris; Garcia, Leandro Martin Totaro; Florindo, Alex Antonio; Peres, Marco Aurélio; Guimarães, Adriana Coutinho de Azevedo; Borgatto, Adriano Ferreti; Duarte, Maria de Fátima da Silva

2016-05-01

The primary aim of this study was to evaluate the effects of a new walking and cycling route on leisure-time physical activity (PA) (walking and moderate-to-vigorous PA) of adults. Furthermore, we also investigated the use, intention to use and barriers to use the new route for leisure-time PA. A longitudinal quasi-experiment was carried out. Three exposure groups were defined, based on the distance from home to the new route: 0-500m, 501-1000m and 1001-1500m. Telephone-based interviews were carried out in 2009 and 2012. Those living around the new walking and cycling route increased their leisure-time walking by 15min/week on average. Those residing up to 500m from the route increased leisure-time walking by 30min/week and walking plus moderate-to-vigorous PA by 50min/week. The proportion of people who started walking or practicing moderate-to-vigorous PA during leisure time and who reported intention to use the new route was higher among those living closer to it. Perceived distance was the most prevalent barrier to use the new route. Copyright © 2016 Elsevier Ltd. All rights reserved.

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.

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.

a New Model for Fuzzy Personalized Route Planning Using Fuzzy Linguistic Preference Relation

NASA Astrophysics Data System (ADS)

Nadi, S.; Houshyaripour, A. H.

2017-09-01

This paper proposes a new model for personalized route planning under uncertain condition. Personalized routing, involves different sources of uncertainty. These uncertainties can be raised from user's ambiguity about their preferences, imprecise criteria values and modelling process. The proposed model uses Fuzzy Linguistic Preference Relation Analytical Hierarchical Process (FLPRAHP) to analyse user's preferences under uncertainty. Routing is a multi-criteria task especially in transportation networks, where the users wish to optimize their routes based on different criteria. However, due to the lake of knowledge about the preferences of different users and uncertainties available in the criteria values, we propose a new personalized fuzzy routing method based on the fuzzy ranking using center of gravity. The model employed FLPRAHP method to aggregate uncertain criteria values regarding uncertain user's preferences while improve consistency with least possible comparisons. An illustrative example presents the effectiveness and capability of the proposed model to calculate best personalize route under fuzziness and uncertainty.

The breeding bird survey, 1966

USGS Publications Warehouse

Robbins, Chandler S.; Van Velzen, Willet T.

1967-01-01

A Breeding Bird Survey of a large section on North America was conducted during June 1966. Cooperators ran a total of 585 Survey routes in 26 eastern States and 4 Canadian Provinces. Future coverage of established routes will enable changes in the abundance of North American breeding birds to be measured. Routes are selected at random on the basis of one-degree blocks of latitude and longitude. Each 241/2-mile route, with 3-minute stops spaced one-half mile apart, is driven by automobile. All birds heard or seen at the stops are recorded on special forms and the data are then transferred to machine punch cards. The average number of birds per route is tabulated by State, along with the total number of each species and the percent of routes and stops upon which they were recorded. Maps are presented showing the range and abundance of selected species. Also, a year-to-year comparison is made of populations of selected species on Maryland routes in 1965 and 1966.

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

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.

Scheduling of an aircraft fleet

NASA Technical Reports Server (NTRS)

Paltrinieri, Massimo; Momigliano, Alberto; Torquati, Franco

1992-01-01

Scheduling is the task of assigning resources to operations. When the resources are mobile vehicles, they describe routes through the served stations. To emphasize such aspect, this problem is usually referred to as the routing problem. In particular, if vehicles are aircraft and stations are airports, the problem is known as aircraft routing. This paper describes the solution to such a problem developed in OMAR (Operative Management of Aircraft Routing), a system implemented by Bull HN for Alitalia. In our approach, aircraft routing is viewed as a Constraint Satisfaction Problem. The solving strategy combines network consistency and tree search techniques.

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

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.

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.

14 CFR 95.8001 - General.

Code of Federal Regulations, 2014 CFR

2014-01-01

... COP's for Federal airways, jet routes, area navigation routes, or other direct routes for which an MEA is designated in this part. Unless otherwise specified the COP is midway between the navigation...

14 CFR 95.8001 - General.

Code of Federal Regulations, 2013 CFR

2013-01-01

... COP's for Federal airways, jet routes, area navigation routes, or other direct routes for which an MEA is designated in this part. Unless otherwise specified the COP is midway between the navigation...

14 CFR 95.8001 - General.

Code of Federal Regulations, 2010 CFR

2010-01-01

... COP's for Federal airways, jet routes, area navigation routes, or other direct routes for which an MEA is designated in this part. Unless otherwise specified the COP is midway between the navigation...

14 CFR 95.8001 - General.

Code of Federal Regulations, 2011 CFR

2011-01-01

... COP's for Federal airways, jet routes, area navigation routes, or other direct routes for which an MEA is designated in this part. Unless otherwise specified the COP is midway between the navigation...

14 CFR 95.8001 - General.

Code of Federal Regulations, 2012 CFR

2012-01-01

... COP's for Federal airways, jet routes, area navigation routes, or other direct routes for which an MEA is designated in this part. Unless otherwise specified the COP is midway between the navigation...

49 CFR 397.103 - Requirements for State routing designations.

Code of Federal Regulations, 2010 CFR

2010-10-01

... REGULATIONS TRANSPORTATION OF HAZARDOUS MATERIALS; DRIVING AND PARKING RULES Routing of Class 7 (Radioactive...), 1200 New Jersey Ave., SE., Washington, DC 20590-0001. Attention: National Hazardous Materials Route...

49 CFR 397.103 - Requirements for State routing designations.

Code of Federal Regulations, 2011 CFR

2011-10-01

... REGULATIONS TRANSPORTATION OF HAZARDOUS MATERIALS; DRIVING AND PARKING RULES Routing of Class 7 (Radioactive...), 1200 New Jersey Ave., SE., Washington, DC 20590-0001. Attention: National Hazardous Materials Route...

Synthetic wastewaters treatment by electrocoagulation to remove silver nanoparticles produced by different routes.

PubMed

Matias, M S; Melegari, S P; Vicentini, D S; Matias, W G; Ricordel, C; Hauchard, D

2015-08-15

Nanoscience is a field that has stood out in recent years. The accurate long-term health and environmental risks associated with these emerging materials are unknown. Therefore, this work investigated how to eliminate silver nanoparticles (AgNPs) from synthetic effluents by electrocoagulation (EC) due to the widespread use of this type of nanoparticle (NP) in industry and its potential inhibition power over microorganisms responsible for biological treatment in effluent treatment plants. Synthesized AgNPs were studied via four different routes by chemical reduction in aqueous solutions to simulate the chemical variations of a hypothetical industrial effluent, and efficiency conditions of the EC treatment were determined. All routes used silver nitrate as the source of silver ions, and two synthesis routes were studied with sodium citrate as a stabilizer. In route I, sodium citrate functioned simultaneously as the reducing agent and stabilizing agent, whereas route II used sodium borohydride as a reducing agent. Route III used D-glucose as the reducing agent and sodium pyrophosphate as the stabilizer; route IV used sodium pyrophosphate as the stabilizing agent and sodium borohydride as the reducing agent. The efficiency of the EC process of the different synthesized solutions was studied. For route I, after 85 min of treatment, a significant decrease in the plasmon resonance peak of the sample was observed, which reflects the efficiency in the mass reduction of AgNPs in the solution by 98.6%. In route II, after 12 min of EC, the absorbance results reached the detection limit of the measurement instrument, which indicates a minimum reduction of 99.9% of AgNPs in the solution. During the 4 min of treatment in route III, the absorbance intensities again reached the detection limit, which indicates a minimum reduction of 99.8%. In route IV, after 10 min of treatment, a minimum AgNP reduction of 99.9% was observed. Based on these results, it was possible to verify that the solutions containing citrate considerably increased the necessary times required to eliminate AgNPs from the synthesized effluent, whereas solutions free of this reagent showed better results on floc formation and, therefore, are best for the treatment. The elimination of AgNPs from effluents by EC proved effective for the studied routes. Copyright © 2015 Elsevier Ltd. All rights reserved.

78 FR 4353 - Proposed Amendment of Area Navigation (RNAV) Route T-266; AK

Federal Register 2010, 2011, 2012, 2013, 2014

2013-01-22

...-1295; Airspace Docket No. 12-AAL-10] RIN 2120-AA66 Proposed Amendment of Area Navigation (RNAV) Route T... (NPRM). SUMMARY: This action proposes to modify low-altitude RNAV route T-266 in the state of Alaska by... Regulations (14 CFR) part 71 to modify RNAV route T-266 in Alaska. T- 266 is currently defined by the Coghland...

41 CFR 301-10.8 - What is my liability if, for personal convenience, I travel by an indirect route or interrupt...

Code of Federal Regulations, 2010 CFR

2010-07-01

... 41 Public Contracts and Property Management 4 2010-07-01 2010-07-01 false What is my liability if, for personal convenience, I travel by an indirect route or interrupt travel by a direct route? 301-10....8 What is my liability if, for personal convenience, I travel by an indirect route or interrupt...

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

75 FR 62919 - Notice of Final Federal Agency Actions on the Route 250 Bypass Interchange at McIntire Road...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-10-13

... on the Route 250 Bypass Interchange at McIntire Road Project in Virginia AGENCY: Federal Highway.... 139(l)(1). The actions relate to the Route 250 Bypass Interchange at McIntire Road project in the City... Virginia: Route 250 Bypass Interchange at McIntire Road. The project would involve construction of a grade...

75 FR 47057 - Self-Regulatory Organizations; NASDAQ Stock Market LLC; Notice of Filing and Immediate...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-08-04

... Rule Change and Amendment Nos. 1 and 2 Thereto Relating to Fees for Routing to Away Markets July 29... assessed for options orders entered into NOM but routed to and executed on away markets (``routing fees... order router. Each time NOS routes to away markets NOS is charged a $0.06 clearing fee and, in the case...

49 CFR 37.71 - Purchase or lease of new non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2013 CFR

2013-10-01

... public entities operating fixed route systems. 37.71 Section 37.71 Transportation Office of the Secretary... operating fixed route systems. (a) Each public entity operating a fixed route system making a solicitation after August 25, 1990, to purchase or lease a new bus or other new vehicle for use on the system, shall...

49 CFR 37.71 - Purchase or lease of new non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2012 CFR

2012-10-01

... public entities operating fixed route systems. 37.71 Section 37.71 Transportation Office of the Secretary... operating fixed route systems. (a) Each public entity operating a fixed route system making a solicitation after August 25, 1990, to purchase or lease a new bus or other new vehicle for use on the system, shall...

49 CFR 37.71 - Purchase or lease of new non-rail vehicles by public entities operating fixed route systems.

Code of Federal Regulations, 2014 CFR

2014-10-01

... public entities operating fixed route systems. 37.71 Section 37.71 Transportation Office of the Secretary... operating fixed route systems. (a) Each public entity operating a fixed route system making a solicitation after August 25, 1990, to purchase or lease a new bus or other new vehicle for use on the system, shall...

77 FR 47886 - Self-Regulatory Organizations; NASDAQ OMX BX, Inc.; Notice of Filing and Immediate Effectiveness...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-08-10

... routing strategies \\4\\ (the same fee charged for routing to all venues other than the New York Stock Exchange (``NYSE'')), $0.0035 per share executed for orders that use the BMOP routing strategy (the same... charged by PSX for orders that use the BTFY or BCRT routing strategies. \\3\\ See SR-Phlx-2012-102 (July 31...

Bikeability and methodological issues using the active commuting route environment scale (ACRES) in a metropolitan setting.

PubMed

Wahlgren, Lina; Schantz, Peter

2011-01-17

Route environments can positively influence people's active commuting and thereby contribute to public health. The Active Commuting Route Environment Scale (ACRES) was developed to study active commuters' perceptions of their route environments. However, bicycle commuters represent a small portion of the population in many cities and thus are difficult to study using population-based material. Therefore, the aim of this study is to expand the state of knowledge concerning the criterion-related validity of the ACRES and the representativity using an advertisement-recruited sample. Furthermore, by comparing commuting route environment profiles of inner urban and suburban areas, we provide a novel basis for understanding the relationship between environment and bikeability. Bicycle commuters from Greater Stockholm, Sweden, advertisement- (n = 1379) and street-recruited (n = 93), responded to the ACRES. Traffic planning and environmental experts from the Municipality of Stockholm (n = 24) responded to a modified version of the ACRES. The criterion-related validity assessments were based on whether or not differences between the inner urban and the suburban route environments, as indicated by the experts and by four existing objective measurements, were reflected by differences in perceptions of these environments. Comparisons of ratings between advertisement- and street-recruited participants were used for the assessments of representativity. Finally, ratings of inner urban and suburban route environments were used to evaluate commuting route environment profiles. Differences in ratings of the inner urban and suburban route environments by the advertisement-recruited participants were in accord with the existing objective measurements and corresponded reasonably well with those of the experts. Overall, there was a reasonably good correspondence between the advertisement- and street-recruited participants' ratings. Distinct differences in commuting route environment profiles were noted between the inner urban and suburban areas. Suburban route environments were rated as safer and more stimulating for bicycle-commuting than the inner urban ones. In general, the findings applied to both men and women. The overall results show: considerable criterion-related validity of the ACRES; ratings of advertisement-recruited participants mirroring those of street-recruited participants; and a higher degree of bikeability in the suburban commuting route environments than in the inner urban ones.

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks.

PubMed

Ogundile, Olayinka O; Alfa, Attahiru S

2017-05-10

Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks.

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 increase energy consumption. We investigate the effects of time-varying interference on the lifetime of ad hoc networks. It is shown that there is a tradeoff between packet delay and node lifetime. We show that it is possible to design the system to perform well under a wide variety of channel conditions.

A Survey on an Energy-Efficient and Energy-Balanced Routing Protocol for Wireless Sensor Networks

PubMed Central

Ogundile, Olayinka O.; Alfa, Attahiru S.

2017-01-01

Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks. PMID:28489054

Occupational exposure to radon for underground tourist routes in Poland: Doses to lung and the risk of developing lung cancer.

PubMed

Walczak, Katarzyna; Olszewski, Jerzy; Politański, Piotr; Zmyślony, Marek

2017-07-14

Radon concentrations for 31 Polish underground tourist routes were analyzed. The equivalent dose to the lung, the effective dose and the relative risk were calculated for employees of the analyzed routes on the grounds of information on radon concentrations, work time, etc. The relative risk for lung cancers was calculated using the Biological Effects of Ionizing Radiation (BEIR) VI Committee model. Equivalent doses to the lungs of workers were determined using the coefficients calculated by the Kendall and Smith. The conversion coefficient proposed by the International Atomic Energy Agency (IAEA) in the report No. 33 was used for estimating the effective doses. In 13 routes, the effective dose was found to be above 1 mSv/year, and in 3 routes, it exceeded 6 mSv/year. For 5 routes, the equivalent dose to lungs was higher than 100 mSv/year, and in 1 case it was as high as 490 mSv/year. In 22.6% of underground workplaces the risk of developing lung cancer among employees was about 2 times higher than that for the general population, and for 1 tourist route it was about 5 times higher. The geometric mean of the relative risk of lung cancer for all workers of underground tourist routes was 1.73 (95% confidence interval (CI): 1.6-1.87). Routes were divided into: caves, mines, post-military underground constructions and urban underground constructions. The difference between levels of the relative risk of developing lung cancer for all types of underground tourist routes was not found to be significant. If we include the professional group of the employees of underground tourist routes into the group of occupational exposure, the number of persons who are included in the Category A due to occupational exposure may increase by about 3/4. The professional group of the employees of underground tourist routes should be monitored for their exposure to radon. Int J Occup Med Environ Health 2017;30(5):687-694. This work is available in Open Access model and licensed under a CC BY-NC 3.0 PL license.

Evaluation of a Dispatcher's Route Optimization Decision Aid to Avoid Aviation Weather Hazards

NASA Technical Reports Server (NTRS)

Dorneich, Michael C.; Olofinboba, Olu; Pratt, Steve; Osborne, Dannielle; Feyereisen, Thea; Latorella, Kara

2003-01-01

This document describes the results and analysis of the formal evaluation plan for the Honeywell software tool developed under the NASA AWIN (Aviation Weather Information) 'Weather Avoidance using Route Optimization as a Decision Aid' project. The software tool aims to provide airline dispatchers with a decision aid for selecting optimal routes that avoid weather and other hazards. This evaluation compares and contrasts route selection performance with the AWIN tool to that of subjects using a more traditional dispatcher environment. The evaluation assesses gains in safety, in fuel efficiency of planned routes, and in time efficiency in the pre-flight dispatch process through the use of the AWIN decision aid. In addition, we are interested in how this AWIN tool affects constructs that can be related to performance. The construct of Situation Awareness (SA), workload, trust in an information system, and operator acceptance are assessed using established scales, where these exist, as well as through the evaluation of questionnaire responses and subject comments. The intention of the experiment is to set up a simulated operations area for the dispatchers to work in. They will be given scenarios in which they are presented with stored company routes for a particular city-pair and aircraft type. A diverse set of external weather information sources is represented by a stand-alone display (MOCK), containing the actual historical weather data typically used by dispatchers. There is also the possibility of presenting selected weather data on the route visualization tool. The company routes have not been modified to avoid the weather except in the case of one additional route generated by the Honeywell prototype flight planning system. The dispatcher will be required to choose the most appropriate and efficient flight plan route in the displayed weather conditions. The route may be modified manually or may be chosen from those automatically displayed.

VISIR-I: small vessels - least-time nautical routes using wave forecasts

NASA Astrophysics Data System (ADS)

Mannarini, Gianandrea; Pinardi, Nadia; Coppini, Giovanni; Oddo, Paolo; Iafrati, Alessandro

2016-05-01

A new numerical model for the on-demand computation of optimal ship routes based on sea-state forecasts has been developed. The model, named VISIR (discoVerIng Safe and effIcient Routes) is designed to support decision-makers when planning a marine voyage. The first version of the system, VISIR-I, considers medium and small motor vessels with lengths of up to a few tens of metres and a displacement hull. The model is comprised of three components: a route optimization algorithm, a mechanical model of the ship, and a processor of the environmental fields. The optimization algorithm is based on a graph-search method with time-dependent edge weights. The algorithm is also able to compute a voluntary ship speed reduction. The ship model accounts for calm water and added wave resistance by making use of just the principal particulars of the vessel as input parameters. It also checks the optimal route for parametric roll, pure loss of stability, and surfriding/broaching-to hazard conditions. The processor of the environmental fields employs significant wave height, wave spectrum peak period, and wave direction forecast fields as input. The topological issues of coastal navigation (islands, peninsulas, narrow passages) are addressed. Examples of VISIR-I routes in the Mediterranean Sea are provided. The optimal route may be longer in terms of miles sailed and yet it is faster and safer than the geodetic route between the same departure and arrival locations. Time savings up to 2.7 % and route lengthening up to 3.2 % are found for the case studies analysed. However, there is no upper bound for the magnitude of the changes of such route metrics, which especially in case of extreme sea states can be much greater. Route diversions result from the safety constraints and the fact that the algorithm takes into account the full temporal evolution and spatial variability of the environmental fields.

City public service learns to speed read. [Computerized routing system for meter reading

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

Aitken, E.L.

1994-02-01

City Public Service (CPS) of San Antonio, TX is a municipally owned utility that serves a densely populated 1,566 square miles in and around San Antonio. CPS's service area is divided into 21 meter reading districts, each of which is broken down into no more than 99 regular routes. Every day, a CPS employee reads one of the districts, following one or more routes. In 1991, CPS began using handheld computers to record reads for regular routes, which are stored on the devices themselves. In contrast, rereads and final reads occur at random throughout the service area. Because they changemore » every day, the process of creating routes that can be loaded onto a handheld device is difficult. Until recently, rereads and final reads were printed on paper orders, and route schedulers would spend close to two hours sorting the paper orders into routes. Meter readers would then hand-sequence the orders on their routes, often using a city map, before taking them into the field in stacks. When the meter readers returned, their completed orders had to be separated by type of reread, and then keyed into the mainframe computer before bill processing could begin. CPS's data processing department developed a computerized routing system of its own that saves time and labor, as well as paper. The system eliminates paper orders entirely, enabling schedulers to create reread and final read routes graphically on a PC. Information no longer needs to be keyed from hard copy, reducing the margin of error and streamlining bill processing by incorporating automated data transfer between systems.« less

Optimal scan timing and intravenous route for contrast-enhanced computed tomography in patients after Fontan operation.

PubMed

Park, Eun-Ah; Lee, Whal; Chung, Se-Young; Yin, Yong Hu; Chung, Jin Wook; Park, Jae Hyung

2010-01-01

To determine the optimal scan timing and adequate intravenous route for patients having undergone the Fontan operation. A total of 88 computed tomographic images in 49 consecutive patients who underwent the Fontan operation were retrospectively evaluated and divided into 7 groups: group 1, bolus-tracking method with either intravenous route (n = 20); group 2, 1-minute-delay scan with single antecubital route (n = 36); group 3, 1-minute-delay scan with both antecubital routes (n = 2); group 4, 1-minute-delay scan with foot vein route (n = 3); group 5, 1-minute-delay scan with simultaneous infusion via both antecubital and foot vein routes (n = 2); group 6, 3-minute-delay scan with single antecubital route (n = 22); and group 7, 3-minute-delay scan with foot vein route (n = 3). The presence of beam-hardening artifact, uniform enhancement, and optimal enhancement was evaluated at the right pulmonary artery (RPA), left pulmonary artery (LPA), and Fontan tract. Optimal enhancement was determined when evaluation of thrombus was possible. Standard deviation was measured at the RPA, LPA, and Fontan tract. Beam-hardening artifacts of the RPA, LPA, and Fontan tract were frequently present in groups 1, 4, and 5. The success rate of uniform and optimal enhancement was highest (100%) in groups 6 and 7, followed by group 2 (75%). An SD of less than 30 Hounsfield unit for the pulmonary artery and Fontan tract was found in groups 3, 6, and 7. The optimal enhancement of the pulmonary arteries and Fontan tract can be achieved by a 3-minute-delay scan irrespective of the intravenous route location.

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

NASA Astrophysics Data System (ADS)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength conversion under the same RWA algorithm.

A novel Smart Routing Protocol for remote health monitoring in Medical Wireless Networks.

PubMed

Sundararajan, T V P; Sumithra, M G; Maheswar, R

2014-01-01

In a Medical Wireless Network (MWN), sensors constantly monitor patient's physiological condition and movement. Inter-MWN communications are set up between the Patient Server and one or more Centralized Coordinators. However, MWNs require protocols with little energy consumption and the self-organizing attribute perceived in ad-hoc networks. The proposed Smart Routing Protocol (SRP) selects only the nodes with a higher residual energy and lower traffic density for routing. This approach enhances cooperation among the nodes of a Mobile Ad Hoc Network. Consequently, SRP produces better results than the existing protocols, namely Conditional Min-Max Battery Cost Routing, Min-Max Battery Cost Routing and AdHoc On-demand Distance Vector in terms of network parameters. The performance of the erstwhile schemes for routing protocols is evaluated using the network simulator Qualnet v 4.5.

A hop count based heuristic routing protocol for mobile delay tolerant networks.

PubMed

You, Lei; Li, Jianbo; Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

2014-01-01

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.

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.

A patient with aphasia using the nonsemantic lexical route for Kanji reading.

PubMed

Hashimoto, Kosei; Uno, Akira; Sambai, Ami; Mizumoto, Go

We report a patient with aphasia, caused by cerebral hemorrhage, who probably used the nonsemantic lexical route when reading words aloud. To investigate the mechanisms underlying her reading dysfunction, we analyzed her reading abilities using the Dual-Route Cascaded Model. Language tests resulted in low correct percentages for both reading comprehension and reading nonwords aloud, suggesting problems in the semantic system and the nonlexical route. Conversely, the patient showed high scores on the reading words aloud task. Although she failed to understand many inconsistent-atypical words in the reading comprehension test, she correctly read most words aloud, suggesting that she used the nonsemantic lexical route. In addition, the lexical reading route was analyzed in detail by using inconsistent-atypical Kanji words as stimuli. Finally, we analyzed her reading dysfunction compared with previous cases.

Assimilation of nicotinamide mononucleotide requires periplasmic AphA phosphatase in Salmonella enterica.

PubMed

Grose, Julianne H; Bergthorsson, Ulfar; Xu, Yaping; Sterneckert, Jared; Khodaverdian, Behzad; Roth, John R

2005-07-01

Salmonella enterica can obtain pyridine from exogenous nicotinamide mononucleotide (NMN) by three routes. In route 1, nicotinamide is removed from NMN in the periplasm and enters the cell as the free base. In route 2, described here, phosphate is removed from NMN in the periplasm by acid phosphatase (AphA), and the produced nicotinamide ribonucleoside (NmR) enters the cell via the PnuC transporter. Internal NmR is then converted back to NMN by the NmR kinase activity of NadR. Route 3 is seen only in pnuC* transporter mutants, which import NMN intact and can therefore grow on lower levels of NMN. Internal NMN produced by either route 2 or route 3 is deamidated to nicotinic acid mononucleotide and converted to NAD by the biosynthetic enzymes NadD and NadE.

A Hop Count Based Heuristic Routing Protocol for Mobile Delay Tolerant Networks

PubMed Central

Wei, Changjiang; Dai, Chenqu; Xu, Jixing; Hu, Lejuan

2014-01-01

Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs. PMID:25110736

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.

Sex Differences in Using Spatial and Verbal Abilities Influence Route Learning Performance in a Virtual Environment: A Comparison of 6- to 12-Year Old Boys and Girls.

PubMed

Merrill, Edward C; Yang, Yingying; Roskos, Beverly; Steele, Sara

2016-01-01

Previous studies have reported sex differences in wayfinding performance among adults. Men are typically better at using Euclidean information and survey strategies while women are better at using landmark information and route strategies. However, relatively few studies have examined sex differences in wayfinding in children. This research investigated relationships between route learning performance and two general abilities: spatial ability and verbal memory in 153 boys and girls between 6- to 12-years-old. Children completed a battery of spatial ability tasks (a two-dimension mental rotation task, a paper folding task, a visuo-spatial working memory task, and a Piagetian water level task) and a verbal memory task. In the route learning task, they had to learn a route through a series of hallways presented via computer. Boys had better overall route learning performance than did girls. In fact, the difference between boys and girls was constant across the age range tested. Structural equation modeling of the children's performance revealed that spatial abilities and verbal memory were significant contributors to route learning performance. However, there were different patterns of correlates for boys and girls. For boys, spatial abilities contributed to route learning while verbal memory did not. In contrast, for girls both spatial abilities and verbal memory contributed to their route learning performance. This difference may reflect the precursor of a strategic difference between boys and girls in wayfinding that is commonly observed in adults.

Physical-level synthesis for digital lab-on-a-chip considering variation, contamination, and defect.

PubMed

Liao, Chen; Hu, Shiyan

2014-03-01

Microfluidic lab-on-a-chips have been widely utilized in biochemical analysis and human health studies due to high detection accuracy, high timing efficiency, and low cost. The increasing design complexity of lab-on-a-chips necessitates the computer-aided design (CAD) methodology in contrast to the classical manual design methodology. A key part in lab-on-a-chip CAD is physical-level synthesis. It includes the lab-on-a-chip placement and routing, where placement is to determine the physical location and the starting time of each operation and routing is to transport each droplet from the source to the destination. In the lab-on-a-chip design, variation, contamination, and defect need to be considered. This work designs a physical-level synthesis flow which simultaneously considers variation, contamination, and defect of the lab-on-a-chip design. It proposes a maze routing based, variation, contamination, and defect aware droplet routing technique, which is seamlessly integrated into an existing placement technique. The proposed technique improves the placement solution for routing and achieves the placement and routing co-optimization to handle variation, contamination, and defect. The simulation results demonstrate that our technique does not use any defective/contaminated grids, while the technique without considering contamination and defect uses 17.0% of the defective/contaminated grids on average. In addition, our routing variation aware technique significantly improves the average routing yield by 51.2% with only 3.5% increase in completion time compared to a routing variation unaware technique.

Optimisation of MSW collection routes for minimum fuel consumption using 3D GIS modelling.

PubMed

Tavares, G; Zsigraiova, Z; Semiao, V; Carvalho, M G

2009-03-01

Collection of municipal solid waste (MSW) may account for more than 70% of the total waste management budget, most of which is for fuel costs. It is therefore crucial to optimise the routing network used for waste collection and transportation. This paper proposes the use of geographical information systems (GIS) 3D route modelling software for waste collection and transportation, which adds one more degree of freedom to the system and allows driving routes to be optimised for minimum fuel consumption. The model takes into account the effects of road inclination and vehicle weight. It is applied to two different cases: routing waste collection vehicles in the city of Praia, the capital of Cape Verde, and routing the transport of waste from different municipalities of Santiago Island to an incineration plant. For the Praia city region, the 3D model that minimised fuel consumption yielded cost savings of 8% as compared with an approach that simply calculated the shortest 3D route. Remarkably, this was true despite the fact that the GIS-recommended fuel reduction route was actually 1.8% longer than the shortest possible travel distance. For the Santiago Island case, the difference was even more significant: a 12% fuel reduction for a similar total travel distance. These figures indicate the importance of considering both the relief of the terrain and fuel consumption in selecting a suitable cost function to optimise vehicle routing.

Potential roadside biases due to habitat changes along Breeding Bird Survey routes

USGS Publications Warehouse

Keller, C.M.E.; Scallan, J.T.

1999-01-01

Breeding Bird Surveys (BBS) are conducted along roadside routes to enable a large geographic area to be surveyed. Yet the potential biases of sampling populations only from roadsides have received little attention. We sampled aerial photography of BBS routes taken in the mid-1960s and late-1980s to evaluate whether habitat changes that occurred along roadsides were also occurring in the surrounding area, and whether the frequency of habitats encountered along roadsides were similar to that off-route. We examined 28 routes in Maryland and 25 routes in Ohio, and defined roadside area as within 200 m of the road, and off-route as 200-1,600 m from the road. Most habitat changes that occurred along BBS roadsides also were occurring in the off-route areas. However, increases in urban cover was significantly greater along the road in Maryland where urbanization of farmland was the predominant habitat change. The small increase in urban cover in Ohio was not significantly greater along the road. Construction of single family homes was greater along BBS roadsides in both states. In Ohio, the greatest change in habitat was the conversion of farmland back to forest, which was not significantly greater along the road. Changes associated with urbanization were more biased towards roadsides than the reforestation of farmland. Within one time period, roadside areas had less forest and more agricultural and urban cover types than occurred off-route.

Preparation of Nickel Aluminum-Manganese Spinel Oxides Ni xAl 1- xMn 2O 4 for Oxygen Electrocatalysis in Alkaline Medium: Comparison of Properties Stemming from Different Preparation Methods

NASA Astrophysics Data System (ADS)

Ponce, Jilberto; Ríos, Edmundo; Rehspringer, Jean-Luc; Poillerat, Gérard; Chartier, Pierre; Gautier, Juan Luis

1999-06-01

Two different procedures were used to prepare spinel-type NixAl1-xMn2O4 (0≤x≤1) compounds to study the effects of solid state properties of mixed oxides on their electrocatalytic properties. The oxalic route, coprecipitation of metal oxalates dissolved in propanol or ethanol, and the propionic route, hydrolysis of metal carboxylates in propionic acid, have been used. In both routes, thermal decomposition produces the corresponding oxides. X-ray diffraction patterns showed that the oxides crystallize in a cubic spinel phase with a unit cell parameter a that increases as aluminum is replaced by nickel. At low x values, compounds prepared by the propionic route showed a larger variation for parameter a than compounds prepared by the oxalic route, probably due to oxygen stoichiometric deficiency. This effect was estimated from the tetrahedral force constant (kt) values, which showed a fast decrease as x varied from 0 to 1. Electrical conductivity, conduction activation energy, hole mobility, and pHz of oxides prepared by the propionic route were also higher than those from oxides prepared by the oxalic route. Crystallinity grade and particle size were nearly 50‧ higher in propionic-route samples than in oxalic-route samples. The apparent and real electrocatalytic activities of both types of oxides were compared for O2 evolution.

VISIR-I: small vessels, least-time nautical routes using wave forecasts

NASA Astrophysics Data System (ADS)

Mannarini, G.; Pinardi, N.; Coppini, G.; Oddo, P.; Iafrati, A.

2015-09-01

A new numerical model for the on-demand computation of optimal ship routes based on sea-state forecasts has been developed. The model, named VISIR (discoVerIng Safe and effIcient Routes) is designed to support decision-makers when planning a marine voyage. The first version of the system, VISIR-I, considers medium and small motor vessels with lengths of up to a few tens of meters and a displacement hull. The model is made up of three components: the route optimization algorithm, the mechanical model of the ship, and the environmental fields. The optimization algorithm is based on a graph-search method with time-dependent edge weights. The algorithm is also able to compute a voluntary ship speed reduction. The ship model accounts for calm water and added wave resistance by making use of just the principal particulars of the vessel as input parameters. The system also checks the optimal route for parametric roll, pure loss of stability, and surfriding/broaching-to hazard conditions. Significant wave height, wave spectrum peak period, and wave direction forecast fields are employed as an input. Examples of VISIR-I routes in the Mediterranean Sea are provided. The optimal route may be longer in terms of miles sailed and yet it is faster and safer than the geodetic route between the same departure and arrival locations. Route diversions result from the safety constraints and the fact that the algorithm takes into account the full temporal evolution and spatial variability of the environmental fields.

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

Mitigating Distributed Denial of Service Attacks with Multi-Protocol Label Switching-Traffic Engineering (MPLS-TE)

DTIC Science & Technology

2009-03-01

time and the router CPU loads are comparable to those reported by two former NPS theses that examined alternative solutions based on BGP blackhole ...routing. 15. NUMBER OF PAGES 135 14. SUBJECT TERMS Traffic Engineering, Distributed Denial of Service Attacks, Sinkhole Routing, Blackhole Routing...alternative solutions based on BGP blackhole routing. vi THIS PAGE INTENTIONALLY LEFT BLANK vii TABLE OF CONTENTS I. INTRODUCTION

75 FR 16068 - Opportunity for Designation in the Amarillo, TX; Cairo, IL; State of Louisiana; State of North...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-31

... Forestry (Louisiana); North Carolina Department of Agriculture (North Carolina); and D. R. Schaal Agency...), Franklin (north of County Road C55, County Road C25, and County Road C23 and west of U.S. Route 65, County..., Wright (north of State Route 3 and Interstate 35 and east of State Route 17 and U.S. Route 65) Counties...

Puget Sound Route Learning Test: Examination of the Validity and Reliability of a Novel Route Test in Healthy Older Adults and Alzheimer's Disease Patients

ERIC Educational Resources Information Center

Tiernan, Kristine N.; Schenk, Kelli; Swadberg, Danielle; Shimonova, Marianna; Schollaert, Daniel; Boorkman, Patti; Cherrier, Monique M.

2004-01-01

The validity and reliability of a novel route learning test were examined to assess the effectiveness of its use in evaluating spatial memory in healthy older adults and patients with Alzheimer's disease (AD). The Puget Sound Route Learning Test was significantly correlated with an existing measure of cognitive ability, the Dementia Rating Scale.…

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.

Security Verification of Secure MANET Routing Protocols

DTIC Science & Technology

2012-03-22

SECURITY VERIFICATION OF SECURE MANET ROUTING PROTOCOLS THESIS Matthew F. Steele, Captain, USAF AFIT/GCS/ ENG /12-03 DEPARTMENT OF THE AIR FORCE AIR...States AFIT/GCS/ ENG /12-03 SECURITY VERIFICATION OF SECURE MANET ROUTING PROTOCOLS THESIS Presented to the Faculty Department of Electrical and Computer...DISTRIBUTION UNLIMITED AFIT/GCS/ ENG /12-03 SECURITY VERIFICATION OF SECURE MANET ROUTING PROTOCOLS Matthew F. Steele, B.S.E.E. Captain, USAF

Eighteen-Month Final Evaluation of UPS Second Generation Diesel Hybrid-Electric Delivery Vans

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

Lammert, M.; Walkowicz, K.

2012-09-01

A parallel hybrid-electric diesel delivery van propulsion system was evaluated at a UPS facility in Minneapolis using on-vehicle data logging, fueling, and maintenance records. Route and drive cycle analysis showed different duty cycles for hybrid vs. conventional delivery vans; routes were switched between the study groups to provide a valid comparison. The hybrids demonstrated greater advantage on the more urban routes; the initial conventional vans' routes had less dense delivery zones. The fuel economy of the hybrids on the original conventional group?s routes was 10.4 mpg vs. 9.2 mpg for the conventional group on those routes a year earlier. Themore » hybrid group's fuel economy on the original hybrid route assignments was 9.4 mpg vs. 7.9 mpg for the conventional group on those routes a year later. There was no statistically significant difference in total maintenance cost per mile or for the vehicle total cost of operation per mile. Propulsion-related maintenance cost per mile was 77% higher for the hybrids, but only 52% more on a cost-per-delivery-day basis. Laboratory dynamometer testing demonstrated 13%-36% hybrid fuel economy improvement, depending on duty cycle, and up to a 45% improvement in ton-mi/gal. NOx emissions increased 21%-49% for the hybrids in laboratory testing.« less

AIRNOISE: A Tool for Preliminary Noise-Abatement Terminal Approach Route Design

NASA Technical Reports Server (NTRS)

Li, Jinhua; Sridhar, Banavar; Xue, Min; Ng, Hok

2016-01-01

Noise from aircraft in the airport vicinity is one of the leading aviation-induced environmental issues. The FAA developed the Integrated Noise Model (INM) and its replacement Aviation Environmental Design Tool (AEDT) software to assess noise impact resulting from all aviation activities. However, a software tool is needed that is simple to use for terminal route modification, quick and reasonably accurate for preliminary noise impact evaluation and flexible to be used for iterative design of optimal noise-abatement terminal routes. In this paper, we extend our previous work on developing a noise-abatement terminal approach route design tool, named AIRNOISE, to satisfy this criterion. First, software efficiency has been significantly increased by over tenfold using the C programming language instead of MATLAB. Moreover, a state-of-the-art high performance GPU-accelerated computing module is implemented that was tested to be hundreds time faster than the C implementation. Secondly, a Graphical User Interface (GUI) was developed allowing users to import current terminal approach routes and modify the routes interactively to design new terminal approach routes. The corresponding noise impacts are then calculated and displayed in the GUI in seconds. Finally, AIRNOISE was applied to Baltimore-Washington International Airport terminal approach route to demonstrate its usage.

Revealing the global map of protein folding space by large-scale simulations

NASA Astrophysics Data System (ADS)

Sinner, Claude; Lutz, Benjamin; Verma, Abhinav; Schug, Alexander

2015-12-01

The full characterization of protein folding is a remarkable long-standing challenge both for experiment and simulation. Working towards a complete understanding of this process, one needs to cover the full diversity of existing folds and identify the general principles driving the process. Here, we want to understand and quantify the diversity in folding routes for a large and representative set of protein topologies covering the full range from all alpha helical topologies towards beta barrels guided by the key question: Does the majority of the observed routes contribute to the folding process or only a particular route? We identified a set of two-state folders among non-homologous proteins with a sequence length of 40-120 residues. For each of these proteins, we ran native-structure based simulations both with homogeneous and heterogeneous contact potentials. For each protein, we simulated dozens of folding transitions in continuous uninterrupted simulations and constructed a large database of kinetic parameters. We investigate folding routes by tracking the formation of tertiary structure interfaces and discuss whether a single specific route exists for a topology or if all routes are equiprobable. These results permit us to characterize the complete folding space for small proteins in terms of folding barrier ΔG‡, number of routes, and the route specificity RT.

Travel optimization by foraging bumblebees through readjustments of traplines after discovery of new feeding locations.

PubMed

Lihoreau, Mathieu; Chittka, Lars; Raine, Nigel E

2010-12-01

Animals collecting resources that replenish over time often visit patches in predictable sequences called traplines. Despite the widespread nature of this strategy, we still know little about how spatial memory develops and guides individuals toward suitable routes. Here, we investigate whether flower visitation sequences by bumblebees Bombus terrestris simply reflect the order in which flowers were discovered or whether they result from more complex navigational strategies enabling bees to optimize their foraging routes. We analyzed bee flight movements in an array of four artificial flowers maximizing interfloral distances. Starting from a single patch, we sequentially added three new patches so that if bees visited them in the order in which they originally encountered flowers, they would follow a long (suboptimal) route. Bees' tendency to visit patches in their discovery order decreased with experience. Instead, they optimized their flight distances by rearranging flower visitation sequences. This resulted in the development of a primary route (trapline) and two or three less frequently used secondary routes. Bees consistently used these routes after overnight breaks while occasionally exploring novel possibilities. We discuss how maintaining some level of route flexibility could allow traplining animals to cope with dynamic routing problems, analogous to the well-known traveling salesman problem.

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

When severe convective weather requires rerouting aircraft, FAA traffic managers employ severe weather avoidance plans (e.g., Playbook routes, Coded Departure Routes, etc.) These routes provide pilots with safe paths around weather-affected regions, and provide controllers with predictable, and often well-established flight plans. However, they often introduce large deviations to the nominal flight plans, which may not be necessary as weather conditions change. If and when the imposed traffic management initiatives (TMIs) become stale, updated shorter path flight trajectories may be found en route, providing significant time-savings to the affected flights. Multiple Flight Common Routes (MFCR) is a concept that allows multiple flights that are within a specified proximity or region, to receive updated shorter flight plans in an operationally efficient manner. MFCR is believed to provide benefits to the National Airspace System (NAS) by allowing traffic managers to update several flight plans of en route aircraft simultaneously, reducing operational workload within the TMUs of all affected ARTCCs. This paper will explore some aspects of the MFCR concept by analyzing multiple flights that have been selected for rerouting by the NAS Constraint Evaluation and Notification Tool (NASCENT). Various methods of grouping aircraft with common or similar routes will be presented, along with a comparison of the efficacy of these methods.

Allocating application to group of consecutive processors in fault-tolerant deadlock-free routing path defined by routers obeying same rules for path selection

DOEpatents

Leung, Vitus J [Albuquerque, NM; Phillips, Cynthia A [Albuquerque, NM; Bender, Michael A [East Northport, NY; Bunde, David P [Urbana, IL

2009-07-21

In a multiple processor computing apparatus, directional routing restrictions and a logical channel construct permit fault tolerant, deadlock-free routing. Processor allocation can be performed by creating a linear ordering of the processors based on routing rules used for routing communications between the processors. The linear ordering can assume a loop configuration, and bin-packing is applied to this loop configuration. The interconnection of the processors can be conceptualized as a generally rectangular 3-dimensional grid, and the MC allocation algorithm is applied with respect to the 3-dimensional grid.

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by employing bandwidth shells at areas of overutilization

DOEpatents

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

2010-04-27

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 final destination. The default routing strategy is altered responsive to detection of overutilization of a particular path of one or more links, and at least some traffic is re-routed by distributing the traffic among multiple paths (which may include the default path). An alternative path may require a greater number of link traversals to reach the destination node.

Integration of multimodal transportation services : final report.

DOT National Transportation Integrated Search

2016-03-08

Flexible route paratransit services may complement as well as compete with conventional public transportation services (that : have fixed routes and schedules). Flexible routes are especially suitable for service areas or time periods with low demand...

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

Self-assembled monolayer and multilayer films of the nanocluster [HxPMo12O40 subsetH4Mo72Fe30(O2CMe)15O254(H2O)68] on gold.

PubMed

Colorado, Ramon; Crouse, Christopher A; Zeigler, Christopher N; Barron, Andrew R

2008-08-19

Films of the molybdenum-iron nanocluster [H x PMo 12O 40 subsetH 4Mo 72Fe 30(O 2CMe) 15O 254(H2O) 68] (FeMoC) were generated on gold via the self-assembly technique using two divergent routes. The first route entails the self-assembly of unfunctionalized FeMoC onto a preprepared carboxyl-terminated SAM on gold. The second route involves the preparation of thiol-terminated functionalized FeMoC clusters, which are then allowed to self-assemble onto bare gold surfaces. Monolayer films of FeMoC clusters are attained via both routes, with the second route requiring shorter immersion times (2 days) than the first route (6 days). Multilayer films of FeMoC are formed via the second route for immersion times longer than 2 days. Characterization of these films using optical ellipsometry, X-ray photoelectron spectroscopy, and atomic force microscopy confirm the self-assembly of the clusters on the surfaces.

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.

The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic.

PubMed

Li, Ning; Martínez, José-Fernán; Hernández Díaz, Vicente

2015-08-10

Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters' dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively.

The Balanced Cross-Layer Design Routing Algorithm in Wireless Sensor Networks Using Fuzzy Logic

PubMed Central

Li, Ning; Martínez, José-Fernán; Díaz, Vicente Hernández

2015-01-01

Recently, the cross-layer design for the wireless sensor network communication protocol has become more and more important and popular. Considering the disadvantages of the traditional cross-layer routing algorithms, in this paper we propose a new fuzzy logic-based routing algorithm, named the Balanced Cross-layer Fuzzy Logic (BCFL) routing algorithm. In BCFL, we use the cross-layer parameters’ dispersion as the fuzzy logic inference system inputs. Moreover, we give each cross-layer parameter a dynamic weight according the value of the dispersion. For getting a balanced solution, the parameter whose dispersion is large will have small weight, and vice versa. In order to compare it with the traditional cross-layer routing algorithms, BCFL is evaluated through extensive simulations. The simulation results show that the new routing algorithm can handle the multiple constraints without increasing the complexity of the algorithm and can achieve the most balanced performance on selecting the next hop relay node. Moreover, the Balanced Cross-layer Fuzzy Logic routing algorithm can adapt to the dynamic changing of the network conditions and topology effectively. PMID:26266412

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization.

PubMed

Jiang, Ailian; Zheng, Lihong

2018-03-29

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime.

An Effective Hybrid Routing Algorithm in WSN: Ant Colony Optimization in combination with Hop Count Minimization

PubMed Central

2018-01-01

Low cost, high reliability and easy maintenance are key criteria in the design of routing protocols for wireless sensor networks (WSNs). This paper investigates the existing ant colony optimization (ACO)-based WSN routing algorithms and the minimum hop count WSN routing algorithms by reviewing their strengths and weaknesses. We also consider the critical factors of WSNs, such as energy constraint of sensor nodes, network load balancing and dynamic network topology. Then we propose a hybrid routing algorithm that integrates ACO and a minimum hop count scheme. The proposed algorithm is able to find the optimal routing path with minimal total energy consumption and balanced energy consumption on each node. The algorithm has unique superiority in terms of searching for the optimal path, balancing the network load and the network topology maintenance. The WSN model and the proposed algorithm have been implemented using C++. Extensive simulation experimental results have shown that our algorithm outperforms several other WSN routing algorithms on such aspects that include the rate of convergence, the success rate in searching for global optimal solution, and the network lifetime. PMID:29596336

Distributive routing and congestion control in wireless multihop ad hoc communication networks

NASA Astrophysics Data System (ADS)

Glauche, Ingmar; Krause, Wolfram; Sollacher, Rudolf; Greiner, Martin

2004-10-01

Due to their inherent complexity, engineered wireless multihop ad hoc communication networks represent a technological challenge. Having no mastering infrastructure the nodes have to selforganize themselves in such a way that for example network connectivity, good data traffic performance and robustness are guaranteed. In this contribution the focus is on routing and congestion control. First, random data traffic along shortest path routes is studied by simulations as well as theoretical modeling. Measures of congestion like end-to-end time delay and relaxation times are given. A scaling law of the average time delay with respect to network size is revealed and found to depend on the underlying network topology. In the second step, a distributive routing and congestion control is proposed. Each node locally propagates its routing cost estimates and information about its congestion state to its neighbors, which then update their respective cost estimates. This allows for a flexible adaptation of end-to-end routes to the overall congestion state of the network. Compared to shortest-path routing, the critical network load is significantly increased.

75 FR 76652 - Proposed Establishment of Area Navigation (RNAV) Routes; Western United States

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-09

... rulemaking (NPRM). SUMMARY: This action proposes to establish six High Altitude Area Navigation (RNAV) routes... Francisco/Oakland, CA, Terminal area. High Altitude RNAV Routes are published in paragraph 2006 in FAA Order...

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

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

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

Buffalo Metropolitan Area, New York Water Resources Management. Interim Report on Feasibility of Flood Management. Appendices.

DTIC Science & Technology

1983-07-01

storage areas were taken into account during the flood routings. AI.36 The computer program REVPULS, developed for this report, reverse Modified Puls...routed the hydrograph at Batavia through the storage upstream of the LVRR embankment. Subtracting this reverse -routed hydrograph from the combined...segments to form a more accurate reconstitution. The hydrographs upstream of Batavia were derived by reverse -routing and prorating by drainage area. Table

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.

Over the Pole: A Fuel Efficiency Analysis of Employing Joint Base Elmendorf-Richardson for Polar Route Utilization

DTIC Science & Technology

2014-06-13

helping me with research, as well as Lt Col Adam Reiman for the use of his modeling software. Both were critical components to help complete this... Reiman , 2013) ............................................ 17 Figure 7: Route Analyzer Secondary Airfields ( Reiman , 2013...Transit Center (Nichol, 2013). AFIT Route Analyzer Model The AFIT Route Analyzer was created by AFIT PhD student Lt Col Adam Reiman . The model was

Improving the Air Mobility Command’s Air Refueler Route Building Capabilities

DTIC Science & Technology

2014-03-27

routing tool. Sundar and Rathinam [18] also study a traveling salesman version of the problem in the unmanned aerial vehicle realm. Their focus is on...constrained shortest path with fuel limitations. The objective is to minimize the distance traveled . Some aircraft routing problems involve...radius and network density their only limitations. 4 O’Rourke et al. [15] examine a traveling salesman version of aircraft routing in the unmanned aerial

Hybrid songbirds employ intermediate routes in a migratory divide.

PubMed

Delmore, Kira E; Irwin, Darren E

2014-10-01

Migratory divides are contact zones between populations that use different routes to navigate around unsuitable areas on seasonal migration. Hybrids in divides have been predicted to employ intermediate and potentially inferior routes. We provide the first direct test of this hypothesis, using light-level geolocators to track birds breeding in a hybrid zone between Swainson's thrushes in western Canada. Compared to parental forms, hybrids exhibited increased variability in their migratory routes, with some using intermediate routes that crossed arid and mountainous regions, and some using the same routes as one parental group on fall migration and the other on spring migration. Hybrids also tended to use geographically intermediate wintering sites. Analysis of genetic variation across the hybrid zone suggests moderately strong selection against hybrids. These results indicate that seasonal migratory behaviour might be a source of selection against hybrids, supporting a possible role for migration in speciation. © 2014 John Wiley & Sons Ltd/CNRS.

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.

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

NASA Astrophysics Data System (ADS)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

Real time monitoring system used in route planning for the electric vehicle

NASA Astrophysics Data System (ADS)

Ionescu, LM; Mazare, A.; Serban, G.; Ionita, S.

2017-10-01

The electric vehicle is a new consumer of electricity that is becoming more and more widespread. Under these circumstances, new strategies for optimizing power consumption and increasing vehicle autonomy must be designed. These must include route planning along with consumption, fuelling points and points of interest. The hardware and software solution proposed by us allows: non-invasive monitoring of power consumption, energy autonomy - it does not add any extra consumption, data transmission to a server and data fusion with the route, the points of interest of the route and the power supply points. As a result: an optimal route planning service will be provided to the driver, considering the route, the requirements of the electric vehicle and the consumer profile. The solution can be easily installed on any type of electric car - it does not involve any intervention on the equipment.

A survey on temperature-aware routing protocols in wireless body sensor networks.

PubMed

Oey, Christian Henry Wijaya; Moh, Sangman

2013-08-02

The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN) is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node's circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols.

An emergency-adaptive routing scheme for wireless sensor networks for building fire hazard monitoring.

PubMed

Zeng, Yuanyuan; Sreenan, Cormac J; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

2011-01-01

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work.

Preliminary access routes and cost study analyses for seven potentially acceptable salt sites: Final report, October 1984

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

Not Available

1987-02-01

This report analyzes highway and railroad access to seven potentially acceptable salt repository sites: Richton Dome and Cypress Creek Dome in Mississippi, Vacherie Dome in Louisiana, Swisher County and Deaf Smith County in Texas, and Davis Canyon and Lavender Canyon in utah. The objectives of the study were to investigate the routing of reasonable access corridors to the sites, describe major characteristics of each route, and estimate the costs for constructing or upgrading highways and railroads. The routes used in the analysis are not necessarily recommended or preferred over other routes, nor do they represent an implied final selection. Detailedmore » engineering studies must be performed for the Davis Canyon and Lavender Canyon highway access before the analyzed routes can be considered to be viable. 20 refs., 7 figs., 3 tabs.« less

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

The challenges of data processing, transmission scheduling and routing within a space network present a multi-criteria optimization problem. Long delays, intermittent connectivity, asymmetric data rates and potentially high error rates make traditional networking approaches unsuitable. The delay tolerant networking architecture and protocols attempt to mitigate many of these issues, yet transmission scheduling is largely manually configured and routes are determined by a static contact routing graph. A high level of variability exists among the requirements and environmental characteristics of different missions, some of which may allow for the use of more opportunistic routing methods. In all cases, resource allocation and constraints must be balanced with the optimization of data throughput and quality of service. Much work has been done researching routing techniques for terrestrial-based challenged networks in an attempt to optimize contact opportunities and resource usage. This paper examines several popular methods to determine their potential applicability to space networks.

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.

A Survey on Temperature-Aware Routing Protocols in Wireless Body Sensor Networks

PubMed Central

Oey, Christian Henry Wijaya; Moh, Sangman

2013-01-01

The rapid growth of the elderly population in the world and the rising cost of healthcare impose big issues for healthcare and medical monitoring. A Wireless Body Sensor Network (WBSN) is comprised of small sensor nodes attached inside, on or around a human body, the main purpose of which is to monitor the functions and surroundings of the human body. However, the heat generated by the node's circuitry and antenna could cause damage to the human tissue. Therefore, in designing a routing protocol for WBSNs, it is important to reduce the heat by incorporating temperature into the routing metric. The main contribution of this paper is to survey existing temperature-aware routing protocols that have been proposed for WBSNs. In this paper, we present a brief overview of WBSNs, review the existing routing protocols comparatively and discuss challenging open issues in the design of routing protocols. PMID:23917259

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.

Routing architecture and security for airborne networks

NASA Astrophysics Data System (ADS)

Deng, Hongmei; Xie, Peng; Li, Jason; Xu, Roger; Levy, Renato

2009-05-01

Airborne networks are envisioned to provide interconnectivity for terrestial and space networks by interconnecting highly mobile airborne platforms. A number of military applications are expected to be used by the operator, and all these applications require proper routing security support to establish correct route between communicating platforms in a timely manner. As airborne networks somewhat different from traditional wired and wireless networks (e.g., Internet, LAN, WLAN, MANET, etc), security aspects valid in these networks are not fully applicable to airborne networks. Designing an efficient security scheme to protect airborne networks is confronted with new requirements. In this paper, we first identify a candidate routing architecture, which works as an underlying structure for our proposed security scheme. And then we investigate the vulnerabilities and attack models against routing protocols in airborne networks. Based on these studies, we propose an integrated security solution to address routing security issues in airborne networks.

Efficient packet transportation on complex networks with nonuniform node capacity distribution

NASA Astrophysics Data System (ADS)

He, Xuan; Niu, Kai; He, Zhiqiang; Lin, Jiaru; Jiang, Zhong-Yuan

2015-03-01

Provided that node delivery capacity may be not uniformly distributed in many realistic networks, we present a node delivery capacity distribution in which each node capacity is composed of uniform fraction and degree related proportion. Based on the node delivery capacity distribution, we construct a novel routing mechanism called efficient weighted routing (EWR) strategy to enhance network traffic capacity and transportation efficiency. Compared with the shortest path routing and the efficient routing strategies, the EWR achieves the highest traffic capacity. After investigating average path length, network diameter, maximum efficient betweenness, average efficient betweenness, average travel time and average traffic load under extensive simulations, it indicates that the EWR appears to be a very effective routing method. The idea of this routing mechanism gives us a good insight into network science research. The practical use of this work is prospective in some real complex systems such as the Internet.

[Erythropoiesis-stimulating agents in chronic kidney disease: which route of administration?].

PubMed

Borrelli, S; Baldanza, D; Scigliano, R; Catapano, F; Grimaldi, M; Calabria, M; Zamboli, P; Minutolo, R; De Nicola, L; Conte, G

2009-01-01

In the last twenty years, erythropoiesis-stimulating agents (ESAs) have improved the management of renal anemia, with significant amelioration of quality of life in patients on hemodialysis. ESAs can be administered both intravenously and subcutaneously. In predialysis chronic kidney disease and in peritoneal dialysis, the administration route is necessarily subcutaneous. In hemodialysis the intravenous route was initially preferred because of the presence of ready vascular access for drug administration. Subsequent studies have demonstrated that the subcutaneous route allowed the achievement of optimal levels of hemoglobin with a reduction of mean administered dose, number of injections, and costs. A few years ago, the finding of a higher risk of pure red cell aplasia associated with subcutaneous administration of epoetin reopened the debate about the route of administration. We here review the studies on the preferable route of administration of epoetin and darbepoetin- alpha, in terms of efficacy and safety, and take a look at future perspectives.

DTN routing in body sensor networks with dynamic postural partitioning.

PubMed

Quwaider, Muhannad; Biswas, Subir

2010-11-01

This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks ( WBAN ) with frequent postural partitioning. A prototype WBAN has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

An integer programming approach to a real-world recyclable waste collection problem in Argentina.

PubMed

Braier, Gustavo; Durán, Guillermo; Marenco, Javier; Wesner, Francisco

2017-05-01

This article reports on the use of mathematical programming techniques to optimise the routes of a recyclable waste collection system servicing Morón, a large municipality outside Buenos Aires, Argentina. The truck routing problem posed by the system is a particular case of the generalised directed open rural postman problem. An integer programming model is developed with a solving procedure built around a subtour-merging algorithm and the addition of subtour elimination constraints. The route solutions generated by the proposed methodology perform significantly better than the previously used, manually designed routes, the main improvement being that coverage of blocks within the municipality with the model solutions is 100% by construction, whereas with the manual routes as much as 16% of the blocks went unserviced. The model-generated routes were adopted by the municipality in 2014 and the national government is planning to introduce the methodology elsewhere in the country.

Valiant load-balanced robust routing under hose model for WDM mesh networks

NASA Astrophysics Data System (ADS)

Zhang, Xiaoning; Li, Lemin; Wang, Sheng

2006-09-01

In this paper, we propose Valiant Load-Balanced robust routing scheme for WDM mesh networks under the model of polyhedral uncertainty (i.e., hose model), and the proposed routing scheme is implemented with traffic grooming approach. Our Objective is to maximize the hose model throughput. A mathematic formulation of Valiant Load-Balanced robust routing is presented and three fast heuristic algorithms are also proposed. When implementing Valiant Load-Balanced robust routing scheme to WDM mesh networks, a novel traffic-grooming algorithm called MHF (minimizing hop first) is proposed. We compare the three heuristic algorithms with the VPN tree under the hose model. Finally we demonstrate in the simulation results that MHF with Valiant Load-Balanced robust routing scheme outperforms the traditional traffic-grooming algorithm in terms of the throughput for the uniform/non-uniform traffic matrix under the hose model.

An Emergency-Adaptive Routing Scheme for Wireless Sensor Networks for Building Fire Hazard Monitoring

PubMed Central

Zeng, Yuanyuan; Sreenan, Cormac J.; Sitanayah, Lanny; Xiong, Naixue; Park, Jong Hyuk; Zheng, Guilin

2011-01-01

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, especially as they do not consider critical and dynamic network scenarios. In this paper, an emergency-adaptive, real-time and robust routing protocol is presented for emergency situations such as building fire hazard applications. The protocol adapts to handle dynamic emergency scenarios and works well with the routing hole problem. Theoretical analysis and simulation results indicate that our protocol provides a real-time routing mechanism that is well suited for dynamic emergency scenarios in building fires when compared with other related work. PMID:22163774

Anatomical classification of breast sentinel lymph nodes using computed tomography-lymphography.

PubMed

Fujita, Tamaki; Miura, Hiroyuki; Seino, Hiroko; Ono, Shuichi; Nishi, Takashi; Nishimura, Akimasa; Hakamada, Kenichi; Aoki, Masahiko

2018-05-03

To evaluate the anatomical classification and location of breast sentinel lymph nodes, preoperative computed tomography-lymphography examinations were retrospectively reviewed for sentinel lymph nodes in 464 cases clinically diagnosed with node-negative breast cancer between July 2007 and June 2016. Anatomical classification was performed based on the numbers of lymphatic routes and sentinel lymph nodes, the flow direction of lymphatic routes, and the location of sentinel lymph nodes. Of the 464 cases reviewed, anatomical classification could be performed in 434 (93.5 %). The largest number of cases showed single route/single sentinel lymph node (n = 296, 68.2 %), followed by multiple routes/multiple sentinel lymph nodes (n = 59, 13.6 %), single route/multiple sentinel lymph nodes (n = 53, 12.2 %), and multiple routes/single sentinel lymph node (n = 26, 6.0 %). Classification based on the flow direction of lymphatic routes showed that 429 cases (98.8 %) had outward flow on the superficial fascia toward axillary lymph nodes, whereas classification based on the height of sentinel lymph nodes showed that 323 cases (74.4 %) belonged to the upper pectoral group of axillary lymph nodes. There was wide variation in the number of lymphatic routes and their branching patterns and in the number, location, and direction of flow of sentinel lymph nodes. It is clinically very important to preoperatively understand the anatomical morphology of lymphatic routes and sentinel lymph nodes for optimal treatment of breast cancer, and computed tomography-lymphography is suitable for this purpose.

On using multiple routing metrics with destination sequenced distance vector protocol for MultiHop wireless ad hoc networks

NASA Astrophysics Data System (ADS)

Mehic, M.; Fazio, P.; Voznak, M.; Partila, P.; Komosny, D.; Tovarek, J.; Chmelikova, Z.

2016-05-01

A mobile ad hoc network is a collection of mobile nodes which communicate without a fixed backbone or centralized infrastructure. Due to the frequent mobility of nodes, routes connecting two distant nodes may change. Therefore, it is not possible to establish a priori fixed paths for message delivery through the network. Because of its importance, routing is the most studied problem in mobile ad hoc networks. In addition, if the Quality of Service (QoS) is demanded, one must guarantee the QoS not only over a single hop but over an entire wireless multi-hop path which may not be a trivial task. In turns, this requires the propagation of QoS information within the network. The key to the support of QoS reporting is QoS routing, which provides path QoS information at each source. To support QoS for real-time traffic one needs to know not only minimum delay on the path to the destination but also the bandwidth available on it. Therefore, throughput, end-to-end delay, and routing overhead are traditional performance metrics used to evaluate the performance of routing protocol. To obtain additional information about the link, most of quality-link metrics are based on calculation of the lost probabilities of links by broadcasting probe packets. In this paper, we address the problem of including multiple routing metrics in existing routing packets that are broadcasted through the network. We evaluate the efficiency of such approach with modified version of DSDV routing protocols in ns-3 simulator.

Pilot performance: assessing how scan patterns & navigational assessments vary by flight expertise.

PubMed

Yang, Ji Hyun; Kennedy, Quinn; Sullivan, Joseph; Fricker, Ronald D

2013-02-01

Helicopter overland navigation is a cognitively complex task that requires continuous monitoring of system and environmental parameters and many hours of training to master. This study investigated the effect of expertise on pilots' gaze measurements, navigation accuracy, and subjective assessment of their navigation accuracy in overland navigation on easy and difficult routes. A simulated overland task was completed by 12 military officers who ranged in flight experience as measured by total flight hours (TFH). They first studied a map of a route that included both easy and difficult route sections, and then had to 'fly' this simulated route in a fixed-base helicopter simulator. They also completed pre-task estimations and post-task assessments of the navigational difficulty of the transit to each waypoint in the route. Their scan pattern was tracked via eye tracking systems, which captured both the subject's out-the-window (OTW) and topographical map scan data. TFH was not associated with navigation accuracy or root mean square (RMS) error for any route section. For the easy routes, experts spent less time scanning out the window (p = 0.61) and had shorter OTW dwell (p = -0.66). For the difficult routes, experts appeared to slow down their scan by spending as much time scanning out the window as the novices while also having fewer Map fixations (p = -0.65) and shorter OTW dwell (p = -0.69). However, TFH was not significantly correlated with more accurate estimates of route difficulty. This study found that TFH did not predict navigation accuracy or subjective assessment, but was correlated with some gaze parameters.

Sex Differences in Using Spatial and Verbal Abilities Influence Route Learning Performance in a Virtual Environment: A Comparison of 6- to 12-Year Old Boys and Girls

PubMed Central

Merrill, Edward C.; Yang, Yingying; Roskos, Beverly; Steele, Sara

2016-01-01

Previous studies have reported sex differences in wayfinding performance among adults. Men are typically better at using Euclidean information and survey strategies while women are better at using landmark information and route strategies. However, relatively few studies have examined sex differences in wayfinding in children. This research investigated relationships between route learning performance and two general abilities: spatial ability and verbal memory in 153 boys and girls between 6- to 12-years-old. Children completed a battery of spatial ability tasks (a two-dimension mental rotation task, a paper folding task, a visuo-spatial working memory task, and a Piagetian water level task) and a verbal memory task. In the route learning task, they had to learn a route through a series of hallways presented via computer. Boys had better overall route learning performance than did girls. In fact, the difference between boys and girls was constant across the age range tested. Structural equation modeling of the children’s performance revealed that spatial abilities and verbal memory were significant contributors to route learning performance. However, there were different patterns of correlates for boys and girls. For boys, spatial abilities contributed to route learning while verbal memory did not. In contrast, for girls both spatial abilities and verbal memory contributed to their route learning performance. This difference may reflect the precursor of a strategic difference between boys and girls in wayfinding that is commonly observed in adults. PMID:26941701

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.

Preparation of nickel aluminum-manganese spinel oxides Ni{sub x}Al{sub 1{minus}x}Mn{sub 2}O{sub 4} for oxygen electrocatalysis in alkaline medium: Comparison of properties stemming from different preparation methods

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

Ponce, J.; Rios, E.; Gautier, J.L.

Two different procedures were used to prepare spinel-type Ni{sub x}Al{sub 1{minus}x}Mn{sub 2}O{sub 4} (0 {le} x {le} 1) compounds to study the effects of solid state properties of mixed oxides on their electrocatalytic properties. The oxalic route, coprecipitation of metal oxalates dissolved in propanol or ethanol, and the propionic route, hydrolysis of metal carboxylates in propionic acid, have been used. In both routes, thermal decomposition produces the corresponding oxides. X-ray diffraction patterns showed that the oxides crystallize in a cubic spinel phase with a unit cell parameter a that increases as aluminum is replaced by nickel. At low x values,more » compounds prepared by the propionic route showed a larger variation for parameter a than compounds prepared by the oxalic route, probably due to oxygen stoichiometric deficiency. This effect was estimated from the tetrahedral force constant (k{sub 1}) values, which showed a fast decrease as x varied from 0 to 1. Electrical conductivity, conduction activation energy, hole mobility, and pHz of oxides prepared by the propionic route were also higher than those from oxides prepared by the oxalic route. Crystallinity grade and particle size were nearly 50% higher in propionic-route samples than in oxalic-route samples. The apparent and real electrocatalytic activities of both types of oxides were compared for O{sub 2} evolution. 42 refs., 6 figs., 4 tabs.« less

An Adaptive Clustering Approach Based on Minimum Travel Route Planning for Wireless Sensor Networks with a Mobile Sink.

PubMed

Tang, Jiqiang; Yang, Wu; Zhu, Lingyun; Wang, Dong; Feng, Xin

2017-04-26

In recent years, Wireless Sensor Networks with a Mobile Sink (WSN-MS) have been an active research topic due to the widespread use of mobile devices. However, how to get the balance between data delivery latency and energy consumption becomes a key issue of WSN-MS. In this paper, we study the clustering approach by jointly considering the Route planning for mobile sink and Clustering Problem (RCP) for static sensor nodes. We solve the RCP problem by using the minimum travel route clustering approach, which applies the minimum travel route of the mobile sink to guide the clustering process. We formulate the RCP problem as an Integer Non-Linear Programming (INLP) problem to shorten the travel route of the mobile sink under three constraints: the communication hops constraint, the travel route constraint and the loop avoidance constraint. We then propose an Imprecise Induction Algorithm (IIA) based on the property that the solution with a small hop count is more feasible than that with a large hop count. The IIA algorithm includes three processes: initializing travel route planning with a Traveling Salesman Problem (TSP) algorithm, transforming the cluster head to a cluster member and transforming the cluster member to a cluster head. Extensive experimental results show that the IIA algorithm could automatically adjust cluster heads according to the maximum hops parameter and plan a shorter travel route for the mobile sink. Compared with the Shortest Path Tree-based Data-Gathering Algorithm (SPT-DGA), the IIA algorithm has the characteristics of shorter route length, smaller cluster head count and faster convergence rate.

Multi-criteria, personalized route planning using quantifier-guided ordered weighted averaging operators

NASA Astrophysics Data System (ADS)

Nadi, S.; Delavar, M. R.

2011-06-01

This paper presents a generic model for using different decision strategies in multi-criteria, personalized route planning. Some researchers have considered user preferences in navigation systems. However, these prior studies typically employed a high tradeoff decision strategy, which used a weighted linear aggregation rule, and neglected other decision strategies. The proposed model integrates a pairwise comparison method and quantifier-guided ordered weighted averaging (OWA) aggregation operators to form a personalized route planning method that incorporates different decision strategies. The model can be used to calculate the impedance of each link regarding user preferences in terms of the route criteria, criteria importance and the selected decision strategy. Regarding the decision strategy, the calculated impedance lies between aggregations that use a logical "and" (which requires all the criteria to be satisfied) and a logical "or" (which requires at least one criterion to be satisfied). The calculated impedance also includes taking the average of the criteria scores. The model results in multiple alternative routes, which apply different decision strategies and provide users with the flexibility to select one of them en-route based on the real world situation. The model also defines the robust personalized route under different decision strategies. The influence of different decision strategies on the results are investigated in an illustrative example. This model is implemented in a web-based geographical information system (GIS) for Isfahan in Iran and verified in a tourist routing scenario. The results demonstrated, in real world situations, the validity of the route planning carried out in the model.

75 FR 76648 - Proposed Establishment of Area Navigation (RNAV) Routes; Western United States

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-09

.... SUMMARY: This action proposes to establish seven High Altitude Area Navigation (RNAV) routes in the... Sacramento, CA. The High Altitude RNAV Routes are published in paragraph 2006 in FAA Order 7400.9U, Airspace...

76 FR 13084 - Establishment of Area Navigation (RNAV) Routes; Western United States

Federal Register 2010, 2011, 2012, 2013, 2014

2011-03-10

... establishes seven High Altitude Area Navigation (RNAV) routes in the Western United States (U.S.). These new... flow from Salt Lake ARTCC to Reno, NV, and Sacramento, CA. The High Altitude RNAV Routes are published...

Analysis of travel route data from a system efficiency perspective

DOT National Transportation Integrated Search

2005-03-23

Traveler route choice behavior is the cornerstone of numerous advanced traffic management technologies. Yet, few datasets of actual travel routes have : been collected and analyzed. There are two specific objectives of the analysis work conducted in ...

An Analysis of En Route Controller-Pilot Voice Communications

DOT National Transportation Integrated Search

1993-03-01

The purposes of this analysis were to examine current pilot-controller communication practices in the en route : environment. Forty-eight hours of voice tapes from eight different Air Route Traffic Control Centers (ARTCCs) were : examined. There were...

VIEW LOOKING SOUTHEAST AT ROUTE 133, SHOWING A CORNER DETAIL ...

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

VIEW LOOKING SOUTHEAST AT ROUTE 133, SHOWING A CORNER DETAIL OF THE POWERHOUSE AND A SECTION OF THE SWITCHYARD. - Wilson Dam & Hydroelectric Plant, Spanning Tennessee River at Wilson Dam Road (Route 133), Muscle Shoals, Colbert County, AL

10. WEST SIDE OF BRIDGE, LOOKING EAST, WITH TOM SHAW, ...

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

10. WEST SIDE OF BRIDGE, LOOKING EAST, WITH TOM SHAW, SC DEPT ARCHIVES & HISTORY - Poinsett Bridge, SC Route 42, 2 miles Northwest of Route 11, 2.5 miles East of SC Route 25, Tigerville, Greenville, SC

Adaptive routing in wireless communication networks using swarm intelligence

NASA Technical Reports Server (NTRS)

Arabshahi, P.; Gray, A.; Kassabalidis, I.; Das, A.; Narayanan, S.; Sharkawi, M. El; Marks, R. J.

2001-01-01

In this paper we focus on the network routing problem, and survey swarm intelligent approaches for its efficient solution, after a brief overview of power-aware routing schemes, which are important in the network examples outlined above.

1. GENERAL VIEW OF ROUTE 209 LOOKING NORTH SHOWING SLEEPING ...

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

1. GENERAL VIEW OF ROUTE 209 LOOKING NORTH SHOWING SLEEPING BEAR INN, SLEEPING BEAR INN GARAGE AND DORMITORY, D.H. DAY STORE, RESTROOM, AND GARAGE - Glen Haven Historic District, Route 209, Glen Arbor, Leelanau County, MI

76 FR 76927 - Port Access Route Study: The Atlantic Coast From Maine to Florida

Federal Register 2010, 2011, 2012, 2013, 2014

2011-12-09

..., recreational and charter fishing vessels, yachts, and sailing vessels. III. Questions The Coast Guard requests... yachts? If yes, how far offshore is your typical route? Does your route change seasonally or according to...

Identifying best practices for snowplow route optimization : final report.

DOT National Transportation Integrated Search

2016-12-01

Well-designed winter maintenance routes result in snow and ice control service that is both more effective, because roads are cleared more rapidly, and more cost-efficient, because deadheading, route overlap and other inefficiencies are reduced or el...

Integration of Fixed and Flexible Route Public Transportation Systems, Phase I

DOT National Transportation Integrated Search

2012-01-01

To provide efficient public transportation services in areas with high demand variability over time, it may be desirable : to switch vehicles between conventional services (with fixed routes and schedules) during peak periods and flexible : route ser...

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

Bikeability and methodological issues using the active commuting route environment scale (ACRES) in a metropolitan setting

PubMed Central

2011-01-01

Background Route environments can positively influence people's active commuting and thereby contribute to public health. The Active Commuting Route Environment Scale (ACRES) was developed to study active commuters' perceptions of their route environments. However, bicycle commuters represent a small portion of the population in many cities and thus are difficult to study using population-based material. Therefore, the aim of this study is to expand the state of knowledge concerning the criterion-related validity of the ACRES and the representativity using an advertisement-recruited sample. Furthermore, by comparing commuting route environment profiles of inner urban and suburban areas, we provide a novel basis for understanding the relationship between environment and bikeability. Methods Bicycle commuters from Greater Stockholm, Sweden, advertisement- (n = 1379) and street-recruited (n = 93), responded to the ACRES. Traffic planning and environmental experts from the Municipality of Stockholm (n = 24) responded to a modified version of the ACRES. The criterion-related validity assessments were based on whether or not differences between the inner urban and the suburban route environments, as indicated by the experts and by four existing objective measurements, were reflected by differences in perceptions of these environments. Comparisons of ratings between advertisement- and street-recruited participants were used for the assessments of representativity. Finally, ratings of inner urban and suburban route environments were used to evaluate commuting route environment profiles. Results Differences in ratings of the inner urban and suburban route environments by the advertisement-recruited participants were in accord with the existing objective measurements and corresponded reasonably well with those of the experts. Overall, there was a reasonably good correspondence between the advertisement- and street-recruited participants' ratings. Distinct differences in commuting route environment profiles were noted between the inner urban and suburban areas. Suburban route environments were rated as safer and more stimulating for bicycle-commuting than the inner urban ones. In general, the findings applied to both men and women. Conclusions The overall results show: considerable criterion-related validity of the ACRES; ratings of advertisement-recruited participants mirroring those of street-recruited participants; and a higher degree of bikeability in the suburban commuting route environments than in the inner urban ones. PMID:21241470

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Model of a Frame of Dynamic Routing and Its Equilibrium

NASA Astrophysics Data System (ADS)

Zhang, Shu; Yuan, Yuan; Xu, Jian

Dynamic routing algorithm based on the shortest path principle is criticized due to the oscillation induced by such routing scheme. In the present work, we propose the model of TCP/RED algorithm by a new frame of dynamic routing, based on the measurement of occupation ratio of router buffer for different links, which only requires the information of the queue size at the buffer of the router, to stabilize the system. We classify several types of equilibrium and employ the numerical method to study the stability of the steady state. Our numerical results show that the careful selection of the parameters characterizing the dynamic routing algorithm can stabilize the system in some cases.

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.

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

Formal Approach For Resilient Reachability based on End-System Route Agility

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

Rauf, Usman; Gillani, Fida; Al-Shaer, Ehab

The deterministic nature of existing routing protocols has resulted into an ossified Internet with static and predictable network routes. This gives persistent attackers (e.g. eavesdroppers and DDoS attackers) plenty of time to study the network and identify the vulnerable links (critical) to plan a devastating and stealthy attack. Recently, route mutation approaches have been proposed to address such issues. However, these approaches incur significantly high overhead and depend upon the availability of disjoint routes in the network, which inherently limit their use for mission critical services. To cope with these issues, we extend the current routing architecture to consider end-hostsmore » as routing elements, and present a formal method based agile defense mechanism to increase resiliency of the existing cyber infrastructure. The major contributions of this paper include: (1) formalization of efficient and resilient End to End (E2E) reachability problem as a constraint satisfaction problem, which identifies the potential end-hosts to reach a destination while satisfying resilience and QoS constraints, (2) design and implementation of a novel decentralized End Point Route Mutation (EPRM) protocol, and (3) design and implementation of planning algorithm to minimize the overlap between multiple flows, for the sake of maximizing the agility in the system. Our implementation and evaluation validates the correctness, effectiveness and scalability of the proposed approach.« 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

Exploring Bikeability in a Suburban Metropolitan Area Using the Active Commuting Route Environment Scale (ACRES)

PubMed Central

Wahlgren, Lina; Schantz, Peter

2014-01-01

Background and Aim: Commuting by bicycle could contribute to public health, and route environments may influence this behaviour. Therefore, the aim of this study is to assess the potential associations between appraisals of the overall route environment as hindering or stimulating for bicycle commuting, with both perceptions of commuting route environmental factors in a suburban area and background factors. Methods: The Active Commuting Route Environment Scale (ACRES) was used for the assessment of bicycle commuters’ perceptions and appraisals of their route environments in the suburban parts of Greater Stockholm, Sweden. A simultaneous multiple regression analysis was used to assess the relationship between the outcome variable whether the overall route environment hinders or stimulates bicycle commuting and environmental factors (e.g., exhaust fumes, speeds of motor vehicles, greenery), as well as background factors (sex, age, education, income) as predictor variables. Results and Conclusions: The results indicate that in suburban areas, the factors aesthetics, greenery and bicycle paths seem to be, independently of each other, stimulating factors for bicycle commuting. On the other hand, flows of motor vehicles, noise, and low “directness” of the route seem to be hindering factors. A comparison of these results with those obtained from an inner urban area points to the importance of studying different types of built-up areas separately. PMID:25153462

Crossed and Locked Quotes in a Multi-Market Simulation

PubMed Central

Todd, Andrew; Beling, Peter; Scherer, William

2016-01-01

Financial markets are often fragmented, introducing the possibility that quotes in identical securities may become crossed or locked. There are a number of theoretical explanations for the existence of crossed and locked quotes, including competition, simultaneous actions, inattentiveness, fee structure and market access. In this paper, we perform a simulation experiment designed to examine the effect of simple order routing procedures on the properties of a fragmented market consisting of a single security trading in two independent limit order books. The quotes in the two markets are connected solely by the routing decision of the market participants. We report on the health of the consolidated market as measured by the duration of crossed and locked states, as well as the spread and the volatility of transaction prices in the consolidated market. We aim to quantify exactly how the prevalence of order routing among a population of market participants affects properties of the consolidated market. Our model contributes to the zero-intelligence literature by treating order routing as an experimental variable. Additionally, we introduce a parsimonious heuristic for limit order routing, allowing us to study the effects of both market order routing and limit order routing. Our model refines intuition for the sometimes subtle relationships between the prevalence of order routing and various market measures. Our model also provides a benchmark for more complex agent-based models. PMID:26959416

An improved least cost routing approach for WDM optical network without wavelength converters

NASA Astrophysics Data System (ADS)

Bonani, Luiz H.; Forghani-elahabad, Majid

2016-12-01

Routing and wavelength assignment (RWA) problem has been an attractive problem in optical networks, and consequently several algorithms have been proposed in the literature to solve this problem. The most known techniques for the dynamic routing subproblem are fixed routing, fixed-alternate routing, and adaptive routing methods. The first one leads to a high blocking probability (BP) and the last one includes a high computational complexity and requires immense backing from the control and management protocols. The second one suggests a trade-off between performance and complexity, and hence we consider it to improve in our work. In fact, considering the RWA problem in a wavelength routed optical network with no wavelength converter, an improved technique is proposed for the routing subproblem in order to decrease the BP of the network. Based on fixed-alternate approach, the first k shortest paths (SPs) between each node pair is determined. We then rearrange the SPs according to a newly defined cost for the links and paths. Upon arriving a connection request, the sorted paths are consecutively checked for an available wavelength according to the most-used technique. We implement our proposed algorithm and the least-hop fixed-alternate algorithm to show how the rearrangement of SPs contributes to a lower BP in the network. The numerical results demonstrate the efficiency of our proposed algorithm in comparison with the others, considering different number of available wavelengths.

Crossed and Locked Quotes in a Multi-Market Simulation.

PubMed

Todd, Andrew; Beling, Peter; Scherer, William

2016-01-01

Financial markets are often fragmented, introducing the possibility that quotes in identical securities may become crossed or locked. There are a number of theoretical explanations for the existence of crossed and locked quotes, including competition, simultaneous actions, inattentiveness, fee structure and market access. In this paper, we perform a simulation experiment designed to examine the effect of simple order routing procedures on the properties of a fragmented market consisting of a single security trading in two independent limit order books. The quotes in the two markets are connected solely by the routing decision of the market participants. We report on the health of the consolidated market as measured by the duration of crossed and locked states, as well as the spread and the volatility of transaction prices in the consolidated market. We aim to quantify exactly how the prevalence of order routing among a population of market participants affects properties of the consolidated market. Our model contributes to the zero-intelligence literature by treating order routing as an experimental variable. Additionally, we introduce a parsimonious heuristic for limit order routing, allowing us to study the effects of both market order routing and limit order routing. Our model refines intuition for the sometimes subtle relationships between the prevalence of order routing and various market measures. Our model also provides a benchmark for more complex agent-based models.

Colour as an environmental cue when learning a route in a virtual environment: typical and atypical development.

PubMed

Farran, Emily K; Courbois, Yannick; Van Herwegen, Jo; Cruickshank, Alice G; Blades, Mark

2012-01-01

Typically developing (TD) 6-year-olds and 9-year-olds, and older children and adults with Williams syndrome (WS) navigated through brick-wall mazes in a virtual environment. Participants were shown a route through three mazes, each with 6 turns. In each maze the floor of each path section was a different colour such that colour acted as an environmental cue. The colours employed were either easy to verbalise (focal colours) or difficult to verbalise (non-focal colours). We investigated whether participants would verbally code the colour information in the focal colour condition only, and whether this facilitated route-learning. All groups could learn the routes; the WS group required more learning trials to learn the route and achieved lower memory scores than both of the TD groups. Despite this, all groups showed the same pattern of results. There was no effect of condition on the ability to learn the maze. However, when asked which colours featured in each route, higher memory scores were achieved for the focal colour (verbalisable) than the non-focal colour (non-verbalisable) condition. This suggests that, in both young children and individuals with WS, once a route has been learnt, the nature of the environmental cues within it can impact an individual's representation of that route. Copyright © 2011 Elsevier Ltd. All rights reserved.

Practice makes proficient: pigeons (Columba livia) learn efficient routes on full-circuit navigational traveling salesperson problems.

PubMed

Baron, Danielle M; Ramirez, Alejandro J; Bulitko, Vadim; Madan, Christopher R; Greiner, Ariel; Hurd, Peter L; Spetch, Marcia L

2015-01-01

Visiting multiple locations and returning to the start via the shortest route, referred to as the traveling salesman (or salesperson) problem (TSP), is a valuable skill for both humans and non-humans. In the current study, pigeons were trained with increasing set sizes of up to six goals, with each set size presented in three distinct configurations, until consistency in route selection emerged. After training at each set size, the pigeons were tested with two novel configurations. All pigeons acquired routes that were significantly more efficient (i.e., shorter in length) than expected by chance selection of the goals. On average, the pigeons also selected routes that were more efficient than expected based on a local nearest-neighbor strategy and were as efficient as the average route generated by a crossing-avoidance strategy. Analysis of the routes taken indicated that they conformed to both a nearest-neighbor and a crossing-avoidance strategy significantly more often than expected by chance. Both the time taken to visit all goals and the actual distance traveled decreased from the first to the last trials of training in each set size. On the first trial with novel configurations, average efficiency was higher than chance, but was not higher than expected from a nearest-neighbor or crossing-avoidance strategy. These results indicate that pigeons can learn to select efficient routes on a TSP problem.

Development of a Healthy Urban Route Planner for cyclists and pedestrians in Amsterdam

NASA Astrophysics Data System (ADS)

van der Molen, Michiel; Ligtenberg, Arend; Vreugdenhil, Corne; Steeneveld, Gert-Jan

2017-04-01

Cities are hotspots of air pollution and heat stress, the exposure to which results in nuisance, health risks, cost of medication, reduced labour productivity and sick leave for citizens. Yet the air pollution and heat stress are spatially and temporally unevenly distributed over the city, depending on pollutant emissions, street design and atmospheric turbulent mixing and radiation. This spatiotemporal variation allows pedestrians and bikers to choose alternative routes to minimize their exposure, if the distribution is known. In this project, we develop a route planner for bicyclists and pedestrians for Amsterdam (NL), that proposes routes and departure times based on model simulations of weather and air quality. We use the WRF-Chem atmosphere and air quality model at unprecedented grid spacing of 100-m (Ronda et al, 2015, Super et al, 2016), with an underlying urban canopy model and NOx and PM10 emissions. The emissions by traffic are calculated based on observed traffic intensities and emission factors. An urban land use map will characterize urban density and street configuration to estimate urban heat storage (Attema et al, 2015). WRF-Chem runs will be issued daily for a lead time of 48 hours, resulting in forecast maps of temperature and pollutant concentrations that will be uniquely expressed in a metric that combines both threats. The hourly fields of this metric are provided to the route planner based on the open source routing library pgRouting to identify the more healthy routes on the route network of Amsterdam. The objectives of the healthy urban route planner are to raise awareness of heat and air quality issues in Amsterdam, to provide an innovative adaptation tool for citizens and tourists, to locate the most important bottlenecks in (the exposure to) air pollution and heat stress, and ultimately to test the readiness of the travellers to use the information and adapt the route. We expect to particularly target a group of lung- and cardiovascular patients, and elderly people. In the future the planner will be expanded with pollen information and possibly with real-time traffic information.

Peninsula transportation district commission route deviation feasibility study.

DOT National Transportation Integrated Search

1998-11-01

Many urban transit providers are faced with the problem of declining ridership on traditional fixed route services in low density suburban areas. As a result, many fixed route services in such areas are not economically viable for the transit provide...

Optimum routing of freight in urban environments under normal operations and disruptions : final report.

DOT National Transportation Integrated Search

2016-12-27

The complexity and dynamics of multimodal freight transportation together with the unpredictability of incidents, disruptions and demand changes make the optimum routing of freight a challenging task. Optimum routing decisions in a multimodal transpo...

19 CFR 24.26 - Automated Clearinghouse credit.

Code of Federal Regulations, 2012 CFR

2012-04-01

... Financial Management Services Center, U.S. Customs Service, 6026 Lakeside Boulevard, Indianapolis, Indiana... information, the Financial Management Services Center will provide the payer with specific ACH credit routing... validate the routing instructions. When the routing instructions are validated, the Financial Management...

19 CFR 24.26 - Automated Clearinghouse credit.

Code of Federal Regulations, 2011 CFR

2011-04-01

... Financial Management Services Center, U.S. Customs Service, 6026 Lakeside Boulevard, Indianapolis, Indiana... information, the Financial Management Services Center will provide the payer with specific ACH credit routing... validate the routing instructions. When the routing instructions are validated, the Financial Management...

3. APPROACH TO BRIDGE FROM NORTH. LOOKING SOUTH. Route ...

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

3. APPROACH TO BRIDGE FROM NORTH. LOOKING SOUTH. - Route 31 Bridge, New Jersey Route 31, crossing disused main line of Central Railroad of New Jersey (C.R.R.N.J.) (New Jersey Transit's Raritan Valley Line), Hampton, Hunterdon County, NJ

8. OBLIQUE VIEW OF WEST ELEVATION. LOOKING EAST. Route ...

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

8. OBLIQUE VIEW OF WEST ELEVATION. LOOKING EAST. - Route 31 Bridge, New Jersey Route 31, crossing disused main line of Central Railroad of New Jersey (C.R.R.N.J.) (New Jersey Transit's Raritan Valley Line), Hampton, Hunterdon County, NJ

7. OBLIQUE VIEW OF EAST ELEVATION. LOOKING WEST. Route ...

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

7. OBLIQUE VIEW OF EAST ELEVATION. LOOKING WEST. - Route 31 Bridge, New Jersey Route 31, crossing disused main line of Central Railroad of New Jersey (C.R.R.N.J.) (New Jersey Transit's Raritan Valley Line), Hampton, Hunterdon County, NJ

4. APPROACH TO BRIDGE FROM SOUTH. LOOKING NORTH. Route ...

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

4. APPROACH TO BRIDGE FROM SOUTH. LOOKING NORTH. - Route 31 Bridge, New Jersey Route 31, crossing disused main line of Central Railroad of New Jersey (C.R.R.N.J.) (New Jersey Transit's Raritan Valley Line), Hampton, Hunterdon County, NJ

Driver decision making in response to alternate routes.

DOT National Transportation Integrated Search

2011-04-11

The issue of driver route choice has been studied fairly extensively as part of the body of research on intelligent : transportation systems. A few studies cited in this literature search focus directly on Route Choice Analysis, while : many other st...

3. VIEW NORTHWEST, PERSPECTIVE OF ABUTMENT AND INCLINED PLANE ON ...

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

3. VIEW NORTHWEST, PERSPECTIVE OF ABUTMENT AND INCLINED PLANE ON WEST SIDE OF PA ROUTE 56 - Laurel Hill Quarry, Incline Plane, Both sides of State Route 56, 2.4 miles East of State Route 711, Seward, Westmoreland County, PA

2. VIEW SOUTH, PERSPECTIVE OF ABUTMENT AND INCLINED PLANE ON ...

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

2. VIEW SOUTH, PERSPECTIVE OF ABUTMENT AND INCLINED PLANE ON WEST SIDE OF PA ROUTE 56 - Laurel Hill Quarry, Incline Plane, Both sides of State Route 56, 2.4 miles East of State Route 711, Seward, Westmoreland County, PA

Analysis of Controller-Pilot Voice Communications from Kansas City Air Route Traffic Control Center

DOT National Transportation Integrated Search

2017-07-01

The implementation of Controller Pilot Datalink Communications (CPDLC) in domestic en route airspace is a key enabling technology in the Next Generation Air Transportation System. The Federal Aviation Administration plans to implement en route CPDLC ...

Integration of Fixed and Flexible Route Public Transportation Systems, Phase II

DOT National Transportation Integrated Search

2012-01-01

Conventional bus service (with fixed routes and schedules) has lower average cost than flexible bus service (with : demand-responsive routes) at high demand densities. At low demand densities flexible bus service has lower : average costs and provide...

Development of decision support systems for real-time freeway traffic routing : volume II.

DOT National Transportation Integrated Search

1998-01-01

Real-time traffic flow routing is a promising approach to alleviating congestion. Existing approaches to developing real-time routing strategies, however, have limitations. This study explored the potential for using case-based reasoning (CBR), an em...

14 CFR 121.135 - Manual contents.

Code of Federal Regulations, 2010 CFR

2010-01-01

... flight control or flight following procedures, as applicable. (5) En route flight, navigation, and... of equipment required for the particular type of operation becomes inoperative or unserviceable en route. (6) For domestic or flag operations, appropriate information from the en route operations...

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 merit(s). Finally, open challenges and research directions are presented for future investigation.

mRM - multiscale Routing Model for Land Surface and Hydrologic Models

NASA Astrophysics Data System (ADS)

Cuntz, M.; Thober, S.; Mai, J.; Samaniego, L. E.; Gochis, D. J.; Kumar, R.

2015-12-01

Routing streamflow through a river network is a basic step within any distributed hydrologic model. It integrates the generated runoff and allows comparison with observed discharge at the outlet of a catchment. The Muskingum routing is a textbook river routing scheme that has been implemented in Earth System Models (e.g., WRF-HYDRO), stand-alone routing schemes (e.g., RAPID), and hydrologic models (e.g., the mesoscale Hydrologic Model). Most implementations suffer from a high computational demand because the spatial routing resolution is fixed to that of the elevation model irrespective of the hydrologic modeling resolution. This is because the model parameters are scale-dependent and cannot be used at other resolutions without re-estimation. Here, we present the multiscale Routing Model (mRM) that allows for a flexible choice of the routing resolution. mRM exploits the Multiscale Parameter Regionalization (MPR) included in the open-source mesoscale Hydrologic Model (mHM, www.ufz.de/mhm) that relates model parameters to physiographic properties and allows to estimate scale-independent model parameters. mRM is currently coupled to mHM and is presented here as stand-alone Free and Open Source Software (FOSS). The mRM source code is highly modular and provides a subroutine for internal re-use in any land surface scheme. mRM is coupled in this work to the state-of-the-art land surface model Noah-MP. Simulation results using mRM are compared with those available in WRF-HYDRO for the Red River during the period 1990-2000. mRM allows to increase the routing resolution from 100m to more than 10km without deteriorating the model performance. Therefore, it speeds up model calculation by reducing the contribution of routing to total runtime from over 80% to less than 5% in the case of WRF-HYDRO. mRM thus makes discharge data available to land surface modeling with only little extra calculations.

Analyzing the evolutionary mechanisms of the Air Transportation System-of-Systems using network theory and machine learning algorithms

NASA Astrophysics Data System (ADS)

Kotegawa, Tatsuya

Complexity in the Air Transportation System (ATS) arises from the intermingling of many independent physical resources, operational paradigms, and stakeholder interests, as well as the dynamic variation of these interactions over time. Currently, trade-offs and cost benefit analyses of new ATS concepts are carried out on system-wide evaluation simulations driven by air traffic forecasts that assume fixed airline routes. However, this does not well reflect reality as airlines regularly add and remove routes. A airline service route network evolution model that projects route addition and removal was created and combined with state-of-the-art air traffic forecast methods to better reflect the dynamic properties of the ATS in system-wide simulations. Guided by a system-of-systems framework, network theory metrics and machine learning algorithms were applied to develop the route network evolution models based on patterns extracted from historical data. Constructing the route addition section of the model posed the greatest challenge due to the large pool of new link candidates compared to the actual number of routes historically added to the network. Of the models explored, algorithms based on logistic regression, random forests, and support vector machines showed best route addition and removal forecast accuracies at approximately 20% and 40%, respectively, when validated with historical data. The combination of network evolution models and a system-wide evaluation tool quantified the impact of airline route network evolution on air traffic delay. The expected delay minutes when considering network evolution increased approximately 5% for a forecasted schedule on 3/19/2020. Performance trade-off studies between several airline route network topologies from the perspectives of passenger travel efficiency, fuel burn, and robustness were also conducted to provide bounds that could serve as targets for ATS transformation efforts. The series of analysis revealed that high robustness is achievable only in exchange of lower passenger travel and fuel burn efficiency. However, increase in the network density can mitigate this trade-off.

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 merit(s). Finally, open challenges and research directions are presented for future investigation. PMID:29783686

PLUTONIUM/HIGH-LEVEL VITRIFIED WASTE BDBE DOSE CALCULATION

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

D.C. Richardson

2003-03-19

In accordance with the Nuclear Waste Policy Amendments Act of 1987, Yucca Mountain was designated as the site to be investigated as a potential repository for the disposal of high-level radioactive waste. The Yucca Mountain site is an undeveloped area located on the southwestern edge of the Nevada Test Site (NTS), about 100 miles northwest of Las Vegas. The site currently lacks rail service or an existing right-of-way. If the Yucca Mountain site is found suitable for the repository, rail service is desirable to the Office of Civilian Waste Management (OCRWM) Program because of the potential of rail transportation tomore » reduce costs and to reduce the number of shipments relative to highway transportation. A Preliminary Rail Access Study evaluated 13 potential rail spur options. Alternative routes within the major options were also developed. Each of these options was then evaluated for potential land use conflicts and access to regional rail carriers. Three potential routes having few land use conflicts and having access to regional carriers were recommended for further investigation. Figure 1-1 shows these three routes. The Jean route is estimated to be about 120 miles long, the Carlin route to be about 365 miles long, and Caliente route to be about 365 miles long. The remaining ten routes continue to be monitored and should any of the present conflicts change, a re-evaluation of that route will be made. Complete details of the evaluation of the 13 routes can be found in the previous study. The DOE has not identified any preferred route and recognizes that the transportation issues need a full and open treatment under the National Environmental Policy Act. The issue of transportation will be included in public hearings to support development of the Environmental Impact Statement (EIS) proceedings for either the Monitored Retrievable Storage Facility or the Yucca Mountain Project or both.« less

Route 20, Autobahn 7, and Slime Mold: Approximating the Longest Roads in USA and Germany With Slime Mold on 3-D Terrains.

PubMed

Adamatzky, Andrew I

2014-01-01

A cellular slime mould Physarum polycephalum is a monstrously large single cell visible by an unaided eye. The slime mold explores space in parallel, is guided by gradients of chemoattractants, and propagates toward sources of nutrients along nearly shortest paths. The slime mold is a living prototype of amorphous biological computers and robotic devices capable of solving a range of tasks of graph optimization and computational geometry. When presented with a distribution of nutrients, the slime mold spans the sources of nutrients with a network of protoplasmic tubes. This protoplasmic network matches a network of major transport routes of a country when configuration of major urban areas is represented by nutrients. A transport route connecting two cities should ideally be a shortest path, and this is usually the case in computer simulations and laboratory experiments with flat substrates. What searching strategies does the slime mold adopt when exploring 3-D terrains? How are optimal and transport routes approximated by protoplasmic tubes? Do the routes built by the slime mold on 3-D terrain match real-world transport routes? To answer these questions, we conducted pioneer laboratory experiments with Nylon terrains of USA and Germany. We used the slime mold to approximate route 20, the longest road in USA, and autobahn 7, the longest national motorway in Europe. We found that slime mold builds longer transport routes on 3-D terrains, compared to flat substrates yet sufficiently approximates man-made transport routes studied. We demonstrate that nutrients placed in destination sites affect performance of slime mold, and show how the mold navigates around elevations. In cellular automaton models of the slime mold, we have shown variability of the protoplasmic routes might depends on physiological states of the slime mold. Results presented will contribute toward development of novel algorithms for sensorial fusion, information processing, and decision making, and will provide inspirations in design of bioinspired amorphous robotic devices.

Chitosan-adjuvanted Mycoplasma gallisepticum bacterin via intraocular administration enhances Mycoplasma gallisepticum protection in commercial layers.

PubMed

Limsatanun, A; Sasipreeyajan, J; Pakpinyo, S

2018-06-01

Mycoplasma gallisepticum (MG) causes respiratory signs and economic losses in the poultry industry. MG vaccination is one of the effective prevention and control measures that have been used around the world. Our previous study demonstrated that chitosan-adjuvanted MG bacterin could effectively reduce pathological lesions induced by MG and that chitosan could be used as an adjuvant in MG bacterin. The present study determining the efficacy of MG bacterins against the Thai MG strain was based on vaccine programs. Seven groups (25 layers/group) were received MG bacterins containing 0.5% chitosan or a commercial bacterin via intramuscular (IM) or intraocular (IO) route at 6 and 10 wk of age. Sham-negative and sham-positive controls were groups 1 and 2, respectively. Group 3: IM route of chitosan bacterin followed by IM route of chitosan bacterin; group 4: commercial bacterin via IM route followed by chitosan bacterin via IO route; group 5: commercial bacterin via IM route followed by commercial bacterin via IM route; group 6: chitosan bacterin via IM followed by chitosan bacterin via IO route; and group 7: chitosan bacterin via IO route followed by chitosan bacterin via IO route were determined. At 16 wk of age, all groups, excluding group 1, were challenged intratracheally with 0.1 mL containing Thai MG strain 107 colony-forming unit. At 17, 18, and 20 wk of age, 5 birds in each group were bled for serological testing and swabbed at the choanal cleft for the quantitative real-time PCR assay, the euthanized and necropsied. The results showed that birds vaccinated with a commercial intramuscular bacterin followed by an intraocularly chitosan adjuvant bacterin showed the best protection against the MG challenge. The study indicated that chitosan could be the effective mucosal adjuvant and increased the effectiveness of MG bacterin.

Role of route previewing strategies on climbing fluency and exploratory movements.

PubMed

Seifert, Ludovic; Cordier, Romain; Orth, Dominic; Courtine, Yoan; Croft, James L

2017-01-01

This study examined the role of route previewing strategies on climbing fluency and on exploratory movements of the limbs, in order to understand whether previewing helps people to perceive and to realize affordances. Eight inexperienced and ten experienced climbers previewed a 10 m high route of 5b difficulty on French scale, then climbed it with a top-rope as fluently as possible. Gaze behavior was collected from an eye tracking system during the preview and allowed us to determine the number of times they scanned the route, and which of four route previewing strategies (fragmentary, ascending, zigzagging, and sequence-of-blocks) they used. Five inertial measurement units (IMU) (3D accelerometer, 3D gyroscope, 3D magnetometer) were attached to the hip, both feet, and forearms to analyze the vertical acceleration and direction of each limb and hip during the ascent. We were able to detect movement and immobility phases of each IMU using segmentation and classification processes. Depending on whether the limbs and/or hip were moving, five states of behavior were detected: immobility, postural regulation, hold exploration, hold change, and hold traction. Using cluster analysis we identified four clusters of gaze behavior during route previewing depending on route preview duration, number of scan paths, fixations duration, ascending, zigzagging, and sequence-of-blocks strategies. The number of scan paths was positively correlated with relative duration of exploration and negatively correlated with relative duration of hold changes during the ascent. Additionally, a high relative duration of sequence-of-blocks strategy and zigzagging strategy were associated with a high relative duration of immobility during the ascent. Route previewing might help to pick up functional information about reachable, graspable, and usable holds, in order to chain movements together and to find the route. In other words, route previewing might contribute to perceiving and realizing nested affordances.

Reinforcement learning for routing in cognitive radio ad hoc networks.

PubMed

Al-Rawi, Hasan A A; Yau, Kok-Lim Alvin; Mohamad, Hafizal; Ramli, Nordin; Hashim, Wahidah

2014-01-01

Cognitive radio (CR) enables unlicensed users (or secondary users, SUs) to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs). Reinforcement learning (RL) is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs.

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.

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.

Electronic Router

NASA Technical Reports Server (NTRS)

Crusan, Jason

2005-01-01

Electronic Router (E-Router) is an application program for routing documents among the cognizant individuals in a government agency or other organization. E-Router supplants a prior 14 NASA Tech Briefs, May 2005 system in which paper documents were routed physically in packages by use of paper slips, packages could be lost, routing times were unacceptably long, tracking of packages was difficult, and there was a need for much photocopying. E-Router enables a user to create a digital package to be routed. Input accepted by E-Router includes the title of the package, the person(s) to whom the package is to be routed, attached files, and comments to reviewers. Electronic mail is used to notify reviewers of needed actions. The creator of the package can, at any time, see the status of the package in the routing structure. At the end of the routing process, E-Router keeps a record of the package and of approvals and/or concurrences of the reviewers. There are commercial programs that perform the general functions of E-Router, but they are more complicated. E-Router is Web-based, easy to use, and does not require the installation or use of client software.

A network coding based routing protocol for underwater sensor networks.

PubMed

Wu, Huayang; Chen, Min; Guan, Xin

2012-01-01

Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime.

Reinforcement Learning for Routing in Cognitive Radio Ad Hoc Networks

PubMed Central

Al-Rawi, Hasan A. A.; Mohamad, Hafizal; Hashim, Wahidah

2014-01-01

Cognitive radio (CR) enables unlicensed users (or secondary users, SUs) to sense for and exploit underutilized licensed spectrum owned by the licensed users (or primary users, PUs). Reinforcement learning (RL) is an artificial intelligence approach that enables a node to observe, learn, and make appropriate decisions on action selection in order to maximize network performance. Routing enables a source node to search for a least-cost route to its destination node. While there have been increasing efforts to enhance the traditional RL approach for routing in wireless networks, this research area remains largely unexplored in the domain of routing in CR networks. This paper applies RL in routing and investigates the effects of various features of RL (i.e., reward function, exploitation, and exploration, as well as learning rate) through simulation. New approaches and recommendations are proposed to enhance the features in order to improve the network performance brought about by RL to routing. Simulation results show that the RL parameters of the reward function, exploitation, and exploration, as well as learning rate, must be well regulated, and the new approaches proposed in this paper improves SUs' network performance without significantly jeopardizing PUs' network performance, specifically SUs' interference to PUs. PMID:25140350

Roman and early-medieval routes in north-western Europe: modelling national and international frequent-travel zones in the Netherlands using a multi-proxy approach.

NASA Astrophysics Data System (ADS)

van Lanen, Rowin J.; Jansma, Esther

2016-04-01

The end of the Roman period in many parts of north-western Europe coincided with severe population decline and collapsing trade routes. To what extent the long-distance transport routes changed from Roman to early-medieval periods and what their exact nature was, is generally unknown. Only few historical sources are available for this period, and archaeological records complex. Traditionally, research on the long-distance exchange of goods therefore generally has focussed on the spatial analyses of archaeologically recognizable goods (e.g. jewellery, religious artefacts). Although these endeavours greatly increase our understanding of long-distance trade networks, they probably in itself do not represent the full spectrum of common exchange networks and transport routes. By using a dendroarchaeological approach we were able to analyse long-distance transport routes of imported timber in the Roman and early-medieval Netherlands. By combining the provenance of exogenous timbers with data on modelled Roman and early-medieval route networks, we were able to reconstruct: (a) Roman and early-medieval trade networks in structural timbers, (b) changing transport routes in structural timbers and (c) model spatially shifting frequent-travel zones in the research area.

Effects of Corynebacterium parvum treatment and Toxoplasma gondii infection on macrophage-mediated cytostasis of tumour target cells.

PubMed Central

Krahenbuhl, J L; Lambert, L H; Remington, J S

1976-01-01

Injection of mice with Corynebacterium parvum or living or killed Toxoplasma gondii was studied to determine the efficacy of these treatments in activating peritoneal macrophages to inhibit the uptake of [3H]TdR (cytostasis) by tumour target cells in vitro. In the presence of activated macrophages from mice treated i.p. with a wide dose range of either C. parvum or living Toxoplasma, cytostasis was usually greater than 99%. This population of activated macrophages was transient in C. parvum-treated mice, but persists, probably for life, in Toxoplasma-infected mice. Whereas the i.p. route of administration of C. parvum was more efficient in activating macrophages than the i.v. route, the s.c. route appeared to be relatively ineffective. Treatment with killed Toxoplasma by any route was also relatively ineffective in activating macrophages. In contrast Toxoplasma infection resulted in highly activated peritoneal macrophages, regardless of the route of administration. Depending upon the route of initial treatment, the route of readministration of C. parvum had either no appreciable effect or resulted in a marked alteration in the cytostatic capacity of peritoneal macrophages. PMID:992714

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.

When affordances climb into your mind: advantages of motor simulation in a memory task performed by novice and expert rock climbers.

PubMed

Pezzulo, Giovanni; Barca, Laura; Bocconi, Alessandro Lamberti; Borghi, Anna M

2010-06-01

Does the sight of multiple climbing holds laid along a path activate a motor simulation of climbing that path? One way of testing whether multiple affordances and their displacement influence the formation of a motor simulation is to study acquired motor skills. We used a behavioral task in which expert and novice rock climbers were shown three routes: an easy route, a route impossible to climb but perceptually salient, and a difficult route. After a distraction task, they were then given a recall test in which they had to write down the sequence of holds composing each route. We found no difference between experts and novices on the easy and impossible routes, whereas on the difficult route, the performance of experts was better than that of novices. This suggests that seeing a climbing wall activates a motor, embodied simulation, which relies not on perceptual salience, but on motor competence. More importantly, our results show that the capability to form this simulation is modulated by individuals' motor repertoire and expertise, and that this strongly impacts recall. Copyright 2010 Elsevier Inc. All rights reserved.

Ecological validity of virtual environments to assess human navigation ability

PubMed Central

van der Ham, Ineke J. M.; Faber, Annemarie M. E.; Venselaar, Matthijs; van Kreveld, Marc J.; Löffler, Maarten

2015-01-01

Route memory is frequently assessed in virtual environments. These environments can be presented in a fully controlled manner and are easy to use. Yet they lack the physical involvement that participants have when navigating real environments. For some aspects of route memory this may result in reduced performance in virtual environments. We assessed route memory performance in four different environments: real, virtual, virtual with directional information (compass), and hybrid. In the hybrid environment, participants walked the route outside on an open field, while all route information (i.e., path, landmarks) was shown simultaneously on a handheld tablet computer. Results indicate that performance in the real life environment was better than in the virtual conditions for tasks relying on survey knowledge, like pointing to start and end point, and map drawing. Performance in the hybrid condition however, hardly differed from real life performance. Performance in the virtual environment did not benefit from directional information. Given these findings, the hybrid condition may offer the best of both worlds: the performance level is comparable to that of real life for route memory, yet it offers full control of visual input during route learning. PMID:26074831

A Network Coding Based Routing Protocol for Underwater Sensor Networks

PubMed Central

Wu, Huayang; Chen, Min; Guan, Xin

2012-01-01

Due to the particularities of the underwater environment, some negative factors will seriously interfere with data transmission rates, reliability of data communication, communication range, and network throughput and energy consumption of underwater sensor networks (UWSNs). Thus, full consideration of node energy savings, while maintaining a quick, correct and effective data transmission, extending the network life cycle are essential when routing protocols for underwater sensor networks are studied. In this paper, we have proposed a novel routing algorithm for UWSNs. To increase energy consumption efficiency and extend network lifetime, we propose a time-slot based routing algorithm (TSR).We designed a probability balanced mechanism and applied it to TSR. The theory of network coding is introduced to TSBR to meet the requirement of further reducing node energy consumption and extending network lifetime. Hence, time-slot based balanced network coding (TSBNC) comes into being. We evaluated the proposed time-slot based balancing routing algorithm and compared it with other classical underwater routing protocols. The simulation results show that the proposed protocol can reduce the probability of node conflicts, shorten the process of routing construction, balance energy consumption of each node and effectively prolong the network lifetime. PMID:22666045

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.

U-Access: a web-based system for routing pedestrians of differing abilities

NASA Astrophysics Data System (ADS)

Sobek, Adam D.; Miller, Harvey J.

2006-09-01

For most people, traveling through urban and built environments is straightforward. However, for people with physical disabilities, even a short trip can be difficult and perhaps impossible. This paper provides the design and implementation of a web-based system for the routing and prescriptive analysis of pedestrians with different physical abilities within built environments. U-Access, as a routing tool, provides pedestrians with the shortest feasible route with respect to one of three differing ability levels, namely, peripatetic (unaided mobility), aided mobility (mobility with the help of a cane, walker or crutches) and wheelchair users. U-Access is also an analytical tool that can help identify obstacles in built environments that create routing discrepancies among pedestrians with different physical abilities. This paper discusses the system design, including database, algorithm and interface specifications, and technologies for efficiently delivering results through the World Wide Web (WWW). This paper also provides an illustrative example of a routing problem and an analytical evaluation of the existing infrastructure which identifies the obstacles that pose the greatest discrepancies between physical ability levels. U-Access was evaluated by wheelchair users and route experts from the Center for Disability Services at The University of Utah, USA.

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

Lagrangian Hotspots of In-Use NOX Emissions from Transit Buses.

PubMed

Kotz, Andrew J; Kittelson, David B; Northrop, William F

2016-06-07

In-use, spatiotemporal NOX emissions were measured from a conventional powertrain transit bus and a series electric hybrid bus over gradients of route kinetic intensity and ambient temperature. This paper introduces a new method for identifying NOX emissions hotspots along a bus route using high fidelity Lagrangian vehicle data to explore spatial interactions that may influence emissions production. Our study shows that the studied transit buses emit higher than regulated emissions because on-route operation does not accurately represent the range of engine operation tested according to regulatory standards. Using the Lagrangian hotspot detection, we demonstrate that NOX hotspots occurred at bus stops, during cold starts, on inclines, and for accelerations. On the selected routes, bus stops resulted in 3.3 times the route averaged emissions factor in grams/km without significant dependence on bus type or climate. The buses also emitted 2.3 times the route averaged NOX emissions factor at the beginning of each route due to cold selective catalytic reduction aftertreatment temperature. The Lagrangian hotspot detection technique demonstrated here could be employed in future connected vehicles empowered by advances in computational power, data storage capability, and improved sensor technology to optimize emissions as a function of spatial location.

Route learning in amnesia: a comparison of trial-and-error and errorless learning in patients with the Korsakoff syndrome.

PubMed

Kessels, Roy P C; van Loon, Eke; Wester, Arie J

2007-10-01

To examine the errorless learning approach using a procedural memory task (i.e. learning of actual routes) in patients with amnesia, as compared to trial-and-error learning. Counterbalanced self-controlled cases series. Psychiatric hospital (Korsakoff clinic). A convenience sample of 10 patients with the Korsakoff amnestic syndrome. All patients learned a route in four sessions on separate days using an errorless approach and a different route using trial-and-error. Error rate was scored during route learning and standard neuro-psychological tests were administered (i.e. subtest route recall of the Rivermead Behavioural Memory Test (RBMT) and the Dutch version of the California Verbal Learning Test (VLGT)). A significant learning effect was found in the trial-and-error condition over consecutive sessions (P = 0.006), but no performance difference was found between errorless and trial-and-error learning of the routes. VLGT performance was significantly correlated with a trial-and-error advantage (P < 0.05); no significant correlation was found between the RBMT subtest and the learning conditions. Errorless learning was no more successful than trial-and-error learning of a procedural spatial task in patients with the Korsakoff syndrome (severe amnesia).

Spatial variation of size distribution of Sarcopoterium spinosum in semi-arid rangelands

NASA Astrophysics Data System (ADS)

Pariente, Sarah

2014-05-01

Rangelands of semi-arid regions exhibit a three-phase mosaic spatial pattern comprising three representative patches: shrubs, trampling routes, and the remaining intershrubs area (hereafter: intershrubs). These patches differ in their soil properties, vegetation, and hydrological characteristics, and the differences are attributed to the differing intensities of animal hoof impacts and trampling: highest in the routes, sporadic in the intershrubs and minimal in the shrubs. A study conducted in the area described below revealed that soil moisture and organic matter contents, and topographic incline varied in the increasing order: routes < intershrubs < beneath shrubs. The opposite trend was found for soil bulk density. Therefore, it was hypothesized that routes should yield more runoff than intershrubs. This led to the present research hypothesis: that, from a hydrological point of view, the size of shrub is controlled by its distance from the routes, i.e., shrubs located near trampling routes are expected to be bigger than those far from them. The research was conducted in the Goral Hills, in the northern Negev region of Israel. This is a hilly, semi-arid area, 350-500 m above sea level, with mean annual rainfall of 300 mm that falls between October/December and May. Average daily temperatures range from 10° C in the winter to 25° C in the summer. The lithology is chalk and limestone of the Eocene era. The soil is shallow, generally not deeper than 20 or 40 cm in the open spaces between shrubs and beneath shrubs, respectively. The research area, like many other semi-arid areas of the Old World, has been grazed by flocks of sheep and goats since prehistoric times. The predominant shrub in the area is Sarcopoterium spinosum. To confirm the above hypothesis 10 representative hillslopes - five south-facing and five north-facing - were randomly selected within the research area. On each, a plot measuring 3 X 18 m running down the backslope was randomly selected and divided into squares of 1 m2. The shrubs - Sarcopoterium spinosum - and routes were mapped and, for each shrub, the height, maximal length, and width at the middle of the canopy were measured, in order to determine the area of the canopy and the volume of the shrub. The shrubs were divided into two categories according to their distance from the closest route upslope: close to the route, i.e., up to 50 cm, and far from the route, i.e., further than 50 cm. The results showed that shrubs were associated with trampling routes. Most of the shrubs on both south- and north-facing hillslopes were located close to the route, and they were taller and wider than those far from it. These findings might indicate that a shrub developing lower down the slope and close to a route may possess an existential advantage, since it receives more water than shrubs far from the route. Furthermore, ecological factors such as animals' hoof activity in the vicinity of the trampling routes should account for the size distribution of the shrubs.

Web-based routing assistance tool to reduce pavement damage by overweight and oversize vehicles.

DOT National Transportation Integrated Search

2016-10-30

This report documents the results of a completed project titled Web-Based Routing Assistance Tool to Reduce Pavement Damage by Overweight and Oversize Vehicles. The tasks involved developing a Web-based GIS routing assistance tool and evaluate ...

Construction and installation of travel time signs on I-35 in Austin.

DOT National Transportation Integrated Search

2016-08-01

Dynamic travel time signs (DTTS) provide current travel times to a specific destination via one or more : routes. These signs aid motorists in making route choice decisions en route. Through this project, three : DTTS were fabricated and installed on...

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

DEVELOPING AND FIELD IMPLEMENTING A DYNAMIC ECO-ROUTING SYSTEM.

DOT National Transportation Integrated Search

2017-04-01

The study develops two different eco-routing systems and uses them to investigate and quantify the system-wide impacts of implementing an eco-routing system. The first one is basically a Nash Equilibrium feedback system, which uses the Ant Colony opt...