On line routing per mobile phone

DEFF Research Database (Denmark)

Bieding, Thomas; Görtz, Simon; Klose, Andreas

2009-01-01

On-line routing is concerned with building vehicle routes in an ongoing fashion in such a way that customer requests arriving dynamically in time are efficiently and effectively served. An indispensable prerequisite for applying on-line routing methods is mobile communication technology....... Additionally it is of utmost importance that the employed communication system is suitable integrated with the firm’s enterprise application system and business processes. On basis of a case study, we describe in this paper a system that is cheap and easy to implement due to the use of simple mobile phones...

Next Generation Network Routing and Control Plane

DEFF Research Database (Denmark)

Fu, Rong

proved, the dominating Border Gateway Protocol (BGP) cannot address all the issues that in inter-domain QoS routing. Thus a new protocol or network architecture has to be developed to be able to carry the inter-domain traffic with the QoS and TE consideration. Moreover, the current network control also...... lacks the ability to cooperate between different domains and operators. The emergence of label switching transport technology such as of Multi-Protocol Label Switching (MPLS) or Generalized MPLS (GMPLS) supports the traffic transport in a finer granularity and more dedicated end-to-end Quality...... (RACF) provides the platform that enables cooperation and ubiquitous integration between networks. In this paper, we investigate in the network architecture, protocols and algorithms for inter-domain QoS routing and traffic engineering. The PCE based inter-domain routing architecture is enhanced...

Route-Based Control of Hybrid Electric Vehicles: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J. D.

2008-01-01

Today's hybrid electric vehicle controls cannot always provide maximum fuel savings over all drive cycles. Route-based controls could improve HEV fuel efficiency by 2%-4% and help save nearly 6.5 million gallons of fuel annually.

Short-Term Memory, Executive Control, and Children's Route Learning

Science.gov (United States)

Purser, Harry R. M.; Farran, Emily K.; Courbois, Yannick; Lemahieu, Axelle; Mellier, Daniel; Sockeel, Pascal; Blades, Mark

2012-01-01

The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11 years 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…

10 CFR 900.5 - Request for coordination.

Science.gov (United States)

2010-01-01

... request shall contain: (1) The exact legal name of the requester; its principal place of business; whether... line; (iii) The design and height of the support structures; (iv) The proposed route (including the... facility has submitted an interconnection request with a transmission organization or electric reliability...

Dynamic Routing during Disaster Events

NARCIS (Netherlands)

Fitrianie, S.; Rothkrantz, L.J.M.

2015-01-01

Innovations in mobile technology allow people to request route information on their smartphone to reach safe areas during emergency and disaster evacuations. In return, the affected people in the field can send their observation reports, e.g. using a dedicated icon-based disaster language. However,

Location-Based Self-Adaptive Routing Algorithm for Wireless Sensor Networks in Home Automation

Directory of Open Access Journals (Sweden)

Hong SeungHo

2011-01-01

Full Text Available The use of wireless sensor networks in home automation (WSNHA is attractive due to their characteristics of self-organization, high sensing fidelity, low cost, and potential for rapid deployment. Although the AODVjr routing algorithm in IEEE 802.15.4/ZigBee and other routing algorithms have been designed for wireless sensor networks, not all are suitable for WSNHA. In this paper, we propose a location-based self-adaptive routing algorithm for WSNHA called WSNHA-LBAR. It confines route discovery flooding to a cylindrical request zone, which reduces the routing overhead and decreases broadcast storm problems in the MAC layer. It also automatically adjusts the size of the request zone using a self-adaptive algorithm based on Bayes' theorem. This makes WSNHA-LBAR more adaptable to the changes of the network state and easier to implement. Simulation results show improved network reliability as well as reduced routing overhead.

Programs for control of an analog-signal switching network

International Nuclear Information System (INIS)

D'Ottavio, T.; Enriquez, R.; Katz, R.; Skelly, J.

1989-01-01

A suite of programs has been developed to control the network of analog-signal switching multiplexers in the AGS complex. The software is driven by a relational database which describes the architecture of the multiplexer tree and the set of available analog signals. Signals are routed through a three-layer multiplexer tree, to be made available at four consoles each with three 4-trace oscilloscopes. A menu-structured operator interface program is available at each console, to accept requests to route any available analog signal to any of that console's 12 oscilloscope traces. A common routing-server program provides automatic routing-server program provides automatic routing of requested signals through the layers of multiplexers, maintaining a reservation database to denote free and in-use trunks. Expansion of the analog signal system is easily accommodated in software by adding new signals, trunks, multiplexers, or consoles to the database. Programmatic control of the triggering signals for each of the oscilloscopes is also provided. 3 refs., 4 figs., 3 tabs

TASAR Flight Trial 2: Assessment of Air Traffic Controller Acceptability of TASAR Requests

Science.gov (United States)

Idris, Husni; Enea, Gabriele

2016-01-01

In support of the Flight Trial (FT-2) of NASA's prototype of the Traffic Aware Strategic Aircrew Requests (TASAR) concept, observations were conducted at the air traffic facilities to identify and assess the main factors that affect the acceptability of pilot requests by air traffic controllers. Two observers shadowed air traffic controllers at the Atlanta (ZTL) and Jacksonville (ZJX) air traffic control centers as the test flight pilot made pre-scripted requests to invoke acceptability issues and then they interviewed the observed and other controllers voluntarily. Fifty controllers were interviewed with experience ranging from one to thirty-five years. All interviewed controllers were enthusiastic about the technology and accounting for sector boundaries in pilot requests, particularly if pilots can be made aware of high workload situations. All interviewed controllers accept more than fifty percent of pilot requests; forty percent of them reject less than ten percent of requests. The most common reason for rejecting requests is conflicting with traffic followed by violating letters of agreement (LOAs) and negatively impacting neighboring sector workload, major arrival and departure flows and flow restrictions. Thirty-six requests were made during the test, eight of which were rejected due to: the aircraft already handed off to another sector, violating LOA, opposing traffic, intruding into an active special use airspace (SUA), intruding into another center, weather, and unfamiliarity with the requested waypoint. Nine requests were accepted with delay mostly because the controller needed to locate unfamiliar waypoints or to coordinate with other controllers.

The deployment of routing protocols in distributed control plane of SDN.

Science.gov (United States)

Jingjing, Zhou; Di, Cheng; Weiming, Wang; Rong, Jin; Xiaochun, Wu

2014-01-01

Software defined network (SDN) provides a programmable network through decoupling the data plane, control plane, and application plane from the original closed system, thus revolutionizing the existing network architecture to improve the performance and scalability. In this paper, we learned about the distributed characteristics of Kandoo architecture and, meanwhile, improved and optimized Kandoo's two levels of controllers based on ideological inspiration of RCP (routing control platform). Finally, we analyzed the deployment strategies of BGP and OSPF protocol in a distributed control plane of SDN. The simulation results show that our deployment strategies are superior to the traditional routing strategies.

The Deployment of Routing Protocols in Distributed Control Plane of SDN

Directory of Open Access Journals (Sweden)

Zhou Jingjing

2014-01-01

Full Text Available Software defined network (SDN provides a programmable network through decoupling the data plane, control plane, and application plane from the original closed system, thus revolutionizing the existing network architecture to improve the performance and scalability. In this paper, we learned about the distributed characteristics of Kandoo architecture and, meanwhile, improved and optimized Kandoo’s two levels of controllers based on ideological inspiration of RCP (routing control platform. Finally, we analyzed the deployment strategies of BGP and OSPF protocol in a distributed control plane of SDN. The simulation results show that our deployment strategies are superior to the traditional routing strategies.

Least loaded and route fragmentation aware RSA strategies for elastic optical networks

Science.gov (United States)

Batham, Deepak; Yadav, Dharmendra Singh; Prakash, Shashi

2017-12-01

Elastic optical networks (EONs) provide flexibility to assign wide range of spectral resources to the connection requests. In this manuscript, we address two issues related to spectrum assignment in EONs: the non uniform spectrum assignment along different links of the route and the spectrum fragmentation in the network. To address these issues, two routing and spectrum assignment (RSA) strategies have been proposed: Least Loaded RSA (LLRSA) and Route Fragmentation Aware RSA (RFARSA). The LLRSA allocates spectrum homogeneously along different links in the network, where as RFARSA accords priority to the routes which are less fragmented. To highlight the salient features of the two strategies, two new metrics, route fragmentation index (RFI) and standard deviation (SD) are introduced. RFI is defined as the ratio of non-contiguous FSs to the total available free FSs on the route, and SD relates to the measure of non-uniformity in the allocation of resources on the links in the network. A simulation program has been developed to evaluate the performance of the proposed (LLRSA and RFARSA) strategies, and the existing strategies of shortest path RSA (SPRSA) and spectrum compactness based defragmentation (SCD) strategies, on the metric of RFI, bandwidth blocking probability (BBP), network capacity utilized, and SD. The variation in the metrics on the basis of number of requests and the bandwidth (number of FSs) requested has been studied. It has been conclusively established that the proposed strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.

A Traveller Information System: Minimisation of the Number of Graphs’ Nodes Involved When Processing Route Requests

Directory of Open Access Journals (Sweden)

Bendaoud Zakaria

2014-12-01

Full Text Available The number of people using public transport is continuously increasing. Transport companies want to fulfil travellers’ expectations wherever possible. However, the great number of public transport companies operating in the same area can sometimes confuse travellers as to which route they should take and how to obtain the information relative to their journey. In this paper we suggest integrating several traveller information systems from different companies into the same multimodal information system, offering companies the choice not to share their data. This encourages them to join the system. Additionally, we have minimised the number of nodes involved when processing travellers’ requests in order to simplify the calculation process. To put our plan into action, we have opted for a multi-agent system coupled with the Voronoi decomposition for managing the network.

Comparison of MANET routing protocols using a scaled indoor wireless grid

CSIR Research Space (South Africa)

Johnson, DL

2008-04-01

Full Text Available accumulation feature of Dynamic Source Routing (DSR) by adding the accumulated route, back to the source, to the Route Request packet. It retains the destination sequence number feature of AODV but HELLO packets are an optional feature and are normally left... than the inbound traffic as the routing algorithm makes a decision to rebroadcast the packet or not and Figure 20 confirms this. DYMO shows the least amount of routing traffic due to its lack of HELLO packets. This is also due to no further...

Use of action requests to control communications

International Nuclear Information System (INIS)

Brady, J.

1988-01-01

This paper discusses the Plant Information Management System (PIMS) that is implemented at Pacific Gas and Electric Company's (PG and E) Diablo Canyon Power Plant (DCPP). PIMS is implemented on IBM mainframes located at the plant, is on-line and interactive, and is accessed via a computer communication system that supports more than 450 IBM 3270 PC workstations. This paper discusses the role of the ACTION REQUEST module of PIMS and how it is used to control plant sensitive communications. The ACTION REQUEST module of PIMS can be accessed from any workstation and during the first year of Commercial Operation of DCPP replaced numerous and redundant forms of manual communication mechanisms. Also in this first year, users at the plant generated approximately 25,000 Action Requests which were controlled through review and approval cycles by PIMS. Each organization assigned action were immediately notified of their responsibilities so that action could be taken in a timely manner. The Diablo Canyon Power Plant broke Westinghouse world-wide operating records for the first year of operation (over 90% availability) due to a well built and reliable plant and due to a responsive Operations organization, which was well informed and controlled

Short Term Strategies for a Dynamic Multi-Period Routing Problem

NARCIS (Netherlands)

Angelelli, E.; Bianchessi, N.; Mansini, R.; Speranza, M. G.

2009-01-01

We consider a Dynamic Multi-Period Routing Problem (DMPRP) faced by a company which deals with on-line pick-up requests and has to serve them by a fleet of uncapacitated vehicles over a finite time horizon. When a request is issued, a deadline of a given number of days d ≤ 2 is associated to it: if

Topology control of tactical wireless sensor networks using energy efficient zone routing

Directory of Open Access Journals (Sweden)

Preetha Thulasiraman

2016-02-01

Full Text Available The US Department of Defense (DoD routinely uses wireless sensor networks (WSNs for military tactical communications. Sensor node die-out has a significant impact on the topology of a tactical WSN. This is problematic for military applications where situational data is critical to tactical decision making. To increase the amount of time all sensor nodes remain active within the network and to control the network topology tactically, energy efficient routing mechanisms must be employed. In this paper, we aim to provide realistic insights on the practical advantages and disadvantages of using established routing techniques for tactical WSNs. We investigate the following established routing algorithms: direct routing, minimum transmission energy (MTE, Low Energy Adaptive Cluster Head routing (LEACH, and zone clustering. Based on the node die out statistics observed with these algorithms and the topological impact the node die outs have on the network, we develop a novel, energy efficient zone clustering algorithm called EZone. Via extensive simulations using MATLAB, we analyze the effectiveness of these algorithms on network performance for single and multiple gateway scenarios and show that the EZone algorithm tactically controls the topology of the network, thereby maintaining significant service area coverage when compared to the other routing algorithms.

Cognitive process modelling of controllers in en route air traffic control.

Science.gov (United States)

Inoue, Satoru; Furuta, Kazuo; Nakata, Keiichi; Kanno, Taro; Aoyama, Hisae; Brown, Mark

2012-01-01

In recent years, various efforts have been made in air traffic control (ATC) to maintain traffic safety and efficiency in the face of increasing air traffic demands. ATC is a complex process that depends to a large degree on human capabilities, and so understanding how controllers carry out their tasks is an important issue in the design and development of ATC systems. In particular, the human factor is considered to be a serious problem in ATC safety and has been identified as a causal factor in both major and minor incidents. There is, therefore, a need to analyse the mechanisms by which errors occur due to complex factors and to develop systems that can deal with these errors. From the cognitive process perspective, it is essential that system developers have an understanding of the more complex working processes that involve the cooperative work of multiple controllers. Distributed cognition is a methodological framework for analysing cognitive processes that span multiple actors mediated by technology. In this research, we attempt to analyse and model interactions that take place in en route ATC systems based on distributed cognition. We examine the functional problems in an ATC system from a human factors perspective, and conclude by identifying certain measures by which to address these problems. This research focuses on the analysis of air traffic controllers' tasks for en route ATC and modelling controllers' cognitive processes. This research focuses on an experimental study to gain a better understanding of controllers' cognitive processes in air traffic control. We conducted ethnographic observations and then analysed the data to develop a model of controllers' cognitive process. This analysis revealed that strategic routines are applicable to decision making.

RECONFIGURABLE PRODUCT ROUTING AND CONTROL FOR MASS CUSTOMISATION MANUFACTURING

Directory of Open Access Journals (Sweden)

A. J. Walker

2012-01-01

Full Text Available

ENGLISH ABSTRACT:Reconfigurable control of flexible manufacturing systems can allow for the efficient and responsive production of customised product instances. This can aid in providing make-to-order business models for various small- to medium-sized enterprises in South Africa, and provide competitive advantage in a dynamic global marketplace. Reconfigurable control application requires an understanding of the modes of production variability in mass customisation manufacturing. Temporally uncorrelated workflow routings are considered as one of these production variability modes. In this light, this paper addresses the flexible material payload routing problem, and presents a mobile robot platform that has been developed to research and design reconfigurable routing systems.

AFRIKAANSE OPSOMMING:Verstelbare beheer van aanpasbare vervaardigingstelsels kan die doeltreffende en reaktiewe produksie van doelgemaakte produkeksemplare toelaat. Hierdie beheer kan assisteer in die voorsiening van vervaardig-na-bestellingbesigheidsmodelle aan ’n aantal klein- tot medium-grootte ondernemings in Suid-Afrika, en aan hulle ’n kompeterende voorsprong bied in ’n dinamiese globale mark. Die instelling van verstelbare beheer vereis dat die modi van produkveranderlikheid in massa verbruikersaanpassingsvervaardiging verstaan word. Hierdie artikel spreek die probleem van aanpasbare roetebepaling van materiaalvragte in massa verbruikersaanpassingsvervaardiging aan. ’n Mobiele robot-platform, ontwikkel vir navorsing in verstelbare roetebepalingstelsels, word ook voorgelê.

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

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

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

A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR PROTOCOL IN MOBILE AD-HOC NETWORKS

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

Full Text Available Mobile Ad-hoc networks (MANETs involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, but in return has caused this random mobility of the nodes many of the challenges, where the routing is considered one of these challenges. There are many types of routing protocols that operate within MANET networks, which responsible for finding paths between the source and destination nodes with the modernization of these paths which are constantly changing due to the dynamic topology of the network stemming from the constant random movement of the nodes. The DSR (Dynamic Source Routing routing protocol algorithm is one of these routing protocols which consist of two main stages; route discovery and maintenance, where the route discovery algorithm operates based on blind flooding of request messages. blind flooding is considered as the most well known broadcasting mechanism, it is inefficient in terms of communication and resource utilization, which causing increasing the probability of collisions, repeating send several copies of the same message, as well as increasing the delay. Hence, a new mechanism in route discovery stage and in caching the routes in DSR algorithm according to the node's location in the network and the direction of the broadcast is proposed for better performance especially in terms of delay as well as redundant packets rate. The implementation of proposed algorithms showed positive results in terms of delay, overhead, and improve the performance of MANETs in general.

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

Full Text Available 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.

Trust-Based Route Selection in Dynamic Source Routin

DEFF Research Database (Denmark)

Jensen, Christian D.; Connell, Paul O

2006-01-01

in the mobile wireless network. However, blindly trusting all other nodes to respect the routing protocol exposes the local node to a wide variety of vulnerabilities. Traditional security mechanisms rely on either the authenticated identity of the requesting principal or some form of credentials that authorise...

Connectivity-Enhanced Route Selection and Adaptive Control for the Chevrolet Volt: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J.; Wood, E.; Rajagopalan, S.

2014-09-01

The National Renewable Energy Laboratory and General Motors evaluated connectivity-enabled efficiency enhancements for the Chevrolet Volt. A high-level model was developed to predict vehicle fuel and electricity consumption based on driving characteristics and vehicle state inputs. These techniques were leveraged to optimize energy efficiency via green routing and intelligent control mode scheduling, which were evaluated using prospective driving routes between tens of thousands of real-world origin/destination pairs. The overall energy savings potential of green routing and intelligent mode scheduling was estimated at 5% and 3% respectively. These represent substantial opportunities considering that they only require software adjustments to implement.

A Cross-Layer Route Discovery Framework for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Wu Jieyi

2005-01-01

Full Text Available Most reactive routing protocols in MANETs employ a random delay between rebroadcasting route requests (RREQ in order to avoid "broadcast storms." However this can lead to problems such as "next hop racing" and "rebroadcast redundancy." In addition to this, existing routing protocols for MANETs usually take a single routing strategy for all flows. This may lead to inefficient use of resources. In this paper we propose a cross-layer route discovery framework (CRDF to address these problems by exploiting the cross-layer information. CRDF solves the above problems efficiently and enables a new technique: routing strategy automation (RoSAuto. RoSAuto refers to the technique that each source node automatically decides the routing strategy based on the application requirements and each intermediate node further adapts the routing strategy so that the network resource usage can be optimized. To demonstrate the effectiveness and the efficiency of CRDF, we design and evaluate a macrobian route discovery strategy under CRDF.

Development of operator requested control system applications: Experience with the SLC control system at SLAC

International Nuclear Information System (INIS)

Stanek, M.

1995-01-01

The SLC Control system at SLAC has evolved into a powerful tool for operation of the accelerator and for troubleshooting the unique problems encountered in extracting maximum performance from the SLC. The evolution has included the development of many custom applications and user interface features generated from accelerator operator and accelerator physicist requests. These applications are written and maintained primarily by the Controls Software Engineering group, and not by the users themselves. The process of developing and supporting user requested control systems applications at SLAC is described, including the effects of organizational structure, formal and informal procedures, and control system architecture

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

Science.gov (United States)

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.

Flow control and routing techniques for integrated voice and data networks

Science.gov (United States)

Ibe, O. C.

1981-10-01

We consider a model of integrated voice and data networks. In this model the network flow problem is formulated as a convex optimization problem. The objective function comprises two types of cost functions: the congestion cost functions, which limit the average input traffic to values compatible with the network conditions; and the rate limitation cost functions, which ensure that all conversations are fairly treated. A joint flow control and routing algorithm is constructed which determines the routes for each conversation, and effects flow control by setting voice packet lengths and data input rates in a manner that achieves optimal tradeoff between each user's satisfaction and the cost of network congestion. An additional congestion control protocol is specified which could be used in conjunction with the algorithm to make the latter respond more dynamically to network congestion.

Traffic Route Modelling and Assignment with Intelligent Transport System

Directory of Open Access Journals (Sweden)

Kunicina Nadezhda

2014-12-01

Full Text Available The development of signal transmitting environment for multimodal traffic control will enhance the integration of emergency and specialized transport routing tools in usual traffic control paradigms - it is one of the opportunities offered by modern intelligent traffic control systems. The improvement of effective electric power use in public transport system is an advantage of Intelligent Transport System (ITS. The research is connected with the improvement of on-line traffic control and adaptation of special traffic lighting alternatives by ITS. The assignment of the nearest appropriate transport will be done by passenger request, but unlike information system, the transport planning is done on demand. The task can be solved with the help of modern technical methods and equipment, as well as by applying control paradigms of the distributed systems. The problem is solved with the help of calculations hyper-graph and scheduling theory. The goal of the research is to develop methods, which support scheduling of the emergency transport, using high performance computing.

An energy-aware engineered control plane for wavelength-routed networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2015-01-01

' operational expenditures. To face this problem, we propose a single-stage routing and wavelength assignment scheme, based on several network engineering extensions to the Generalised Multi-Protocol Label Switching (GMPLS) control plane protocols, mainly Open Shortest Path First, with new composed metrics...

The equipment access software for a distributed UNIX-based accelerator control system

International Nuclear Information System (INIS)

Trofimov, Nikolai; Zelepoukine, Serguei; Zharkov, Eugeny; Charrue, Pierre; Gareyte, Claire; Poirier, Herve

1994-01-01

This paper presents a generic equipment access software package for a distributed control system using computers with UNIX or UNIX-like operating systems. The package consists of three main components, an application Equipment Access Library, Message Handler and Equipment Data Base. An application task, which may run in any computer in the network, sends requests to access equipment through Equipment Library calls. The basic request is in the form Equipment-Action-Data and is routed via a remote procedure call to the computer to which the given equipment is connected. In this computer the request is received by the Message Handler. According to the type of the equipment connection, the Message Handler either passes the request to the specific process software in the same computer or forwards it to a lower level network of equipment controllers using MIL1553B, GPIB, RS232 or BITBUS communication. The answer is then returned to the calling application. Descriptive information required for request routing and processing is stored in the real-time Equipment Data Base. The package has been written to be portable and is currently available on DEC Ultrix, LynxOS, HPUX, XENIX, OS-9 and Apollo domain. ((orig.))

An algorithm for routing optimization in DiffServ-aware MPLS networks

OpenAIRE

Luigi Atzori; Fabio D'Andreagiovanni; Carlo Mannino; Tatiana Onali

2010-01-01

This paper addresses the constrained-based routing problem in DiffServaware MPLS networks. We consider a dynamic context in which new requests appear over time, asking for reconfigurations of the previous allocation. In the classical approach, a multi-phase heuristic procedure is adopted: the new requests are evaluated considering available bandwidth; if the bandwidth is not sufficient, preemption and rerouting of one or more connections are performed in sequence. As an alternative, we propos...

Preventing Restricted Space Inference in Online Route Planning Services

Directory of Open Access Journals (Sweden)

Florian Dorfmeister

2016-03-01

Full Text Available Online route planning services compute routes from any given location to a desired destination address. Unlike offline implementations, they do so in a traffic-aware fashion by taking into consideration up-to-date map data and real-time traffic information. In return, users have to provide precise location information about a route’s endpoints to a not necessarily trusted service provider. As suchlike leakage of personal information threatens a user’s privacy and anonymity, this paper presents PrOSPR, a comprehensive approach for using current online route planning services in a privacy-preserving way, and introduces the concept of k-immune route requests to avert inference attacks based on restricted space information. Using a map-based approach for creating cloaked regions for the start and destination addresses, our solution queries the online service for routes between subsets of points from these regions. This, however, might result in the returned path deviating from the optimal route. By means of empirical evaluation on a real road network, we demonstrate the feasibility of our approach regarding quality of service and communication overhead.

Colloidal templating : a route towards controlled synthesis of functional polymeric nanoparticles

NARCIS (Netherlands)

Ali, S.I.

2010-01-01

Template-directed synthesis of polymeric nanoparticles offers better control over particle morphology, shape, structure, composition and properties compare to the conventional emulsion polymerization routes. For the production of anisotropic polymer-clay composite latex particles and polymeric

Energy efficient motion control of the electric bus on route

Science.gov (United States)

Kotiev, G. O.; Butarovich, D. O.; Kositsyn, B. B.

2018-02-01

At present, the urgent problem is the reduction of energy costs of urban motor transport. The article proposes a method of solving this problem by developing an energy-efficient law governing the movement of an electric bus along a city route. To solve this problem, an algorithm is developed based on the dynamic programming method. The proposed method allows you to take into account the constraints imposed on the phase coordinates, control action, as well as on the time of the route. In the course of solving the problem, the model of rectilinear motion of an electric bus on a horizontal reference surface is considered, taking into account the assumptions that allow it to be adapted for the implementation of the method. For the formation of a control action in the equations of motion dynamics, an algorithm for changing the traction / braking torque on the wheels of an electric bus is considered, depending on the magnitude of the control parameter and the speed of motion. An optimal phase trajectory was obtained on a selected section of the road for the prototype of an electric bus. The article presents the comparison of simulation results obtained with the optimal energy efficient control law with the results obtained by a test driver. The comparison proved feasibility of the energy efficient control law for the automobile city electric transport.

Overview of the Meraka wireless grid test bed for evaluation of ad-hoc routing protocols

CSIR Research Space (South Africa)

Johnson, D

2007-09-01

Full Text Available to the source, to the Route Request packet. It retains the destination sequence number feature of AODV but HELLO packets are an optional feature and are normally left out by default. It also does away with the gratuitous RREP feature of AODV. Routing... spiral algorithm makes a decision to rebroadcast the packet or not and Fig. 5. confirms this. DYMO shows the least amount of routing traffic due to its lack of HELLO packets. This is also due to no further routing packets being transmitted once...

Analyzing the effect of routing protocols on media access control protocols in radio networks

Energy Technology Data Exchange (ETDEWEB)

Barrett, C. L. (Christopher L.); Drozda, M. (Martin); Marathe, A. (Achla); Marathe, M. V. (Madhav V.)

2002-01-01

We study the effect of routing protocols on the performance of media access control (MAC) protocols in wireless radio networks. Three well known MAC protocols: 802.11, CSMA, and MACA are considered. Similarly three recently proposed routing protocols: AODV, DSR and LAR scheme 1 are considered. The experimental analysis was carried out using GloMoSim: a tool for simulating wireless networks. The main focus of our experiments was to study how the routing protocols affect the performance of the MAC protocols when the underlying network and traffic parameters are varied. The performance of the protocols was measured w.r.t. five important parameters: (i) number of received packets, (ii) average latency of each packet, (iii) throughput (iv) long term fairness and (v) number of control packets at the MAC layer level. Our results show that combinations of routing and MAC protocols yield varying performance under varying network topology and traffic situations. The result has an important implication; no combination of routing protocol and MAC protocol is the best over all situations. Also, the performance analysis of protocols at a given level in the protocol stack needs to be studied not locally in isolation but as a part of the complete protocol stack. A novel aspect of our work is the use of statistical technique, ANOVA (Analysis of Variance) to characterize the effect of routing protocols on MAC protocols. This technique is of independent interest and can be utilized in several other simulation and empirical studies.

Integrated management tool for controls software problems, requests and project tasking at SLAC

International Nuclear Information System (INIS)

Rogind, D.; Allen, W.; Colocho, W.; DeContreras, G.; Gordon, J.; Pandey, P.; Shoaee, H.

2012-01-01

The Accelerator Directorate (AD) Instrumentation and Controls (ICD) Software (SW) Department at SLAC, with its service center model, continuously receives engineering requests to design, build and support controls for accelerator systems lab-wide. Each customer request can vary in complexity from a small software engineering change to a major enhancement. SLAC's Accelerator Improvement Projects (AIPs), along with DOE Construction projects, also contribute heavily to the work load. The various customer requests and projects, paired with the ongoing operational maintenance and problem reports, place a demand on the department that consistently exceeds the capacity of available resources. A centralized repository - comprised of all requests, project tasks, and problems - available to physicists, operators, managers, and engineers alike, is essential to capture, communicate, prioritize, assign, schedule, track, and finally, commission all work components. The Software Department has recently integrated request / project tasking into SLAC's custom online problem tracking 'Comprehensive Accelerator Tool for Enhancing Reliability' (CATER) tool. This paper discusses the newly implemented software request management tool - the workload it helps to track, its structure, features, reports, work-flow and its many usages. (authors)

Blocking Reduction of Span Restoration Requests in GMPLS Controlled WDM Optical Networks

DEFF Research Database (Denmark)

Buron, Jakob Due; Ruepp, Sarah Renée; Andriolli, N.

2006-01-01

The proposed label preference scheme reduces blocking of span restoration requests in GMPLS optical networks with limited wavelength conversion. By minimizing resource contention and conversion usage, it increases recovery percentage and reduces control plane load.......The proposed label preference scheme reduces blocking of span restoration requests in GMPLS optical networks with limited wavelength conversion. By minimizing resource contention and conversion usage, it increases recovery percentage and reduces control plane load....

Route Selection with Unspecified Sites Using Knowledge Based Genetic Algorithm

Science.gov (United States)

Kanoh, Hitoshi; Nakamura, Nobuaki; Nakamura, Tomohiro

This paper addresses the problem of selecting a route to a given destination that traverses several non-specific sites (e.g. a bank, a gas station) as requested by a driver. The proposed solution uses a genetic algorithm that includes viral infection. The method is to generate two populations of viruses as domain specific knowledge in addition to a population of routes. A part of an arterial road is regarded as a main virus, and a road that includes a site is regarded as a site virus. An infection occurs between two points common to a candidate route and the virus, and involves the substitution of the intersections carried by the virus for those on the existing candidate route. Crossover and infection determine the easiest-to-drive and quasi-shortest route through the objective landmarks. Experiments using actual road maps show that this infection-based mechanism is an effective way of solving the problem. Our strategy is general, and can be effectively used in other optimization problems.

Optimization of routing strategies for data transfer in peer-to-peer networks

International Nuclear Information System (INIS)

Morioka, Atsushi; Igarashi, Akito

2014-01-01

Since peer-to-peer file-sharing systems have become familiar recently, the information traffic in the networks is increasing. Therefore it causes various traffic problems in peer-to-peer networks. In this paper, we model some features of the peer-to-peer networks, and investigate the traffic problems. Peer-to-peer networks have two notable characters. One is that each peer frequently searches for a file and download it from a peer who has the requested file. To decide whether a peer has the requested file or not in modelling of the search and download process, we introduce file-parameter P j , which expresses the amount of files stored in peer j. It is assumed that if P j is large, peer j has many files and can meet other peers' requests with high probability. The other character is that peers leave and join into the network repeatedly. Many researchers address traffic problems of data transfer in computer communication networks. To our knowledge, however, no reports focus on those in peer-to-peer networks whose topology changes with time. For routing paths of data transfer, generally, the shortest paths are used in usual computer networks. In this paper, we introduce a new optimal routing strategy which uses weights of peers to avoid traffic congestion. We find that the new routing strategy is superior to the shortest path strategy in terms of congestion frequency in data transfer

Emission control with route optimization in solid waste collection ...

Indian Academy of Sciences (India)

system is used, route distance and route time will be decreased by 24·6% and. 44·3% as ... Keywords. Exhaust emission; route optimization; solid waste collection; GIS, .... Catchment areas for a sales campaign can be analysed. Customers ...

Fuzzy-Neural Controller in Service Requests Distribution Broker for SOA-Based Systems

Science.gov (United States)

Fras, Mariusz; Zatwarnicka, Anna; Zatwarnicki, Krzysztof

The evolution of software architectures led to the rising importance of the Service Oriented Architecture (SOA) concept. This architecture paradigm support building flexible distributed service systems. In the paper the architecture of service request distribution broker designed for use in SOA-based systems is proposed. The broker is built with idea of fuzzy control. The functional and non-functional request requirements in conjunction with monitoring of execution and communication links are used to distribute requests. Decisions are made with use of fuzzy-neural network.

31 CFR 50.8 - Procedure for requesting determinations of controlling influence.

Science.gov (United States)

2010-07-01

... determinations of controlling influence. 50.8 Section 50.8 Money and Finance: Treasury Office of the Secretary of... determinations of controlling influence. (a) An insurer or insurers not having control over another insurer under... controlling influence under § 50.5(c)(4)(i) through (iv) or otherwise to request a determination of...

MQARR-AODV: A NOVEL MULTIPATH QOS AWARE RELIABLE REVERSE ON-DEMAND DISTANCE VECTOR ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORKS

Directory of Open Access Journals (Sweden)

K.G. Santhiya

2012-12-01

Full Text Available MANET (Mobile Ad-hoc Network is an infra structure less wireless ad-hoc network that does not require any basic central control. The topology of the network changes drastically due to very fast mobility of nodes. So an adaptive routing protocol is needed for routing in MANET. AODV (Ad-hoc On-demand Distance Vector routing is the effective and prominent on-demand Ad-hoc routing protocols. During route establishment phase in traditional AODV, only one route reply message will be sent in the reverse path to establish routing path. The high mobility of nodes may affect the reply messages which lead to the retransmission of route request message by the sender which in turn leads to higher communication delay, power consumption and the reduction in the ratio of packets delivered. Sending multiple route reply messages and establishing multiple paths in a single path discovery will reduce the routing overhead involved in maintaining the connection between source and destination nodes. Multipath routing can render high scalability, end-to-end throughput and provide load balancing in MANET. The new proposed novel Multipath QoS aware reliable routing protocol establishes two routes of maximum node disjoint paths and the data transfer is carried out in the two paths simultaneously. To select best paths, the new proposed protocol uses three parameters Link Eminence, MAC overhead and node residual energy. The experimental values prove that the MQARR-AODV protocol achieves high reliability, stability, low latency and outperforms AODV by the less energy consumption, overhead and delay.

Operation Request Gatekeeper: A software system for remote access control of diagnostic instruments in fusion experiments

International Nuclear Information System (INIS)

Abla, G.; Schissel, D. P.; Fredian, T. W.; Stillerman, J. A.; Greenwald, M. J.; Stepanov, D. N.; Ciarlette, D. J.

2010-01-01

Tokamak diagnostic settings are repeatedly modified to meet the changing needs of each experiment. Enabling the remote diagnostic control has significant challenges due to security and efficiency requirements. The Operation Request Gatekeeper (ORG) is a software system that addresses the challenges of remotely but securely submitting modification requests. The ORG provides a framework for screening all the requests before they enter the secure machine zone and are executed by performing user authentication and authorization, grammar validation, and validity checks. A prototype ORG was developed for the ITER CODAC that satisfies their initial requirements for remote request submission and has been tested with remote control of the KSTAR Plasma Control System. This paper describes the software design principles and implementation of ORG as well as worldwide test results.

Practicing more retrieval routes leads to greater memory retention.

Science.gov (United States)

Zheng, Jun; Zhang, Wei; Li, Tongtong; Liu, Zhaomin; Luo, Liang

2016-09-01

A wealth of research has shown that retrieval practice plays a significant role in improving memory retention. The current study focused on one simple yet rarely examined question: would repeated retrieval using two different retrieval routes or using the same retrieval route twice lead to greater long-term memory retention? Participants elaborately learned 22 Japanese-Chinese translation word pairs using two different mediators. Half an hour after the initial study phase, the participants completed two retrieval sessions using either one mediator (Tm1Tm1) or two different mediators (Tm1Tm2). On the final test, which was performed 1week after the retrieval practice phase, the participants received only the cue with a request to report the mediator (M1 or M2) followed by the target (Experiment 1) or only the mediator (M1 or M2) with a request to report the target (Experiment 2). The results of Experiment 1 indicated that the participants who practiced under the Tm1Tm2 condition exhibited greater target retention than those who practiced under the Tm1Tm1 condition. This difference in performance was due to the significant disadvantage in mediator retrieval and decoding of the unpracticed mediator under the Tm1Tm1 condition. Although mediators were provided to participants on the final test in Experiment 2, decoding of the unpracticed mediators remained less effective than decoding of the practiced mediators. We conclude that practicing multiple retrieval routes leads to greater memory retention than focusing on a single retrieval route. Thus, increasing retrieval variability during repeated retrieval practice indeed significantly improves long-term retention in a delay test. Copyright © 2016 Elsevier B.V. All rights reserved.

Demonstration of Optically Controlled re-Routing in a Photonic Crystal Three-Port Switch

DEFF Research Database (Denmark)

Combrié, S.; Heuck, Mikkel; Xavier, S.

2012-01-01

We present an experimental demonstration of optically controlled re-routing of a signal in a photonic crystal cavity-waveguide structure with 3 ports. This represents a key functionality of integrated all-optical signal processing circuits....

"To Control Tibet, First Pacify Kham": Trade Routes and "Official Routes" (Guandao in Easternmost Kham

Directory of Open Access Journals (Sweden)

Patrick Booz

2016-06-01

Full Text Available This article focuses on the trade routes in the western Sichuan borderlands that facilitated contact and trade between Chinese counties and Eastern Tibet. In particular, the article offers a description of “official routes” (guandao—which the Chinese emperor twice proclaimed to be the vital mode of access between China and Tibet—from Chengdu, Sichuan’s provincial capital, to Khampa areas, with Lhasa as the final destination. The exchange of goods in this region followed various routes during different periods. From the tenth to sixteenth centuries, transactions occurred primarily along the borders of Amdo (Tib. A mdo, Northeastern Tibet, but for political, economic, and practical reasons, such exchanges became more limited geographically and eventually focused along the Sichuan–Kham/Ngawa border. Many routes shifted to the towns of Kangding (Tib. Dartsedo and Songpan (Tib. Zungchu, the main sites of distribution, where rich opportunities for trade and a strictly limiting transport geography made them important entrepôts that evolved into centers of prosperity. The geographic range of this article reaches to these two towns and leaves the investigation of the routes that led to western centers such as Derge, Batang, Chamdo, and Jyekundo for future research.

Zone routing in a torus network

Science.gov (United States)

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

2013-01-29

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

METHOD AND ABSTRACT MODEL FOR CONTROL AND ACCESS RIGHTS BY REQUESTS REDIRECTION

Directory of Open Access Journals (Sweden)

K. A. Shcheglov

2015-11-01

Full Text Available We have researched implementation problems of control and access rights of subjects to objects in modern computer systems. We have suggested access control method based on objects access requests redirection. The method possesses a distinctive feature as compared to discretional access control. In case when a subject needs to deny writing (object modification, it is not denied but redirected (access rights are not changed, but operation is performed with another object. This gives the possibility to implement access policies to system objects without breaking the system and applications operability, and share correctly access objects between subjects. This important property of suggested access control method enables to solve fundamentally new system objects securing problems like system resources virtualization aimed to protect system objects from users’ and applications attacks. We have created an abstract model, and it shows that this method (access control from subjects to objects based on requests redirection can be used as self-sufficient access control method, implementing any access control policy (from subjects to objects, thus being an alternative to discretional access control method.

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

Science.gov (United States)

Arneson, Heather M.; Dousse, Nicholas; Langbort, Cedric

2014-01-01

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

Transportation routing analysis geographic information system -- TRAGIS, a multimodal transportation routing tool

International Nuclear Information System (INIS)

Johnson, P.E.

1995-01-01

Over 15 years ago, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Subsequent modifications have been made to enhance each of these models. Some of these changes include population density information for routes, HM-164 routing regulations for highway route controlled quantities of radioactive materials (RAM) truck shipments, and inclusion of waterway routing into INTERLINE. The AIRPORT model, developed 2 years after the HIGHWAY and INTERLINE models, serves as an emergency response tool. This model identifies the nearest airports from a designated location. Currently, the AIRPORT model is inactive. The Transportation Management Division of the US Department of Energy held a Baseline Requirements Assessment Session on the HIGHWAY, INTERLINE, and AIRPORT models in April 1994 to bring together many users of these models and other experts in the transportation routing field to discuss these models and to decide on the capabilities that needed to be added. Of the many needs discussed, the primary one was to have the network databases within a geographic information system (GIS). As a result of the Baseline Requirements Session, the development of a new GIS model has been initiated. This paper will discuss the development of the new Transportation Routing Analysis GIS (TRAGIS) model at ORNL

Randomised controlled trial of routine individual feedback to improve rationality and reduce numbers of test requests.

Science.gov (United States)

Winkens, R A; Pop, P; Bugter-Maessen, A M; Grol, R P; Kester, A D; Beusmans, G H; Knottnerus, J A

1995-02-25

Feedback can be described as a way to provide information on doctors' performance to enable changes in future behaviour. Feedback is used with the aim of changing test-ordering behaviour. It can lead to reductions in test usage and cost savings. It is not sufficiently clear, however, whether feedback leads to more appropriate test use. Since 1985, the Diagnostic Coordinating Center Maastricht has been giving feedback on diagnostic tests as a routine health care activity to all family doctors in its region. Both quantity and quality of requests are discussed. In a randomised, controlled trial over 2.5 years, discussion of tests not included previously was added to the existing routine feedback. One group of family doctors (n = 39) received feedback on test-group A (electrocardiography, endoscopy, cervical smears, and allergy tests), the other (n = 40) on test-group B (radiographic and ultrasonographic tests). Thus, each group of doctors acted as a control group for the other. Changes in volume and rationality of requests were analysed. The number of requests decreased during the trial (p = 0.036). Request numbers decreased particularly for test-group A (p = 0.04). The proportion of requests that were non-rational decreased more in the intervention than in the control groups (p = 0.009). Rationality improved predominantly for test-group B (p = 0.043). Thus, routine feedback can change the quantity and quality of requests.

RoCoMAR: Robots' Controllable Mobility Aided Routing and Relay Architecture for Mobile Sensor Networks

Science.gov (United States)

Van Le, Duc; Oh, Hoon; Yoon, Seokhoon

2013-01-01

In a practical deployment, mobile sensor network (MSN) suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots' Controllable Mobility Aided Routing) that uses robotic nodes' controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay. PMID:23881134

RoCoMAR: Robots’ Controllable Mobility Aided Routing and Relay Architecture for Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Seokhoon Yoon

2013-07-01

Full Text Available In a practical deployment, mobile sensor network (MSN suffers from a low performance due to high node mobility, time-varying wireless channel properties, and obstacles between communicating nodes. In order to tackle the problem of low network performance and provide a desired end-to-end data transfer quality, in this paper we propose a novel ad hoc routing and relaying architecture, namely RoCoMAR (Robots’ Controllable Mobility Aided Routing that uses robotic nodes’ controllable mobility. RoCoMAR repeatedly performs link reinforcement process with the objective of maximizing the network throughput, in which the link with the lowest quality on the path is identified and replaced with high quality links by placing a robotic node as a relay at an optimal position. The robotic node resigns as a relay if the objective is achieved or no more gain can be obtained with a new relay. Once placed as a relay, the robotic node performs adaptive link maintenance by adjusting its position according to the movements of regular nodes. The simulation results show that RoCoMAR outperforms existing ad hoc routing protocols for MSN in terms of network throughput and end-to-end delay.

75 FR 61785 - Proposed Collection; Comment Request for Review of a Revised Information Collection: (OMB Control...

Science.gov (United States)

2010-10-06

... Information Collection: (OMB Control No. 3206-0201; Federal Employees Health Benefits (FEHB) Open Season... collection, ``Federal Employees Health Benefits (FEHB) Open Season Express Interactive Voice Response (IVR... other insurance information for self and family enrollments, requesting plan brochures, requesting a...

76 FR 7196 - California State Nonroad Engine Pollution Control Standards; Request for Authorization of...

Science.gov (United States)

2011-02-09

... ENVIRONMENTAL PROTECTION AGENCY [FRL-9264-4] California State Nonroad Engine Pollution Control Standards; Request for Authorization of Airborne Toxic Control Measure for In-Use Portable Diesel Engines 50... for In-Use Strategies to Control Emissions from Diesel Engines,'' 13 California Code of Regulations...

Traffic restrictions on Routes Bloch, Maxwell and Bohr

CERN Multimedia

IT Department

2008-01-01

Excavation and pipework is being carried out in the framework of the transfer of the waste water treatment plant for the effluents from the surface treatment workshops from Building 254 to Building 676, currently under construction. This work may encroach onto Routes Bloch, Maxwell and Bohr and disrupt the flow of traffic. Users are requested to comply with the road signs that will be erected. The work is expected to last until the beginning of December 2008. Thank you for your understanding. TS/CE and TS/FM Groups Tel.7 4188 or 16 4314

Reasons for requesting emergency contraception: a survey of 506 Italian women.

Science.gov (United States)

Bastianelli, C; Farris, M; Benagiano, G

2005-09-01

To evaluate the reason for requesting emergency contraception (EC), previous use of contraceptive methods and provision route in a Family Planning Clinic in Italy. Women requesting EC were interviewed, through a questionnaire containing questions on demographic characteristics, about their reasons for requesting EC, their prior contraceptive use, their reasons for not using an effective contraceptive method (or possible reasons for its failure) and specifically about the so-called 'provision route' (i.e. whether and where they had previously requested EC receiving a negative response). Almost 70% of all women requesting EC were aged between 18 and 25 years. Some 80% of all women were in a stable relationship with their partner, with fewer than 20% having had an occasional intercourse. The vast majority of women (83%) reported prior use of a modern contraceptive method, i.e. 64% with a condom, 27% for combined oral contraceptives and 1.1% for the intrauterine device (IUD). In addition, 15% of the women had used more than one method (oral pills and condoms). Concerning the reasons for requesting EC, condom breakage or slipping was the most frequently cited (64%), followed by totally unprotected intercourse (28%), failed withdrawal (5%) and forgetting one or more pill (only 1.1%). More than one-third of the women interviewed had previously used an emergency contraceptive modality; although no one did so more than four times. Therefore, it can be inferred that-at least in the present series-EC had not been used as a routine contraceptive method. Finally, it seems clear that in Italy, even in large cities, information about the availability, proper usage and mechanism of action is lacking. This seems due to information being spread by word of mouth between peers and friends, with more formal communication channels lagging behind.

78 FR 46332 - Proposed Information Collection Request; Comment Request; National Estuary Program

Science.gov (United States)

2013-07-31

... Request; Comment Request; National Estuary Program AGENCY: Environmental Protection Agency (EPA). ACTION... request (ICR), ``National Estuary Program'' (EPA ICR No. 1500.08, OMB Control No. 2040-0138 to the Office... comments to OMB. Abstract: The National Estuary Program (NEP) involves collecting information from the...

OSPF-TE Extensions for Green Routing in Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, S.; Fagertun, Anna Manolova

2012-01-01

This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing.......This paper proposes extensions to the OSPF-TE protocol to enable green routing in GMPLS-controlled optical networks. Simulation results show a remarkable reduction in CO2 emissions by preferring network elements powered by green energy sources in the connection routing....

En route position and time control of aircraft using Kalman filtering of radio aid data

Science.gov (United States)

Mcgee, L. A.; Christensen, J. V.

1973-01-01

Fixed-time-of-arrival (FTA) guidance and navigation is investigated as a possible technique capable of operation within much more stringent en route separation standards and offering significant advantages in safety, higher traffic densities, and improved scheduling reliability, both en route and in the terminal areas. This study investigated the application of FTA guidance previously used in spacecraft guidance. These FTA guidance techniques have been modified and are employed to compute the velocity corrections necessary to return an aircraft to a specified great-circle reference path in order to exercise en route time and position control throughout the entire flight. The necessary position and velocity estimates to accomplish this task are provided by Kalman filtering of data from Loran-C, VORTAC/TACAN, Doppler radar, radio or barometric altitude,and altitude rate. The guidance and navigation system was evaluated using a digital simulation of the cruise phase of supersonic and subsonic flights between San Francisco and New York City, and between New York City and London.

Aircraft route forecasting under adverse weather conditions

Directory of Open Access Journals (Sweden)

Thomas Hauf

2017-04-01

Full Text Available In this paper storm nowcasts in the terminal manoeuvring area (TMA of Hong Kong International Airport are used to forecast deviation routes through a field of storms for arriving and departing aircraft. Storms were observed and nowcast by the nowcast system SWIRLS from the Hong Kong Observatory. Storms were considered as no-go zones for aircraft and deviation routes were determined with the DIVSIM software package. Two days (21 and 22 May 2011 with 22 actual flown routes were investigated. Flights were simulated with a nowcast issued at the time an aircraft entered the TMA or departed from the airport. These flights were compared with a posteriori simulations, in which all storm fields were known and circumnavigated. Both types of simulated routes were then compared with the actual flown routes. The qualitative comparison of the various routes revealed generally good agreement. Larger differences were found in more complex situations with many active storms in the TMA. Route differences resulted primarily from air traffic control measures imposed such as holdings, slow-downs and shortcuts, causing the largest differences between the estimated and actual landing time. Route differences could be enhanced as aircraft might be forced to circumnavigate a storm ahead in a different sense. The use of route forecasts to assist controllers coordinating flights in a complex moving storm field is discussed. The study emphasises the important application of storm nowcasts in aviation meteorology.

Design and Operational Evaluation of the Traffic Management Advisor at the Ft. Worth Air Route Traffic Control Center

Science.gov (United States)

Swenson, Harry N.; Vincent, Danny; Tobias, Leonard (Technical Monitor)

1997-01-01

NASA and the FAA have designed and developed and an automation tool known as the Traffic Management Advisor (TMA). The system was operationally evaluated at the Ft. Worth Air Route Traffic Control Center (ARTCC). The TMA is a time-based strategic planning tool that provides Traffic Management Coordinators and En Route Air Traffic Controllers the ability to efficiently optimize the capacity of a demand impacted airport. The TMA consists of trajectory prediction, constraint-based runway scheduling, traffic flow visualization and controllers advisories. The TMA was used and operationally evaluated for forty-one rush traffic periods during a one month period in the Summer of 1996. The evaluations included all shifts of air traffic operations as well as periods of inclement weather. Performance data was collected for engineering and human factor analysis and compared with similar operations without the TMA. The engineering data indicates that the operations with the TMA show a one to two minute per aircraft delay reduction during rush periods. The human factor data indicate a perceived reduction in en route controller workload as well as an increase in job satisfaction. Upon completion of the evaluation, the TMA has become part of the normal operations at the Ft. Worth ARTCC.

Highway and interline transportation routing models

International Nuclear Information System (INIS)

Joy, D.S.; Johnson, P.E.

1994-01-01

The potential impacts associated with the transportation of hazardous materials are important issues to shippers, carriers, and the general public. Since transportation routes are a central characteristic in most of these issues, the prediction of likely routes is the first step toward the resolution of these issues. In addition, US Department of Transportation requirements (HM-164) mandate specific routes for shipments of highway controlled quantities of radioactive materials. In response to these needs, two routing models have been developed at Oak Ridge National Laboratory under the sponsorship of the U.S. Department of Energy (DOE). These models have been designated by DOE's Office of Environmental Restoration and Waste Management, Transportation Management Division (DOE/EM) as the official DOE routing models. Both models, HIGHWAY and INTERLINE, are described

Cooperative Optimization QoS Cloud Routing Protocol Based on Bacterial Opportunistic Foraging and Chemotaxis Perception for Mobile Internet

Directory of Open Access Journals (Sweden)

Shujuan Wang

2015-01-01

Full Text Available In order to strengthen the mobile Internet mobility management and cloud platform resources utilization, optimizing the cloud routing efficiency is established, based on opportunistic bacterial foraging bionics, and puts forward a chemotaxis perception of collaborative optimization QoS (Quality of Services cloud routing mechanism. The cloud routing mechanism is based on bacterial opportunity to feed and bacterial motility and to establish the data transmission and forwarding of the bacterial population behavior characteristics. This mechanism is based on the characteristics of drug resistance of bacteria and the structure of the field, and through many iterations of the individual behavior and population behavior the bacteria can be spread to the food gathering area with a certain probability. Finally, QoS cloud routing path would be selected and optimized based on bacterial bionic optimization and hedge mapping relationship between mobile Internet node and bacterial population evolution iterations. Experimental results show that, compared with the standard dynamic routing schemes, the proposed scheme has shorter transmission delay, lower packet error ratio, QoS cloud routing loading, and QoS cloud route request overhead.

Study of QoS control and reliable routing method for utility communication network. Application of differentiated service to the network and alternative route establishment by the IP routing protocol; Denryokuyo IP network no QoS seigyo to shinraisei kakuho no hoho. DiffServ ni yoru QoS seigyo no koka to IP ni yoru fuku root ka no kento

Energy Technology Data Exchange (ETDEWEB)

Oba, E.

2000-05-01

QoS control method which satisfies utilities communication network requirement and alternative route establishment method which is for sustaining communication during a failure are studied. Applicability of DiffServ (Differentiated Service), one of the most promising QoS control method on IP network and studying energetically in IETF WG, is studied and it is found most application used in the utility communication network except for relaying system information could he accommodated to the DiffServ network. An example of the napping of the utility communication applications to the DiffServ PHB (Per Hop Behavior) is shown in this paper. Regarding to the alternative route, usual IP routing protocol cannot establish alternative route which doesn't have common links and nodes in their paths for a destination. IP address duplication with some modification of routing protocol enables such alternative route establishment. MPLS, distance vector algorithm and link state algorithm are evaluated qualitatively, and as a result, we found MPLS is promising way to establish the route. Quantitative evaluation will be future work. (author)

40 CFR 63.1034 - Closed vent systems and control devices; or emissions routed to a fuel gas system or process...

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 10 2010-07-01 2010-07-01 false Closed vent systems and control devices; or emissions routed to a fuel gas system or process standards. 63.1034 Section 63.1034 Protection... routed to a fuel gas system or process standards. (a) Compliance schedule. The owner or operator shall...

Crystallization engineering as a route to epitaxial strain control

Directory of Open Access Journals (Sweden)

Andrew R. Akbashev

2015-10-01

Full Text Available The controlled synthesis of epitaxial thin films offers opportunities for tuning their functional properties via enabling or suppressing strain relaxation. Examining differences in the epitaxial crystallization of amorphous oxide films, we report on an alternate, low-temperature route for strain engineering. Thin films of amorphous Bi–Fe–O were grown on (001SrTiO3 and (001LaAlO3 substrates via atomic layer deposition. In situ X-ray diffraction and X-ray photoelectron spectroscopy studies of the crystallization of the amorphous films into the epitaxial (001BiFeO3 phase reveal distinct evolution profiles of crystallinity with temperature. While growth on (001SrTiO3 results in a coherently strained film, the same films obtained on (001LaAlO3 showed an unstrained, dislocation-rich interface, with an even lower temperature onset of the perovskite phase crystallization than in the case of (001SrTiO3. Our results demonstrate how the strain control in an epitaxial film can be accomplished via its crystallization from the amorphous state.

78 FR 69664 - Proposed Information Collection Request; Comment Request; Approval of State Coastal Nonpoint...

Science.gov (United States)

2013-11-20

... Collection Request; Comment Request; Approval of State Coastal Nonpoint Pollution Control Programs AGENCY... to submit an information collection request (ICR), ``Approval of State Coastal Nonpoint Pollution... Watershed Protection Division, Office of Wetlands Oceans and Watersheds, Mail Code 4503-T, Environmental...

Performance of clustering techniques for solving multi depot vehicle routing problem

Directory of Open Access Journals (Sweden)

Eliana M. Toro-Ocampo

2016-01-01

Full Text Available The vehicle routing problem considering multiple depots is classified as NP-hard. MDVRP determines simultaneously the routes of a set of vehicles and aims to meet a set of clients with a known demand. The objective function of the problem is to minimize the total distance traveled by the routes given that all customers must be served considering capacity constraints in depots and vehicles. This paper presents a hybrid methodology that combines agglomerative clustering techniques to generate initial solutions with an iterated local search algorithm (ILS to solve the problem. Although previous studies clustering methods have been proposed like strategies to generate initial solutions, in this work the search is intensified on the information generated after applying the clustering technique. Besides an extensive analysis on the performance of techniques, and their effect in the final solution is performed. The operation of the proposed methodology is feasible and effective to solve the problem regarding the quality of the answers and computational times obtained on request evaluated literature

Quantum optics. All-optical routing of single photons by a one-atom switch controlled by a single photon.

Science.gov (United States)

Shomroni, Itay; Rosenblum, Serge; Lovsky, Yulia; Bechler, Orel; Guendelman, Gabriel; Dayan, Barak

2014-08-22

The prospect of quantum networks, in which quantum information is carried by single photons in photonic circuits, has long been the driving force behind the effort to achieve all-optical routing of single photons. We realized a single-photon-activated switch capable of routing a photon from any of its two inputs to any of its two outputs. Our device is based on a single atom coupled to a fiber-coupled, chip-based microresonator. A single reflected control photon toggles the switch from high reflection (R ~ 65%) to high transmission (T ~ 90%), with an average of ~1.5 control photons per switching event (~3, including linear losses). No additional control fields are required. The control and target photons are both in-fiber and practically identical, making this scheme compatible with scalable architectures for quantum information processing. Copyright © 2014, American Association for the Advancement of Science.

78 FR 49730 - Collection of Information; Proposed Extension of Approval; Comment Request-Publicly Available...

Science.gov (United States)

2013-08-15

... to the information collection: Reports of harm, manufacturer comments, branding information, and the... business portal for such requests. Branding Information: Using the business portal, registered businesses may voluntarily submit branding information to assist CPSC in correctly and timely routing reports of...

New Hybrid Route to Biomimetic Synthesis

National Research Council Canada - National Science Library

Morse, Daniel

2003-01-01

To develop economical low-temperature routes to biomimetic synthesis of high-performance composite materials, with control of composition and structure based on the molecular mechanisms controlling...

Dimensions of Air Traffic Control Tower Information Needs: From Information Requests to Display Design

Science.gov (United States)

Durso, Francis T.; Johnson, Brian R.; Crutchfield, Jerry M.

2010-01-01

In an effort to determine the information needs of tower air traffic controllers, instructors from the Federal Aviation Administration's Academy in Oklahoma City were asked to control traffic in a high-fidelity tower cab simulator. Information requests were made apparent by eliminating access to standard tower information sources. Instead,…

Research on Strategy Control of Taxi Carpooling Detour Route under Uncertain Environment

Directory of Open Access Journals (Sweden)

Wei Zhang

2016-01-01

Full Text Available For the problem of route choice in taxi carpooling detour, considering the uncertainty of traffic and the characteristic of passengers’ noncomplete rationality, an evolutionary game model of taxi carpooling detour route is built, in which prospect theory is introduced and revenue of strategy is replaced by prospect value. The model reflects more really decision-making psychology of passengers. Then the stable strategies of the model are studied, and the influences of detour distance and traffic congestion on detour carpooling success are analyzed, respectively. The results show that when at least one route of which prospect values for two passenger sides are both positive exists, carpooling route can reach an agreement. The route is stable strategy of evolutionary game, and the passengers requiring short travel time tend to select the nondetour route. With the increase of detour distance and traffic congestion rate, the possibility of reaching an agreement decreases gradually; that is, possibility of carpooling failure increases. So taxi carpooling detour is possible under the certain condition, but some measures must be carried out such as constraints of detour distance and mitigation of traffic congestion to improve carpooling success probability. These conclusions have a certain guiding significance to the formulation of taxi carpooling policy.

Whirlpool routing for mobility

KAUST Repository

Lee, Jung Woo

2010-01-01

We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP\\'s design is that data traffic can use an existing routing gradient to efficiently probe the topology, repair the routing gradient, and communicate these repairs to nearby nodes. Using simulation, controlled testbeds, and real mobility experiments, we find that using the data plane for topology maintenance is highly effective due to the incremental nature of mobility updates. WARP leverages the fact that converging flows at a destination make the destination have the region of highest traffic. We provide a theoretical basis for WARP\\'s behavior, defining an "update area" in which the topology must adjust when a destination moves. As long as packets arrive at a destination before it moves outside of the update area, WARP can repair the topology using the data plane. Compared to existing protocols, such as DYMO and HYPER, WARP\\'s packet drop rate is up to 90% lower while sending up to 90% fewer packets.

FAA Alleged Waste and Mismanagement of Air Route Traffic Control Centers Critical and Essential Power Systems Project

Science.gov (United States)

1996-10-16

The Office of Inspector General (OIG) reviewed a complaint from Congressman Deal on behalf of a constituent. The constituent alleged waste and mismanagement occurred in the Federal Aviation Administration (FAA) Air Route Traffic Control Centers Criti...

A Novel Load Balancing Scheme for Multipath Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Kokilamani Mounagurusamy

2016-09-01

Full Text Available The recent advancements in information and communication technology create a great demand for multipath routing protocols. In MANET, nodes can be arbitrarily located and can move freely at any given time. The topology of MANET can change rapidly and unpredictably. Because wireless link capacities are usually limited, congestion is possible in MANETs. Hence, balancing the load in a MANET is important since nodes with high load will deplete their batteries quickly, thereby increasing the probability of disconnecting or partitioning the network. To overcome these, the multipath protocol should be aware of load at route discovery phase. The main objective of the proposed article is to balance the load on a node and to extend the lifetime of the node due to the congestion, energy depletion and link failures. This article describes a novel load and congestion aware scheme called Path Efficient Ad-hoc On-demand Multipath Distance Vector (PE-AOMDV protocol to increase the performance of routing process in MANET in terms of congestion, end-to-end delay and load balancing. A new threshold value and a counter variable are introduced to limit the number of communication paths passing over a node in route discovery phase. For every new request the counter variable is incremented by one and the threshold value is compared to see whether the maximum number of connections has been reached or not. The proposed method is network simulator ns-2 and it is found that there is a significant improvement in the proposed scheme. It reduces the energy consumption, average end-to-end delay and normalized routing overhead. Also the proposed scheme increases packet delivery ratio, throughput and minimizes routing overheads.

Towards the Engineering of Dependable P2P-Based Network Control — The Case of Timely Routing Control Messages

Science.gov (United States)

Tutschku, Kurt; Nakao, Akihiro

This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.

Label-controlled optical packet routing technologies and applications

DEFF Research Database (Denmark)

Koonen, A.M.J.; Yan, N.; Vegas Olmos, Juan José

2007-01-01

An overview is given of various optical packet labeling techniques. The architecture and technologies are discussed for optical packet routing nodes using orthogonal labeling with optoelectronic label processing, and for nodes using time-serial labeling with all-optical time-serial label processing...

On Energy-Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Poor HVincent

2007-01-01

Full Text Available A hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection is also investigated, and it is shown that the use of multiuser detection can increase the capacity of the ad hoc network significantly for a given level of energy consumption.

On Energy-Efficient Hierarchical Cross-Layer Design: Joint Power Control and Routing for Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Cristina Comaniciu

2007-03-01

Full Text Available A hierarchical cross-layer design approach is proposed to increase energy efficiency in ad hoc networks through joint adaptation of nodes' transmitting powers and route selection. The design maintains the advantages of the classic OSI model, while accounting for the cross-coupling between layers, through information sharing. The proposed joint power control and routing algorithm is shown to increase significantly the overall energy efficiency of the network, at the expense of a moderate increase in complexity. Performance enhancement of the joint design using multiuser detection is also investigated, and it is shown that the use of multiuser detection can increase the capacity of the ad hoc network significantly for a given level of energy consumption.

Route planning module as a part of Supply Chain Management system

Directory of Open Access Journals (Sweden)

Michal Košíček

2012-01-01

Full Text Available Today, the demand for creating a systematic approach for managing sales, ordering, and logistics has increased. Supply Chain Management (SCM is one of the responses to problems that have arose with the need for managing complex supply chains. Nowadays, most of the activities of Supply Chain Management is realized or supported with computing technologies. Route planning is an important part of Supply Chain Management related to both procurement and distribution. Route planning systems specify the sequences in which the selected transport vehicles should supply the demand points by requested quantities of goods at the right time. The paper is focused on the analysis of a route planning system which could be used as a part of Supply Chain Management information system or as a standalone application. It describes basic techniques and frameworks of transportation problems as well as important functional requirements, considering recent trends in the field of distribution planning. As a result, functional specification of basic features and other components of system are provided. The paper is a result of a joint initiative of the authors and a vendor of business information systems.

RSRP: A Robust Secure Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Sinha Ditipriya

2014-05-01

Full Text Available In this paper, we propose a novel algorithm RSRP to build a robust secure routing protocol in mobile ad-hoc networks (MANETs. This algorithm is based on some basic schemes such as RSA_CRT for encryption and decryption of messages; CRT for safety key generation, Shamir’s secret sharing principle for generation of secure routes. Those routes which are free from any malicious node and which belong to the set of disjoint routes between a source-destination pair are considered as probable routes. Shamir’s secret sharing principle is applied on those probable routes to obtain secure routes. Finally, most trustworthy and stable route is selected among those secure routes. Selection of the final route depends on some criteria of the nodes present in a route e.g.: battery power, mobility and trust value. In addition, complexity of key generation is reduced to a large extent by using RSA-CRT instead of RSA. In turn, the routing becomes less expensive and most secure and robust one. Performance of this routing protocol is then compared with non-secure routing protocols (AODV and DSR, secure routing scheme using secret sharing, security routing protocol using ZRP and SEAD depending on basic characteristics of these protocols. All such comparisons show that RSRP shows better performance in terms of computational cost, end-to-end delay and packet dropping in presence of malicious nodes in the MANET, keeping the overhead in terms of control packets same as other secure routing protocols.

75 FR 14455 - Notice of Proposed Information Collection: Comment Request; Request Voucher for Grant Payment and...

Science.gov (United States)

2010-03-25

... Information Collection: Comment Request; Request Voucher for Grant Payment and Line of Credit Control System... Notice also lists the following information: Title of proposal: Request Voucher for Grant Payment and..., if applicable: 2535-0102. Description of the need for the information and proposed use: Payment...

Simulation of Controller Pilot Data Link Communications over VHF Digital Link Mode 3

Science.gov (United States)

Bretmersky, Steven C.; Murawski, Robert; Nguyen, Thanh C.; Raghavan, Rajesh S.

2004-01-01

The Federal Aviation Administration (FAA) has established an operational plan for the future Air Traffic Management (ATM) system, in which the Controller Pilot Data Link Communications (CPDLC) is envisioned to evolve into digital messaging that will take on an ever increasing role in controller to pilot communications, significantly changing the way the National Airspace System (NAS) is operating. According to FAA, CPDLC represents the first phase of the transition from the current analog voice system to an International Civil Aviation Organization (ICAO) compliant system in which digital communication becomes the alternate and perhaps primary method of routine communication. The CPDLC application is an Air Traffic Service (ATS) application in which pilots and controllers exchange messages via an addressed data link. CPDLC includes a set of clearance, information, and request message elements that correspond to existing phraseology employed by current Air Traffic Control (ATC) procedures. These message elements encompass altitude assignments, crossing constraints, lateral deviations, route changes and clearances, speed assignments, radio frequency assignments, and various requests for information. The pilot is provided with the capability to respond to messages, to request clearances and information, to report information, and to declare/rescind an emergency. A 'free text' capability is also provided to exchange information not conforming to defined formats. This paper presents simulated results of the aeronautical telecommunication application Controller Pilot Data Link Communications over VHF Digital Link Mode 3 (VDL Mode 3). The objective of this simulation study was to determine the impact of CPDLC traffic loads, in terms of timely message delivery and capacity of the VDL Mode 3 subnetwork. The traffic model is based on and is used for generating air/ground messages with different priorities. Communication is modeled for the en route domain of the Cleveland

Programmable Logic Controllers for Research on the Cyber Security of Industrial Power Plants

Science.gov (United States)

2017-02-12

any commercial carriers for shipment of the Goods . WESCO will use its reasonable efforts to comply with Buyer’s requests as to method and route of...and includes a small electrical substation control environment. The lab has already been used to support the research of the PI and his student ...large gToup of gTaduate and undergTadnatc students . The PI is also dcvclopiug a course on control systems security, and t lms wi ll use the lab to

Generating Heat Maps of Popular Routes Online from Massive Mobile Sports Tracking Application Data in Milliseconds While Respecting Privacy

Directory of Open Access Journals (Sweden)

Jani Sainio

2015-09-01

Full Text Available The breakthrough of GPS-equipped smartphones has enabled the collection of track data from human mobility on massive scales that can be used in route recommendation, urban planning and traffic management. In this work we present a fast map server that can generate and visualize heat maps of popular routes online from massive sports track data based on client preferences, e.g., running routes lasting less than an hour. The heat maps shown respect user privacy by not showing routes with less than a predefined number of different users, for instance five. The results are represented to the client using a dynamic tile layer. The current implementation uses data collected by the Sports Tracker mobile application with over 800,000 different tracks and 2.8 billion GPS data points. Stress tests indicate that the server can handle hundreds of simultaneous client requests in a single server configuration.

31 CFR 1.5 - Specific requests for other records.

Science.gov (United States)

2010-07-01

... balance due. (c) Requests for records not in control of bureau; referrals; consultations. (1) When a... to the requester. (2) This subpart applies only to records in the possession or control of the bureau... determination. (v) “Other” Requester. This refers to a requester who does not fall within any of the previously...

JISCARD GUI, a graphical interface application for simple and quick calculation of aviation route doses

International Nuclear Information System (INIS)

Andersson, Martin; Ryufuku, Susumu; Yasuda, Hiroshi

2011-01-01

Pilots, flight attendants, and passengers aboard jet aircrafts are subjected to higher cosmic radiation levels at high altitude than on the ground. Additional dose, received during flight is called 'aviation route dose'. Addressing the needs for precise and easy determination of aviation route doses (Sv), the authors have developed a new application 'JISCARD GUI' with a graphical user interface which provides dose rate (Sv/h) distribution along a flight route and aviation route dose. The graphical interface made with Adobe Flash provide functions to select airports on dynamic map or to search by airport/city names, and to report resulting aviation route doses and graphs of dose rate change through a flight. Dose rate data at several cut off rigidity, Rc and force field potential, FFP were calculated in advance using a PHITS-based analytical model and stored in the server as matrix data. Upon user's request of departure/arrival airports and flight date, interpolation using matrix data substantiates derivation of dose rate distribution in a simple and quick manner with sufficient accuracy. Precision of the dose calculation was verified by comparison with JISCARD EX (MS-Excel version) released in September 2008. This advanced application will be open to public through the website of the National Institute of Radiological Sciences in the near future. (author)

Maritime routing and speed optimization with emission control areas

DEFF Research Database (Denmark)

Fagerholt, Kjetil; Gausel, Nora T.; Rakke, Jørgen G.

2015-01-01

a computational study on a number of realistic shipping routes in order to evaluate possible impacts on sailing paths and speeds, and hence fuel consumption and costs, from the ECA regulations. Moreover, the aim is to examine the implications for the society with regards to environmental effects. Comparisons...... of cases show that a likely effect of the regulations is that ship operators will often choose to sail longer distances to avoid sailing time within ECAs. Another effect is that they will sail at lower speeds within and higher speeds outside the ECAs in order to use less of the more expensive fuel. On some......Strict limits on the maximum sulphur content in fuel used by ships have recently been imposed in some Emission Control Areas (ECAs). In order to comply with these regulations many ship operators will switch to more expensive low-sulphur fuel when sailing inside ECAs. Since they are concerned about...

Dynamic routing and spectrum assignment based on multilayer virtual topology and ant colony optimization in elastic software-defined optical networks

Science.gov (United States)

Wang, Fu; Liu, Bo; Zhang, Lijia; Zhang, Qi; Tian, Qinghua; Tian, Feng; Rao, Lan; Xin, Xiangjun

2017-07-01

Elastic software-defined optical networks greatly improve the flexibility of the optical switching network while it has brought challenges to the routing and spectrum assignment (RSA). A multilayer virtual topology model is proposed to solve RSA problems. Two RSA algorithms based on the virtual topology are proposed, which are the ant colony optimization (ACO) algorithm of minimum consecutiveness loss and the ACO algorithm of maximum spectrum consecutiveness. Due to the computing power of the control layer in the software-defined network, the routing algorithm avoids the frequent link-state information between routers. Based on the effect of the spectrum consecutiveness loss on the pheromone in the ACO, the path and spectrum of the minimal impact on the network are selected for the service request. The proposed algorithms have been compared with other algorithms. The results show that the proposed algorithms can reduce the blocking rate by at least 5% and perform better in spectrum efficiency. Moreover, the proposed algorithms can effectively decrease spectrum fragmentation and enhance available spectrum consecutiveness.

Route-external and route-internal landmarks in route descriptions : Effects of route length and map design

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

Landmarks are basic ingredients in route descriptions. They often mark choice points: locations where travellers choose from different options how to continue the route. This study focuses on one of the loose ends in the taxonomy of landmarks. In a memory-based production experiment in which

Do familiar teammates request and accept more backup? Transactive memory in air traffic control.

Science.gov (United States)

Smith-Jentsch, Kimberly A; Kraiger, Kurt; Cannon-Bowers, Janis A; Salas, Eduardo

2009-04-01

The present study investigated factors that explain when and why different groups of teammates are more likely to request and accept backup from one another when needed in an environment characterized by extreme time pressure and severe consequences of error: commercial air traffic control (ATC). Transactive memory theory states that teammates develop consensus regarding the distribution of their relative expertise as well as confidence in that expertise over time and that this facilitates coordination processes. The present study investigated whether this theory could help to explain between-team differences in requesting and accepting backup when needed. The present study used cross-sectional data collected from 51 commercial ATC teams. Hypotheses were tested using multiple regression analysis. Teammates with greater experience working together requested and accepted backup from one another more than those with lesser experience working together. Teammate knowledge consensus and perceived team efficacy appear to have mediated this relationship. Transactive memory theory extends to high-stress environments in which members' expertise is highly overlapping. Teammates' shared mental models about one another increase the likelihood that they will request and accept backup. Teammate familiarity should be considered when choosing among potential replacement team members. Training strategies that accelerate the development of teammate knowledge consensus and team efficacy are warranted.

Transportation of radioactive materials routing analysis: The Nevada experience

International Nuclear Information System (INIS)

Ardila-Coulson, M.V.

1991-01-01

In 1987, the Nevada State Legislature passed a Bill requiring the Nevada Dept. of Transportation to develop and enforce a plan for highway routing of highway route controlled quantity shipments of radioactive materials and high-level radioactive waste. A large network with all the major highways in Nevada was created and used in a computer model developed by Sandia National Labs. Twenty-eight highway parameters that included geometrics, traffic characteristics, environment and special facilities were collected. Alternative routes were identified by minimizing primary parameters (population density and accident rates). An analysis using the US DOT Guidelines were performed to identify a preferred route from the alternative routes

Interface Assignment-Based AODV Routing Protocol to Improve Reliability in Multi-Interface Multichannel Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Won-Suk Kim

2015-01-01

Full Text Available The utilization of wireless mesh networks (WMNs has greatly increased, and the multi-interface multichannel (MIMC technic has been widely used for the backbone network. Unfortunately, the ad hoc on-demand distance vector (AODV routing protocol defined in the IEEE 802.11s standard was designed for WMNs using the single-interface single-channel technic. So, we define a problem that happens when the legacy AODV is used in MIMC WMNs and propose an interface assignment-based AODV (IA-AODV in order to resolve that problem. IA-AODV, which is based on multitarget path request, consists of the PREQ prediction scheme, the PREQ loss recovery scheme, and the PREQ sender assignment scheme. A detailed operation according to various network conditions and services is introduced, and the routing efficiency and network reliability of a network using IA-AODV are analyzed over the presented system model. Finally, after a real-world test-bed for MIMC WMNs using the IA-AODV routing protocol is implemented, the various indicators of the network are evaluated through experiments. When the proposed routing protocol is compared with the existing AODV routing protocol, it performs the path update using only 14.33% of the management frames, completely removes the routing malfunction, and reduces the UDP packet loss ratio by 0.0012%.

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...... popularity, which are enabled by common driving behaviors found in available trajectory data. The ability to evaluate the quality of routing services enables service providers to improve the quality of their services and enables users to identify the services that best serve their needs. The paper covers......Mobile location-based services is a very successful class of services that are being used frequently by users with GPS-enabled mobile devices such as smartphones. This paper presents a study of how to exploit GPS trajectory data, which is available in increasing volumes, for the assessment...

Routing and wavelength assignment based on normalized resource and constraints for all-optical network

Science.gov (United States)

Joo, Seong-Soon; Nam, Hyun-Soon; Lim, Chang-Kyu

2003-08-01

With the rapid growth of the Optical Internet, high capacity pipes is finally destined to support end-to-end IP on the WDM optical network. Newly launched 2D MEMS optical switching module in the market supports that expectations of upcoming a transparent optical cross-connect in the network have encouraged the field applicable research on establishing real all-optical transparent network. To open up a customer-driven bandwidth services, design of the optical transport network becomes more challenging task in terms of optimal network resource usage. This paper presents a practical approach to finding a route and wavelength assignment for wavelength routed all-optical network, which has λ-plane OXC switches and wavelength converters, and supports that optical paths are randomly set up and released by dynamic wavelength provisioning to create bandwidth between end users with timescales on the order of seconds or milliseconds. We suggest three constraints to make the RWA problem become more practical one on deployment for wavelength routed all-optical network in network view: limitation on maximum hop of a route within bearable optical network impairments, limitation on minimum hops to travel before converting a wavelength, and limitation on calculation time to find all routes for connections requested at once. We design the NRCD (Normalized Resource and Constraints for All-Optical Network RWA Design) algorithm for the Tera OXC: network resource for a route is calculated by the number of internal switching paths established in each OXC nodes on the route, and is normalized by ratio of number of paths established and number of paths equipped in a node. We show that it fits for the RWA algorithm of the wavelength routed all-optical network through real experiments on the distributed objects platform.

Lessons learned by southern states in designating alternative routes

International Nuclear Information System (INIS)

1989-08-01

The purpose of this report is to discuss the ''lessons learned'' by the five states within the southem region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations. Under DOT regulations (49 CFR 177.826), carriers of highway route controlled quantities of radioactive materials (which include spent nuclear fuel and high-level waste) must use preferred routes selected to reduce time in transit. Such preferred routes consist of (1) an interstate system highway with use of an interstate system bypass or beltway around cities when available, and (2) alternate routes selected by a ''state routing agency.''

A Cross-Layer Routing Design for Multi-Interface Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Tzu-Chieh Tsai

2009-01-01

Full Text Available In recent years, Wireless Mesh Networks (WMNs technologies have received significant attentions. WMNs not only accede to the advantages of ad hoc networks but also provide hierarchical multi-interface architecture. Transmission power control and routing path selections are critical issues in the past researches of multihop networks. Variable transmission power levels lead to different network connectivity and interference. Further, routing path selections among different radio interfaces will also produce different intra-/interflow interference. These features tightly affect the network performance. Most of the related works on the routing protocol design do not consider transmission power control and multi-interface environment simultaneously. In this paper, we proposed a cross-layer routing protocol called M2iRi2 which coordinates transmission power control and intra-/interflow interference considerations as routing metrics. Each radio interface calculates the potential tolerable-added transmission interference in the physical layer. When the route discovery starts, the M2iRi2 will adopt the appropriate power level to evaluate each interface quality along paths. The simulation results demonstrate that our design can enhance both network throughput and end-to-end delay.

Suppressing traffic-driven epidemic spreading by adaptive routing strategy

International Nuclear Information System (INIS)

Yang, Han-Xin; Wang, Zhen

2016-01-01

The design of routing strategies for traffic-driven epidemic spreading has received increasing attention in recent years. In this paper, we propose an adaptive routing strategy that incorporates topological distance with local epidemic information through a tunable parameter h. In the case where the traffic is free of congestion, there exists an optimal value of routing parameter h, leading to the maximal epidemic threshold. This means that epidemic spreading can be more effectively controlled by adaptive routing, compared to that of the static shortest path routing scheme. Besides, we find that the optimal value of h can greatly relieve the traffic congestion in the case of finite node-delivering capacity. We expect our work to provide new insights into the effects of dynamic routings on traffic-driven epidemic spreading.

Independent programmable CAMAC crate controller based on KR580IK80A microprocessor

International Nuclear Information System (INIS)

Kulik, O.V.; Andronov, M.A.

1986-01-01

The RTKAM-2 independent programmable CAMAC crate controller is designed for use as a remote terminal in systems for automation of physics research. The built-in 12K-byte RAM is automatically changed to 24-bit organization in exchanges with the crate dataway. A nonstandard 24-level priority-interrupt system allows an LAM-request routing to be accessed in 5.5 μsec. Communication with the base computer is through a two conductor line

En Route Descent Advisor Multi-Sector Planning Using Active and Provisional Controller Plans

Science.gov (United States)

Vivona, Robert; Green, Steven

2003-01-01

As decision support tools are developed to support controllers in complex air traffic control environments, new approaches to maintaining situation awareness and managing traffic planning must be developed to handle the ever-increasing amounts of alerting and advisory data. Within high-density metering and other environments where flight path changes are the rule, not the exception, and where interactions between these changes are required, current trial planning approaches are limited by potential increases in workload. The Enroute Descent Advisor (EDA) is a set of decision support tool capabilities for managing high-density en route traffic subject to metering restrictions. The EDA system s novel approach builds aircraft plans from combinations of user intent data and builds controller plans from combinations of aircraft plans to effectively maintain situation awareness during traffic planning. By maintaining both active (current) and provisional (proposed) controller plans, EDA supports controllers in coordinated traffic planning both within and between sectors. Ultimately, EDA s multi-sector planning approach will facilitate a transition from current sector-oriented operations to a new trajectory-oriented paradigm, enabling new levels of efficiency and collaboration in air traffic control.

77 FR 53199 - California State Motor Vehicle Pollution Control Standards; Advanced Clean Car Program; Request...

Science.gov (United States)

2012-08-31

... cars, light-duty trucks and medium-duty passenger vehicles (and limited requirements related to heavy... ENVIRONMENTAL PROTECTION AGENCY [AMS-FRL-9724-4] California State Motor Vehicle Pollution Control Standards; Advanced Clean Car Program; Request for Waiver of Preemption; Opportunity for Public Hearing and...

76 FR 2398 - Submission for OMB Review; Comment Request; California Health Interview Survey Cancer Control...

Science.gov (United States)

2011-01-13

... annual burden hours requested are 2,177 (see Table 1). There are no Capital Costs, Operating Costs, and/or Maintenance Costs to report. Table 1--Estimates of Annualized Hour Burden Average time Type of... Control Module (CHIS-CCM) 2011. Type of [[Page 2399

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select alternative routes. First,the state must establish a ''state routing agency,'' defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice of DOT of any alternative route designation before the routes are deemed effective

Low Carbon Footprint Routes for Bird Watching

Directory of Open Access Journals (Sweden)

Wei-Ta Fang

2015-03-01

Full Text Available Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic information systems to detect the shortest path, thereby solving the problems associated with time-consuming transport. Based on the results of road network analyses, optimal travel-route planning can be determined. These methods include simulated annealing (SA and genetic algorithms (GA. We applied two algorithms in our simulation research to detect which one is an appropriate algorithm for running carbon-routing algorithms at the regional scale. SA, which is superior to GA, is considered an excellent approach to search for the optimal path to reduce carbon dioxide and high gasoline fees, thereby controlling travel time by using the shortest travel routes.

Seeded Growth Route to Noble Calcium Carbonate Nanocrystal.

Directory of Open Access Journals (Sweden)

Aminul Islam

Full Text Available A solution-phase route has been considered as the most promising route to synthesize noble nanostructures. A majority of their synthesis approaches of calcium carbonate (CaCO3 are based on either using fungi or the CO2 bubbling methods. Here, we approached the preparation of nano-precipitated calcium carbonate single crystal from salmacis sphaeroides in the presence of zwitterionic or cationic biosurfactants without external source of CO2. The calcium carbonate crystals were rhombohedron structure and regularly shaped with side dimension ranging from 33-41 nm. The high degree of morphological control of CaCO3 nanocrystals suggested that surfactants are capable of strongly interacting with the CaCO3 surface and control the nucleation and growth direction of calcium carbonate nanocrystals. Finally, the mechanism of formation of nanocrystals in light of proposed routes was also discussed.

Suppressing traffic-driven epidemic spreading by use of the efficient routing protocol

International Nuclear Information System (INIS)

Yang, Han-Xin; Wu, Zhi-Xi

2014-01-01

Despite extensive work on the interplay between traffic dynamics and epidemic spreading, the control of epidemic spreading by routing strategies has not received adequate attention. In this paper, we study the impact of an efficient routing protocol on epidemic spreading. In the case of infinite node-delivery capacity, where the traffic is free of congestion, we find that that there exist optimal values of routing parameter, leading to the maximal epidemic threshold. This means that epidemic spreading can be effectively controlled by fine tuning the routing scheme. Moreover, we find that an increase in the average network connectivity and the emergence of traffic congestion can suppress the epidemic outbreak. (paper)

An Experimental Study of the Effect of Shared Information on Pilot/Controller Re-Route Negotiation

Science.gov (United States)

Farley, Todd C.; Hansman, R. John

1999-01-01

Air-ground data link systems are being developed to enable pilots and air traffic controllers to share information more fully. The sharing of information is generally expected to enhance their shared situation awareness and foster more collaborative decision making. An exploratory, part-task simulator experiment is described which evaluates the extent to which shared information may lead pilots and controllers to cooperate or compete when negotiating route amendments. The results indicate an improvement in situation awareness for pilots and controllers and a willingness to work cooperatively. Independent of data link considerations, the experiment also demonstrates the value of providing controllers with a good-quality weather representation on their plan view displays. Observed improvements in situation awareness and separation assurance are discussed. It is argued that deployment of this relatively simple, low-risk addition to the plan view displays be accelerated.

Hurricane Evacuation Routes

Data.gov (United States)

Department of Homeland Security — Hurricane Evacuation Routes in the United States A hurricane evacuation route is a designated route used to direct traffic inland in case of a hurricane threat. This...

33 CFR 273.17 - Annual budget request.

Science.gov (United States)

2010-07-01

... 33 Navigation and Navigable Waters 3 2010-07-01 2010-07-01 false Annual budget request. 273.17... DEFENSE AQUATIC PLANT CONTROL § 273.17 Annual budget request. The Aquatic Plant Control Program is a... to utilize within the budget year taking into account the foreseeable availability of local funds to...

Energy-efficient routing, modulation and spectrum allocation in elastic optical networks

Science.gov (United States)

Tan, Yanxia; Gu, Rentao; Ji, Yuefeng

2017-07-01

With tremendous growth in bandwidth demand, energy consumption problem in elastic optical networks (EONs) becomes a hot topic with wide concern. The sliceable bandwidth-variable transponder in EON, which can transmit/receive multiple optical flows, was recently proposed to improve a transponder's flexibility and save energy. In this paper, energy-efficient routing, modulation and spectrum allocation (EE-RMSA) in EONs with sliceable bandwidth-variable transponder is studied. To decrease the energy consumption, we develop a Mixed Integer Linear Programming (MILP) model with corresponding EE-RMSA algorithm for EONs. The MILP model jointly considers the modulation format and optical grooming in the process of routing and spectrum allocation with the objective of minimizing the energy consumption. With the help of genetic operators, the EE-RMSA algorithm iteratively optimizes the feasible routing path, modulation format and spectrum resources solutions by explore the whole search space. In order to save energy, the optical-layer grooming strategy is designed to transmit the lightpath requests. Finally, simulation results verify that the proposed scheme is able to reduce the energy consumption of the network while maintaining the blocking probability (BP) performance compare with the existing First-Fit-KSP algorithm, Iterative Flipping algorithm and EAMGSP algorithm especially in large network topology. Our results also demonstrate that the proposed EE-RMSA algorithm achieves almost the same performance as MILP on an 8-node network.

Pseudo-Cycle-Based Multicast Routing in Wormhole-Routed Networks

Institute of Scientific and Technical Information of China (English)

SONG JianPing (宋建平); HOU ZiFeng (侯紫峰); XU Ming (许铭)

2003-01-01

This paper addresses the problem of fault-tolerant multicast routing in wormholerouted multicomputers. A new pseudo-cycle-based routing method is presented for constructing deadlock-free multicast routing algorithms. With at most two virtual channels this technique can be applied to any connected networks with arbitrary topologies. Simulation results show that this technique results in negligible performance degradation even in the presence of a large number of faulty nodes.

Routing in opportunistic networks

CERN Document Server

Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

2013-01-01

This book provides a comprehensive guide to selected topics, both ongoing and emerging, in routing in OppNets. The book is edited by worldwide technical leaders, prolific researchers and outstanding academics, Dr. Isaac Woungang and co-editors, Dr. Sanjay Kumar Dhurandher, Prof. Alagan Anpalagan and Prof. Athanasios Vasilakos. Consisting of contributions from well known and high profile researchers and scientists in their respective specialties, the main topics that are covered in this book include mobility and routing, social-aware routing, context-based routing, energy-aware routing, incentive-aware routing, stochastic routing, modeling of intermittent connectivity, in both infrastructure and infrastructure-less OppNets. Key Features: Discusses existing and emerging techniques for routing in infrastructure and infrastructure-less OppNets. Provides a unified covering of otherwise disperse selected topics on routing in infrastructure and infrastructure-less OppNets.  Includes a set of PowerPoint slides and g...

A novel insight into beaconless geo-routing

KAUST Repository

Bader, Ahmed

2012-12-01

Beaconless geo-routing protocols have been traditionally analyzed assuming equal communication ranges for the data and control packets. This is not true in reality, since the communication range is in practice function of the packet length. As a consequence, a substantial discrepancy may exist between analytical and empirical results offered in beaconless geo-routing literature. Furthermore, performance of beaconless geo-routing protocols has typically considered using single-hop metrics only. End-to-end performance is considered in literature only occasionally and mainly in terms of simulation only. In this paper, we re-examine this class of protocols. We first incorporate practical packet detection models in order to capture the dependency of the communication range on the packet\\'s length. We then develop a detailed analytical framework for the end-to-end delay and energy performance of beaconless geo-routing protocols. Finally, we present two different application scenarios and study various tradeoffs in light of the framework developed. © 2012 IEEE.

Planning routes around the world: International evidence for southern route preferences

NARCIS (Netherlands)

Brunyé, Tad T.; Andonova, Elena; Meneghetti, Chiara; Noordzij, Matthijs Leendert; Pazzaglia, Francesca; Wienemann, Rasmus; Mahoney, Caroline R.; Taylor, Holly A.

2012-01-01

Three studies test whether the southern route preference, which describes the tendency for route planners to disproportionately select south- rather than north-going routes, can be attributed to regional elevation patterns; specifically, we ask whether this effect replicates in three topographically

PKCζ regulates Notch receptor routing and activity in a Notch signaling-dependent manner

NARCIS (Netherlands)

Sjöqvist, M.; Antfolk, D.; Ferraris, S.; Rraklli, V.; Haga, C.; Antila, C.; Mutvei, A.; Imanishi, S.Y.; Holmberg, J.; Jin, S.; Eriksson, J.E.; Lendahl, U.; Sahlgren, C.M.

Activation of Notch signaling requires intracellular routing of the receptor, but the mechanisms controlling the distinct steps in the routing process is poorly understood. We identify PKCζ as a key regulator of Notch receptor intracellular routing. When PKCζ was inhibited in the developing chick

75 FR 61784 - Submission for OMB Review; Request for Comment on a New Information Collection: (OMB Control No...

Science.gov (United States)

2010-10-06

..., Congressional employees, members of Congress, and air traffic controllers. Because these court orders were... is needed on the OPM website so these individuals and their survivors can make the request. We...

Improving the Security and Performance of the BaBar Detector Controls System

International Nuclear Information System (INIS)

Kotturi, Karen D.

2003-01-01

It starts out innocently enough--users want to monitor Online data and so run their own copies of the detector control GUIs in their offices and at home. But over time, the number of processes making requests for values to display on GUIs, webpages and stripcharts can grow, and affect the performance of an Input/Output Controller (IOC) such that it is unable to respond to requests from requests critical to data-taking. At worst, an IOC can hang, its CPU having been allocated 100% to responding to network requests. For the BaBar Online Detector Control System, we were able to eliminate this problem and make great gains in security by moving all of the IOCs to a non-routed, virtual LAN and by enlisting a workstation with two network interface cards to act as the interface between the virtual LAN and the public BaBar network. On the interface machine, we run the Experimental Physics Industrial Control System (EPICS) Channel Access (CA) gateway software (originating from Advanced Photon Source). This software accepts as inputs, all the channels which are loaded into the EPICS databases on all the IOCs. It polls them to update its copy of the values. It answers requests from applications by sending them the currently cached value. We adopted the requirement that data-taking would be independent of the gateway, so that, in the event of a gateway failure, data-taking would be uninterrupted. In this way, we avoided introducing any new risk elements to data-taking. Security rules already in use by the IOC were propagated to the gateway's own security rules and the security of the IOCs themselves was improved by removing them from the public BaBar network

Air Traffic Controller Acceptability of Unmanned Aircraft System Detect-and-Avoid Thresholds

Science.gov (United States)

Mueller, Eric R.; Isaacson, Douglas R.; Stevens, Derek

2016-01-01

A human-in-the-loop experiment was conducted with 15 retired air traffic controllers to investigate two research questions: (a) what procedures are appropriate for the use of unmanned aircraft system (UAS) detect-and-avoid systems, and (b) how long in advance of a predicted close encounter should pilots request or execute a separation maneuver. The controller participants managed a busy Oakland air route traffic control sector with mixed commercial/general aviation and manned/UAS traffic, providing separation services, miles-in-trail restrictions and issuing traffic advisories. Controllers filled out post-scenario and post-simulation questionnaires, and metrics were collected on the acceptability of procedural options and temporal thresholds. The states of aircraft were also recorded when controllers issued traffic advisories. Subjective feedback indicated a strong preference for pilots to request maneuvers to remain well clear from intruder aircraft rather than deviate from their IFR clearance. Controllers also reported that maneuvering at 120 seconds until closest point of approach (CPA) was too early; maneuvers executed with less than 90 seconds until CPA were more acceptable. The magnitudes of the requested maneuvers were frequently judged to be too large, indicating a possible discrepancy between the quantitative UAS well clear standard and the one employed subjectively by manned pilots. The ranges between pairs of aircraft and the times to CPA at which traffic advisories were issued were used to construct empirical probability distributions of those metrics. Given these distributions, we propose that UAS pilots wait until an intruder aircraft is approximately 80 seconds to CPA or 6 nmi away before requesting a maneuver, and maneuver immediately if the intruder is within 60 seconds and 4 nmi. These thresholds should make the use of UAS detect and avoid systems compatible with current airspace procedures and controller expectations.

Contamination of cars and exposure dose to drivers traveling through the Route 6 in the restricted area

International Nuclear Information System (INIS)

Kawakami, Hiroto; Sasaki, Satoru; Shimomura, Masanori; Takano, Hitoshi; Hayashi, Hiroki; Inoue, Ryo; Yamada, Norikazu

2012-05-01

Traffic on the Route 6 will increase after the revision of evacuation area and restricted area. At the request of the Local Nuclear Emergency Response Headquarters established in Fukushima Prefecture, Japan Nuclear Energy Safety Organization (JNES) has surveyed the effect on cars and drivers traveling through the Route 6 in the restricted area as listed bellow. (1) Investigation of contamination of cars traveling through the Route 6. (2) Investigation of exposure dose of drivers traveling through the Route 6. The maximum contamination at the surface of tires and tire-houses of cars traveling through the Route 6 is estimated to be 2 Bq/cm"2 (this concentration is correspond to 470 cpm). The external exposure dose of drivers will be about 4 μSv when they run through the restricted area at a pace of 40 km/h. The internal exposure dose will be small because of the low radioactive concentration in the air. It is important not to stay long in high radiation areas to prevent unnecessary exposure. The main source of the contamination is sand cloud thrown up by the wheels. Though, the radioactivity of the sand cloud is proportional to the surface concentration of roads and dose rate of each area, contamination level by the sand cloud will remain low level. Significant contamination is likely to be caused by running on the soil. So, it is important not to run on the soil on the local road around the Route 6 or road shoulder of the Route 6. It is recommended to wash tires and tire-houses when accidentally run on the soil. (author)

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

Full Text Available The article deals with a scheme for the modern vine route in Bulgaria. Five basic vine routes and one international, between Bulgaria, Macedonia and Greece are defined. All routes consider characteristic varieties of grapes and kinds of vine products. Vine tourist products combined with visits of important natural and anthropological object are in the bases of the defined routes. The described routes are an important contribution to development of alternative tourist products in the country.

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

Full Text Available The aim of this paper was to propose a novel routing protocol for Mobile Adhoc Network communication which reduces the route failure during transmission. The proposed routing protocol uses 3 salient parameters to discover the path which ensure the reliable communication. The quality of the channel, link quality and energy level of the node are the major reasons for unintentional node failure in mobile Adhoc network. So the proposed routing protocol considers these three parameters to select the best forwarder node in the path. The reliable data communication is achieved by transmitting data via path selected by the proposed routing scheme has been proven using network simulator (NS2. Keywords: Channel quality, Link quality, Mobile Adhoc Network (MANET, Residual energy

The implementation of common object request broker architecture (CORBA) for controlling robot arm via web

International Nuclear Information System (INIS)

Syed Mahamad Zuhdi Amin; Mohd Yazid Idris; Wan Mohd Nasir Wan Kadir

2001-01-01

This paper presents the employment of the Common Object Request Broker Architecture (CORBA) technology in the implementation of our distributed Arm Robot Controller (ARC). CORBA is an industrial standard architecture based on distributed abstract object model, which is developed by Object Management Group (OMG). The architecture consists of five components i.e. Object Request Broker (ORB), Interface Definition Language (IDL), Dynamic Invocation Interface (DII), Interface Repositories (IR) and Object adapter (OA). CORBA objects are different from typical programming objects in three ways i.e. they can be executed on any platform, located anywhere on the network and written in any language that supports IDL mapping. In the implementation of the system, 5 degree of freedom (DOF) arm robot RCS 6.0 and Java as a programming mapping to the CORBA IDL. By implementing this architecture, the objects in the server machine can be distributed over the network in order to run the controller. the ultimate goal for our ARC system is to demonstrate concurrent execution of multiple arm robots through multiple instantiations of distributed object components. (Author)

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

Full Text Available Wireless Sensor Network (WSN has emerged as an important supplement to the modern wireless communication systems due to its wide range of applications. The recent researches are facing the various challenges of the sensor network more gracefully. However, energy efficiency has still remained a matter of concern for the researches. Meeting the countless security needs, timely data delivery and taking a quick action, efficient route selection and multi-path routing etc. can only be achieved at the cost of energy. Hierarchical routing is more useful in this regard. The proposed algorithm Energy Aware Cluster Based Routing Scheme (EACBRS aims at conserving energy with the help of hierarchical routing by calculating the optimum number of cluster heads for the network, selecting energy-efficient route to the sink and by offering congestion control. Simulation results prove that EACBRS performs better than existing hierarchical routing algorithms like Distributed Energy-Efficient Clustering (DEEC algorithm for heterogeneous wireless sensor networks and Energy Efficient Heterogeneous Clustered scheme for Wireless Sensor Network (EEHC.

76 FR 49769 - Proposed Agency Information Collection Activities; Comment Request

Science.gov (United States)

2011-08-11

... in Organizational Structure. Agency form number: FR Y-10E. OMB control number: 7100-0297. Frequency... OMB control numbers to collection of information requests and requirements conducted or sponsored by... control number. Request for Comment on Information Collection Proposal The following information...

Research on Large-Scale Road Network Partition and Route Search Method Combined with Traveler Preferences

Directory of Open Access Journals (Sweden)

De-Xin Yu

2013-01-01

Full Text Available Combined with improved Pallottino parallel algorithm, this paper proposes a large-scale route search method, which considers travelers’ route choice preferences. And urban road network is decomposed into multilayers effectively. Utilizing generalized travel time as road impedance function, the method builds a new multilayer and multitasking road network data storage structure with object-oriented class definition. Then, the proposed path search algorithm is verified by using the real road network of Guangzhou city as an example. By the sensitive experiments, we make a comparative analysis of the proposed path search method with the current advanced optimal path algorithms. The results demonstrate that the proposed method can increase the road network search efficiency by more than 16% under different search proportion requests, node numbers, and computing process numbers, respectively. Therefore, this method is a great breakthrough in the guidance field of urban road network.

75 FR 6677 - Information Collection Request to Office of Management and Budget; OMB Control Number: 1625-0086

Science.gov (United States)

2010-02-10

... Office of Management and Budget; OMB Control Number: 1625-0086 AGENCY: Coast Guard, DHS. ACTION: Sixty... Management and Budget (OMB) requesting an extension of its approval for the following collection of... following means: (1) Online: http://www.regulations.gov . [[Page 6678

76 FR 24537 - Paperwork Reduction Act; Proposed Collection; Comment Request

Science.gov (United States)

2011-05-02

... President, Office of National Drug Control Policy, Drug-Free Communities (DFC) Support Program, 750 17th... OFFICE OF NATIONAL DRUG CONTROL POLICY Paperwork Reduction Act; Proposed Collection; Comment Request AGENCY: Office of National Drug Control Policy. ACTION: 60-Day notice and request for comments...

Synthesis of SnO2 nanoparticles through the controlled precipitation route

International Nuclear Information System (INIS)

Ibarguen, C. Ararat; Mosquera, A.; Parra, R.; Castro, M.S.; Rodriguez-Paez, J.E.

2007-01-01

The controlled precipitation method allowed to the synthesis of SnO 2 with advantageous specific properties, such as size and shape employing an aqueous SnCl 2 .2H 2 O solution as precursor. Through XRD analyses, the optimum pH value of the solution that yielded the desired product was found to be 6.25. After a thermal treatment at 600 deg. C, the final powder presented an average particle size below 50 nm with a surface area of 19 m 2 g -1 and a large reactivity. The evolution of the most important functional groups during the steps involved in this synthesis route is explained in view of the results obtained with FTIR and XRD. A thorough discussion on the different intermediates involved in the whole process is presented on the basis of hydrolysis and condensation reactions. The conclusions are supported with a complete characterization through differential and gravimetric thermal analysis (DTA/TGA), electron microscopies (SEM/TEM) and surface area determinations (BET)

Energy-Aware Routing in Multiple Domains Software-Defined Networks

Directory of Open Access Journals (Sweden)

Adriana FERNÁNDEZ-FERNÁNDEZ

2016-12-01

Full Text Available The growing energy consumption of communication networks has attracted the attention of the networking researchers in the last decade. In this context, the new architecture of Software-Defined Networks (SDN allows a flexible programmability, suitable for the power-consumption optimization problem. In this paper we address the issue of designing a novel distributed routing algorithm that optimizes the power consumption in large scale SDN with multiple domains. The solution proposed, called DEAR (Distributed Energy-Aware Routing, tackles the problem of minimizing the number of links that can be used to satisfy a given data traffic demand under performance constraints such as control traffic delay and link utilization. To this end, we present a complete formulation of the optimization problem that considers routing requirements for control and data plane communications. Simulation results confirm that the proposed solution enables the achievement of significant energy savings.

76 FR 26746 - Information Collection Requests to Office of Management and Budget; OMB Control Numbers: 1625...

Science.gov (United States)

2011-05-09

... Office of Management and Budget; OMB Control Numbers: 1625-0077, 1625-0085 and 1625-0112 AGENCY: Coast... Office of Management and Budget (OMB), Office of Information and Regulatory Affairs (OIRA), requesting an... identified by Coast Guard docket number [USCG-2011-0336] to the Docket Management Facility (DMF) at the U.S...

Cooperative Route Planning for Multiple Aircraft in a Semifree ATC System

Directory of Open Access Journals (Sweden)

Yi Yang

2018-01-01

Full Text Available This paper presents the Semifree Flight theory used in a civil air traffic control (ATC system to improve the capability of the traditional Free Flight mode. The progressiveness and hidden defects of the “Free Flight” model in civil aviation are analysed, and the Semifree Flight ATC system mode is introduced. Moreover, this paper presents the collaborative route planning method, which is the most important method used in the Semifree Flight ATC system. This collaborative route planning method can plan routes for each aircraft (either in flight or just before achieving flight in real time, and the routes can satisfy all the safety constraints. The final numerical simulations verify the correctness and practicability of the Semifree Flight theory and the collaborative route planning method.

Towards seasonal Arctic shipping route predictions

Science.gov (United States)

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

2017-12-01

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

Comparison of actual and predicted routes used in the shipment of radioactive materials

International Nuclear Information System (INIS)

Joy, D.S.; Johnson, P.E.; Harrison, I.G.

1985-01-01

A number of highway controlled shipments of radioactive materials have been made over the past several years. An excellent example showing the variability of actual routes is the transfer of 45 shipments between the Three Mile Island reactor in Pennsylvania and Scoville, Idaho in 1982 and 1983. Six different routes varying between 2273 and 2483 miles were used. Approximately 75% of these shipments followed a common route which passed through ten Urbanized Areas, defined by the Census Bureau as having a population exceeding 100,000 people. Other routes, while shorter in distance, passed through as many as 14 Urbanized Areas. Routes predicted by the Oak Ridge routing model did not exactly duplicate actual routes used. However, the analysis shows that the routing model does make a good estimate of transportation routes actually chosen by shippers of radioactive materials. In actual practice, a number of factors (weather, road conditions, driver preference, etc.) influence the actual route taken. 5 refs., 1 fig., 1 tab

Route churn: an analysis of low-cost carrier route continuity in Europe

NARCIS (Netherlands)

de Wit, J.G.; Zuidberg, J.

2016-01-01

Discontinuity of air routes is a subject that has been analysed in various ways. For example, the complex network approach focuses on network robustness and resilience due to route interruptions during a relatively short period. Also seasonal interruptions of air routes are a well-documented

Benefits Analysis of Multi-Center Dynamic Weather Routes

Science.gov (United States)

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

2014-01-01

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

A Dual-Route Perspective on Eye Movements of Dyslexic Readers

Science.gov (United States)

Hawelka, Stefan; Gagl, Benjamin; Wimmer, Heinz

2010-01-01

This study assessed eye movement abnormalities of adolescent dyslexic readers and interpreted the findings by linking the dual-route model of single word reading with the E-Z Reader model of eye movement control during silent sentence reading. A dysfunction of the lexical route was assumed to account for a reduced number of words which received…

75 FR 39700 - Information Collection Request to Office of Management and Budget; OMB; Control Number: 1625-New

Science.gov (United States)

2010-07-12

... Office of Management and Budget; OMB; Control Number: 1625-New AGENCY: Coast Guard, DHS. ACTION: Sixty... of Management and Budget (OMB) requesting an approval for the following collection of information... the following means: (1) Online: http://www.regulations.gov . (2) Mail: Docket Management Facility...

75 FR 82038 - Information Collection Request to Office of Management and Budget; OMB Control Numbers: 1625-0058...

Science.gov (United States)

2010-12-29

... Office of Management and Budget; OMB Control Numbers: 1625-0058, 1625-0072 and 1625-0092 AGENCY: Coast... Office of Management and Budget (OMB), Office of Information and Regulatory Affairs (OIRA), requesting... Transport Municipal and Commercial Waste, 1625-0072, Waste Management Plans, Refuse Discharge Logs, Letters...

A facile route to shape controlled CdTe nanoparticles

Energy Technology Data Exchange (ETDEWEB)

Mntungwa, Nhlakanipho; Rajasekhar, Pullabhotla V.S.R. [Department of Chemistry, University of Zululand, Private Bag X1001, KwaDlangezwa 3886, Empangeni, KZN (South Africa); Revaprasadu, Neerish, E-mail: nrevapra@pan.uzulu.ac.za [Department of Chemistry, University of Zululand, Private Bag X1001, KwaDlangezwa 3886, Empangeni, KZN (South Africa)

2011-04-15

Research highlights: {yields} A facile hybrid solution based/thermolysis route has been used for the synthesis of hexadecylamine capped CdTe nanoparticles. {yields} This method involves the reaction by the addition of an aqueous suspension of a cadmium salt to a freshly prepared NaHTe solution. {yields} The cadmium salt plays an important role in the growth mechanism of the particles and hence its final morphology. - Abstract: Hexadecylamine (HDA) capped CdTe nanoparticles have been synthesized using a facile hybrid solution based/thermolysis route. This method involves the reaction by the addition of an aqueous suspension or solution of a cadmium salt (chloride, acetate, nitrate or carbonate) to a freshly prepared NaHTe solution. The isolated CdTe was then dispersed in tri-octylphosphine (TOP) and injected into pre-heated HDA at temperatures of 190, 230 and 270 deg. C for 2 h. The particle growth and size distribution of the CdTe particles synthesized using cadmium chloride as the cadmium source were monitored using absorption and photoluminescence spectroscopy. The final morphology of the CdTe nanoparticles synthesized from the various cadmium sources was studied by transmission electron microscopy (TEM) and high resolution TEM. The cadmium source has an influence on the final morphology of the particles.

A facile route to shape controlled CdTe nanoparticles

International Nuclear Information System (INIS)

Mntungwa, Nhlakanipho; Rajasekhar, Pullabhotla V.S.R.; Revaprasadu, Neerish

2011-01-01

Research highlights: → A facile hybrid solution based/thermolysis route has been used for the synthesis of hexadecylamine capped CdTe nanoparticles. → This method involves the reaction by the addition of an aqueous suspension of a cadmium salt to a freshly prepared NaHTe solution. → The cadmium salt plays an important role in the growth mechanism of the particles and hence its final morphology. - Abstract: Hexadecylamine (HDA) capped CdTe nanoparticles have been synthesized using a facile hybrid solution based/thermolysis route. This method involves the reaction by the addition of an aqueous suspension or solution of a cadmium salt (chloride, acetate, nitrate or carbonate) to a freshly prepared NaHTe solution. The isolated CdTe was then dispersed in tri-octylphosphine (TOP) and injected into pre-heated HDA at temperatures of 190, 230 and 270 deg. C for 2 h. The particle growth and size distribution of the CdTe particles synthesized using cadmium chloride as the cadmium source were monitored using absorption and photoluminescence spectroscopy. The final morphology of the CdTe nanoparticles synthesized from the various cadmium sources was studied by transmission electron microscopy (TEM) and high resolution TEM. The cadmium source has an influence on the final morphology of the particles.

Cognitive Routing in Software-Defined Underwater Acoustic Networks

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2017-12-01

Full Text Available There are two different types of primary users (natural acoustic and artificial acoustic, and there is a long propagation delay for acoustic links in underwater cognitive acoustic networks (UCANs. Thus, the selection of a stable route is one of the key design factors for improving overall network stability, thereby reducing end-to-end delay. Software-defined networking (SDN is a novel approach that improves network intelligence. To this end, we propose a novel SDN-based routing protocol for UCANs in order to find a stable route between source and destination. A main controller is placed in a surface buoy that is responsible for the global view of the network, whereas local controllers are placed in different autonomous underwater vehicles (AUVs that are responsible for a localized view of the network. The AUVs have fixed trajectories, and sensor nodes within transmission range of the AUVs serve as gateways to relay the gathered information to the controllers. This is an SDN-based underwater communications scheme whereby two nodes can only communicate when they have a consensus about a common idle channel. To evaluate our proposed scheme, we perform extensive simulations and improve network performance in terms of end-to-end delay, delivery ratio, and overhead.

Prioritizing connection requests in GMPLS-controlled optical networks

DEFF Research Database (Denmark)

Ruepp, Sarah Renée; Koster, A.; Andriolli, N.

2009-01-01

We prioritize bidirectional connection requests by combining dynamic connection provisioning with off-line optimization. Results show that the proposed approach decreases wavelength-converter usage, thereby allowing operators to reduce blocking-probably under bulk connection assignment or network...

High throughput route selection in multi-rate wireless mesh networks

Institute of Scientific and Technical Information of China (English)

WEI Yi-fei; GUO Xiang-li; SONG Mei; SONG Jun-de

2008-01-01

Most existing Ad-hoc routing protocols use the shortest path algorithm with a hop count metric to select paths. It is appropriate in single-rate wireless networks, but has a tendency to select paths containing long-distance links that have low data rates and reduced reliability in multi-rate networks. This article introduces a high throughput routing algorithm utilizing the multi-rate capability and some mesh characteristics in wireless fidelity (WiFi) mesh networks. It uses the medium access control (MAC) transmission time as the routing metric, which is estimated by the information passed up from the physical layer. When the proposed algorithm is adopted, the Ad-hoc on-demand distance vector (AODV) routing can be improved as high throughput AODV (HT-AODV). Simulation results show that HT-AODV is capable of establishing a route that has high data-rate, short end-to-end delay and great network throughput.

75 FR 10297 - Information Collection Request to Office of Management and Budget; OMB Control Numbers: 1625-0056

Science.gov (United States)

2010-03-05

... Office of Management and Budget; OMB Control Numbers: 1625-0056 AGENCY: Coast Guard, DHS. ACTION: Sixty... of Management and Budget (OMB) requesting an extension of its approval for the following collection... . (2) Mail: Docket Management Facility (DMF) (M-30), U.S. Department of Transportation (DOT), West...

75 FR 1068 - Information Collection Request to Office of Management and Budget; OMB Control Numbers: 1625-0087

Science.gov (United States)

2010-01-08

... Office of Management and Budget; OMB Control Numbers: 1625-0087 AGENCY: Coast Guard, DHS. ACTION: Sixty... Management and Budget (OMB) requesting an extension of its approval for the following collection of...: Docket Management Facility (DMF) (M-30), U.S. Department of Transportation (DOT), West Building Ground...

75 FR 70938 - Information Collection Request to Office of Management and Budget; OMB Control numbers: 1625-0108.

Science.gov (United States)

2010-11-19

... Office of Management and Budget; OMB Control numbers: 1625-0108. AGENCY: Coast Guard, DHS. ACTION: Sixty... of Management and Budget (OMB) requesting an extension of its approval for the following collection.... (2) Mail: Docket Management Facility (DMF) (M-30), U.S. Department of Transportation (DOT), West...

Hazmat Routes (National)

Data.gov (United States)

Department of Transportation — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes (NTAD) were developed using the 2004 First Edition TIGER/Line files. The routes are...

Reconfigurable Robust Routing for Mobile Outreach Network

Science.gov (United States)

Lin, Ching-Fang

2010-01-01

The Reconfigurable Robust Routing for Mobile Outreach Network (R3MOO N) provides advanced communications networking technologies suitable for the lunar surface environment and applications. The R3MOON techn ology is based on a detailed concept of operations tailored for luna r surface networks, and includes intelligent routing algorithms and wireless mesh network implementation on AGNC's Coremicro Robots. The product's features include an integrated communication solution inco rporating energy efficiency and disruption-tolerance in a mobile ad h oc network, and a real-time control module to provide researchers an d engineers a convenient tool for reconfiguration, investigation, an d management.

A novel insight into beaconless geo-routing

KAUST Repository

Bader, Ahmed; Abed-Meraim, Karim; Alouini, Mohamed-Slim

2012-01-01

Beaconless geo-routing protocols have been traditionally analyzed assuming equal communication ranges for the data and control packets. This is not true in reality, since the communication range is in practice function of the packet length. As a

Radiological mapping of Mumbai-Arakkonam rail route

International Nuclear Information System (INIS)

Chavan, R.V.; Patil, S.S.; Solase, S.; Saindane, S.S.; Murali, S.

2018-01-01

Presently usage of sources of radiation in various fields of application has increased significantly. If such radiation sources get misplaced, lost from administrative control mechanism or smuggled out, it is advisable to have the countrywide baseline data on radiological aspects. As a part of emergency preparedness programme, it had been planned to generate the radiological baseline data for various road routes and cities in India. The radiological mapping is useful for updates on the trend of the radiation level at various locations/routes. The radiation mapping of Mumbai-Arakkonam rail route was carried out by using various state of the art monitoring systems/instruments. The radiological data at every railway stations were analyzed thoroughly. The overall increase in radiation level was found mainly due to the presence of higher concentration of naturally occurring radionuclide's in the environment mainly 40 K and 232 Th

Placement of effective work-in-progress limits in route-specific unit-based pull systems

NARCIS (Netherlands)

Ziengs, N.; Riezebos, J.; Germs, R.

2012-01-01

Unit-based pull systems control the throughput time of orders in a production system by limiting the number of orders on the shop floor. In production systems where orders can follow different routings on the shop floor, route-specific pull systems that control the progress of orders on the shop

A Computer Simulation of the System-Wide Effects of Parallel-Offset Route Maneuvers

Science.gov (United States)

Lauderdale, Todd A.; Santiago, Confesor; Pankok, Carl

2010-01-01

Most aircraft managed by air-traffic controllers in the National Airspace System are capable of flying parallel-offset routes. This paper presents the results of two related studies on the effects of increased use of offset routes as a conflict resolution maneuver. The first study analyzes offset routes in the context of all standard resolution types which air-traffic controllers currently use. This study shows that by utilizing parallel-offset route maneuvers, significant system-wide savings in delay due to conflict resolution of up to 30% are possible. It also shows that most offset resolutions replace horizontal-vectoring resolutions. The second study builds on the results of the first and directly compares offset resolutions and standard horizontal-vectoring maneuvers to determine that in-trail conflicts are often more efficiently resolved by offset maneuvers.

Congestion control for vehicular delay tolerant network routing protocols

OpenAIRE

Oham, Chuka Finbars

2014-01-01

The Vehicular Delay Tolerant Network (VDTN) is a special and challenging type of the Delay Tolerant Network because of its high mobility, frequent disconnections and nodal congestion features. These challenging features make it prone to congestion which leads to a considerable amount of message drops in the network. To minimize the impact of congestion in the network, we designed and implemented the Congestion Aware Spray and Wait (CASaW) routing protocol. We varied the buffer sizes of the no...

75 FR 57809 - Information Collection Request to Office of Management and Budget; OMB Control Numbers: 1625-0002...

Science.gov (United States)

2010-09-22

... Office of Management and Budget; OMB Control Numbers: 1625-0002, 1625-0017, 1625-0019, and 1625- 0030... (ICRs) and Analyses to the Office of Management and Budget (OMB) requesting an extension of its approval...://www.regulations.gov . (2) Mail: Docket Management Facility (DMF) (M-30), U.S. Department of...

76 FR 27073 - Information Collection Request to Office of Management and Budget; OMB Control Number: 1625-0109

Science.gov (United States)

2011-05-10

... Office of Management and Budget; OMB Control Number: 1625-0109 AGENCY: Coast Guard, DHS. ACTION: Sixty....S. Coast Guard intends to submit an Information Collection Request (ICR) to the Office of Management...-0158] to the Docket Management Facility (DMF) at the U.S. Department of Transportation (DOT). To avoid...

75 FR 19413 - Information Collection Request to Office of Management and Budget; OMB Control Number: 1625-0089.

Science.gov (United States)

2010-04-14

... Office of Management and Budget; OMB Control Number: 1625-0089. AGENCY: Coast Guard, DHS. ACTION: Sixty... of Management and Budget (OMB) requesting an approval for re-instatement with change of the following... Management Facility (DMF) (M-30), U.S. Department of Transportation (DOT), West Building Ground Floor, Room...

76 FR 11502 - Information Collection Request to Office of Management and Budget; OMB Control Number: 1625-0003

Science.gov (United States)

2011-03-02

... Office of Management and Budget; OMB Control Number: 1625-0003 AGENCY: Coast Guard, DHS. ACTION: Sixty....S. Coast Guard intends to submit an Information Collection Request (ICR) to the Office of Management... number [USCG-2011-0017], to the Docket Management Facility (DMF) at the U.S. Department of Transportation...

76 FR 10385 - Information Collection Request to Office of Management and Budget; OMB Control Number: 1625-0106

Science.gov (United States)

2011-02-24

... Office of Management and Budget; OMB Control Number: 1625-0106 AGENCY: Coast Guard, DHS. ACTION: Sixty....S. Coast Guard intends to submit an Information Collection Request (ICR) to the Office of Management... Coast Guard docket number [USCG-2011-0087] to the Docket Management Facility (DMF) at the U.S...

A Sociability-Based Routing Scheme for Delay-Tolerant Networks

Directory of Open Access Journals (Sweden)

Fabbri Flavio

2011-01-01

Full Text Available The problem of choosing the best forwarders in Delay-Tolerant Networks (DTNs is crucial for minimizing the delay in packet delivery and for keeping the amount of generated traffic under control. In this paper, we introduce sociable routing, a novel routing strategy that selects a subset of optimal forwarders among all the nodes and relies on them for an efficient delivery. The key idea is that of assigning to each network node a time-varying scalar parameter which captures its social behavior in terms of frequency and types of encounters. This sociability concept is widely discussed and mathematically formalized. Simulation results of a DTN of vehicles in urban environment, driven by real mobility traces, and employing sociable routing, is presented. Encouraging results show that sociable routing, compared to other known protocols, achieves a good compromise in terms of delay performance and amount of generated traffic.

40 CFR 205.57-1 - Test request.

Science.gov (United States)

2010-07-01

... 40 Protection of Environment 24 2010-07-01 2010-07-01 false Test request. 205.57-1 Section 205.57-1 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) NOISE ABATEMENT PROGRAMS TRANSPORTATION EQUIPMENT NOISE EMISSION CONTROLS Medium and Heavy Trucks § 205.57-1 Test request. (a) The...

Computer-Assisted Periodical Routing and Renewal Audit

Science.gov (United States)

Yerkey, A. Neil

1973-01-01

A computer-assisted periodical control system was designed to reduce clerical time required to maintain records in three areas: renewal audit, routing, and records-keeping. The renewal audit features are unusual and are described in detail. (3 references) (Author/DH)

ROUTE PLAN DESIGNER FOR TRACTOR GUIDANCE SYSTEMS

DEFF Research Database (Denmark)

Sveistrup, Daniel; Jørgensen, Rasmus Nyholm; Green, Ole

2010-01-01

Earlier works have shown field trial designs to be very labor extensive, even when combining autoguidancesystems with conventional machinery.Designing routes for semi-automated systems in a controlled manner is both resource demandingand complicated. Different types of auto-guidance systems vary ...

On routing strategy with finite-capacity effect on scale-free networks

International Nuclear Information System (INIS)

Tang, S.; Jiang, X.; Ma, L.; Zhang, Z.; Zheng, Z.

2010-01-01

We propose a class of systems with finite-capacity effect to investigate routing-strategy optimization. The local topology and the variable capacity, two crucial elements for routing, are naturally coupled by considering the interactions among packets. We show how the combination of these two elements controls the normal and efficient functioning of routing in the frame of condensation and coverage, respectively. Specifically, it is shown that the dynamic behaviors of diffusing packets exhibit condensation, for which exact results of the stationary state and phase transition are given. Further, we explore the diffusion coverage of routed packets through simulation. Various alternatives for the strategy parameters are illustrated to apply standard techniques to alleviate condensation and accelerate coverage. Our results provide a practical way for the design of optimal routing strategies in complex networks by the manipulation of a few parameters. (author)

Helpdesk troubleshooting requests

CERN Multimedia

2006-01-01

We should like to remind all CERN users that the FM Help Desk handles all work and repair requests and other enquiries relating to CERN's tertiary buildings, in particular the following systems and equipment: Electricity and lighting in office buildings, halls and workshops Heating, ventilation and air conditioning in office buildings, halls and workshops Lifts (excluding those in underground areas) Motorised doors Buildings and their equipment: roofs, doors, windows, blinds, etc. Plumbing Toilets Cleaning (all buildings and underground areas) Restaurant equipment Roads and green areas Waste collection The FM Helpdesk is open between 7.30 a.m. and 6.30 p.m. and can be contacted on Tel. 77777 or by e-mail (Fm.Support@cern.ch). Troubleshooting requests, complaints and work requests will only be accepted during these hours. Outside these hours and for any problems relating to non-tertiary buildings or to equipment not included in the above list, please contact the TI Control Room on Tel. 72201, 24 hours a d...

Indoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation

Directory of Open Access Journals (Sweden)

Liu Liu

2017-11-01

Full Text Available Humans perform many activities indoors and they show a growing need for indoor navigation, especially in unfamiliar buildings such as airports, museums and hospitals. Complexity of such buildings poses many challenges for building managers and visitors. Indoor navigation services play an important role in supporting these indoor activities. Indoor navigation covers extensive topics such as: 1 indoor positioning and localization; 2 indoor space representation for navigation model generation; 3 indoor routing computation; 4 human wayfinding behaviours; and 5 indoor guidance (e.g., textual directories. So far, a large number of studies of pedestrian indoor navigation have presented diverse navigation models and routing algorithms/methods. However, the major challenge is rarely referred to: how to represent the complex indoor environment for pedestrians and conduct routing according to the different roles and sizes of users. Such complex buildings contain irregular shapes, large open spaces, complicated obstacles and different types of passages. A navigation model can be very complicated if the indoors are accurately represented. Although most research demonstrates feasible indoor navigation models and related routing methods in regular buildings, the focus is still on a general navigation model for pedestrians who are simplified as circles. In fact, pedestrians represent different sizes, motion abilities and preferences (e.g., described in user profiles, which should be reflected in navigation models and be considered for indoor routing (e.g., relevant Spaces of Interest and Points of Interest. In order to address this challenge, this thesis proposes an innovative indoor modelling and routing approach – two-level routing. It specially targets the case of routing in complex buildings for distinct users. The conceptual (first level uses general free indoor spaces: this is represented by the logical network whose nodes represent the spaces and edges

75 FR 59278 - Information Collection Request to Office of Management and Budget; OMB Control Numbers: 1625-0062...

Science.gov (United States)

2010-09-27

... Office of Management and Budget; OMB Control Numbers: 1625-0062, 1625-0078, and 1625-0082 AGENCY: Coast... Analyses to the Office of Management and Budget (OMB) requesting a revision of its approval for the...: (1) Online: http://www.regulations.gov . (2) Mail: Docket Management Facility (DMF) (M-30), U.S...

76 FR 77243 - Information Collection Request to Office of Management and Budget; OMB Control Number: 1625-0010

Science.gov (United States)

2011-12-12

... Office of Management and Budget; OMB Control Number: 1625-0010 AGENCY: Coast Guard, DHS. ACTION: Sixty....S. Coast Guard intends to submit an Information Collection Request (ICR) to the Office of Management... Guard docket number [USCG-2011-1074] to the Docket Management Facility (DMF) at the U.S. Department of...

Multihop Wireless Networks Opportunistic Routing

CERN Document Server

Zeng, Kai; Li, Ming

2011-01-01

This book provides an introduction to opportunistic routing an emerging technology designed to improve the packet forwarding reliability, network capacity and energy efficiency of multihop wireless networks This book presents a comprehensive background to the technological challenges lying behind opportunistic routing. The authors cover many fundamental research issues for this new concept, including the basic principles, performance limit and performance improvement of opportunistic routing compared to traditional routing, energy efficiency and distributed opportunistic routing protocol desig

Request for All - Generalized Request Framework for PhEDEx

CERN Document Server

Huang, C-H; Ratnikova, N.; Sanchez-Hernandez, A.; Zhang, X.; Magini, N.

2014-01-01

PhEDEx has been serving CMS community since 2004 as the data broker. Every PhEDEx operation is initiated by a request, such as request to move data, request to delete data, and so on. A request has it own life cycle, including creation, approval, notification, and book keeping and the details depend on its type. Currently, only two kinds of requests, transfer and deletion, are fully integrated in PhEDEx. They are tailored specifically to the operations workflows. To be able to serve a new type of request it generally means a fair amount of development work.After several years of operation, we have gathered enough experience to rethink the request handling in PhEDEx. Generalized Request Project is set to abstract such experience and come up with a request system which is not tied into current workflow yet it is general enough to accommodate current and future requests.The challenges are dealing with different stages in a requests life cycle, complexity of approval process and complexity of the ability and auth...

Understanding individual routing behaviour.

Science.gov (United States)

Lima, Antonio; Stanojevic, Rade; Papagiannaki, Dina; Rodriguez, Pablo; González, Marta C

2016-03-01

Knowing how individuals move between places is fundamental to advance our understanding of human mobility (González et al. 2008 Nature 453, 779-782. (doi:10.1038/nature06958)), improve our urban infrastructure (Prato 2009 J. Choice Model. 2, 65-100. (doi:10.1016/S1755-5345(13)70005-8)) and drive the development of transportation systems. Current route-choice models that are used in transportation planning are based on the widely accepted assumption that people follow the minimum cost path (Wardrop 1952 Proc. Inst. Civ. Eng. 1, 325-362. (doi:10.1680/ipeds.1952.11362)), despite little empirical support. Fine-grained location traces collected by smart devices give us today an unprecedented opportunity to learn how citizens organize their travel plans into a set of routes, and how similar behaviour patterns emerge among distinct individual choices. Here we study 92 419 anonymized GPS trajectories describing the movement of personal cars over an 18-month period. We group user trips by origin-destination and we find that most drivers use a small number of routes for their routine journeys, and tend to have a preferred route for frequent trips. In contrast to the cost minimization assumption, we also find that a significant fraction of drivers' routes are not optimal. We present a spatial probability distribution that bounds the route selection space within an ellipse, having the origin and the destination as focal points, characterized by high eccentricity independent of the scale. While individual routing choices are not captured by path optimization, their spatial bounds are similar, even for trips performed by distinct individuals and at various scales. These basic discoveries can inform realistic route-choice models that are not based on optimization, having an impact on several applications, such as infrastructure planning, routing recommendation systems and new mobility solutions. © 2016 The Author(s).

76 FR 12758 - Proposed Information Collection Request of the ETA-9016 (OMB Control No. 1205-0268) on Alien...

Science.gov (United States)

2011-03-08

... of the ETA-9016 (OMB Control No. 1205-0268) on Alien Claims Activity Report; Comment Request on... the U.S. Citizenship and Immigration Services (USCIS), Systematic Alien Verification for Entitlement.... In addition, data from the Alien Claims Activity report is being used to assist the Secretary of...

Cluster Based Hierarchical Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, Md. Golam; Kabir, M. Hasnat; Rahim, Muhammad Sajjadur; Ullah, Shaikh Enayet

2012-01-01

The efficient use of energy source in a sensor node is most desirable criteria for prolong the life time of wireless sensor network. In this paper, we propose a two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP). We introduce a new concept called head-set, consists of one active cluster head and some other associate cluster heads within a cluster. The head-set members are responsible for control and management of the network. Results show that t...

Size-controlled synthesis of transition metal nanoparticles through chemical and photo-chemical routes

Science.gov (United States)

Tangeysh, Behzad

The central objective of this work is developing convenient general procedures for controlling the formation and stabilization of nanoscale transition metal particles. Contemporary interest in developing alternative synthetic approaches for producing nanoparticles arises in large part from expanding applications of the nanomaterials in areas such as catalysis, electronics and medicine. This research focuses on advancing the existing nanoparticle synthetic routes by using a new class of polymer colloid materials as a chemical approach, and the laser irradiation of metal salt solution as a photo-chemical method to attain size and shape selectivity. Controlled synthesis of small metal nanoparticles with sizes ranging from 1 to 5nm is still a continuing challenge in nanomaterial synthesis. This research utilizes a new class of polymer colloid materials as nano-reactors and protective agents for controlling the formation of small transition metal nanoparticles. The polymer colloid particles were formed from cross-linking of dinegatively charged metal precursors with partially protonated poly dimethylaminoethylmethacrylate (PDMAEMA). Incorporation of [PtCl6]2- species into the colloidal particles prior to the chemical reduction was effectively employed as a new strategy for synthesis of unusually small platinum nanoparticles with narrow size distributions (1.12 +/-0.25nm). To explore the generality of this approach, in a series of proof-of-concept studies, this method was successfully employed for the synthesis of small palladium (1.4 +/-0.2nm) and copper nanoparticles (1.5 +/-0.6nm). The polymer colloid materials developed in this research are pH responsive, and are designed to self-assemble and/or disassemble by varying the levels of protonation of the polymer chains. This unique feature was used to tune the size of palladium nanoparticles in a small range from 1nm to 5nm. The procedure presented in this work is a new convenient room temperature route for synthesis of

SAFEBIKE: A Bike-sharing Route Recommender with Availability Prediction and Safe Routing

OpenAIRE

Zhong, Weisheng; Chen, Fanglan; Fu, Kaiqun; Lu, Chang-Tien

2017-01-01

This paper presents SAFEBIKE, a novel route recommendation system for bike-sharing service that utilizes station information to infer the number of available bikes in dock and recommend bike routes according to multiple factors such as distance and safety level. The system consists of a station level availability predictor that predicts bikes and docks amount at each station, and an efficient route recommendation service that considers safety and bike/dock availability factors. It targets use...

Personal continuous route pattern mining

Institute of Scientific and Technical Information of China (English)

Qian YE; Ling CHEN; Gen-cai CHEN

2009-01-01

In the daily life, people often repeat regular routes in certain periods. In this paper, a mining system is developed to find the continuous route patterns of personal past trips. In order to count the diversity of personal moving status, the mining system employs the adaptive GPS data recording and five data filters to guarantee the clean trips data. The mining system uses a client/server architecture to protect personal privacy and to reduce the computational load. The server conducts the main mining procedure but with insufficient information to recover real personal routes. In order to improve the scalability of sequential pattern mining, a novel pattern mining algorithm, continuous route pattern mining (CRPM), is proposed. This algorithm can tolerate the different disturbances in real routes and extract the frequent patterns. Experimental results based on nine persons' trips show that CRPM can extract more than two times longer route patterns than the traditional route pattern mining algorithms.

An Overlay Architecture for Throughput Optimal Multipath Routing

Science.gov (United States)

2017-01-14

maximum throughput. Finally, we propose a threshold-based policy (BP-T) and a heuristic policy (OBP), which dynamically control traffic bifurcations...network stability region is available . Second, given any subset of nodes that are controllable, we also wish to develop an optimal routing policy that...case when tunnels do not overlap. We also develop a heuristic overlay control policy for use on general topologies, and show through simulation that

Dynamic Weather Routes: A Weather Avoidance Concept for Trajectory-Based Operations

Science.gov (United States)

McNally, B. David; Love, John

2011-01-01

The integration of convective weather modeling with trajectory automation for conflict detection, trial planning, direct routing, and auto resolution has uncovered a concept that could help controllers, dispatchers, and pilots identify improved weather routes that result in significant savings in flying time and fuel burn. Trajectory automation continuously and automatically monitors aircraft in flight to find those that could potentially benefit from improved weather reroutes. Controllers, dispatchers, and pilots then evaluate reroute options to assess their suitability given current weather and traffic. In today's operations aircraft fly convective weather avoidance routes that were implemented often hours before aircraft approach the weather and automation does not exist to automatically monitor traffic to find improved weather routes that open up due to changing weather conditions. The automation concept runs in real-time and employs two keysteps. First, a direct routing algorithm automatically identifies flights with large dog legs in their routes and therefore potentially large savings in flying time. These are common - and usually necessary - during convective weather operations and analysis of Fort Worth Center traffic shows many aircraft with short cuts that indicate savings on the order of 10 flying minutes. The second and most critical step is to apply trajectory automation with weather modeling to determine what savings could be achieved by modifying the direct route such that it avoids weather and traffic and is acceptable to controllers and flight crews. Initial analysis of Fort Worth Center traffic suggests a savings of roughly 50% of the direct route savings could be achievable.The core concept is to apply trajectory automation with convective weather modeling in real time to identify a reroute that is free of weather and traffic conflicts and indicates enough time and fuel savings to be considered. The concept is interoperable with today

Class network routing

Science.gov (United States)

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

2009-09-08

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

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

Science.gov (United States)

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

2016-01-01

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

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

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

A System Concept for Facilitating User Preferences in En Route Airspace

Science.gov (United States)

Vivona, R. A.; Ballin, M. G.; Green, S. M.; Bach, R. E.; McNally, B. D.

1996-01-01

The Federal Aviation Administration is trying to make its air traffic management system more responsive to the needs of the aviation community by exploring the concept of 'free flight' for aircraft flying under instrument flight rules. A logical first step toward free flight could be made without significantly altering current air traffic control (ATC) procedures or requiring new airborne equipment by designing a ground-based system to be highly responsive to 'user preference' in en route airspace while providing for an orderly transition to the terminal area. To facilitate user preference in all en route environments, a system based on an extension of the Center/TRACON Automation System (CTAS) is proposed in this document. The new system would consist of two integrated components. An airspace tool (AT) focuses on unconstrained en route aircraft (e.g., not transitioning to the terminal airspace), taking advantage of the relatively unconstrained nature of their flights and using long-range trajectory prediction to provide cost-effective conflict resolution advisories to sector controllers. A sector tool (ST) generates efficient advisories for all aircraft, with a focus on supporting controllers in analyzing and resolving complex, highly constrained traffic situations. When combined, the integrated AT/ST system supports user preference in any air route traffic control center sector. The system should also be useful in evaluating advanced free-flight concepts by serving as a test bed for future research. This document provides an overview of the design concept, explains its anticipated benefits, and recommends a development strategy that leads to a deployable system.

Robustness of airline route networks

Science.gov (United States)

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.

78 FR 65658 - Agency Information Collection Activities: Submission for OMB Review; Comment Request

Science.gov (United States)

2013-11-01

... relevant survey experience, organizational survey capacity, and quality control procedures. The Marketplace... or OMB control number. To be assured consideration, comments and recommendations must be received by... Information Collection Request: New collection (Request for a new OMB control number); Title of Information...

77 FR 48554 - Agency Information Collection Activities: Comment Request

Science.gov (United States)

2012-08-14

... Schools. OMB Control No.: 3145-NEW. Abstract The National Science Foundation (NSF) requests a three-year... commitment to science, technology, engineering, and mathematics (STEM) education will also be surveyed. This... NATIONAL SCIENCE FOUNDATION Agency Information Collection Activities: Comment Request AGENCY...

Dynamic Routing and Coordination in Multi-Agent Networks

Science.gov (United States)

2016-06-10

epidemics spreading . Bibliography (J1) F. Pasqualetti, S. Zampieri, and F. Bullo. Controllability metrics, limitations and algorithms for complex networks ...controllability properties of the clusters and on their coupling strength. We validate our results with examples from power networks , social networks , and...SECURITY CLASSIFICATION OF: Supported by this project, we designed innovative routing, planning and coordination strategies for robotic networks and

75 FR 39620 - Proposed Information Collection (Dependents' Educational Assistance (DEA) Election Request...

Science.gov (United States)

2010-07-09

... (Dependents' Educational Assistance (DEA) Election Request) Activity: Comment Request AGENCY: Veterans... veterans beginning date to start their DEA benefits. DATES: Written comments and recommendations on the.... Title: Dependents' Educational Assistance (DEA) Election Request, VA Form Letter 22-909. OMB Control...

78 FR 17778 - Proposed Information Collection (Dependents' Educational Assistance (DEA) Election Request...

Science.gov (United States)

2013-03-22

... (Dependents' Educational Assistance (DEA) Election Request) Activity: Comment Request AGENCY: Veterans... veterans beginning date to start their DEA benefits. DATES: Written comments and recommendations on the.... Title: Dependents' Educational Assistance (DEA) Election Request, VA Form Letter 22-909. OMB Control...

76 FR 58567 - Proposed Information Collection (Request for Transportation Expense Reimbursement) Activity...

Science.gov (United States)

2011-09-21

... (Request for Transportation Expense Reimbursement) Activity; Comment Request AGENCY: Veterans Benefits... needed to determine children with spina bifida eligibility for reimbursement of transportation expenses...: Request for Transportation Expense Reimbursement (38 CFR 21.8370). OMB Control Number: 2900-0580. Type of...

78 FR 31557 - Agency Information Collection Activities: Proposed Collection; Comment Request

Science.gov (United States)

2013-05-24

..., Attention: Document Identifier/OMB Control Number ------, Room C4-26-05, 7500 Security Boulevard, Baltimore... essentially the same concept known in the private insurance industry as coordination of benefits; it refers to.... Type of Information Collection Request: New collection (Request for a new OMB control number); Title of...

Partial Path Column Generation for the Vehicle Routing Problem

DEFF Research Database (Denmark)

Jepsen, Mads Kehlet; Petersen, Bjørn

This paper presents a column generation algorithm for the Capacitated Vehicle Routing Problem (CVRP) and the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the CVRP and VRPTW have consisted of a Set Partitioning master problem with each column...... of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution space for the pricing problem can be obtained....

Strategy modulates spatial perspective-taking: evidence for dissociable disembodied and embodied routes

Science.gov (United States)

Gardner, Mark R.; Brazier, Mark; Edmonds, Caroline J.; Gronholm, Petra C.

2013-01-01

Previous research provides evidence for a dissociable embodied route to spatial perspective-taking that is under strategic control. The present experiment investigated further the influence of strategy on spatial perspective-taking by assessing whether participants may also elect to employ a separable “disembodied” route loading on inhibitory control mechanisms. Participants (N = 92) undertook both the “own body transformation” (OBT) perspective-taking task, requiring speeded spatial judgments made from the perspective of an observed figure, and a control task measuring ability to inhibit spatially compatible responses in the absence of a figure. Perspective-taking performance was found to be related to performance on the response inhibition control task, in that participants who tended to take longer to adopt a new perspective also tended to show a greater elevation in response times when inhibiting spatially compatible responses. This relationship was restricted to those participants reporting that they adopted the perspective of another by reversing left and right whenever confronted with a front-view figure; it was absent in those participants who reported perspective-taking by mentally transforming their spatial orientation to align with that of the figure. Combined with previously published results, these findings complete a double dissociation between embodied and disembodied routes to spatial perspective-taking, implying that spatial perspective-taking is subject to modulation by strategy, and suggesting that embodied routes to perspective-taking may place minimal demands on domain general executive functions. PMID:23964229

77 FR 56842 - Labor-Management Relations Information Collection Requests

Science.gov (United States)

2012-09-14

... FEDERAL MEDIATION AND CONCILIATION SERVICE Labor-Management Relations Information Collection... the following public information collection request (ICR) to the Office of Management and Budget (OMB... information collection request is the Notice to Mediation Agencies (Agency Form F-7), OMB control number 3076...

Request Stream Control for the Access to Broadband Multimedia Educational Resources in the Distance Learning System

Directory of Open Access Journals (Sweden)

Irina Pavlovna Bolodurina

2013-10-01

Full Text Available This article presents a model of queuing system for broadband multimedia educational resources, as well as a model of access to a hybrid cloud system storage. These models are used to enhance the efficiency of computing resources in a distance learning system. An additional OpenStack control module has been developed to achieve the distribution of request streams and balance the load between cloud nodes.

An overview of smart grid routing algorithms

Science.gov (United States)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

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

Deflection routing scheme for GMPLS-based OBS networks

DEFF Research Database (Denmark)

Eid, Arafat; Mahmood, Waqar; Alomar, Anwar

2010-01-01

Integrating the Generalized Multi-Protocol Label Switching (GMPLS) framework into an Optical Burst Switching (OBS) Control Plane is a promising solution to alleviating most of OBS performance and design issues. However, implementing the already proposed OBS deflection routing schemes is not appli...

78 FR 69643 - Submission for OMB Review; Comment Request

Science.gov (United States)

2013-11-20

... DEPARTMENT OF COMMERCE Submission for OMB Review; Comment Request The Department of Commerce will... Rationalization Social Study. OMB Control Number: None. Form Number(s): NA. Type of Request: Regular submission... negative social impacts. Sufficient non-economic social science data will be collected to describe the...

78 FR 42752 - Submission for OMB Review; Comment Request

Science.gov (United States)

2013-07-17

... DEPARTMENT OF COMMERCE Submission for OMB Review; Comment Request The Department of Commerce will... Rationalization Social Study. OMB Control Number: 0648-0606. Form Number(s): NA. Type of Request: Regular... fishery. An understanding of social impacts in fisheries--achieved through the collection of data on...

Southern states' routing agency report

International Nuclear Information System (INIS)

1989-02-01

The Southern states' routing agency report is a compendium of 16-southern states' routing programs relative to the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source ad scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

Southern States' Routing Agency Report

International Nuclear Information System (INIS)

1990-03-01

The Southern States' Routing Agency Report is a compendium of 16-southern states' routing program for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs.

Science.gov (United States)

Aslam, Muhammad; Hu, Xiaopeng; Wang, Fan

2017-12-13

Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN). Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs) utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR) routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR's routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS). This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR) to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime and stability

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs

Directory of Open Access Journals (Sweden)

Muhammad Aslam

2017-12-01

Full Text Available Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN. Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR’s routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS. This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime

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

Science.gov (United States)

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.

77 FR 75970 - Information Collection Activity; Comment Request

Science.gov (United States)

2012-12-26

... . Title: Request for Release of Lien and/or Approval of Sale. OMB Control Number: 0572-0041. Type of... security instruments, e.g., the RUS mortgage, limit the rights of a RUS borrower to dispose of its capital assets. The RUS Form 793, Request for Release of Lien and/or Approval of Sale, allows the...

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.

75 FR 38774 - Submission for OMB Review; Comment Request

Science.gov (United States)

2010-07-06

... DEPARTMENT OF COMMERCE Submission for OMB Review; Comment Request The Department of Commerce will... Social Network Analysis. OMB Control Number: None. Form Number(s): None. Type of Request: Regular... on these issues in many capacities. A social network analysis will serve to identify the network of...

75 FR 26197 - Submission for OMB Review; Comment Request

Science.gov (United States)

2010-05-11

... DEPARTMENT OF COMMERCE Submission for OMB Review; Comment Request The Department of Commerce will... Social Study. OMB Control Number: None. Form Number(s): NA. Type of Request: Regular submission. Number... understanding of social impacts in fisheries--achieved through the collection of data on fishing communities, as...

Contraceptive attitudes and contraceptive failure among women requesting induced abortion in Denmark

DEFF Research Database (Denmark)

Rasch, Vibeke; Knudsen, Lisbeth B.; Gammeltoft, Tine

2007-01-01

Objective: To elucidate how contraceptive attitudes among Danish-born and immigrant women influence the request of induced abortion. Method: A case-control study, the case group comprising 1,095 Danish-born women and 233 immigrant women requesting abortion, in comparison with a control group of 1...

Partial path column generation for the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Petersen, Bjørn; Jepsen, Mads Kehlet

2009-01-01

This paper presents a column generation algorithm for the Vehicle Routing Problem with Time Windows (VRPTW). Traditionally, column generation models of the VRPTW have consisted of a Set Partitioning master problem with each column representing a route, i.e., a resource feasible path starting...... and ending at the depot. Elementary routes (no customer visited more than once) have shown superior results on difficult instances (less restrictive capacity and time windows). However, the pricing problems do not scale well when the number of feasible routes increases, i.e., when a route may contain a large...... number of customers. We suggest to relax that ‘each column is a route’ into ‘each column is a part of the giant tour’; a so-called partial path, i.e., not necessarily starting and ending in the depot. This way, the length of the partial path can be bounded and a better control of the size of the solution...

EpSoc: Social-Based Epidemic-Based Routing Protocol in Opportunistic Mobile Social Network

Directory of Open Access Journals (Sweden)

Halikul Lenando

2018-01-01

Full Text Available In opportunistic networks, the nature of intermittent and disruptive connections degrades the efficiency of routing. Epidemic routing protocol is used as a benchmark for most of routing protocols in opportunistic mobile social networks (OMSNs due to its high message delivery and latency. However, Epidemic incurs high cost in terms of overhead and hop count. In this paper, we propose a hybrid routing protocol called EpSoc which utilizes the Epidemic routing forwarding strategy and exploits an important social feature, that is, degree centrality. Two techniques are used in EpSoc. Messages’ TTL is adjusted based on the degree centrality of nodes, and the message blocking mechanism is used to control replication. Simulation results show that EpSoc increases the delivery ratio and decreases the overhead ratio, the average latency, and the hop counts as compared to Epidemic and Bubble Rap.

Modeling route choice criteria from home to major streets: A discrete choice approach

Directory of Open Access Journals (Sweden)

Jose Osiris Vidana-Bencomo

2018-03-01

Full Text Available A discrete choice model that consists of three sub-models was developed to investigates the route choice criteria of drivers who travel from their homes in the morning to the access point along the major streets that bound the Traffic Analysis Zones (TAZs. The first sub-model is a Nested Logit Model (NLM that estimates the probability of a driver has or has no multiple routes, and if the driver has multiple routes, the route selection criteria are based on the access point’s intersection control type or other factors. The second sub-model is a Mixed Logit (MXL model. It estimates the probabilities of the type of intersection control preferred by a driver. The third sub-model is a NLM that estimates the probabilities of a driver selecting his/her route for its shortest travel time or to avoid pedestrian, and if the aim is to take the fastest route, the decision criteria is based on the shortest distance or minimum stops and turns. Data gathered in a questionnaire survey were used to estimate the sub-models. The attributes of the utility functions of the sub-models are the driver’s demographic and trip characteristics. The model provides a means for transportation planners to distribute the total number of home-based trips generated within a TAZ to the access points along the major streets that bound the TAZ.

DARAL: A Dynamic and Adaptive Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Francisco José Estévez

2016-06-01

Full Text Available The evolution of Smart City projects is pushing researchers and companies to develop more efficient embedded hardware and also more efficient communication technologies. These communication technologies are the focus of this work, presenting a new routing algorithm based on dynamically-allocated sub-networks and node roles. Among these features, our algorithm presents a fast set-up time, a reduced overhead and a hierarchical organization, which allows for the application of complex management techniques. This work presents a routing algorithm based on a dynamically-allocated hierarchical clustering, which uses the link quality indicator as a reference parameter, maximizing the network coverage and minimizing the control message overhead and the convergence time. The present work based its test scenario and analysis in the density measure, considered as a node degree. The routing algorithm is compared with some of the most well known routing algorithms for different scenario densities.

78 FR 56225 - Information Collection Request Submitted to OMB for Review and Approval; Comment Request; Soil...

Science.gov (United States)

2013-09-12

...EPA has submitted the following Information Collection Request (ICR) to the Office of Management and Budget (OMB) for review and approval in accordance with the Paperwork Reduction Act: ``Soil Fumigant Risk Mitigation'' (EPA ICR No. 2451.01, OMB Control No. 2070- New). This is a request for approval of a new collection. The ICR, which is abstracted below, describes the nature of the information collection activity and its expected burden and costs. Copies of the ICR and related documents are available in the docket.

78 FR 31972 - Notice of Proposed Information Collection for Public Comment; Request Voucher for Grant Payment...

Science.gov (United States)

2013-05-28

... Information Collection for Public Comment; Request Voucher for Grant Payment and Line of Credit Control System... information: Title Of Proposal: Request Voucher for Grant Payment and Line of Credit Control System (LOCCS... and proposed use: Payment request vouchers for distribution of grant funds using the automated Voice...

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

Directory of Open Access Journals (Sweden)

Tad T Brunyé

Full Text Available 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.

76 FR 7532 - Submission for OMB Review; Comment Request

Science.gov (United States)

2011-02-10

... Requirements. OMB Control Number: 0648-0351. Form Number(s): NA. Type of Request: Regular submission (extension... the gear is to be marked for the purposes of visibility (e.g., buoys, radar reflectors, or other... DEPARTMENT OF COMMERCE Submission for OMB Review; Comment Request The Department of Commerce will...

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

couple of decades. To deliver competitive service and price, transportation today needs to be cost effective. A company requiring for things to be shipped will aim at having the freight shipped as cheaply as possible while often satisfying certain time constraints. For the transportation company......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... set cost making the cost of the individual vehicle routes inter-dependant. Depending on the problem type, the size of the problems and time available for solving, different solution methods can be applicable. In this thesis both heuristic methods and several exact methods are investigated depending...

78 FR 23975 - Proposed Collection; Comment Request for Regulation Project

Science.gov (United States)

2013-04-23

... DEPARTMENT OF THE TREASURY Internal Revenue Service Proposed Collection; Comment Request for Regulation Project AGENCY: Internal Revenue Service (IRS), Treasury. ACTION: Notice and request for comments... definition of a controlled foreign corporation, foreign base company income and foreign personal holding...

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

Multi-Attribute Decision Theory is applied to rank II alternative routes to nuclear proliferation in order of difficulty in acquiring nuclear weapons by nonnuclear countries. The method is based on reducing the various variables affecting the decision to a single function providing a measure for the proliferation route. The results indicate that the most difficult route to obtain atomic weapons is through nuclear power reactors, specifically the liquid-metal fast breeder reactor, heavy water Canada deuterium uranium reactor, and light water reactors such as boiling water and pressurized water reactors. The easiest routes are supercritical centrifuge isotope separation, laser isotope separation, and research reactor. However, nonnuclear routes available that result in substantial damage to life and property are easier than any nuclear route

22 CFR 212.34 - Procedures for responding to requests for records.

Science.gov (United States)

2010-04-01

... what extent the Agency can provide the information requested. Upon the making of that determination... the name of the controlling agency and of the address from which the material may be requested, unless...

75 FR 60404 - Information Collection Request Submitted to Office of Management and Budget

Science.gov (United States)

2010-09-30

... [OMB Control Number: 3002-0003] Information Collection Request Submitted to Office of Management and... United States will submit an Information Collection Request (ICR) to the Office of Management and Budget (OMB) requesting approval for the following collection of information: 3002-0003, Substitute...

Transportation Routing Analysis Geographic Information System -- TRAGIS, progress on improving a routing tool

International Nuclear Information System (INIS)

Johnson, P.E.; Lester, P.B.

1998-05-01

The Transportation Routing Analysis Geographic Information System (TRAGIS) model provides a useful tool to calculate and analyze transportation routes for radioactive materials within the continental US. This paper outlines some of the features available in this model

Large graph visualization of millions of connections in the CERN control system network traffic: analysis and design of routing and firewall rules with a new approach

CERN Document Server

Gallerani, Luigi

2015-01-01

Abstract The CERN Technical Network (TN) TN was intended to be a network for accelerator and infrastructure operations. However, today, more than 60 million IP packets are routed every hour between the General Purpose Network (GPN) and the TN, involving more than 6000 different hosts. In order to improve the security of the accelerator control system, it is fundamental to understand the network traffic between the two networks and to define new appropriate routing and firewall rules without impacting operations. The complexity and huge size of the infrastructure and the number of protocols and services involved, have discouraged for years any attempt to understand and control the network traffic between the GPN and the TN. In this paper, we show a new way to solve the problem graphically. Combining the network traffic analysis with the use of large graph visualization algorithms we produced usable 2D large color topology maps of the network identifying the inter-relations of the control system machines and s...

Collective network routing

Science.gov (United States)

Hoenicke, Dirk

2014-12-02

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

North Atlantic IFR Route Planning Chart GEO-TIFF - Aeronautical Information Services Digital Products

Data.gov (United States)

Department of Transportation — North Atlantic Route Chart is designed for FAA Controllers to monitor transatlantic flights, this 5-color chart shows oceanic control areas, coastal navigation aids,...

North Atlantic IFR Route Planning Chart PDF File - Aeronautical Information Services Digital Products

Data.gov (United States)

Department of Transportation — North Atlantic Route Chart is designed for FAA Controllers to monitor transatlantic flights, this 5-color chart shows oceanic control areas, coastal navigation aids,...

ABORt: Acknowledgement-Based Opportunistic Routing Protocol for High Data Rate Multichannel WSNs

Directory of Open Access Journals (Sweden)

Hamadoun Tall

2017-10-01

Full Text Available The ease of deployment and the auto-configuration capabilities of Wireless Sensor Networks (WSNs make them very attractive in different domains like environmental, home automation or heath care applications. The use of multichannel communications in WSNs helps to improve the overall performance of the network. However, in heavy traffic scenarios, routing protocols should be adapted to allow load balancing and to avoid losing data packets due to congestion and queue overflow. In this paper, we present an Acknowledgement-Based Opportunistic Routing (ABORt protocol designed for high data rate multichannel WSNs. It is a low overhead protocol that does not rely on synchronization for control traffic exchange during the operational phase of the network. ABORt is an opportunistic protocol that relies on link layer acknowledgements to disseminate routing metrics, which helps to reduce overhead. The performance of ABORt is evaluated using the Cooja simulator and the obtained results show that ABORt has a high packet delivery ratio with reduced packet end-to-end delay compared to two single channel routing protocols and two multichannel routing protocols that use number of hops and expected transmission count as routing metrics.

Route Scherrer and Route Einstein closed for construction work

CERN Multimedia

2015-01-01

Please note that Route Scherrer will be inaccessible for two and a half months from the beginning of March and that part of Route Einstein will be closed for two weeks from the end of February.   Figure 1. The part of Route Scherrer between Building 510 and Building 53 (see Figure 1) will be closed from the beginning of March until mid-May for civil engineering works.   The superheated water pipes supplying the buildings in this area date back to 1959 and therefore present a significant risk of leakage. In order to ensure the reliable supply of superheated water, and, by extension, heating, to all premises near the Main Building (i.e. Buildings 500, 501, 503, 60, 62, 63 and 64), a new buried service duct will be installed between the basements of Buildings 53 and 61 to house a new superheated water pipe. Figure 2. The following car parks will, however, remain accessible for the duration of the works: the Cèdres car park, the car park for Buildings 4 and 5, and the ca...

US Hazardous Materials Routes, Geographic WGS84, BTS (2006) [hazardous_material_routes_BTS_2006

Data.gov (United States)

Louisiana Geographic Information Center — The Federal Motor Carrier Safety Administration (FMCSA) Hazardous Material Routes were developed using the 2004 First Edition TIGER/Line files. The routes are...

Harmonic analysis of the stability of reverse routing in channels

Directory of Open Access Journals (Sweden)

2007-01-01

Full Text Available Normal downstream routing of a flood flow is a highly stable process for Froude numbers less than 1 and hence the results are reliable. In contrast, reverse routing in an upstream direction, which may be required for flow control, is potentially unstable. This paper reports the results of a study of the practical limits on channel lengths for reverse routing. Harmonic analysis is applied to the full non-linear solution of the St. Venant equations for three different wave patterns and two different wave periods, for a particular channel with a Froude number of 0.5. Reverse routing can be done for prismatic channels longer than 100 km. For long periods (>10 hours the shape of the upstream hydrograph is recovered well. However, when the wave period is short (<1 hour, the high frequency components of the upstream hydrograph and, thus, its shape, are not recovered. These limits are influenced by the channel morphology and shape of the wave. Further work is needed to determine how these factors interact.

Route-specific analysis for radioactive materials transportation

International Nuclear Information System (INIS)

1986-01-01

This report addresses a methodology for route-specific analysis, of which route-selection is one aspect. Identification and mitigation of specific hazards along a chosen route is another important facet of route-specific analysis. Route-selection and route-specific mitigation are two tools to be used in minimizing the risk of radioactive materials transportation and promoting public confidence. Other tools exist to improve the safety of transportation under the Nuclear Waste Policy Act. Selection of a transportation mode and other, non-route-specific measures, such as improved driver training and improved cask designs, are additional tools to minimize transportation risk and promote public confidence. This report addresses the route-specific analysis tool and does not attempt to evaluate its relative usefulness as compared to other available tools. This report represents a preliminary attempt to develop a route-specific analysis methodlogy. The Western Interstate Energy Board High-Level Waste Committee has formed a Route-Specific Analysis Task Force which will build upon the methodology proposed in this Staff Report. As western states continue to investigate route-specific analysis issues, it is expected that the methodology will evolve into a more refined product representing the views of a larger group of interested parties in the West

A LOOP-BASED APPROACH IN CLUSTERING AND ROUTING IN MOBILE AD HOC NETWORKS

Institute of Scientific and Technical Information of China (English)

Li Yanping; Wang Xin; Xue Xiangyang; C.K. Toh

2006-01-01

Although clustering is a convenient framework to enable traffic control and service support in Mobile Ad hoc NETworks (MANETs), it is seldom adopted in practice due to the additional traffic overhead it leads to for the resource limited ad hoc network. In order to address this problem, we proposed a loop-based approach to combine clustering and routing. By employing loop topologies, topology information is disseminated with a loop instead of a single node, which provides better robustness, and the nature of a loop that there are two paths between each pair of nodes within a loop suggests smart route recovery strategy. Our approach is composed of setup procedure, regular procedure and recovery procedure to achieve clustering, routing and emergent route recovering.

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

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

2018-04-01

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

SDN-enabled dynamic WDM networks to address routing information inaccuracy

CSIR Research Space (South Africa)

Ravhuanzwo, Lusani

2016-11-01

Full Text Available Large dynamic wavelength-division multiplexed (WDM) networks based on the distributed control mechanism are susceptible to routing information inaccuracies. Factors such as non-negligible propagation delays, infrequent network state updates...

Experiences with serial and parallel algorithms for channel routing using simulated annealing

Science.gov (United States)

Brouwer, Randall Jay

1988-01-01

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

Joy, D.S.; Johnson, P.E.; Clarke, D.B.; McGuire, S.C.

1981-01-01

Oak Ridge National Laboratory (ORNL) has been involved in transportation logistics of radioactive wastes as part of the overall waste transportation program. A Spent Fuel Logistics Model (SFLM), was developed to predict overall material balances representing the flow of spent fuel assemblies from reactors to away-from-reactor storage facilities and/or to federal repositories. The transportation requirements to make these shipments are also itemized. The next logical step in the overall transportation project was the development of a set of computer codes which would predict likely transportation routes for waste shipments. Two separate routing models are now operational at ORNL. Routes for truck transport can be estimated with the HIGHWAY program, and rail and barge routes can be predicted with the INTERLINE model. This paper discusses examples of the route estimates and applications of the routing models

Human risk assessment of dermal and inhalation exposures to chemicals assessed by route-to-route extrapolation: the necessity of kinetic data.

Science.gov (United States)

Geraets, Liesbeth; Bessems, Jos G M; Zeilmaker, Marco J; Bos, Peter M J

2014-10-01

In toxicity testing the oral route is in general the first choice. Often, appropriate inhalation and dermal toxicity data are absent. Risk assessment for these latter routes usually has to rely on route-to-route extrapolation starting from oral toxicity data. Although it is generally recognized that the uncertainties involved are (too) large, route-to-route extrapolation is applied in many cases because of a strong need of an assessment of risks linked to a given exposure scenario. For an adequate route-to-route extrapolation the availability of at least some basic toxicokinetic data is a pre-requisite. These toxicokinetic data include all phases of kinetics, from absorption (both absorbed fraction and absorption rate for both the starting route and route of interest) via distribution and biotransformation to excretion. However, in practice only differences in absorption between the different routes are accounted for. The present paper demonstrates the necessity of route-specific absorption data by showing the impact of its absence on the uncertainty of the human health risk assessment using route-to-route extrapolation. Quantification of the absorption (by in vivo, in vitro or in silico methods), particularly for the starting route, is considered essential. Copyright © 2014 Elsevier Inc. All rights reserved.

Vehicle Routing With User Generated Trajectory Data

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

Rapidly increasing volumes of GPS data collected from vehicles provide new and increasingly comprehensive insight into the routes that drivers prefer. While routing services generally compute shortest or fastest routes, recent studies suggest that local drivers often prefer routes that are neithe...

Conflict Resolution Performance in an Experimental Study of En Route Free Maneuvering Operations

Science.gov (United States)

Doble, Nathan A.; Barhydt, Richard; Hitt, James M., II

2005-01-01

NASA has developed a far-term air traffic management concept, termed Distributed Air/Ground Traffic Management (DAG-TM). One component of DAG-TM, En Route Free Maneuvering, allows properly trained flight crews of equipped autonomous aircraft to assume responsibility for separation from other autonomous aircraft and from Instrument Flight Rules (IFR) aircraft. Ground-based air traffic controllers continue to separate IFR traffic and issue flow management constraints to all aircraft. To examine En Route Free Maneuvering operations, a joint human-in-the-loop experiment was conducted in summer 2004 at the NASA Ames and Langley Research Centers. Test subject pilots used desktop flight simulators to resolve traffic conflicts and adhere to air traffic flow constraints issued by subject controllers. The experimental airspace integrated both autonomous and IFR aircraft at varying traffic densities. This paper presents a subset of the En Route Free Maneuvering experimental results, focusing on airborne and ground-based conflict resolution, and the effects of increased traffic levels on the ability of pilots and air traffic controllers to perform this task. The results show that, in general, increases in autonomous traffic do not significantly impact conflict resolution performance. In addition, pilot acceptability of autonomous operations remains high throughout the range of traffic densities studied. Together with previously reported findings, these results continue to support the feasibility of the En Route Free Maneuvering component of DAG-TM.

StateGEN/StateNET - A structured method to perform route comparisons

International Nuclear Information System (INIS)

Cashwell, J.W.; Erickson, C.M.

1989-01-01

StateGEN/StateNET is a modeling structure and routing algorithm designed expressly to address the needs of state and local governments to perform analyses of routing alternatives. StateGEN/StateNET is designed to permit the user to construct a network and assign attributes of interest to the network on a personal computer (PC). The completed network is then transferred via a modem to the TRANSNET system and the preferred route is determined based upon attribute weights assigned by the user. This modeling structure permits the state or local government to perform a routing analysis, such as that required by the US Department of Transportation (DOT) for Highway Route-Controlled Quantity shipments of radioactive materials, with a minimum of resources. StateGEN/StateNET provides a computerized version of the DOT guidelines or allows the user to structure their own network parameters. Sandia National Laboratories (SNL) is the Department of Energy (DOE) lead organization for transportation research and development. The DOE Office of Defense Programs has been the prime sponsor of development of models and associated databases used to analyze the impacts of the transportation of radioactive materials. The routing algorithms used in StateGEN/StateNET were based on the existing models on TRANSNET, a system which was developed to enable outside users to access analytical codes and associated data developed for the DOE

StateGEN/StateNET--A structured method to perform route comparisons

International Nuclear Information System (INIS)

Cashwell, J.W.; Erickson, C.M.

1989-01-01

StateGEN/StateNET is a modelling structure and routing algorithm designed expressly to address the needs of state and local governments to perform analyses of routing alternatives. StateGEN/StateNET is designed to permit the user to construct a network and assign attributes of interest to the network on a personal computer (PC). The completed network is then transferred via a modem to the TRANSNET system (Cashwell, 1989) and the preferred route is determined based upon attribute weights assigned by the user. This modelling structure permits the state or local to perform a routing analysis, such as that required by the US Department of Transportation (DOT) for Highway Route-Controlled Quantity shipments of radioactive materials, with a minimum of resources. StateGEN/StateNET provides a computerized version of the DOT guidelines (Cashwell, 1989) or allows the user to structure their own network parameters. Sandia national Laboratories (SNL) is the Department of Energy's (DOE) lead organization for transportation research and development. The DOE Office of Defense Programs has been the prime sponsor of development of models and associated databases used to analyze the impacts of the transportation of radioactive materials. The routing algorithms used in StateGEN/StateNET were based on the existing models on TRANSNET, a system which was developed to enable outside users to access analytical codes and associated data developed for the DOE. 2 refs

78 FR 63496 - Agency Information Collection Activities; Submission for OMB Review; Comment Request; Medical...

Science.gov (United States)

2013-10-24

... submission of responses. Agency: DOL-OWCP. Title of Collection: Medical Travel Refund Request. OMB Control... DEPARTMENT OF LABOR Office of the Secretary Agency Information Collection Activities; Submission for OMB Review; Comment Request; Medical Travel Refund Request ACTION: Notice. SUMMARY: The Department...

A Genetic Algorithm on Inventory Routing Problem

Directory of Open Access Journals (Sweden)

Nevin Aydın

2014-03-01

Full Text Available Inventory routing problem can be defined as forming the routes to serve to the retailers from the manufacturer, deciding on the quantity of the shipment to the retailers and deciding on the timing of the replenishments. The difference of inventory routing problems from vehicle routing problems is the consideration of the inventory positions of retailers and supplier, and making the decision accordingly. Inventory routing problems are complex in nature and they can be solved either theoretically or using a heuristics method. Metaheuristics is an emerging class of heuristics that can be applied to combinatorial optimization problems. In this paper, we provide the relationship between vendor-managed inventory and inventory routing problem. The proposed genetic for solving vehicle routing problem is described in detail.

Blind Cooperative Routing for Scalable and Energy-Efficient Internet of Things

KAUST Repository

Bader, Ahmed

2016-02-26

Multihop networking is promoted in this paper for energy-efficient and highly-scalable Internet of Things (IoT). Recognizing concerns related to the scalability of classical multihop routing and medium access techniques, the use of blind cooperation in conjunction with multihop communications is advocated herewith. Blind cooperation however is actually shown to be inefficient unless power control is applied. Inefficiency in this paper is projected in terms of the transport rate normalized to energy consumption. To that end, an uncoordinated power control mechanism is proposed whereby each device in a blind cooperative cluster randomly adjusts its transmit power level. An upper bound is derived for the mean transmit power that must be observed at each device. Finally, the uncoordinated power control mechanism is demonstrated to consistently outperform the simple point-to-point routing case. © 2015 IEEE.

ENERGY EFFICIENT ROUTING PROTOCOLS FOR WIRELESS AD HOC NETWORKS – A SURVEY

Directory of Open Access Journals (Sweden)

K. Sankar

2012-06-01

Full Text Available Reducing energy consumption, primarily with the goal of extending the lifetime of battery-powered devices, has emerged as a fundamental challenge in wireless communication. The performance of the medium access control (MAC scheme not only has a fairly significant end-result on the behaviour of the routing approach employed, but also on the energy consumption of the wireless network interface card (NIC. We investigate the inadequacies of the MAC schemes designed for ad hoc wireless networks in the context of power awareness herein. The topology changes due to uncontrollable factors such as node mobility, weather, interference, noise, as well as on controllable parameters such as transmission power and antenna direction results in significant amount of energy loss. Controlling rapid topology changes by minimizing the maximum transmission power used in ad hoc wireless networks, while still maintaining networks connectivity can prolong battery life and hence network lifetime considerably. In addition, we systematically explore the potential energy consumption pitfalls of non–power-based and power based routing schemes. We suggest a thorough energy-based performance survey of energy aware routing protocols for wireless mobile ad-hoc networks. We also present the statistical performance metrics measured by our simulations.

Towards Internet QoS provisioning based on generic distributed QoS adaptive routing engine.

Science.gov (United States)

Haikal, Amira Y; Badawy, M; Ali, Hesham A

2014-01-01

Increasing efficiency and quality demands of modern Internet technologies drive today's network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature.

Towards Internet QoS Provisioning Based on Generic Distributed QoS Adaptive Routing Engine

Directory of Open Access Journals (Sweden)

Amira Y. Haikal

2014-01-01

Full Text Available Increasing efficiency and quality demands of modern Internet technologies drive today’s network engineers to seek to provide quality of service (QoS. Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i provide a general configuration guideline for service differentiation, (ii formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA based on dynamic programming technique, and (iii propose QoS multipath forwarding (QMPF model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature.

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

.... In this paper, we propose a new approach, namely a capacity constrained routing planner which models capacity as a time series and generalizes shortest path algorithms to incorporate capacity constraints...

A Dynamic Reputation Management System for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Eric Chiejina

2015-04-01

Full Text Available Nodes in mobile ad hoc networks (MANETs are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the network.

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

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

The Pyramidal Capacitated Vehicle Routing Problem

DEFF Research Database (Denmark)

Lysgaard, Jens

This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal...

The pyramidal capacitated vehicle routing problem

DEFF Research Database (Denmark)

Lysgaard, Jens

2010-01-01

This paper introduces the pyramidal capacitated vehicle routing problem (PCVRP) as a restricted version of the capacitated vehicle routing problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the pyramidal traveling salesman problem (PTSP). A pyramidal...

Routing of individual polymers in designed patterns

DEFF Research Database (Denmark)

Knudsen, Jakob Bach; Liu, Lei; Kodal, Anne Louise Bank

2015-01-01

Synthetic polymers are ubiquitous in the modern world, but our ability to exert control over the molecular conformation of individual polymers is very limited. In particular, although the programmable self-assembly of oligonucleotides and proteins into artificial nanostructures has been...... demonstrated, we currently lack the tools to handle other types of synthetic polymers individually and thus the ability to utilize and study their single-molecule properties. Here we show that synthetic polymer wires containing short oligonucleotides that extend from each repeat can be made to assemble...... into arbitrary routings. The wires, which can be more than 200 nm in length, are soft and bendable, and the DNA strands allow individual polymers to self-assemble into predesigned routings on both two- and three-dimensional DNA origami templates. The polymers are conjugated and potentially conducting, and could...

Routed planar networks

Directory of Open Access Journals (Sweden)

David J. Aldous

2016-04-01

Full Text Available Modeling a road network as a planar graph seems very natural. However, in studying continuum limits of such networks it is useful to take {\\em routes} rather than {\\em edges} as primitives. This article is intended to introduce the relevant (discrete setting notion of {\\em routed network} to graph theorists. We give a naive classification of all 71 topologically different such networks on 4 leaves, and pose a variety of challenging research questions.

Facile and solvent-free routes for the synthesis of size-controllable Fe3O4 nanoparticles

International Nuclear Information System (INIS)

Ngo, Thanh Hieu; Tran, Dai Lam; Do, Hung Manh; Le, Van Hong; Nguyen, Xuan Phuc; Tran, Vinh Hoang

2010-01-01

Magnetite nanoparticles are one of the most important materials that are widely used in both medically diagnostic and therapeutic research. In this paper, we present some facile and non-toxic synthetic approaches for size-controllable preparations of magnetite nanoparticles, which are appropriate for biomedical applications, namely (i) co-precipitation; (ii) reduction–precipitation and (iii) oxidation–precipitation. Magnetic characterizations of the obtained nanoparticles have been studied and discussed. The oxidation precipitation route was chosen for investigation of the dependence of kinetic driven activation energy and that of coercive force on particle size (and temperature) during the course of the reaction. The structural–magnetic behavior was also correlated. Being solvent and surfactant-free, these methods are advantageous for synthesis and further functionalization towards biomedical applications

Road Routes for Waste Disposal - MDC_RecyclingRoute

Data.gov (United States)

NSGIC Local Govt | GIS Inventory — This CURBSIDE RECYCLING ROUTES BOUNDARIES LAYER IS A polygon feature class created for the Miami-Dade Department of Solid Waste Management (DSWM). It contains the...

Porcelain tiles by the dry route

International Nuclear Information System (INIS)

Melchiades, F. G.; Daros, M. T.; Boschi, A. O.

2010-01-01

In Brazil, the second largest tile producer of the world, at present, 70% of the tiles are produced by the dry route. One of the main reasons that lead to this development is the fact that the dry route uses approximately 30% less thermal energy them the traditional wet route. The increasing world concern with the environment and the recognition of the central role played by the water also has pointed towards privileging dry processes. In this context the objective of the present work is to study the feasibility of producing high quality porcelain tiles by the dry route. A brief comparison of the dry and wet route, in standard conditions industrially used today to produce tiles that are not porcelain tiles, shows that there are two major differences: the particle sizes obtained by the wet route are usually considerably finer and the capability of mixing the different minerals, the intimacy of the mixture, is also usually better in the wet route. The present work studied the relative importance of these differences and looked for raw materials and operational conditions that would result in better performance and glazed porcelain tiles of good quality. (Author) 7 refs.

Low pathogenicity avian influenza viruses infect chicken layers by different routes of inoculation.

Science.gov (United States)

Pantin-Jackwood, Mary J; Smith, Diane M; Wasilenko, Jamie L; Spackman, Erica

2012-06-01

In order to develop better control measures against avian influenza, it is necessary to understand how the virus transmits in poultry. In a previous study in which the infectivity and transmissibility of the pandemic H1N1 influenza virus was examined in different poultry species, we found that no or minimal infection occurred in chicken and turkeys intranasally (IN) inoculated with the virus. However, we demonstrated that the virus can infect laying turkey hens by the intracloacal (IC) and intraoviduct (IO) routes, possibly explaining the drops in egg production observed in turkey breeder farms affected by the virus. Such novel routes of exposure have not been previously examined in chickens and could also explain outbreaks of low pathogenicity avian influenza (LPAI) that cause a decrease in egg production in chicken layers and breeders. In the present study, 46-wk-old specific-pathogen-free chicken layers were infected by the IN, IC, or IO routes with one of two LPAI viruses: a poultry origin virus, A/chicken/CA/1255/02 (H6N2), and a live bird market isolate, A/chicken/NJ/12220/97 (H9N2). Only hens IN inoculated with the H6N2 virus presented mild clinical signs consisting of depression and anorexia. However, a decrease in number of eggs laid was observed in all virus-inoculated groups when compared to control hens. Evidence of infection was found in all chickens inoculated with the H6N2 virus by any of the three routes and the virus transmitted to contact hens. On the other hand, only one or two hens from each of the groups inoculated with the H9N2 virus shed detectable levels of virus, or seroconverted and did not transmit the virus to contacts, regardless of the route of inoculation. In conclusion, LPAI viruses can also infect chickens through other routes besides the IN route, which is considered the natural route of exposure. However, as seen with the H9N2 virus, the infectivity of the virus did not increase when given by these alternate routes.

VANET Routing Protocols: Pros and Cons

OpenAIRE

Paul, Bijan; Ibrahim, Md.; Bikas, Md. Abu Naser

2012-01-01

VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol h...

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

Science.gov (United States)

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.

Predicting bat colony survival under controls targeting multiple transmission routes of white-nose syndrome.

Science.gov (United States)

Meyer, A D; Stevens, D F; Blackwood, J C

2016-11-21

White-nose syndrome (WNS) is a lethal infection of bats caused by the psychrophilic fungus Pseudogymnoascus destructans (Pd). Since the first cases of WNS were documented in 2006, it is estimated that as many as 5.5million bats have succumbed in the United States-one of the fastest mammalian die-offs due to disease ever observed, and the first known sustained epizootic of bats. WNS is contagious between bats, and mounting evidence suggests that a persistent environmental reservoir of Pd plays a significant role in transmission as well. It is unclear, however, the relative contributions of bat-to-bat and environment-to-bat transmission to disease propagation within a colony. We analyze a mathematical model to investigate the consequences of both avenues of transmission on colony survival in addition to the efficacy of disease control strategies. Our model shows that selection of the most effective control strategies is highly dependent on the primary route of WNS transmission. Under all scenarios, however, generalized culling is ineffective and while targeted culling of infected bats may be effective under idealized conditions, it primarily has negative consequences. Thus, understanding the significance of environment-to-bat transmission is paramount to designing effective management plans. Copyright © 2016 Elsevier Ltd. All rights reserved.

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

Science.gov (United States)

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.

Contraceptive attitudes and contraceptive failure among women requesting induced abortion in Denmark

DEFF Research Database (Denmark)

Rasch, Vibeke; Knudsen, L B; Gammeltoft, T

2007-01-01

BACKGROUND: To elucidate how contraceptive attitudes among Danish-born and immigrant women influence the request of induced abortion. METHODS: A case-control study, the case group comprising 1095 Danish-born women and 233 immigrant women requesting abortion, in comparison with a control group...... of 1295 pregnant women intending to give birth. The analysis used hospital-based questionnaire interviews. RESULTS: Lack of contraceptive knowledge and experience of contraceptive problems were associated with the choice of abortion. This association was most pronounced among immigrant women, where women...... lacking knowledge had a 6-fold increased odds ratio (OR) and women having experienced problems a 5-fold increased OR for requesting abortion. Further, in this group of women, a partner's negative attitude towards contraception was associated with an 8-fold increased OR for requesting abortion...

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

2018-01-01

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

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

Science.gov (United States)

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.

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

NARCIS (Netherlands)

Dessing, D.; Vries, S.I. de; Hegeman, G.; Verhagen, E.; Mechelen, W. van; Pierik, F.H.

2016-01-01

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

An Energy-aware Routing Scheme in Delay Tolerant Mobile Sensor Networking

Directory of Open Access Journals (Sweden)

Zhe Chen

2014-08-01

Full Text Available In Delay Tolerant Mobile Sensor Networking (DTMSN, mobile sensor nodes are usually limited to their energy capacity, one important concern in routing design of DTMSN is energy consumption. This paper presents a number of variations of the Epidemic Routing Protocol (ERP to extend the DTMSN lifetime. It introduces the analytical model for ERP, after introducing the concepts behind the Target Delivery Probability and Minimum Delivery Probability, it defines the network lifetime. In this paper, it firstly studies many variations of the Epidemic Routing Protocol to extend the lifetime of the DTMSN. Secondly, based on the Epidemic Routing Protocol, three schemes are introduced. Those schemes rely on the limiting the times of message allowed for propagation (LT scheme, directly controlling the number of the copies (LC scheme, split the copies to the residual energies of the nodes (LE scheme. Finally, with the experiment and the validation of the simulation, the LE scheme can significantly maximize the lifetime of DTMSN, because it minimizes the number of copies and that shifts the generation of the copies to the nodes with larger residual energy.

Cooperative HARQ with Poisson Interference and Opportunistic Routing

KAUST Repository

Kaveh, Mostafa

2014-01-06

This presentation considers reliable transmission of data from a source to a destination, aided cooperatively by wireless relays selected opportunistically and utilizing hybrid forward error correction/detection, and automatic repeat request (Hybrid ARQ, or HARQ). Specifically, we present a performance analysis of the cooperative HARQ protocol in a wireless adhoc multihop network employing spatial ALOHA. We model the nodes in such a network by a homogeneous 2-D Poisson point process. We study the tradeoff between the per-hop rate, spatial density and range of transmissions inherent in the network by optimizing the transport capacity with respect to the network design parameters, HARQ coding rate and medium access probability. We obtain an approximate analytic expression for the expected progress of opportunistic routing and optimize the capacity approximation by convex optimization. By way of numerical results, we show that the network design parameters obtained by optimizing the analytic approximation of transport capacity closely follows that of Monte Carlo based exact transport capacity optimization. As a result of the analysis, we argue that the optimal HARQ coding rate and medium access probability are independent of the node density in the network.

78 FR 67204 - Agency Information Collection Activities: Proposed Collection; Comment Request

Science.gov (United States)

2013-11-08

... action to submit an information collection request to the Office of Management and Budget (OMB) and... about our intention to request the OMB's approval for renewal of an existing information collection that... safety demonstration section are submitted every two years. Nuclear material control and accounting...

Route selection issues for NWPA shipments

International Nuclear Information System (INIS)

Hill, C.V.; Harrison, I.G.

1993-01-01

Questions surrounding the designation of routes for the movement of spent nuclear fuel (SNF) and high-level radioactive waste (HLW) by the Office of Civilian Radioactive Waste Management (OCRWM) have broad implications. Federal regulations prescribe rules to be applied in the selection of highway routes. In most cases, these rules will lead to a clear selection of one route between an origin and destination point. However, in other cases, strict application of the regulations does not result in a clear choice of a preferred route. The regulations also provide discretion to State governments and carriers to select alternative routes to enhance the safety of the shipment. Railroad shipments of radioactive materials are not subject to Federal routing regulations. Since the railroads operate on private property, it has been assumed that they know the best way to move freight on their system. This discretion, while desirable for addressing unique local safety concerns or for responding to temporary safety concerns such as road problems, weather conditions, or construction areas, leads to significant opportunity for misunderstandings and uneasiness on the part of local residents

Routing of individual polymers in designed patterns

Science.gov (United States)

Knudsen, Jakob Bach; Liu, Lei; Bank Kodal, Anne Louise; Madsen, Mikael; Li, Qiang; Song, Jie; Woehrstein, Johannes B.; Wickham, Shelley F. J.; Strauss, Maximilian T.; Schueder, Florian; Vinther, Jesper; Krissanaprasit, Abhichart; Gudnason, Daniel; Smith, Anton Allen Abbotsford; Ogaki, Ryosuke; Zelikin, Alexander N.; Besenbacher, Flemming; Birkedal, Victoria; Yin, Peng; Shih, William M.; Jungmann, Ralf; Dong, Mingdong; Gothelf, Kurt V.

2015-10-01

Synthetic polymers are ubiquitous in the modern world, but our ability to exert control over the molecular conformation of individual polymers is very limited. In particular, although the programmable self-assembly of oligonucleotides and proteins into artificial nanostructures has been demonstrated, we currently lack the tools to handle other types of synthetic polymers individually and thus the ability to utilize and study their single-molecule properties. Here we show that synthetic polymer wires containing short oligonucleotides that extend from each repeat can be made to assemble into arbitrary routings. The wires, which can be more than 200 nm in length, are soft and bendable, and the DNA strands allow individual polymers to self-assemble into predesigned routings on both two- and three-dimensional DNA origami templates. The polymers are conjugated and potentially conducting, and could therefore be used to create molecular-scale electronic or optical wires in arbitrary geometries.

Traffic Aware Strategic Aircrew Requests (TASAR) Concept of Operations

Science.gov (United States)

Henderson, Jeffrey

2013-01-01

Aircrews submit trajectory change requests to air traffic control (ATC) to better achieve the operator's preferred business trajectory. Requests are currently made with limited information and are often denied because the change is not compatible with traffic. Also, request opportunities can be overlooked due to lack of automation that advises aircrews of trajectory changes that improve flight time, fuel burn, and other objectives. The Traffic Aware Strategic Aircrew Requests (TASAR) concept leverages Automatic Dependent Surveillance-Broadcast (ADS-B) surveillance information to advise the aircrew of beneficial trajectory changes that are probed for traffic compatibility prior to issuing the request to ATC. This document describes the features, benefits, and limitations of TASAR automation hosted on an Electronic Flight Bag. TASAR has two modes: (1) auto mode that continuously assesses opportunities for improving the performance of the flight and (2) manual mode that probes trajectory changes entered by aircrews for conflicts and performance objectives. The roles and procedures of the aircrew and ATC remain unchanged under TASAR.

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

Science.gov (United States)

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

Port Authority of Allegheny County Transit Routes

Data.gov (United States)

Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Shapefile of Transit Routes - Please refer to each resource for active dates of the route information. Routes change over time,

Energy Efficiency Performance Improvements for Ant-Based Routing Algorithm in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Adamu Murtala Zungeru

2013-01-01

Full Text Available The main problem for event gathering in wireless sensor networks (WSNs is the restricted communication range for each node. Due to the restricted communication range and high network density, event forwarding in WSNs is very challenging and requires multihop data forwarding. Currently, the energy-efficient ant based routing (EEABR algorithm, based on the ant colony optimization (ACO metaheuristic, is one of the state-of-the-art energy-aware routing protocols. In this paper, we propose three improvements to the EEABR algorithm to further improve its energy efficiency. The improvements to the original EEABR are based on the following: (1 a new scheme to intelligently initialize the routing tables giving priority to neighboring nodes that simultaneously could be the destination, (2 intelligent update of routing tables in case of a node or link failure, and (3 reducing the flooding ability of ants for congestion control. The energy efficiency improvements are significant particularly for dynamic routing environments. Experimental results using the RMASE simulation environment show that the proposed method increases the energy efficiency by up to 9% and 64% in converge-cast and target-tracking scenarios, respectively, over the original EEABR without incurring a significant increase in complexity. The method is also compared and found to also outperform other swarm-based routing protocols such as sensor-driven and cost-aware ant routing (SC and Beesensor.

Relationship of Employee Attitudes and Supervisor-Controller Ratio to En Route Operational Error Rates

National Research Council Canada - National Science Library

Broach, Dana

2002-01-01

...; Rodgers, Mogford, Mogford, 1998). In this study, the relationship of organizational factors to en route OE rates was investigated, based on an adaptation of the Human Factors Analysis and Classification System (HFACS; Shappell & Wiegmann 2000...

The QKD network: model and routing scheme

Science.gov (United States)

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.

Environmental factors along the Northern Sea Route

International Nuclear Information System (INIS)

Fjeld, P.E.

1993-01-01

The Northern Sea Route runs ca 5,600 nautical miles across the top of Russia from Murmansk to Vladivostok, and includes half of the Arctic basin. An environmental impact assessment is needed for this route because of the potential for commercial shipping to disturb the vulnerable Arctic environment along the route. For example, Russian development of oil and gas resources in the area served by the route is expected to rise dramatically in the near future. Drilling in the route area offshore has already begun, and potential blowouts or tanker spills are of concern. A pilot study on the environment along this route was conducted in 1990/91, focusing on a study of the literature and communications with Russian scientists working on Arctic ecology. Existing data seem to be insufficient and generally only cover the westernmost and easternmost parts of the route. A five-year research plan is proposed to provide an inventory of Arctic species in the route area and levels of contaminants present, to assess the environmental sensitivity of the area, and analyze impacts that increased shipping might have on the environment. Protection measures will also be suggested. 1 fig

The Complexity of Architecture : An Analysis of Design Intentions and Theories in the Norwegian National Tourist Routes

OpenAIRE

Roan, Beck

2013-01-01

This thesis analyzes the design intentions of architects in the Norwegian National Tourist Routes. Since architecture is not an isolated concept, this analysis incorporates philosophical and theoretical ideas in an investigation of the Tourist Route site design. Although they were hired to build compelling architectural sites along unique Norwegian nature, the Tourist Route architects also address subjects like practicality, balance, intention, meaning, control, freedom, and reflection in the...

An Evolutionary Mobility Aware Multi-Objective Hybrid Routing Algorithm for Heterogeneous Wireless Sensor Networks

DEFF Research Database (Denmark)

Kulkarni, Nandkumar P.; Prasad, Neeli R.; Prasad, Ramjee

deliberation. To tackle these two problems, Mobile Wireless Sensor Networks (MWSNs) is a better choice. In MWSN, Sensor nodes move freely to a target area without the need for any special infrastructure. Due to mobility, the routing process in MWSN has become more complicated as connections in the network can...... such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. The authors study the influence of energy heterogeneity and mobility of sensor nodes on the performance of EMRP. The Performance of EMRP compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-Objective Routing...

76 FR 29804 - Agency Information Collection Activities: Proposed Collection; Comment Request

Science.gov (United States)

2011-05-23

... action to submit an information collection request to the Office of Management and Budget (OMB) and solicitation of public comment. SUMMARY: The NRC invites public comment about our intention to request the OMB... written material accounting and control procedures, although actual reporting of transfer and material...

CAN Tree Routing for Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao LI

2014-01-01

Full Text Available We propose a novel topology to improve the routing performance of Content- Addressable Network overlays while minimizing the maintenance overhead during nodes churn. The key idea of our approach is to establish a P2P tree structure (CAN tree by means of equipping each node with a few long links towards some distant nodes. The long links enhance routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is O(log n, which is much better than a uniform greedy routing, while each node maintains two long links in average.

Pheromone based alternative route planning

Directory of Open Access Journals (Sweden)

Liangbing Feng

2016-08-01

Full Text Available In this work, we propose an improved alternative route calculation based on alternative figures, which is suitable for practical environments. The improvement is based on the fact that the main traffic route is the road network skeleton in a city. Our approach using nodes may generate a higher possibility of overlapping. We employ a bidirectional Dijkstra algorithm to search the route. To measure the quality of an Alternative Figures (AG, three quotas are proposed. The experiment results indicate that the improved algorithm proposed in this paper is more effective than others.

Route planning algorithms: Planific@ Project

Directory of Open Access Journals (Sweden)

Gonzalo Martín Ortega

2009-12-01

Full Text Available Planific@ is a route planning project for the city of Madrid (Spain. Its main aim is to develop an intelligence system capable of routing people from one place in the city to any other using the public transport. In order to do this, it is necessary to take into account such things as: time, traffic, user preferences, etc. Before beginning to design the project is necessary to make a comprehensive study of the variety of main known route planning algorithms suitable to be used in this project.

Vehicle routing problem in investment fund allocation

Science.gov (United States)

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

2013-04-01

Since its introduction by Dantzig and Ramser in 1959, vehicle routing problem keeps evolving in theories, applications and variability. The evolution in computing and technology are also important contributors to research in solving vehicle routing problem. The main sectors of interests among researchers and practitioners for vehicle routing problem are transportation, distribution and logistics. However, literature found that concept and benefits of vehicle routing problem are not taken advantages of by researchers in the field of investment. Other methods found used in investment include multi-objective programming, linear programming, goal programming and integer programming. Yet the application of vehicle routing problem is not fully explored. A proposal on a framework of the fund allocation optimization using vehicle routing problem is presented here. Preliminary results using FTSE Bursa Malaysia data testing the framework are also given.

Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

Directory of Open Access Journals (Sweden)

Yingcheng Xu

2013-01-01

Full Text Available In order to effectively solve the dynamic vehicle routing problem with time windows, the mathematical model is established and an improved variable neighborhood search algorithm is proposed. In the algorithm, allocation customers and planning routes for the initial solution are completed by the clustering method. Hybrid operators of insert and exchange are used to achieve the shaking process, the later optimization process is presented to improve the solution space, and the best-improvement strategy is adopted, which make the algorithm can achieve a better balance in the solution quality and running time. The idea of simulated annealing is introduced to take control of the acceptance of new solutions, and the influences of arrival time, distribution of geographical location, and time window range on route selection are analyzed. In the experiment, the proposed algorithm is applied to solve the different sizes' problems of DVRP. Comparing to other algorithms on the results shows that the algorithm is effective and feasible.

What is the Ideal Route of Administration of Tranexamic Acid in TKA? A Randomized Controlled Trial.

Science.gov (United States)

Lee, Sung Yup; Chong, Suri; Balasubramanian, Dhanasekaraprabu; Na, Young Gon; Kim, Tae Kyun

2017-08-01

TKA commonly involves substantial blood loss and tranexamic acid has been used to reduce blood loss after TKA. Numerous clinical trials have documented the efficacy and safety of intravenous (IV) or intraarticular (IA) use of tranexamic acid. Combined administration of tranexamic acid also has been suggested; however, there is no consensus regarding the ideal route of tranexamic acid administration. (1) To compare the efficacy of tranexamic acid in terms of total blood loss and the allogeneic transfusion rate among three routes of administration: IV alone, IA alone, and combined IV and IA. (2) To compare these regimens in terms of venous thromboembolism (VTE) and the frequency of wound complications. In total, 376 patients undergoing TKA between March 2014 and March 2015 were randomized to four groups by the route of tranexamic acid administration: IV only, IA only, low-dose combined (IV + IA injection of 1 g), and high-dose combined (IV + IA injection of 2 g). The calculated total blood loss, allogeneic transfusion rate, decrease in hemoglobin, the frequency of symptomatic deep vein thrombosis and pulmonary embolism, wound complications, and periprosthetic joint infection were compared among the groups. Total blood loss was calculated using estimated total body blood volume and hemoglobin loss. The decision regarding when to transfuse was determined based on preset criteria. The high- and low-dose combined groups and the IA-only group had lower total blood loss (564 ± 242 mL, 642 ± 242 mL, and 633 ± 205 mL, respectively) than the IV-only group (764 ± 217 mL; mean differences = 199 mL [95% CI, 116-283 mL], p tranexamic acid administration further reduces blood loss after TKA in comparison to IV use alone; no additional effect in further reducing blood loss was found in combination with IV tranexamic acid. Appropriately powered studies are needed to confirm the safety of this route of administration as the preferred route of administration in TKA. Level I

78 FR 21617 - Notice of Proposed Information Collection: Comment Request; Final Endorsement of Credit Instrument

Science.gov (United States)

2013-04-11

... Information Collection: Comment Request; Final Endorsement of Credit Instrument AGENCY: Office of the... Proposal: Final Endorsement of Credit Instrument. OMB Control Number, if applicable: 2502-0016. Description... Endorsement of Credit Instrument'' form is used to request to request final endorsement by HUD of the credit...

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

Full Text Available in each and every relay node so as to find the next hop for the packet. A routing metric is simply a measure used for selecting the best path, used by a routing protocol. Figure 2 shows the relationship between a routing protocol and the routing... on its QoS-awareness level. The routing metrics that considered QoS the most were selected from each group. This section discusses the four routing metrics that were compared in this paper, which are: hop count (HOP), expected transmission count (ETX...

The roles of gender, age and cognitive development in children's pedestrian route selection.

Science.gov (United States)

Barton, B K; Ulrich, T; Lyday, B

2012-03-01

Thousands of American children under the age of 10 years are injured annually as pedestrians. Despite the scope of this public health problem, knowledge about behavioural control and developmental factors involved in the aetiology of child pedestrian safety is limited. The present study examined the roles of gender, age and two aspects of cognitive development (visual search and efficiency of processing) in children's safe pedestrian route selection. Measures of cognitive functioning (visual search and efficiency) and selections of risky pedestrian routes were collected from 65 children aged 5-9 years. Boys, younger children and those with less developed cognitive functioning selected riskier pedestrian routes. Cognitive functioning also subsumed age as a predictor of risky route selections. Our findings suggest developmental differences, specifically less developed cognitive functioning, play important roles in children's pedestrian decision making. Directions for future examination are discussed. © 2011 Blackwell Publishing Ltd.

Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

Science.gov (United States)

Bombelli, Alessandro

Due to a soaring air travel growth in the last decades, air traffic management has become increasingly challenging. As a consequence, planning tools are being devised to help human decision-makers achieve a better management of air traffic. Planning tools are divided into two categories, strategic and tactical. Strategic planning generally addresses a larger planning domain and is performed days to hours in advance. Tactical planning is more localized and is performed hours to minutes in advance. An aggregate route model for strategic air traffic flow management is presented. It is an Eulerian model, describing the flow between cells of unidirectional point-to-point routes. Aggregate routes are created from flight trajectory data based on similarity measures. Spatial similarity is determined using the Frechet distance. The aggregate routes approximate actual well-traveled traffic patterns. By specifying the model resolution, an appropriate balance between model accuracy and model dimension can be achieved. For a particular planning horizon, during which weather is expected to restrict the flow, a procedure for designing airborne reroutes and augmenting the traffic flow model is developed. The dynamics of the traffic flow on the resulting network take the form of a discrete-time, linear time-invariant system. The traffic flow controls are ground holding, pre-departure rerouting and airborne rerouting. Strategic planning--determining how the controls should be used to modify the future traffic flow when local capacity violations are anticipated--is posed as an integer programming problem of minimizing a weighted sum of flight delays subject to control and capacity constraints. Several tests indicate the effectiveness of the modeling and strategic planning approach. In the final, most challenging, test, strategic planning is demonstrated for the six western-most Centers of the 22-Center national airspace. The planning time horizon is four hours long, and there is

Effects of carprofen administered by different routes to control experimental uveitis in dogs Efeitos do carprofeno, aplicado por diferentes vias, no controle de uveítes experimentais em cães

Directory of Open Access Journals (Sweden)

A.P. Ribeiro

2010-04-01

Full Text Available Efficacy of carprofen, administered by different routes, was studied in experimental uveitis in dogs. Anterior chamber paracenteses was accomplished at two different moments (M0 and M1, with a five hour interval between them. At M0 and M1, 0.2mL of aqueous humor was collected and quantitation of total protein and prostaglandin E2 (PGE2 were determined. Four groups were formed (n=8, which received carprofen at the end of M0, by the following routes: subcutaneous (GIm, subconjunctival (GII, and topical (GIII. A fourth group that received no treatment was instituted (Control. Conjunctival histopathology of the GII animals was performed. In all groups, values of protein and PGE2 significantly enhanced at M1; however, they did not significantly change among groups at M1. Inflammatory exudate of acute character and mild hemorrhage were seen at histopathology after carprofen administration. Carprofen was unable to inhibit PGE2 synthesis and the protein influx to the anterior chamber by any of the tested routes. However, the reduction of 44% in protein levels (topical suggests that the agent can be used by this route as an adjuvant to control uveitis in dogs.Estudaram-se os efeitos do carprofeno, aplicado por diferentes vias, em uveítes experimentais em cães. Realizou-se paracentese de câmara anterior em dois momentos (M0 e M1, com intervalo de cinco horas entre si. Em M0 e M1, colheram-se 0,2mL de humor aquoso e determinaram-se as concentrações de proteína total e de prostaglandina E2 (PGE2. Constituíram-se quatro grupos (n = 8, que receberam carprofeno ao final de M0 pelas vias subcutânea (GI, subconjuntival (GII e tópica (GIII. Um quarto grupo não recebeu tratamento (controle. Procedeu-se à avaliação histopatológica nos indivíduos do GII. Em todos os grupos, encontrou-se aumento significativo dos níveis proteicos e de PGE2 em M1. Não se observou diferença significativa, em M1, entre os grupos para nenhum dos parâmetros estudados

The Silk Route from Land to Sea

Directory of Open Access Journals (Sweden)

Jack Weatherford

2018-04-01

Full Text Available The Silk Route reached its historic and economic apogee under the Mongol Empire (1207–1368, as a direct result of the policies of Chinggis Khan (Genghis Khan and his successors. Because the land network proved inefficient for the amount of goods needing transport from one part of the empire to another, the Mongols expanded the Silk Route to ocean shipping and thus created the first Maritime Silk Route. The sea traffic initially expanded the land routes but soon strangled them. With the expansion of the Maritime Silk Route through the fourteenth century, the land connections reverted to local networks and lost their global importance.

Efficient evaluation of shortest travel-time path queries through spatial mashups

KAUST Repository

Zhang, Detian

2017-01-07

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

Efficient evaluation of shortest travel-time path queries through spatial mashups

KAUST Repository

Zhang, Detian; Chow, Chi-Yin; Liu, An; Zhang, Xiangliang; Ding, Qingzhu; Li, Qing

2017-01-01

In the real world, the route/path with the shortest travel time in a road network is more meaningful than that with the shortest network distance for location-based services (LBS). However, not every LBS provider has adequate resources to compute/estimate travel time for routes by themselves. A cost-effective way for LBS providers to estimate travel time for routes is to issue external route requests to Web mapping services (e.g., Google Maps, Bing Maps, and MapQuest Maps). Due to the high cost of processing such external route requests and the usage limits of Web mapping services, we take the advantage of direction sharing, parallel requesting and waypoints supported by Web mapping services to reduce the number of external route requests and the query response time for shortest travel-time route queries in this paper. We first give the definition of sharing ability to reflect the possibility of sharing the direction information of a route with others, and find out the queries that their query routes are independent with each other for parallel processing. Then, we model the problem of selecting the optimal waypoints for an external route request as finding the longest simple path in a weighted complete digraph. As it is a MAX SNP-hard problem, we propose a greedy algorithm with performance guarantee to find the best set of waypoints in an external route request. We evaluate the performance of our approach using a real Web mapping service, a real road network, real and synthetic data sets. Experimental results show the efficiency, scalability, and applicability of our approach.

75 FR 30845 - Request Voucher for Grant Payment and Line of Credit Control System (LOCCS) Voice Response System...

Science.gov (United States)

2010-06-02

... subject proposal. Payment request vouchers for distribution of grant funds using the automated Voice... Lists the Following Information Title of Proposal: Request Voucher for Grant Payment and Line of Credit... DEPARTMENT OF HOUSING AND URBAN DEVELOPMENT [Docket No. FR-5376-N-46] Request Voucher for Grant...

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

Science.gov (United States)

Baldwin, Jarret Taylor

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

Perception bias in route choice

NARCIS (Netherlands)

Vreeswijk, Jacob Dirk; Thomas, Tom; van Berkum, Eric C.; van Arem, Bart

2014-01-01

Travel time is probably one of the most studied attributes in route choice. Recently, perception of travel time received more attention as several studies have shown its importance in explaining route choice behavior. In particular, travel time estimates by travelers appear to be biased against

76 FR 28460 - Agency Information Collection Activities; Submission for OMB Review; Comment Request; Rock Burst...

Science.gov (United States)

2011-05-17

... for OMB Review; Comment Request; Rock Burst Control Plan--Pertains to Underground Metal and Nonmetal... develop a rock burst plan within 90 days after a rock burst has been experienced. Stress data are normally... Administration (MSHA) sponsored information collection request (ICR) titled, ``Burst Control Plan--Pertains to...

User habits and multimodal route planning

Directory of Open Access Journals (Sweden)

Géza Katona

2017-10-01

Full Text Available The results of route planning researches are monitored by logistic and automotive industries. The economic aspects of the cost saving are in the focus of the attention. An optimal route could cause time or fuel savings. An effective driving or an optimal route is a good basis to achieve an economical aim. Moreover the spread of new automotive solutions especially in case of electric cars the optimisation has particular significance regarding the limited battery storage. Additionally the autonomous car development could not be neglected. As a result the society could expect safer roads, better space usage and effective resource management. Nevertheless the requirements of users are extremely diverse, which is not negligible. Supporting these aims, in this paper the connection between the multimodal route planning and the user requirements are investigated. The examination is focused to a sensitivity analysis and a survey to evaluate the data and support the settings of a user habit effect to the final route.

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

TORGERSON, MARK D.; VAN LEEUWEN, BRIAN P.

2001-01-01

In this paper, we discuss several specific threats directed at the routing data of an ad hoc network. We address security issues that arise from wrapping authentication mechanisms around ad hoc routing data. We show that this bolt-on approach to security may make certain attacks more difficult, but still leaves the network routing data vulnerable. We also show that under a certain adversarial model, most existing routing protocols cannot be secured with the aid of digital signatures

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

Science.gov (United States)

Sadovsky, Alexander V.

2016-01-01

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

Energy efficiency with QoS control in dynamic optical networks with SDN enabled integrated control plane

DEFF Research Database (Denmark)

Wang, Jiayuan; Chen, Xin; Phillips, Chris

2014-01-01

The paper presents energy efficient routing algorithms based on a novel integrated control plane platform. The centralized control plane structure enables the use of flexible heuristic algorithms for route selection in optical networks. Differentiated routing for various traffic types is used in ...

La-CTP: Loop-Aware Routing for Energy-Harvesting Wireless Sensor Networks.

Science.gov (United States)

Sun, Guodong; Shang, Xinna; Zuo, Yan

2018-02-02

In emerging energy-harvesting wireless sensor networks (EH-WSN), the sensor nodes can harvest environmental energy to drive their operation, releasing the user's burden in terms of frequent battery replacement, and even enabling perpetual sensing systems. In EH-WSN applications, usually, the node in energy-harvesting or recharging state has to stop working until it completes the energy replenishment. However, such temporary departures of recharging nodes severely impact the packet routing, and one immediate result is the routing loop problem. Controlling loops in connectivity-intermittent EH-WSN in an efficient way is a big challenge in practice, and so far, users still lack of effective and practicable routing protocols with loop handling. Based on the Collection Tree Protocol (CTP) widely used in traditional wireless sensor networks, this paper proposes a loop-aware routing protocol for real-world EH-WSNs, called La-CTP, which involves a new parent updating metric and a proactive, adaptive beaconing scheme to effectively suppress the occurrence of loops and unlock unavoidable loops, respectively. We constructed a 100-node testbed to evaluate La-CTP, and the experimental results showed its efficacy and efficiency.

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

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

Predicting routes of radioactive wastes moved on the U.S. railroad system

International Nuclear Information System (INIS)

Hillsman, E.L.; Johnson, P.E.; Peterson, B.E.

1980-01-01

Relative to the use of public roads, railroads offer several advantages for the movement of radioactive wastes. These include the ability to accommodate large, heavy containers, the ability to transfer large volumes in a single movement, and the safety of a dedicated, centrally controlled right-of-way. The principal disadvantage of railroads is that the shipper has considerably less freedom to specify the route a shipment will take. The lower density of the railroad network, the need to coordinate waste shipments with other traffic in the system, and the private ownership of the US network all reduce the shippers routing power. Although the shipper can dictate an exact route, this could require the use of a special train at an increased cost. Before considering the general use of special trains to move radioactive wastes, it is first desirable to determine how these materials would move as general rail traffic. This paper describes the development of a system to predict routes of general rail traffic at Oak Ridge National Laboratory

Route of delivery following successful external cephalic version.

Science.gov (United States)

Policiano, Catarina; Costa, Ana; Valentim-Lourenço, Alexandre; Clode, Nuno; Graça, Luís M

2014-09-01

To evaluate the delivery route and the indications for cesarean delivery after successful external cephalic version (ECV). A retrospective matched case-control study was conducted at a hospital in Lisbon, Portugal, between 2002 and 2012. Each woman who underwent successful ECV (n = 44) was compared with the previous and next women who presented for labor management and who had the same parity and a singleton vertex pregnancy at term (n = 88). The outcome measures were route of delivery, indications for cesarean delivery, and incidence of nonreassuring fetal status. Attempts at ECV were successful in 62 (46%) of 134 women, and 44 women whose fetuses remained in a cephalic presentation until delivery were included in the study. The rates of intrapartum cesarean delivery and operative vaginal delivery did not differ significantly between cases and controls (intrapartum cesarean delivery, 9 [20%] vs 16 [18%], P = 0.75; operative vaginal delivery, 14 [32%] vs 19 [22%], P = 0.20). The indications for cesarean delivery after successful ECV did not differ; in both groups, cesarean delivery was mainly performed for labor arrest disorders (cases, 6 [67%] vs controls, 13 [81%]; P = 0.63). Successful ECV was not associated with increased rates of intrapartum cesarean delivery or operative vaginal delivery. Copyright © 2014 International Federation of Gynecology and Obstetrics. Published by Elsevier Ireland Ltd. All rights reserved.

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

Ellens, W.; Kovács, P.; Núñez-Queija, R.; Berg, H. van den

2015-01-01

We consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues with independent

Routing policies for a partially observable two-server queueing system

NARCIS (Netherlands)

W. Ellens; P. Kovacs; J.L. van den Berg (Hans); R. Núñez Queija (Rudesindo); A. Busic; M. Gribaudo; P. Reinecke

2015-01-01

htmlabstractWe consider a queueing system controlled by decisions based on partial state information. The motivation for this work stems from road traffic, in which drivers may, or may not, be subscribed to a smartphone application for dynamic route planning. Our model consists of two queues

Analysis of Serum Concentrations of Tranexamic Acid Given by Alternate Routes in Swine (Sus scrofa) During Controlled Hemorrhage.

Science.gov (United States)

2017-08-17

60th Medical Group (AMC), Travis AFB, CA INSTITUTIONAL ANIMAL CARE AND USE COMMITTEE (IACUC) FINAL REPORT SUMMARY (Please~ all information. Use...routes. Methods: 15 Yorkshire swine were anesthetized, hemorrhaged 35% of their blood volume, equilibrated and randomized to IV, 10, or IM...measurements or hemorrhage percentage between groups and all were in a congruent state of class Ill shock. Serum sample analysis showed all three routes

A Machine Learning Concept for DTN Routing

Science.gov (United States)

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.

Energy- Efficient Routing Protocols For Wireless Sensor Network A Review

Directory of Open Access Journals (Sweden)

Pardeep Kaur

2017-12-01

Full Text Available There has been plenty of interest in building and deploying sensor networks. Wireless sensor network is a collection of a large number of small nodes which acts as routers also. These nodes carry very limited power source which is non-rechargeable and non-replaceable which makes energy consumption an significant issue. Energy conservation is a very important issue for prolonging the lifetime of the network. As the sensor nodes act like routers as well the determination of routing technique plays a key role in controlling the consumption of energy. This paper describes the framework of wireless sensor network and the analysis and study of various research work related to Energy Efficient Routing in Wireless Sensor Networks.

78 FR 20102 - Proposed Information Collection Request; Comment Request; Reformulated Gasoline Commingling...

Science.gov (United States)

2013-04-03

... Request; Comment Request; Reformulated Gasoline Commingling Provisions AGENCY: Environmental Protection... information collection request (ICR), ``Reformulated Gasoline Commingling Provisions'' (EPA ICR No.2228.04.... Abstract: EPA would like to continue collecting notifications from gasoline retailers and wholesale...

Determination of Route Delivery in the Logistic Service Provider (LSP) by Reviewing the Performance of Street in The City of Malang

Science.gov (United States)

Agustin, I. W.; Sumantri, Y.

2017-03-01

Malang as the National Activity Centre (PKN) led to increased economic growth and increased the demand for goods both primary and tertiary goods. Demand of goods which is increasing and also diversing will certainly have an impact on the process of transportation of goods involving a freight forwarder. Shipping of goods is part of the supply chain, which handles the flow of goods, distribution and delivery service or commonly called the courier. Fulfilling the request of goods would require Logistics Service Provider (LSP) that distribute goods from point of origin to destination. Delays in the distribution of goods will slow(DOWN) economic growth in Malang, therefore focused studies on the movement of goods which includes the election of the delivery route is needed. The purpose of this study is to get the delivery route for LSP by identifying its patterns of freight transport movement and to analyze the network performance of the road that is passed by freight transportation. Data collection techniques in this research are interviews, questionnaires and observations of moving-car and traffic counting to get the volume of traffic. The study used road’s performance analysis to get the level of service (LOS) of roads which are used by the freight transportation of LSP and Dijkstra’s algorithm analysis to determine the delivery routes. The results showed that the Level of Service of the roads (LOS) is at the level of D to F which indicates that the chosen roads experience instability of traffic flow even reach a critical condition. Therefore by considering delivery routes selection both of existing condition and analysis result as well as the condition of the road network in Malang, then given alternative is by deliverying goods on the chosen routes but not at peak hour.

Warehouse order-picking process. Order-picker routing problem

Directory of Open Access Journals (Sweden)

E. V. Korobkov

2015-01-01

Full Text Available This article continues “Warehouse order-picking process” cycle and describes order-picker routing sub-problem of a warehouse order-picking process. It draws analogies between the orderpickers’ routing problem and traveling salesman’s problem, shows differences between the standard problem statement of a traveling salesman and routing problem of warehouse orderpickers, and gives the particular Steiner’s problem statement of a traveling salesman.Warehouse layout with a typical order is represented by a graph, with some its vertices corresponding to mandatory order-picker’s visits and some other ones being noncompulsory. The paper describes an optimal Ratliff-Rosenthal algorithm to solve order-picker’s routing problem for the single-block warehouses, i.e. warehouses with only two crossing aisles, defines seven equivalent classes of partial routing sub-graphs and five transitions used to have an optimal routing sub-graph of a order-picker. An extension of optimal Ratliff-Rosenthal order-picker routing algorithm for multi-block warehouses is presented and also reasons for using the routing heuristics instead of exact optimal algorithms are given. The paper offers algorithmic description of the following seven routing heuristics: S-shaped, return, midpoint, largest gap, aisle-by-aisle, composite, and combined as well as modification of combined heuristics. The comparison of orderpicker routing heuristics for one- and two-block warehouses is to be described in the next article of the “Warehouse order-picking process” cycle.

Routing algorithms in networks-on-chip

CERN Document Server

Daneshtalab, Masoud

2014-01-01

This book provides a single-source reference to routing algorithms for Networks-on-Chip (NoCs), as well as in-depth discussions of advanced solutions applied to current and next generation, many core NoC-based Systems-on-Chip (SoCs). After a basic introduction to the NoC design paradigm and architectures, routing algorithms for NoC architectures are presented and discussed at all abstraction levels, from the algorithmic level to actual implementation.  Coverage emphasizes the role played by the routing algorithm and is organized around key problems affecting current and next generation, many-core SoCs. A selection of routing algorithms is included, specifically designed to address key issues faced by designers in the ultra-deep sub-micron (UDSM) era, including performance improvement, power, energy, and thermal issues, fault tolerance and reliability.   ·         Provides a comprehensive overview of routing algorithms for Networks-on-Chip and NoC-based, manycore systems; ·         Describe...

Stochastic vehicle routing with recourse

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath; Saket, Rishi

2012-01-01

instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

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

Science.gov (United States)

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.

Identification of Robust Terminal-Area Routes in Convective Weather

Science.gov (United States)

Pfeil, Diana Michalek; Balakrishnan, Hamsa

2012-01-01

Convective weather is responsible for large delays and widespread disruptions in the U.S. National Airspace System, especially during summer. Traffic flow management algorithms require reliable forecasts of route blockage to schedule and route traffic. This paper demonstrates how raw convective weather forecasts, which provide deterministic predictions of the vertically integrated liquid (the precipitation content in a column of airspace) can be translated into probabilistic forecasts of whether or not a terminal area route will be blocked. Given a flight route through the terminal area, we apply techniques from machine learning to determine the likelihood that the route will be open in actual weather. The likelihood is then used to optimize terminalarea operations by dynamically moving arrival and departure routes to maximize the expected capacity of the terminal area. Experiments using real weather scenarios on stormy days show that our algorithms recommend that a terminal-area route be modified 30% of the time, opening up 13% more available routes that were forecast to be blocked during these scenarios. The error rate is low, with only 5% of cases corresponding to a modified route being blocked in reality, whereas the original route is in fact open. In addition, for routes predicted to be open with probability 0.95 or greater by our method, 96% of these routes (on average over time horizon) are indeed open in the weather that materializes

77 FR 9665 - Submission for OMB Emergency Review; Comment Request: A Multi-Center International Hospital-Based...

Science.gov (United States)

2012-02-17

... Review; Comment Request: A Multi- Center International Hospital-Based Case-Control Study of Lymphoma in... the Office of Management and Budget (OMB) a request for emergency review and processing this... Hospital- Based Case-Control Study of Lymphoma in Asia (AsiaLymph) (NCI). Type of Information Collection...

A facile route to controlled synthesis of Co3O4 nanoparticles and their environmental catalytic properties

International Nuclear Information System (INIS)

Dong Yuming; He Kun; Yin Lin; Zhang Aimin

2007-01-01

Using ammonia and Co(CH 3 COO) 2 ·4H 2 O as starting materials, a facile and surfactant-free route to controlled synthesis of Co 3 O 4 nanoparticles was proposed. Co 3 O 4 nanoparticles with average sizes of 3.5, 6, 11, 19 and 70 nm were obtained through adjusting the ethanol amount in the solvent (the ratio of ethanol to water) or the concentration of raw materials. In this process, the presence of enough O 2 was crucial for the formation of pure Co 3 O 4 phase. The environmental catalytic properties of as-obtained Co 3 O 4 nanoparticles were investigated. The results indicated their remarkable catalysis for ozonation degradation of phenol, which denoted a promising application as catalyst in waste-water treatment

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

Science.gov (United States)

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.

Great Ellipse Route Planning Based on Space Vector

Directory of Open Access Journals (Sweden)

LIU Wenchao

2015-07-01

Full Text Available Aiming at the problem of navigation error caused by unified earth model in great circle route planning using sphere model and modern navigation equipment using ellipsoid mode, a method of great ellipse route planning based on space vector is studied. By using space vector algebra method, the vertex of great ellipse is solved directly, and description of great ellipse based on major-axis vector and minor-axis vector is presented. Then calculation formulas of great ellipse azimuth and distance are deduced using two basic vectors. Finally, algorithms of great ellipse route planning are studied, especially equal distance route planning algorithm based on Newton-Raphson(N-R method. Comparative examples show that the difference of route planning between great circle and great ellipse is significant, using algorithms of great ellipse route planning can eliminate the navigation error caused by the great circle route planning, and effectively improve the accuracy of navigation calculation.

The Route Analysis Based On Flight Plan

Science.gov (United States)

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.

Is Entrepreneurship a Route Out of Deprivation?

DEFF Research Database (Denmark)

Frankish, Julian S.; Roberts, Richard G.; Coad, Alexander Jean-Luc

2014-01-01

Frankish J. S., Roberts R. G., Coad A. and Storey D. J. Is entrepreneurship a route out of deprivation?, Regional Studies. This paper investigates whether entrepreneurship constitutes a route out of deprivation for those living in deprived areas. The measure of income/wealth used is based...... the wealth distribution. Hence, entrepreneurship can be a route out of deprivation....

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Science.gov (United States)

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.

Optimizing well intervention routes

Energy Technology Data Exchange (ETDEWEB)

Paiva, Ronaldo O. [PETROBRAS S.A., Vitoria, ES (Brazil); Schiozer, Denis J.; Bordalo, Sergio N. [Universidade Estadual de Campinas, SP (Brazil). Faculdade de Engenharia Mecanica. Centro de Estudo do Petroleo (CEPETRO)]. E-mail: denis@dep.fem.unicamp.br; bordalo@dep.fem.unicamp.br

2000-07-01

This work presents a method for optimizing the itinerary of work over rigs, i.e., the search for the route of minimum total cost, and demonstrates the importance of the dynamics of reservoir behaviour. The total cost of a route includes the rig expenses (transport, assembly and operation), which are functions of time and distances, plus the losses of revenue in wells waiting for the rig, which are also dependent of time. A reservoir simulator is used to evaluate the monetary influence of the well shutdown on the present value of the production curve. Finally, search algorithms are employed to determine the route of minimal cost. The Simulated Annealing algorithm was also successful in optimizing the distribution of a list of wells among different work over rigs. The rational approach presented here is recommended for management teams as a standard procedure to define the priority of wells scheduled for work over. (author)

A Comprehensive Survey on Hierarchical-Based Routing Protocols for Mobile Wireless Sensor Networks: Review, Taxonomy, and Future Directions

Directory of Open Access Journals (Sweden)

Nabil Sabor

2017-01-01

Full Text Available Introducing mobility to Wireless Sensor Networks (WSNs puts new challenges particularly in designing of routing protocols. Mobility can be applied to the sensor nodes and/or the sink node in the network. Many routing protocols have been developed to support the mobility of WSNs. These protocols are divided depending on the routing structure into hierarchical-based, flat-based, and location-based routing protocols. However, the hierarchical-based routing protocols outperform the other routing types in saving energy, scalability, and extending lifetime of Mobile WSNs (MWSNs. Selecting an appropriate hierarchical routing protocol for specific applications is an important and difficult task. Therefore, this paper focuses on reviewing some of the recently hierarchical-based routing protocols that are developed in the last five years for MWSNs. This survey divides the hierarchical-based routing protocols into two broad groups, namely, classical-based and optimized-based routing protocols. Also, we present a detailed classification of the reviewed protocols according to the routing approach, control manner, mobile element, mobility pattern, network architecture, clustering attributes, protocol operation, path establishment, communication paradigm, energy model, protocol objectives, and applications. Moreover, a comparison between the reviewed protocols is investigated in this survey depending on delay, network size, energy-efficiency, and scalability while mentioning the advantages and drawbacks of each protocol. Finally, we summarize and conclude the paper with future directions.

75 FR 28095 - Application To Renew Information Collection Request OMB No. 2105-0551

Science.gov (United States)

2010-05-19

... basis of disability. The carriers must also categorize these complaints according to the type of disability and nature of complaint, prepare a summary report annually of the complaints received during the... Control Number: 2105-0551. Type of Request: Renewal of currently approved Information Collection Request...

A study of routing algorithms for SCI-Based multistage networks

International Nuclear Information System (INIS)

Wu Bin; Kristiansen, E.; Skaali, B.; Bogaerts, A.; )

1994-03-01

The report deals with a particular class of multistage Scalable Coherent Interface (SCI) network systems and two important routing algorithms, namely self-routing and table-look up routing. The effect of routing delay on system performance is investigated by simulations. Adaptive routing and deadlock-free routing are studied. 8 refs., 11 figs., 1 tab

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2016-02-01

Full Text Available Abstrak OSPF (Open Shortest Path First dan EIGRP (Enhanced Interior Gateway Routing Protocol adalah dua routing protokol yang banyak digunakan dalam jaringan komputer. Perbedaan karakteristik antar routing protokol menimbulkan masalah dalam pengiriman paket data. Teknik redistribution adalah solusi untuk melakukan komunikasi antar routing protokol. Dengan menggunakan software Cisco Packet Tracer 5.3 pada penelitian ini dibuat simulasi OSPF dan EIGRP yang dihubungkan oleh teknik redistribution, kemudian dibandingkan kualitasnya dengan single routing protokol EIGRP dan OSPF. Parameter pengujian dalam penelitian ini adalah nilai time delay dan trace route. Nilai trace route berdasarkan perhitungan langsung cost dan metric dibandingkan dengan hasil simulasi. Hasilnya dapat dilakukan proses redistribution OSPF dan EIGRP. Nilai delay redistribution lebih baik 1% dibanding OSPF dan 2-3% di bawah EIGRP tergantung kepadatan traffic. Dalam perhitungan trace route redistribution dilakukan 2 perhitungan, yaitu cost untuk area OSPF dan metric pada area EIGRP. Pengambilan jalur utama dan alternatif pengiriman paket berdasarkan nilai cost dan metric yang terkecil, hal ini terbukti berdasarkan perhitungan dan simulasi. Kata kunci: OSPF, EIGRP, Redistribution, Delay, Cost, Metric. Abstract OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost

Quantum chemistry-assisted synthesis route development

International Nuclear Information System (INIS)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-01-01

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

Route Choice Model Based on Game Theory for Commuters

Directory of Open Access Journals (Sweden)

Licai Yang

2016-06-01

Full Text Available The traffic behaviours of commuters may cause traffic congestion during peak hours. Advanced Traffic Information System can provide dynamic information to travellers. Due to the lack of timeliness and comprehensiveness, the provided information cannot satisfy the travellers’ needs. Since the assumptions of traditional route choice model based on Expected Utility Theory conflict with the actual situation, a route choice model based on Game Theory is proposed to provide reliable route choice to commuters in actual situation in this paper. The proposed model treats the alternative routes as game players and utilizes the precision of predicted information and familiarity of traffic condition to build a game. The optimal route can be generated considering Nash Equilibrium by solving the route choice game. Simulations and experimental analysis show that the proposed model can describe the commuters’ routine route choice decisionexactly and the provided route is reliable.

Fingerprinting Software Defined Networks and Controllers

Science.gov (United States)

2015-03-01

rps requests per second RTT Round-Trip Time SDN Software Defined Networking SOM Self-Organizing Map STP Spanning Tree Protocol TRW-CB Threshold Random...Protocol ( STP ) updates), in which case the frame will be “punted” from the forwarding lookup process and processed by the route processor [9]. The act of...environment 20 to accomplish the needs of B4. In addition to Google, the SDN market is expected to grow beyond $35 billion by April 2018 [31]. The rate

Traffic Aware Strategic Aircrew Requests (TASAR)

Science.gov (United States)

Wing, David J.

2014-01-01

The Traffic Aware Strategic Aircrew Request (TASAR) concept offers onboard automation for the purpose of advising the pilot of traffic compatible trajectory changes that would be beneficial to the flight. A fast-time simulation study was conducted to assess the benefits of TASAR to Alaska Airlines. The simulation compares historical trajectories without TASAR to trajectories developed with TASAR and evaluated by controllers against their objectives. It was estimated that between 8,000 and 12,000 gallons of fuel and 900 to 1,300 minutes could be saved annually per aircraft. These savings were applied fleet-wide to produce an estimated annual cost savings to Alaska Airlines in excess of $5 million due to fuel, maintenance, and depreciation cost savings. Switching to a more wind-optimal trajectory was found to be the use case that generated the highest benefits out of the three TASAR use cases analyzed. Alaska TASAR requests peaked at four to eight requests per hour in high-altitude Seattle center sectors south of Seattle-Tacoma airport..

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

Full Text Available Cognitive Radio (CR technology is an agile solution for spectrum congestion and spectrum access utilization problems that result from the legacy fixed spectrum management policies. CR technology can exploit unused licensed band to meet the increasing demand for radio frequency. The routing process faces many challenges in CR Network (CRN such as the absence of centralized infrastructure, the coordination between the routing module and spectrum management module, in addition to the frequent link failure due to the sudden appearance of PUs. In this paper we propose a Tree routing protocol for cognitive radio network (C-TRP that jointly utilizes the tree routing algorithm with a spectrum management module in routing decisions, and also we proposed a new metric used in taking the best route decisions. In addition, we enhance the traditional tree routing algorithm by using a neighbor table technique that speeds up the forwarding data packets. Moreover, we add a robust recovery module to C-TRP to resume the network in case of the link failure. The main motivation in the design of C-TRP is quick data transmission and maximization of date rates. The performance evaluation is carried out in NS2 simulator. The simulation results proved that C-TRP protocol achieves better performance in terms of average “PDR”, “end-to-end delay” and “routing overhead ratio “compared to “CTBR” and “STOD-RP” routing protocols.

Route Network Construction with Location-Direction-Enabled Photographs

Science.gov (United States)

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.

Development of safe routes for children in urban environment

Science.gov (United States)

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.

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

Science.gov (United States)

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

2017-11-01

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

Impact of robotic technology on hysterectomy route and associated implications for resident education.

Science.gov (United States)

Jeppson, Peter C; Rahimi, Salma; Gattoc, Leda; Westermann, Lauren B; Cichowski, Sara; Raker, Christina; LeBrun, Emily Elise Weber; Sung, Vivian W

2015-02-01

We sought to compare the proportion of benign hysterectomies performed vaginally and the mean number of hysterectomies with resident involvement by route before and after robot implementation. This multicenter, retrospective cohort study using nonsynchronous controls was conducted through the Society of Gynecologic Surgeons Fellows' Pelvic Research Network. The route of hysterectomy for benign disease was compared for 1-year periods before (prerobot) and after (postrobot) robotic introduction at 4 academic institutions. We reviewed medical records and recorded patient demographics, hysterectomy approach, preoperative and postoperative diagnosis, and resident involvement. In all, 1440 hysterectomies were included: 732 in the prerobot group and 708 in the postrobot group. Median age was 46 years and mean body mass index was 29.5 (standard deviation, 6.9). The proportion of hysterectomies performed via the vaginal route decreased from 42.5% prerobot to 30.5% postrobot (P technology at institutions included in this study. The proportion of hysterectomies with resident involvement is lower with a robotic approach than any other route. Copyright © 2015 Elsevier Inc. All rights reserved.

Routing architecture and security for airborne networks

Science.gov (United States)

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.

75 FR 10547 - Application To Renew Information Collection Request OMB No. 2105-0551

Science.gov (United States)

2010-03-08

... accessibility or discrimination on the basis of disability. The carriers must also categorize these complaints according to the type of disability and nature of complaint, prepare a summary report annually of the... Control Number: 2105-0551. Type of Request: Renewal of currently approved Information Collection Request...

WEAMR — A Weighted Energy Aware Multipath Reliable Routing Mechanism for Hotline-Based WSNs

Directory of Open Access Journals (Sweden)

Ki-Hyung Kim

2013-05-01

Full Text Available Reliable source to sink communication is the most important factor for an efficient routing protocol especially in domains of military, healthcare and disaster recovery applications. We present weighted energy aware multipath reliable routing (WEAMR, a novel energy aware multipath routing protocol which utilizes hotline-assisted routing to meet such requirements for mission critical applications. The protocol reduces the number of average hops from source to destination and provides unmatched reliability as compared to well known reactive ad hoc protocols i.e., AODV and AOMDV. Our protocol makes efficient use of network paths based on weighted cost calculation and intelligently selects the best possible paths for data transmissions. The path cost calculation considers end to end number of hops, latency and minimum energy node value in the path. In case of path failure path recalculation is done efficiently with minimum latency and control packets overhead. Our evaluation shows that our proposal provides better end-to-end delivery with less routing overhead and higher packet delivery success ratio compared to AODV and AOMDV. The use of multipath also increases overall life time of WSN network using optimum energy available paths between sender and receiver in WDNs.

Attitudes on En Route Air Traffic Control Training and Work: A Comparison of Recruits Initially Trained at the FAA Academy and Recruits Initially Trained at Assigned Centers.

Science.gov (United States)

Mathews, John J.; And Others

In the comparison, questionnaires concerning aspects of training-related and work-related attitudes were sent to 225 Air Traffic Control (ATC) trainees who represented groups of attritions and retentions in two En Route training programs; viz, programs that provided basic training at the FAA Academy and programs that provided basic training at the…

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

Directory of Open Access Journals (Sweden)

Yan Han

2014-01-01

Full Text Available The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scene spot and tourists demand and tour behaviors characteristic such as visit frequency, number of attractions visited was obtained and analyzed. Based on the convey datum, tour routes multiobjective optimization functions were prompted for the tour route design regarding the maximum satisfaction and the minimum tour distance as the optimal objective. The available routes are listed and categorized. Based on the particle swarm optimization model, the priorities of the tour route are calculated and finally the suggestion depth tour route and quick route tour routes are given considering the different tour demands of tourists. The results can offer constructive suggestions on how to design tour routes on the part of tourism enterprises and how to choose a proper tour route on the part of tourists.

Policy implications of Iran's Nuclear Deal in technical terms for the plutonium route, uranium route, covert options, inspections, monitoring and verifications

International Nuclear Information System (INIS)

Pinheiro, Andre Ricardo M.

2017-01-01

The present Paper addresses the policy implications of Joint Comprehensive Plan of Action (JCPOA) known as 'Ian Nuclear Deal', implemented on 16 th January of 2016 between the Iran and the P5+1 countries (the U.S., U.K. France, Germany, Russia, and China), along with the EU in technical terms to analyze the Plutonium Route, Uranium Route and the Covert options and Inspections, Monitoring and Verifications. A historical review is presented to understand how the Iranian Nuclear Program is formed. Following is shown the current nuclear facilities in Iran and its capacity to process nuclear materials. It is analyzed the impact of JCPOA in Uranium and Plutonium routes. Covert Options always will be an option, so the most sensitive impact is related to the new monitoring and verification policies that must ensure real control of illegal procedures. The main conclusion is that the deal postpones the Iran's nuclear program for more than a decade (15 years), delaying Iran's nuclear bomb time from a few months to at least one year, although there is a current latent capacity to develop a nuclear bomb in Uranium route. It also gives IAEA inspectors capability to monitor nuclear activities and prevent to possible development to a nuclear bomb. To arrive in this conclusion an extensive technical analyze of impact of JCPOA in Iran's nuclear capabilities was made to discover how effective is the deal to prevent Iran to build, or acquire a nuclear weapon. (author)

Policy implications of Iran's Nuclear Deal in technical terms for the plutonium route, uranium route, covert options, inspections, monitoring and verifications

Energy Technology Data Exchange (ETDEWEB)

Pinheiro, Andre Ricardo M., E-mail: andrericardopinheiro@usp.br [Universidade de São Paulo (USP), SP (Brazil). Departamento de Engenharia Naval; Guimarães, Leonam dos Santos, E-mail: leonam@eletronuclear.gov.br [Eletrobrás Termonuclear S.A. (ELETRONUCLEAR), Rio de Janeiro, RJ (Brazil)

2017-07-01

The present Paper addresses the policy implications of Joint Comprehensive Plan of Action (JCPOA) known as 'Ian Nuclear Deal', implemented on 16{sup th} January of 2016 between the Iran and the P5+1 countries (the U.S., U.K. France, Germany, Russia, and China), along with the EU in technical terms to analyze the Plutonium Route, Uranium Route and the Covert options and Inspections, Monitoring and Verifications. A historical review is presented to understand how the Iranian Nuclear Program is formed. Following is shown the current nuclear facilities in Iran and its capacity to process nuclear materials. It is analyzed the impact of JCPOA in Uranium and Plutonium routes. Covert Options always will be an option, so the most sensitive impact is related to the new monitoring and verification policies that must ensure real control of illegal procedures. The main conclusion is that the deal postpones the Iran's nuclear program for more than a decade (15 years), delaying Iran's nuclear bomb time from a few months to at least one year, although there is a current latent capacity to develop a nuclear bomb in Uranium route. It also gives IAEA inspectors capability to monitor nuclear activities and prevent to possible development to a nuclear bomb. To arrive in this conclusion an extensive technical analyze of impact of JCPOA in Iran's nuclear capabilities was made to discover how effective is the deal to prevent Iran to build, or acquire a nuclear weapon. (author)

Innovative Sol-Gel Routes for the Bottom-up Preparation of Heterogeneous Catalysts.

Science.gov (United States)

Debecker, Damien P

2017-12-11

Heterogeneous catalysts can be prepared by different methods offering various levels of control on the final properties of the solid. In this account, we exemplify bottom-up preparation routes that are based on the sol-gel chemistry and allow to tailor some decisive properties of solid catalysts. First, an emulsion templating strategy is shown to lead to macrocellular self-standing monoliths with a macroscopic 3D structure. The latter can be used as catalyst or catalyst supports in flow chemistry, without requiring any subsequent shaping step. Second, the aerosol-assisted sol-gel process allows for the one-step and continuous production of porous mixed oxides. Tailored textural properties can be obtained together with an excellent control on composition and homogeneity. Third, the application of non-hydrolytic sol-gel routes, in the absence of water, leads to mixed oxides with outstanding textural properties and with peculiar surface chemistry. In all cases, the resulting catalytic performance can be correlated with the specificities of the preparation routes presented. This is exemplified in catalytic reactions in the fields of biomass conversion, petro chemistry, enantioselective organic synthesis, and air pollution mitigation. © 2017 The Chemical Society of Japan & Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

Optimal routing of IP packets to multi-homed servers

International Nuclear Information System (INIS)

Swartz, K.L.

1992-08-01

Multi-homing, or direct attachment to multiple networks, offers both performance and availability benefits for important servers on busy networks. Exploiting these benefits to their fullest requires a modicum of routing knowledge in the clients. Careful policy control must also be reflected in the routing used within the network to make best use of specialized and often scarce resources. While relatively straightforward in theory, this problem becomes much more difficult to solve in a real network containing often intractable implementations from a variety of vendors. This paper presents an analysis of the problem and proposes a useful solution for a typical campus network. Application of this solution at the Stanford Linear Accelerator Center is studied and the problems and pitfalls encountered are discussed, as are the workarounds used to make the system work in the real world

Cesarean delivery on maternal request.

Science.gov (United States)

Viswanathan, Meera; Visco, Anthony G; Hartmann, Katherine; Wechter, Mary Ellen; Gartlehner, Gerald; Wu, Jennifer M; Palmieri, Rachel; Funk, Michele Jonsson; Lux, Linda; Swinson, Tammeka; Lohr, Kathleen N

2006-03-01

The RTI International-University of North Carolina at Chapel Hill Evidence-based Practice Center (RTI-UNC EPC) systematically reviewed the evidence on the trend and incidence of cesarean delivery (CD) in the United States and in other developed countries, maternal and infant outcomes of cesarean delivery on maternal request (CDMR) compared with planned vaginal delivery (PVD), factors affecting the magnitude of the benefits and harms of CDMR, and future research directions. We searched MEDLINE, Cochrane Collaboration resources, and Embase and identified 1,406 articles to examine against a priori inclusion criteria. We included studies published from 1990 to the present, written in English. Studies had to include comparison between the key reference group (CDMR or proxies) and PVD. A primary reviewer abstracted detailed data on key variables from included articles; a second senior reviewer confirmed accuracy. We identified 13 articles for trends and incidence of CD, 54 for maternal and infant outcomes, and 5 on modifiers of CDMR. The incidence of CDMR appears to be increasing. However, accurately assessing either its true incidence or trends over time is difficult because currently CDMR is neither a well-recognized clinical entity nor an accurately reported indication for diagnostic coding or reimbursement. Virtually no studies exist on CDMR, so the knowledge base rests chiefly on indirect evidence from proxies possessing unique and significant limitations. Furthermore, most studies compared outcomes by actual routes of delivery, resulting in great uncertainty as to their relevance to planned routes of delivery. Primary CDMR and planned vaginal delivery likely do differ with respect to individual outcomes for either mothers or infants. However, our comprehensive assessment, across many different outcomes, suggests that no major differences exist between primary CDMR and planned vaginal delivery, but the evidence is too weak to conclude definitively that differences

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2008-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. However, in practice, temporal traffic congestions make that such solutions are not optimal with respect to minimizing the total duty time. Furthermore, VRPTW

Chlorpyrifos PBPK/PD model for multiple routes of exposure.

Science.gov (United States)

Poet, Torka S; Timchalk, Charles; Hotchkiss, Jon A; Bartels, Michael J

2014-10-01

1. Chlorpyrifos (CPF) is an important pesticide used to control crop insects. Human Exposures to CPF will occur primarily through oral exposure to residues on foods. A physiologically based pharmacokinetic/pharmacodynamic (PBPK/PD) model has been developed that describes the relationship between oral, dermal and inhalation doses of CPF and key events in the pathway for cholinergic effects. The model was built on a prior oral model that addressed age-related changes in metabolism and physiology. This multi-route model was developed in rats and humans to validate all scenarios in a parallelogram design. 2. Critical biological effects from CPF exposure require metabolic activation to CPF oxon, and small amounts of metabolism in tissues will potentially have a great effect on pharmacokinetics and pharmacodynamic outcomes. Metabolism (bioactivation and detoxification) was therefore added in diaphragm, brain, lung and skin compartments. Pharmacokinetic data are available for controlled human exposures via the oral and dermal routes and from oral and inhalation studies in rats. The validated model was then used to determine relative dermal versus inhalation uptake from human volunteers exposed to CPF in an indoor scenario.

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...... depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0....

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

depots, one for each vehicle, and compute routes for the vehicles so that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. In obtaining this result, we introduce a common generalization of the k-median and minimum...... spanning tree problems (called k median forest), which might be of independent interest. We give a local-search based (3+ε)-approximation algorithm for k median forest, which leads to a (12+ε)-approximation algorithm for k-LocVRP, for any constant ε>0.......We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

Routes and Stations

Data.gov (United States)

Department of Homeland Security — he Routes_Stations table is composed of fixed rail transit systems within the Continental United States, Alaska, Hawaii, the District of Columbia, and Puerto Rico....

New TPG bus route 28

CERN Multimedia

2003-01-01

Geneva's Public Transport services (TPG) have recently inaugurated a new bus line 28, connecting the La Tour Hospital in Meyrin to the international organisations in Geneva, via the airport. All signs associated with this route will be yellow in colour. Timetables and route details can be found at http://www.tpg.ch. Relations with the Host States Service http://www.cern.ch/relations/ Tel. 72848

78 FR 69175 - Proposed Information Collection (Financial Statement); Comment Request

Science.gov (United States)

2013-11-18

... DEPARTMENT OF VETERANS AFFAIRS [OMB Control No. 2900-0047] Proposed Information Collection (Financial Statement); Comment Request AGENCY: Veterans Benefits Administration, Department of Veterans... use of other forms of information technology. Title: Financial Statement, VA Form 26-6807. OMB Control...

78 FR 41926 - Proposed Information Collection Request; Comment Request; Performance Evaluation Studies on...

Science.gov (United States)

2013-07-12

... ENVIRONMENTAL PROTECTION AGENCY [EPA-HQ-OECA-2013-0413; FRL--9832-8] Proposed Information Collection Request; Comment Request; Performance Evaluation Studies on Wastewater Laboratories (Renewal); EPA... request (ICR), ``Performance Evaluation Studies on Wastewater Laboratories'' (EPA ICR No. 0234.11, OMB...

77 FR 34384 - Proposed Agency Information Collection Activities; Comment Request

Science.gov (United States)

2012-06-11

... of Changes in Organizational Structure. Agency form number: FR Y-10E. OMB control number: 7100-0297... assign OMB control numbers to collection of information requests and requirements conducted or sponsored... control number. DATES: Comments must be submitted on or before August 10, 2012. ADDRESSES: You may submit...

78 FR 21937 - Proposed Agency Information Collection Request: Comment Request; Great Lakes Accountability...

Science.gov (United States)

2013-04-12

... Collection Request: Comment Request; Great Lakes Accountability System (Renewal) AGENCY: Environmental... an information collection request (ICR), ``Great Lakes Accountability System'' (EPA ICR No. 2379.02... using www.regulations.gov (our preferred method) or by mail to: Great Lakes Accountability System, Attn...

Perspectives on Illegal Routes in Nigeria

African Journals Online (AJOL)

Nneka Umera-Okeke

University of Kwazulu-Natal. Pietermaritzburg, South ... Key Words: Nigeria Immigration Service, Illegal Routes, Security Policing, Border,. State .... transported weapons across borders to sell them in exchange for food or other commodities. ... The study's respondents were of the opinion that illegal routes exist around the ...

Optimizing Departure Times in Vehicle Routes

NARCIS (Netherlands)

Kok, A.L.; Hans, Elias W.; Schutten, Johannes M.J.

2011-01-01

Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporary traffic congestion make such solutions non-optimal with respect to minimizing the total duty time. Furthermore, the VRPTW does not

Classification of Dynamic Vehicle Routing Systems

DEFF Research Database (Denmark)

Larsen, Allan; Madsen, Oli B.G.; Solomon, Marius M.

2007-01-01

This chapter discusses important characteristics seen within dynamic vehicle routing problems. We discuss the differences between the traditional static vehicle routing problems and its dynamic counterparts. We give an in-depth introduction to the degree of dynamism measure which can be used to c...

77 FR 50986 - Submission for OMB Review; Comment Request

Science.gov (United States)

2012-08-23

...: National Oceanic and Atmospheric Administration (NOAA). Title: Coastal Zone Management Program Administration. OMB Control Number: 0648-0119. Form Number(s): NA. Type of Request: Regular submission (revision...; [[Page 50987

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

Directory of Open Access Journals (Sweden)

Noraziah Adzhar

2014-01-01

Full Text Available In the process of automatic design for printed circuit boards (PCBs, the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniform Nx×Ny array of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

Sigma Routing Metric for RPL Protocol

Directory of Open Access Journals (Sweden)

Paul Sanmartin

2018-04-01

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

Traffic modifications on Routes Rutherford, Democrite and Fermi

CERN Multimedia

2015-01-01

The GS Department would like to inform you that until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

Traffic modifications on Routes Rutherford, Democrite and Fermi

CERN Multimedia

2015-01-01

The GS Department would like to inform you that, until the end of December, the construction of Building 245 will result in the following traffic modifications: Traffic on Route Rutherford will be partially restricted in front of the construction site, Traffic on Route Democrite will be one-way towards Route Rutherford. Also, please note that due to construction work in front of Building 377, Route Fermi will be closed from Wednesday, 10 June until Friday, 7 August. Thank you for your understanding.

Dynamic route guidance strategy in a two-route pedestrian-vehicle mixed traffic flow system

Science.gov (United States)

Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

2016-05-01

With the rapid development of transportation, traffic questions have become the major issue for social, economic and environmental aspects. Especially, during serious emergencies, it is very important to alleviate road traffic congestion and improve the efficiency of evacuation to reduce casualties, and addressing these problems has been a major task for the agencies responsible in recent decades. Advanced road guidance strategies have been developed for homogeneous traffic flows, or to reduce traffic congestion and enhance the road capacity in a symmetric two-route scenario. However, feedback strategies have rarely been considered for pedestrian-vehicle mixed traffic flows with variable velocities and sizes in an asymmetric multi-route traffic system, which is a common phenomenon in many developing countries. In this study, we propose a weighted road occupancy feedback strategy (WROFS) for pedestrian-vehicle mixed traffic flows, which considers the system equilibrium to ease traffic congestion. In order to more realistic simulating the behavior of mixed traffic objects, the paper adopted a refined and dynamic cellular automaton model (RDPV_CA model) as the update mechanism for pedestrian-vehicle mixed traffic flow. Moreover, a bounded rational threshold control was introduced into the feedback strategy to avoid some negative effect of delayed information and reduce. Based on comparisons with the two previously proposed strategies, the simulation results obtained in a pedestrian-vehicle traffic flow scenario demonstrated that the proposed strategy with a bounded rational threshold was more effective and system equilibrium, system stability were reached.

Adaptive powertrain control for plugin hybrid electric vehicles

Science.gov (United States)

Kedar-Dongarkar, Gurunath; Weslati, Feisel

2013-10-15

A powertrain control system for a plugin hybrid electric vehicle. The system comprises an adaptive charge sustaining controller; at least one internal data source connected to the adaptive charge sustaining controller; and a memory connected to the adaptive charge sustaining controller for storing data generated by the at least one internal data source. The adaptive charge sustaining controller is operable to select an operating mode of the vehicle's powertrain along a given route based on programming generated from data stored in the memory associated with that route. Further described is a method of adaptively controlling operation of a plugin hybrid electric vehicle powertrain comprising identifying a route being traveled, activating stored adaptive charge sustaining mode programming for the identified route and controlling operation of the powertrain along the identified route by selecting from a plurality of operational modes based on the stored adaptive charge sustaining mode programming.

41 CFR 109-40.302 - Standard routing principle.

Science.gov (United States)

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

Nudging socially isolated people towards well-being with the 'Happiness Route': design of a randomized controlled trial for the evaluation of a happiness-based intervention.

Science.gov (United States)

Weiss, Laura A; Westerhof, Gerben J; Bohlmeijer, Ernst T

2013-09-20

The Happiness Route is an innovative intervention that uses a happiness-based approach for people with an accumulation of risk factors for low well-being: socially isolated people with health impairments and a low socioeconomic status. The goal of this intervention is to improve well-being by engaging participants in intrinsically motivated activities with methods from positive psychology. We hypothesize that the primary outcome measure, emotional, social and psychological well-being of participants of the Happiness Route, will increase in comparison to the traditional and commonly-used problem-based approach. Secondary outcome measures are health-related quality of life, psychosocial functioning and health care consumption. Participants will be socially isolated people with health problems and a low socioeconomic status. Participants will be recruited in ten Dutch communities and candidates will be signed up by intermediaries, professionals from the health and social sector. Randomly assigned, half of the participants will follow the Happiness Route and half of the participants will follow the active, problem-focused control group 'Customized Care'. In total, 256 participants will be included. In both conditions, participants will receive counseling sessions from trained counselors. In the control group, participants will talk about their problems and the care they get and counselors help to optimize their care. In the Happiness Route, the counselor ask questions such as "How do you want to live your life?". The intervention helps people to find their 'passion', i.e., a positive goal-engaged and intrinsically motivated activity. It enables them to follow their passion through by a once-only personal happiness budget (maximal €500). We use well-validated and reliable questionnaires to measure primary and secondary outcome measures at baseline, directly after the intervention and at a nine-month follow-up. Shortcomings of earlier intervention studies in positive

78 FR 46360 - 30-Day Notice of Proposed Information Collection: Request Voucher for Grant Payment and Line of...

Science.gov (United States)

2013-07-31

... Information Collection: Request Voucher for Grant Payment and Line of Credit Control System (LOCCS) Voice.... Description of the need for the information and proposed use: Payment request vouchers for distribution of.... A. Overview of Information Collection Title of Information Collection: Request Voucher for Grant...

Modeling and Performance Analysis of Route-Over and Mesh-Under Routing Schemes in 6LoWPAN under Error-Prone Channel Condition

Directory of Open Access Journals (Sweden)

Tsung-Han Lee

2013-01-01

Full Text Available 6LoWPAN technology has attracted extensive attention recently. It is because 6LoWPAN is one of Internet of Things standard and it adapts to IPv6 protocol stack over low-rate wireless personal area network, such as IEEE 802.15.4. One view is that IP architecture is not suitable for low-rate wireless personal area network. It is a challenge to implement the IPv6 protocol stack into IEEE 802.15.4 devices due to that the size of IPv6 packet is much larger than the maximum packet size of IEEE 802.15.4 in data link layer. In order to solve this problem, 6LoWPAN provides header compression to reduce the transmission overhead for IP packets. In addition, two selected routing schemes, mesh-under and route-over routing schemes, are also proposed in 6LoWPAN to forward IP fragmentations under IEEE 802.15.4 radio link. The distinction is based on which layer of the 6LoWPAN protocol stack is in charge of routing decisions. In route-over routing scheme, the routing distinction is taken at the network layer and, in mesh-under, is taken by the adaptation layer. Thus, the goal of this research is to understand the performance of two routing schemes in 6LoWPAN under error-prone channel condition.

Energy Efficient Routing in Nomadic Networks

DEFF Research Database (Denmark)

Kristensen, Mads Darø; Bouvin, Niels Olof

2007-01-01

We present an evaluation of a novel energy-efficient routing protocol for mobile ad-hoc networks. We combine two techniques for optimizing energy levels with a well-known routing protocol. We examine the behavior of this combination in a nomadic network setting, where some nodes are stationary...

76 FR 4643 - Notice of Proposed Information Collection Requests

Science.gov (United States)

2011-01-26

...): Lessons from the Research and Profiles of Promising Programs. OMB Control Number: Pending. Agency Form... grade 12 and to describe contextual factors that contribute to their effectiveness. Requests for copies...

A Novel CAN Tree Coordinate Routing in Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao Li

2014-09-01

Full Text Available In this paper, we propose a novel approach to improve coordination routing while minimizing the maintenance overhead during nodes churn. It bases on “CAN Tree Routing for Content- Addressable Network” 1 which is a solution for peer-to-peer routing. We concentrated on coordinate routing in this paper. The key idea of our approach is a recursion process to calculate target zone code and search in CAN tree 1. Because the hops are via long links in CAN, it enhances routing flexibility and robustness against failures. Nodes automatically adapt routing table to cope with network change. The routing complexity is , which is much better than a uniform greedy routing, while each node maintains two long links in average.

Sinkhole Avoidance Routing in Wireless Sensor Networks

Science.gov (United States)

2011-05-09

COVERED (From- To) 09-05-2011 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Sinkhole Avoidance Routing in Wireless Sensor Networks 5b . GRANT NUMBER . 5c...reliability of wireless sensor networks. 15. SUBJECT TERMS wireless sensor networks, sinkhole attack, routing protocol 16. SECURITY CLASSIFICATION...Include area code) Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std . Z39.18 1 Sinkhole Avoidance Routing in Wireless Sensor Networks MIDN 1/C

Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

OpenAIRE

Schurgot, Mary R.; Comaniciu, Cristina; Jaffrès-Runser, Katia

2011-01-01

This article examines the evolution of routing protocols for intermittently connected ad hoc networks and discusses the trend toward social-based routing protocols. A survey of current routing solutions is presented, where routing protocols for opportunistic networks are classified based on the network graph employed. The need to capture performance tradeoffs from a multi-objective perspective is highlighted.

Occurrence of radon in the Polish underground tourist routes

Directory of Open Access Journals (Sweden)

Jerzy Olszewski

2015-08-01

Full Text Available Background: There are about 200 underground tourist routes in Poland. There are caves, mines or underground structures. This paper presents the results of the research intended to identify the extent of the occurrence of radon concentrations in underground areas of tourist routes. Material and Methods: We conducted the measurement of periodic concentrations of radon (1–2 months in the summer using type Tastrak trace detectors. We determined the average concentrations of radon in air in 66 underground tourist routes in Poland. Results: The research results comprise 259 determinations of average radon concentrations in 66 routes. The arithmetic average of the results was 1610 Bqm–3, and the maximum measured concentration was over 20 000 Bqm–3. The minimum concentration was 100 Bqm–3 (threshold method considering the arithmetic average of the measurements. It was found that in 67% of the routes, the average concentration of radon has exceeded 300 Bqm–3 and in 22 underground routes it exceeded 1000 Bqm–3. Conclusions: Radon which occurs in many Polish underground tourist routes may be an organizational, legal and health problem. It is necessary to develop a program of measures to reduce radon concentrations in underground routes, especially routes located in the former mines. Med Pr 2015;66(4:557–563

78 FR 20139 - Agency Information Collection Activities; Proposed Collection; Comments Requested: Request for...

Science.gov (United States)

2013-04-03

... Collection; Comments Requested: Request for Recognition of a Non-profit Religious, Charitable, Social Service... Approved Collection. (2) Title of the Form/Collection: Request for Recognition of a Non- profit Religious, Charitable, Social Service, or Similar Organization. (3) Agency form number, if any, and the applicable...

Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

Directory of Open Access Journals (Sweden)

Baozhen Yao

2014-02-01

Full Text Available This paper deals with a real-life vehicle delivery routing problem, which is a seafood product delivery routing problem. Considering the features of the seafood product delivery routing problem, this paper formulated this problem as a multi-depot open vehicle routing problem. Since the multi-depot open vehicle routing problem is a very complex problem, a method is used to reduce the complexity of the problem by changing the multi-depot open vehicle routing problem into an open vehicle routing problem with a dummy central depot in this paper. Then, ant colony optimization is used to solve the problem. To improve the performance of the algorithm, crossover operation and some adaptive strategies are used. Finally, the computational results for the benchmark problems of the multi-depot vehicle routing problem indicate that the proposed ant colony optimization is an effective method to solve the multi-depot vehicle routing problem. Furthermore, the computation results of the seafood product delivery problem from Dalian, China also suggest that the proposed ant colony optimization is feasible to solve the seafood product delivery routing problem.

78 FR 2379 - Agency Information Collection Activities; Comment Request; Impact Evaluation of Math Professional...

Science.gov (United States)

2013-01-11

...; Comment Request; Impact Evaluation of Math Professional Development AGENCY: IES/NCES, Department of... of Math Professional Development. OMB Control Number: 1850-NEW. Type of Review: New information... requests clearance to recruit and collect data from districts, schools, and teachers for a study of math...

A Clustering Routing Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jinke Huang

2016-01-01

Full Text Available The dynamic topology of a mobile ad hoc network poses a real challenge in the design of hierarchical routing protocol, which combines proactive with reactive routing protocols and takes advantages of both. And as an essential technique of hierarchical routing protocol, clustering of nodes provides an efficient method of establishing a hierarchical structure in mobile ad hoc networks. In this paper, we designed a novel clustering algorithm and a corresponding hierarchical routing protocol for large-scale mobile ad hoc networks. Each cluster is composed of a cluster head, several cluster gateway nodes, several cluster guest nodes, and other cluster members. The proposed routing protocol uses proactive protocol between nodes within individual clusters and reactive protocol between clusters. Simulation results show that the proposed clustering algorithm and hierarchical routing protocol provide superior performance with several advantages over existing clustering algorithm and routing protocol, respectively.

Routing in Optical and Stochastic Networks

NARCIS (Netherlands)

Yang, S.

2015-01-01

In most types of networks (e.g., optical or transportation networks), finding one or more best paths from a source to a destination, is one of the biggest concerns of network users and providers. This process is known as routing. The routing problems differ accordingly depending on different

Transportation Routing Analysis Geographic Information System (WebTRAGIS) User's Manual

International Nuclear Information System (INIS)

Michelhaugh, R.D.

2000-01-01

In the early 1980s, Oak Ridge National Laboratory (ORNL) developed two transportation routing models: HIGHWAY, which predicts truck transportation routes, and INTERLINE, which predicts rail transportation routes. Both of these models have been used by the U.S. Department of Energy (DOE) community for a variety of routing needs over the years. One of the primary uses of the models has been to determine population-density information, which is used as input for risk assessment with the RADTRAN model, which is available on the TRANSNET computer system. During the recent years, advances in the development of geographic information systems (GISs) have resulted in increased demands from the user community for a GIS version of the ORNL routing models. In April 1994, the DOE Transportation Management Division (EM-261) held a Baseline Requirements Assessment Session with transportation routing experts and users of the HIGHWAY and INTERLINE models. As a result of the session, the development of a new GIS routing model, Transportation Routing Analysis GIS (TRAGIS), was initiated. TRAGIS is a user-friendly, GIS-based transportation and analysis computer model. The older HIGHWAY and INTERLINE models are useful to calculate routes, but they cannot display a graphic of the calculated route. Consequently, many users have experienced difficulty determining the proper node for facilities and have been confused by or have misinterpreted the text-based listing from the older routing models. Some of the primary reasons for the development of TRAGIS are (a) to improve the ease of selecting locations for routing, (b) to graphically display the calculated route, and (c) to provide for additional geographic analysis of the route

Air Cargo Transportation Route Choice Analysis

Science.gov (United States)

Obashi, Hiroshi; Kim, Tae-Seung; Oum, Tae Hoon

2003-01-01

Using a unique feature of air cargo transshipment data in the Northeast Asian region, this paper identifies the critical factors that determine the transshipment route choice. Taking advantage of the variations in the transport characteristics in each origin-destination airports pair, the paper uses a discrete choice model to describe the transshipping route choice decision made by an agent (i.e., freight forwarder, consolidator, and large shipper). The analysis incorporates two major factors, monetary cost (such as line-haul cost and landing fee) and time cost (i.e., aircraft turnaround time, including loading and unloading time, custom clearance time, and expected scheduled delay), along with other controls. The estimation method considers the presence of unobserved attributes, and corrects for resulting endogeneity by use of appropriate instrumental variables. Estimation results find that transshipment volumes are more sensitive to time cost, and that the reduction in aircraft turnaround time by 1 hour would be worth the increase in airport charges by more than $1000. Simulation exercises measures the impacts of alternative policy scenarios for a Korean airport, which has recently declared their intention to be a future regional hub in the Northeast Asian region. The results suggest that reducing aircraft turnaround time at the airport be an effective strategy, rather than subsidizing to reduce airport charges.

An Energy Centric Cluster-Based Routing Protocol for Wireless Sensor Networks.

Science.gov (United States)

Hosen, A S M Sanwar; Cho, Gi Hwan

2018-05-11

Clustering is an effective way to prolong the lifetime of a wireless sensor network (WSN). The common approach is to elect cluster heads to take routing and controlling duty, and to periodically rotate each cluster head's role to distribute energy consumption among nodes. However, a significant amount of energy dissipates due to control messages overhead, which results in a shorter network lifetime. This paper proposes an energy-centric cluster-based routing mechanism in WSNs. To begin with, cluster heads are elected based on the higher ranks of the nodes. The rank is defined by residual energy and average distance from the member nodes. With the role of data aggregation and data forwarding, a cluster head acts as a caretaker for cluster-head election in the next round, where the ranks' information are piggybacked along with the local data sending during intra-cluster communication. This reduces the number of control messages for the cluster-head election as well as the cluster formation in detail. Simulation results show that our proposed protocol saves the energy consumption among nodes and achieves a significant improvement in the network lifetime.

Compilation of requests for nuclear data

International Nuclear Information System (INIS)

Weston, L.W.; Larson, D.C.

1993-02-01

This compilation represents the current needs for nuclear data measurements and evaluations as expressed by interested fission and fusion reactor designers, medical users of nuclear data, nuclear data evaluators, CSEWG members and other interested parties. The requests and justifications are reviewed by the Data Request and Status Subcommittee of CSEWG as well as most of the general CSEWG membership. The basic format and computer programs for the Request List were produced by the National Nuclear Data Center (NNDC) at Brookhaven National Laboratory. The NNDC produced the Request List for many years. The Request List is compiled from a computerized data file. Each request has a unique isotope, reaction type, requestor and identifying number. The first two digits of the identifying number are the year in which the request was initiated. Every effort has been made to restrict the notations to those used in common nuclear physics textbooks. Most requests are for individual isotopes as are most ENDF evaluations, however, there are some requests for elemental measurements. Each request gives a priority rating which will be discussed in Section 2, the neutron energy range for which the request is made, the accuracy requested in terms of one standard deviation, and the requested energy resolution in terms of one standard deviation. Also given is the requestor with the comments which were furnished with the request. The addresses and telephone numbers of the requestors are given in Appendix 1. ENDF evaluators who may be contacted concerning evaluations are given in Appendix 2. Experimentalists contemplating making one of the requested measurements are encouraged to contact both the requestor and evaluator who may provide valuable information. This is a working document in that it will change with time. New requests or comments may be submitted to the editors or a regular CSEWG member at any time

77 FR 48959 - Submission for OMB Review; Comment Request

Science.gov (United States)

2012-08-15

... Along the California Coastline Part of the California Signage Plan Initiative. OMB Control Number: None...: This request is for a new information collection. The California Signage Plan is an organized and...

77 FR 25196 - Agency Information Collection Activities: Proposed Collection; Comments Requested; Request for...

Science.gov (United States)

2012-04-27

... Collection; Comments Requested; Request for Recognition of a Non-Profit Religious, Charitable, Social Service...) Title of the Form/Collection: Request for Recognition of a Non- profit Religious, Charitable, Social... organization meets the regulatory and relevant case law requirements for recognition by the Board as a legal...

78 FR 36577 - Agency Information Collection Activities; Proposed Collection; Comments Requested: Request for...

Science.gov (United States)

2013-06-18

... Collection; Comments Requested: Request for Recognition of a Non-Profit Religious, Charitable, Social Service... Collection. (2) Title of the Form/Collection: Request for Recognition of a Non- profit Religious, Charitable, Social Service, or Similar Organization. (3) Agency form number, if any, and the applicable component of...

PNW River Reach Files -- 1:100k LLID Routed Streams (routes)

Data.gov (United States)

Pacific States Marine Fisheries Commission — This feature class includes the ROUTE features from the 2001 version of the PNW River Reach files Arc/INFO coverage. Separate, companion feature classes are also...

Pharmacokinetics of Alternative Administration Routes of Melatonin

DEFF Research Database (Denmark)

Zetner, D.; Andersen, L. P.H.; Rosenberg, J.

2016-01-01

Background: Melatonin is traditionally administered orally but has a poor and variable bioavailability. This study aims to present an overview of studies investigating the pharmacokinetics of alternative administration routes of melatonin. Methods: A systematic literature search was performed...... and included experimental or clinical studies, investigating pharmacokinetics of alternative administration routes of melatonin in vivo. Alternative administration routes were defined as all administration routes except oral and intravenous. Results: 10 studies were included in the review. Intranasal....... Subcutaneous injection of melatonin displayed a rapid absorption rate compared to oral administration. Conclusion: Intranasal administration of melatonin has a large potential, and more research in humans is warranted. Transdermal application of melatonin has a possible use in a local application, due to slow...

Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohail Jabbar

2015-01-01

Full Text Available Network lifetime is one of the most prominent barriers in deploying wireless sensor networks for large-scale applications because these networks employ sensors with nonrenewable scarce energy resources. Sensor nodes dissipate most of their energy in complex routing mechanisms. To cope with limited energy problem, we present EASARA, an energy aware simple ant routing algorithm based on ant colony optimization. Unlike most algorithms, EASARA strives to avoid low energy routes and optimizes the routing process through selection of least hop count path with more energy. It consists of three phases, that is, route discovery, forwarding node, and route selection. We have improved the route discovery procedure and mainly concentrate on energy efficient forwarding node and route selection, so that the network lifetime can be prolonged. The four possible cases of forwarding node and route selection are presented. The performance of EASARA is validated through simulation. Simulation results demonstrate the performance supremacy of EASARA over contemporary scheme in terms of various metrics.

Route Flap Damping Made Usable

Science.gov (United States)

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

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

Using Sphinx to Improve Onion Routing Circuit Construction

Science.gov (United States)

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.

Iconic memory-based omnidirectional route panorama navigation.

Science.gov (United States)

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.

77 FR 35660 - Proposed Collection; Comment Request

Science.gov (United States)

2012-06-14

...; WHS Form 09; OMB Control Number 0704-TBD. Needs and Uses: The information collection requirement is...) and the outcome of such requests. Respondents are employees of WHS serviced components or applicants for employment of WHS serviced components. Dated: May 7, 2012. Patricia L. Toppings, OSD Federal...

78 FR 26620 - Proposed Collection; Comment Request

Science.gov (United States)

2013-05-07

..., including through the use of automated collection techniques or other forms of information technology. DATES..., Washington, DC 20301-1600. Title and OMB Control Number: Post Government Employment Advice Opinion Request... obtain minimal information on which to base an opinion about post Government employment of select former...

76 FR 51970 - Agency Information Collection Activities; Proposed Collection; Comment Request; Underground...

Science.gov (United States)

2011-08-19

... Underground Injection Control (UIC) Program under the Safe Drinking Water Act established a Federal and State... Activities; Proposed Collection; Comment Request; Underground Injection Control (UIC) Program AGENCY... Water Protection Division/Underground Injection Control Program, Mailcode: 4606M, Environmental...

Routing in Wireless Multimedia Home Networks

NARCIS (Netherlands)

Scholten, Johan; Jansen, P.G.; Hop, Laurens

This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless real-time home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

78 FR 5169 - Proposed Information Collection; Comment Request; Procedures for Considering Requests and...

Science.gov (United States)

2013-01-24

... apparel industry is being adversely impacted by imports of these products from Oman, thereby allowing CITA... Proclamation, an interested party in the U.S. domestic textile and apparel industry may file a request for a... Request; Procedures for Considering Requests and Comments From the Public for Textile and Apparel...

77 FR 67804 - Agency Information Collection Activities; Comment Request; Application for Client Assistance Program

Science.gov (United States)

2012-11-14

...; Comment Request; Application for Client Assistance Program AGENCY: Department of Education (ED), Office of... of Collection: Application for Client Assistance Program. OMB Control Number: 1820-0520. Type of... Burden Hours: 9. Abstract: This form is used by states to request funds to establish and carry out Client...

Multicast routing for wavelength-routed WDM networks with dynamic membership

Science.gov (United States)

Huang, Nen-Fu; Liu, Te-Lung; Wang, Yao-Tzung; Li, Bo

2000-09-01

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work, we explore the optical link control layer on the top of optical layer that enables the possibility of bandwidth on-demand service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over the optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to joint a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as less as possible. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2014-07-01

OSPF (Open Shortest Path First and EIGRP (Enhanced Interior Gateway Routing Protocol are two routing protocols are widely used in computer networks. Differences between the characteristics of routing protocols pose a problem in the delivery of data packets. Redistribution technique is the solution for communication between routing protocols. By using the software Cisco Packet Tracer 5.3 in this study were made simulating OSPF and EIGRP redistribution linked by technique, then compared its quality with a single EIGRP and OSPF routing protocols. Testing parameters in this study is the value of the time delay and trace route. Value trace route based on direct calculation of cost and metric compared with the simulation results. The result can be OSPF and EIGRP redistribution process. Value delay redistribution 1% better than OSPF and EIGRP 2-3% under traffic density dependent. In calculating the trace route redistribution is done 2 calculations, the cost for OSPF area and the area of the EIGRP metric. Making primary and alternate paths based on the packet delivery rate and the cost of the smallest metric, it is proved by calculation and simulation. Keywords: OSPF, EIGRP, Redistribution, Delay, Cost, Metric.

Long-Range Correlations and Memory in the Dynamics of Internet Interdomain Routing.

Directory of Open Access Journals (Sweden)

Maksim Kitsak

Full Text Available Data transfer is one of the main functions of the Internet. The Internet consists of a large number of interconnected subnetworks or domains, known as Autonomous Systems (ASes. Due to privacy and other reasons the information about what route to use to reach devices within other ASes is not readily available to any given AS. The Border Gateway Protocol (BGP is responsible for discovering and distributing this reachability information to all ASes. Since the topology of the Internet is highly dynamic, all ASes constantly exchange and update this reachability information in small chunks, known as routing control packets or BGP updates. In the view of the quick growth of the Internet there are significant concerns with the scalability of the BGP updates and the efficiency of the BGP routing in general. Motivated by these issues we conduct a systematic time series analysis of BGP update rates. We find that BGP update time series are extremely volatile, exhibit long-term correlations and memory effects, similar to seismic time series, or temperature and stock market price fluctuations. The presented statistical characterization of BGP update dynamics could serve as a basis for validation of existing and developing better models of Internet interdomain routing.

Analyzing multiday route choice behavior of commuters using GPS data

Directory of Open Access Journals (Sweden)

Wenyun Tang

2016-02-01

Full Text Available In this study, accurate global position system and geographic information system data were employed to reveal multiday routes people used and to study multiday route choice behavior for the same origin–destination trips, from home to work. A new way of thinking about route choice modeling is provided in this study. Travelers are classified into three kinds based on the deviation between actual routes and the shortest travel time paths. Based on the classification, a two-stage route choice process is proposed, in which the first step is to classify the travelers and the second one is to model route choice behavior. After analyzing the characteristics of different types of travelers, an artificial neural network was adopted to classify travelers and model route choice behavior. An empirical study using global position systems data collected in Minneapolis–St Paul metropolitan area was carried out. It finds that most travelers follow the same route during commute trips on successive days. And different types of travelers have a significant difference in route choice property. The modeling results indicate that neural network framework can classify travelers and model route choice well.

Route assessment using comparative risk factors integrated through a GIS

International Nuclear Information System (INIS)

Toth, D.M.; O'Connell, W.J.

1996-01-01

The assessment of potential alternative routes for the shipment of spent nuclear fuel was simplified through the use of comparative risk factors evaluated using detailed route and environmental attributes. The route characteristics, integrated into risk measures, vary strongly with location and were developed from national, state, and local sources. The route data and evaluation were managed using a geographic information system (GIS). An assessment of four real North Florida routes was performed and an interstate highway route exhibited the lowest risk based on the application of the risk factors

Routing in Wireless Multimedia Home Networks

NARCIS (Netherlands)

Scholten, Johan; Jansen, P.G.; Hop, Laurens

This paper describes an adapted version of the destination sequenced distance vector routing protocol (DSDV) which is suitable to calculate routes in a wireless ¿real-time¿ home network. The home network is based on a IEEE 802.11b ad hoc network and uses a scheduled token to enforce real-time

Cost analysis of hybrid adaptive routing protocol for heterogeneous ...

Indian Academy of Sciences (India)

NONITA SHARMA

Event detection; wireless sensor networks; hybrid routing; cost benefit analysis; proactive routing; reactive routing. 1. ... additional energy, high processing power, etc. are deployed to extend the .... transmit to its parent node. (2) Reactive ...

A joint routing and speed optimization problem

OpenAIRE

Fukasawa, Ricardo; He, Qie; Santos, Fernando; Song, Yongjia

2016-01-01

Fuel cost contributes to a significant portion of operating cost in cargo transportation. Though classic routing models usually treat fuel cost as input data, fuel consumption heavily depends on the travel speed, which has led to the study of optimizing speeds over a given fixed route. In this paper, we propose a joint routing and speed optimization problem to minimize the total cost, which includes the fuel consumption cost. The only assumption made on the dependence between the fuel cost an...

77 FR 75971 - Submission for OMB Review; Comment Request

Science.gov (United States)

2012-12-26

... Ecosystems for Recreation/Tourism. OMB Control Number: None. Form Number(s): NA. Type of Request: Regular... all ecosystem services for the Guanica Bay Watershed and for recreation-tourism for all of Puerto Rico...

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

Science.gov (United States)

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 Korsakoff syndrome (severe amnesia).

THE ROUTE DETERMINATION OF FILING A TAXI TO THE CUSTOMER IN TERMS OF FUNCTIONING OF THE AUTOMATED CONTROL SYSTEM

Directory of Open Access Journals (Sweden)

Yu. O. Davidich

2008-03-01

Full Text Available The issues of overall performance increase of taxi transport due to improvement of automated system of dispatching management by its technological processes are considered. The route of taxi submission to a customer is offered to be determined by a criterion of minimum time. To solve the given task the taxi submission route determination technique is developed. It will promote the reduction of passengers’ waiting time and the decrease in operational expenses of a carrier.

78 FR 41363 - Information Collection Activity; Comment Request

Science.gov (United States)

2013-07-10

... Analysis, Rural Utilities Service, 1400 Independence Ave. SW., STOP 1522, Room 5162--South Building... Program. OMB Control Number: 0572-0127. Type of Request: Extension of a currently approved information...-oriented connectivity'' basis. The ``community-oriented connectivity'' concept integrates the deployment of...

Satellite network robust QoS-aware routing

CERN Document Server

Long, Fei

2014-01-01

Satellite Network Robust QoS-aware Routing presents a novel routing strategy for satellite networks. This strategy is useful for the design of multi-layered satellite networks as it can greatly reduce the number of time slots in one system cycle. The traffic prediction and engineering approaches make the system robust so that the traffic spikes can be handled effectively. The multi-QoS optimization routing algorithm can satisfy various potential user requirements. Clear and sufficient illustrations are also presented in the book. As the chapters cover the above topics independently, readers from different research backgrounds in constellation design, multi-QoS routing, and traffic engineering can benefit from the book.   Fei Long is a senior engineer at Beijing R&D Center of 54th Research Institute of China Electronics Technology Group Corporation.

An inventory location routing model with environmental considerations

Directory of Open Access Journals (Sweden)

Lerhlaly Sanaa

2017-01-01

Full Text Available In this work we consider an integrated Inventory Location Routing problem ILRP. The objective is to select depots to open, the routes to perform distribution from the capacitated depots to the clients by a homogeneous fleet of vehicles and over a multi-period planning horizon. To solve the problem, an exact model is designed in order to minimize the total cost (location, routing and inventory and the routing CO2 emissions, while respecting transport and storage constraints for a hazardous material. We have also studied an industrial real case to illustrate the problem.

Results of the radiological survey at 200 State Route 17 (MJ035), Maywood, New Jersey

International Nuclear Information System (INIS)

Foley, R.D.; Crutcher, J.W.; Carrier, R.F.; Floyd, L.M.

1989-02-01

The property discussed in this report and properties in its vicinity contaminated with residues from the former Maywood Chemical Works (MCW) were included as a decontamination research and development project under the DOE Formerly Utilized Sites Remedial Action Program. As part of this project, DOE is conducting radiological surveys in the vicinity of the site to identify properties contaminated with residues derived from the MCW. The principal radionuclide of concern is thorium-232. The radiological survey discussed in this report is part of that effort and was conducted, at the request of DOE, by members of the Measurement Applications and Development Group of Oak Ridge National Laboratory. A radiological survey of the commercial property at 200 State Route 17, Maywood, New Jersey, was conducted during 1987. The survey and sampling of the ground surface and subsurface were carried out on September 2, 1987. 4 refs., 2 figs., 3 tabs

A new route to copper nitrate hydroxide microcrystals

International Nuclear Information System (INIS)

Niu Haixia; Yang Qing; Tang Kaibin

2006-01-01

A solution evaporation route has been successfully developed for the growth of copper nitrate hydroxide microcrystals using copper nitrate solution as the starting material in the absence of any surfactants or templates. The products were characterized by X-ray diffraction (XRD), infrared (IR) spectrum, scanning electron microscopy (SEM) and thermogravimetric (TG) analysis measurements. Controlled experiments suggested that the reaction temperature and solution concentration played an important role on the formation of the products. A possible formation mechanism of the products was also proposed

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

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

2018-04-23

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

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

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

Science.gov (United States)

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

1989-01-01

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

Mobility Tolerant Firework Routing for Improving Reachability in MANETs

Directory of Open Access Journals (Sweden)

Gen Motoyoshi

2014-03-01

Full Text Available In this paper, we investigate our mobility-assisted and adaptive broadcast routing mechanism, called Mobility Tolerant Firework Routing (MTFR, which utilizes the concept of potentials for routing and improves node reachability, especially in situations with high mobility, by including a broadcast mechanism. We perform detailed evaluations by simulations in a mobile environment and demonstrate the advantages of MTFR over conventional potential-based routing. In particular, we show that MTFR produces better reachability in many aspects at the expense of a small additional transmission delay and intermediate traffic overhead, making MTFR a promising routing protocol and feasible for future mobile Internet infrastructures.

Routing strategies in traffic network and phase transition in network ...

Indian Academy of Sciences (India)

The dynamics of information traffic over scale-free networks has been investigated systematically. A series of routing strategies of data packets have been proposed, including the local routing strategy, the next-nearest-neighbour routing strategy, and the mixed routing strategy based on local static and dynamic information.

How to enhance route learning and visuo-spatial working memory in aging: a training for residential care home residents.

Science.gov (United States)

Mitolo, Micaela; Borella, Erika; Meneghetti, Chiara; Carbone, Elena; Pazzaglia, Francesca

2017-05-01

This study aimed to assess the efficacy of a route-learning training in a group of older adults living in a residential care home. We verified the presence of training-specific effects in tasks similar to those trained - route-learning tasks - as well as transfer effects on related cognitive processes - visuo-spatial short-term memory (VSSTM; Corsi Blocks Test (CBT), forward version), visuo-spatial working memory (VSWM; CBT, backward version; Pathway Span Tasks; Jigsaw Puzzle Test) - and in self-report measures. The maintenance of training benefits was examined after 3 months. Thirty 70-90-year-old residential care home residents were randomly assigned to the route-learning training group or to an active control group (involved in non-visuo-spatial activities). The trained group performed better than the control group in the route-learning tasks, retaining this benefit 3 months later. Immediate transfer effects were also seen in visuo-spatial span tasks (i.e., CBT forward and backward version and Pathway Span Task); these benefits had been substantially maintained at the 3-month follow-up. These findings suggest that a training on route learning is a promising approach to sustain older adults' environmental learning and some related abilities (e.g., VSSTM and VSWM), even in residential care home residents.

76 FR 1598 - Submission for OMB Review; Comment Request

Science.gov (United States)

2011-01-11

... (FHWAR) Cell Phone and Debit Card Test. OMB Control Number: None. Form Number(s): Control Advance Letter... FHW-W1[C2], Advance Letter for Debit Card Sample FHW- W1[D]. Type of Request: New collection. Burden... existing and future needs. The FHWAR uses an address-based sample selected from the Census Bureau's Master...

Routing protocols for wireless sensor networks: What the literature says?

Directory of Open Access Journals (Sweden)

Amit Sarkar

2016-12-01

Full Text Available Routing in Wireless Sensor Networks (WSNs plays a significant role in the field of environment-oriented monitoring, traffic monitoring, etc. Here, wide contributions that are made toward routing in WSN are explored. The paper mainly aims to categorize the routing problems and examines the routing-related optimization problems. For achieving the motive, 50 papers from the standard journals are collected and primarily reviewed in a chronological way. Later, various features that are related to energy, security, speed and reliability problems of routing are discussed. Subsequently, the literature is analyzed based on the simulation environment and experimental setup, awareness over the Quality of Service (QoS and the deployment against various applications. In addition, the optimization of the routing algorithms and the meta-heuristic study of routing optimization are explored. Routing is a vast area with numerous unsolved issues and hence, various research gaps along with future directions are also presented.

77 FR 68151 - Agency Information Collection Activities; Submission for OMB Review; Comment Request: Main Fan...

Science.gov (United States)

2012-11-15

... for OMB Review; Comment Request: Main Fan Operation and Inspection (I-A, II-A, III, and V-A Mines... Administration (MSHA) sponsored information collection request (ICR) titled, ``Main Fan Operation and Inspection...: Potentially gassy (explosive) conditions underground are largely controlled by main fans. When accumulations...

An Indirect Route for Ethanol Production

Energy Technology Data Exchange (ETDEWEB)

Eggeman, T.; Verser, D.; Weber, E.

2005-04-29

The ZeaChem indirect method is a radically new approach to producing fuel ethanol from renewable resources. Sugar and syngas processing platforms are combined in a novel way that allows all fractions of biomass feedstocks (e.g. carbohydrates, lignins, etc.) to contribute their energy directly into the ethanol product via fermentation and hydrogen based chemical process technologies. The goals of this project were: (1) Collect engineering data necessary for scale-up of the indirect route for ethanol production, and (2) Produce process and economic models to guide the development effort. Both goals were successfully accomplished. The projected economics of the Base Case developed in this work are comparable to today's corn based ethanol technology. Sensitivity analysis shows that significant improvements in economics for the indirect route would result if a biomass feedstock rather that starch hydrolyzate were used as the carbohydrate source. The energy ratio, defined as the ratio of green energy produced divided by the amount of fossil energy consumed, is projected to be 3.11 to 12.32 for the indirect route depending upon the details of implementation. Conventional technology has an energy ratio of 1.34, thus the indirect route will have a significant environmental advantage over today's technology. Energy savings of 7.48 trillion Btu/yr will result when 100 MMgal/yr (neat) of ethanol capacity via the indirect route is placed on-line by the year 2010.

Alternative routes to olefins. Chances and challenges

Energy Technology Data Exchange (ETDEWEB)

Meiswinkel, A.; Delhomme, C.; Ponceau, M. [Linde AG, Pullach (Germany)

2013-11-01

In the future, conventional raw materials which are used for the production of olefins will get shorter and more expensive and alternative raw materials and production routes will gain importance. Natural gas, coal, shale oil or bio-mass are potential sources for the production of olefins, especially ethylene and propylene, as major base chemicals. Several potential production routes were already developed in the past, but cost, energy and environmental considerations might make these unattractive or unfeasible in comparison to traditional processes (e.g. steam cracking). Other processes such as methanol to olefins processes were successfully developed and first commercial units are running. In addition, combination of traditional processes (e.g. coal/biomass gasification, Fischer-Tropsch and steam cracking) might enable new pathways. Besides, dehydration of ethanol is opening direct routes from biomass to 'green' ethylene. However, for these 'bio-routes', feedstock availability and potential land use conflict with food production (sugar cane, wheat,..) still need to be evaluated. finally, new oxidative routes, including processes such as oxidative coupling of methane or oxidative dehydrogenation, are still at an early development stage but present potential for future industrial applications. (orig.) (Published in summary form only)

Privacy-Preserving Interdomain Routing at Internet Scale

Directory of Open Access Journals (Sweden)

Asharov Gilad

2017-07-01

Full Text Available The Border Gateway Protocol (BGP computes routes between the organizational networks that make up today’s Internet. Unfortunately, BGP suffers from deficiencies, including slow convergence, security problems, a lack of innovation, and the leakage of sensitive information about domains’ routing preferences. To overcome some of these problems, we revisit the idea of centralizing and using secure multi-party computation (MPC for interdomain routing which was proposed by Gupta et al. (ACM HotNets’12. We implement two algorithms for interdomain routing with state-of-the-art MPC protocols. On an empirically derived dataset that approximates the topology of today’s Internet (55 809 nodes, our protocols take as little as 6 s of topology-independent precomputation and only 3 s of online time. We show, moreover, that when our MPC approach is applied at country/region-level scale, runtimes can be as low as 0.17 s online time and 0.20 s pre-computation time. Our results motivate the MPC approach for interdomain routing and furthermore demonstrate that current MPC techniques are capable of efficiently tackling real-world problems at a large scale.

Integrating routing decisions in public transportation problems