Next-Generation WDM Network Design and Routing

NASA Astrophysics Data System (ADS)

Tsang, Danny H. K.; Bensaou, Brahim

2003-09-01

Call for Papers The Editors of JON are soliciting papers on WDM Network Design and Routing. The aim in this focus issue is to publish original research on topics including - but not limited to - the following: - WDM network architectures and protocols - GMPLS network architectures - Wavelength converter placement in WDM networks - Routing and wavelength assignment (RWA) in WDM networks - Protection and restoration strategies and algorithms in WDM networks - Traffic grooming in WDM networks - Dynamic routing strategies and algorithms - Optical burst switching - Support of multicast - Protection and restoration in WDM networks - Performance analysis and optimization in WDM networks Manuscript Submission To submit to this special issue, follow the normal procedure for submission to JON, indicating "WDM Network Design" in the "Comments" field of the online submission form. For all other questions relating to this focus issue, please send an e-mail to jon@osa.org, subject line "WDM Network Design." Additional information can be found on the JON website: http://www.osa-jon.org/submission/. Schedule - Paper Submission Deadline: November 1, 2003 - Notification to Authors: January 15, 2004 - Final Manuscripts to Publisher: February 15, 2004 - Publication of Focus Issue: February/March 2004

Driver decision making in response to alternate routes.

DOT National Transportation Integrated Search

2011-04-11

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

A Multi-Agent Framework for Packet Routing in Wireless Sensor Networks

PubMed Central

Ye, Dayon; Zhang, Minji; Yang, Yu

2015-01-01

Wireless sensor networks (WSNs) have been widely investigated in recent years. One of the fundamental issues in WSNs is packet routing, because in many application domains, packets have to be routed from source nodes to destination nodes as soon and as energy efficiently as possible. To address this issue, a large number of routing approaches have been proposed. Although every existing routing approach has advantages, they also have some disadvantages. In this paper, a multi-agent framework is proposed that can assist existing routing approaches to improve their routing performance. This framework enables each sensor node to build a cooperative neighbour set based on past routing experience. Such cooperative neighbours, in turn, can help the sensor to effectively relay packets in the future. This framework is independent of existing routing approaches and can be used to assist many existing routing approaches. Simulation results demonstrate the good performance of this framework in terms of four metrics: average delivery latency, successful delivery ratio, number of live nodes and total sensing coverage. PMID:25928063

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Fundamental Lifetime Mechanisms in Routing Protocols for Wireless Sensor Networks: A Survey and Open Issues

PubMed Central

Eslaminejad, Mohammadreza; Razak, Shukor Abd

2012-01-01

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues. PMID:23202008

Fundamental lifetime mechanisms in routing protocols for wireless sensor networks: a survey and open issues.

PubMed

Eslaminejad, Mohammadreza; Razak, Shukor Abd

2012-10-09

Wireless sensor networks basically consist of low cost sensor nodes which collect data from environment and relay them to a sink, where they will be subsequently processed. Since wireless nodes are severely power-constrained, the major concern is how to conserve the nodes' energy so that network lifetime can be extended significantly. Employing one static sink can rapidly exhaust the energy of sink neighbors. Furthermore, using a non-optimal single path together with a maximum transmission power level may quickly deplete the energy of individual nodes on the route. This all results in unbalanced energy consumption through the sensor field, and hence a negative effect on the network lifetime. In this paper, we present a comprehensive taxonomy of the various mechanisms applied for increasing the network lifetime. These techniques, whether in the routing or cross-layer area, fall within the following types: multi-sink, mobile sink, multi-path, power control and bio-inspired algorithms, depending on the protocol operation. In this taxonomy, special attention has been devoted to the multi-sink, power control and bio-inspired algorithms, which have not yet received much consideration in the literature. Moreover, each class covers a variety of the state-of-the-art protocols, which should provide ideas for potential future works. Finally, we compare these mechanisms and discuss open research issues.

Traditional and Alternate Routes to Teacher Certification: Issues, Assumptions, and Misconceptions. Issue Paper 95-2.

ERIC Educational Resources Information Center

Stoddart, Trish; Floden, Robert E.

States have created "alternate" routes to teacher certification. Comparison of alternate and college-based programs reveals clear trends in recruitment but a mixed picture regarding development of expertise. Alternate certification represents a radical departure from the current norm of teacher preparation. Several factors have led to…

CCS-DTN: clustering and network coding-based efficient routing in social DTNs.

PubMed

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs.

CCS-DTN: Clustering and Network Coding-Based Efficient Routing in Social DTNs

PubMed Central

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2015-01-01

With the development of mobile Internet, wireless communication via mobile devices has become a hot research topic, which is typically in the form of Delay Tolerant Networks (DTNs). One critical issue in the development of DTNs is routing. Although there is a lot research work addressing routing issues in DTNs, they cannot produce an advanced solution to the comprehensive challenges since only one or two aspects (nodes' movements, clustering, centricity and so on) are considered when the routing problem is handled. In view of these defects in the existing works, we propose a novel solution to address the routing issue in social DTNs. By this solution, mobile nodes are divided into different clusters. The scheme, Spray and Wait, is used for the intra-cluster communication while a new forwarding mechanism is designed for the inter-cluster version. In our solution, the characteristics of nodes and the relation between nodes are fully considered. The simulation results show that our proposed scheme can significantly improve the performance of the routing scheme in social DTNs. PMID:25609047

The QKD network: model and routing scheme

NASA Astrophysics Data System (ADS)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

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

[Observational study of outpatient unit duration of stay depending on the route of administration (intravenous vs subcutaneous) for a targeted therapy].

PubMed

Despiau, Frédéric; Zagala, Yann; Delord, Jean-Pierre; Montastruc, Marion; Lacaze, Jean-Louis; Ferrand, Régis; Bombail, Marie

2017-10-01

New routes of administration available for some targeted therapies, especially subcutaneous injections, have an impact not only on the patients' daycare experience, but also on the unit's organization. This observational study conducted on 48 voluntary patients at the Institut universitaire du cancer Toulouse-Oncopole shows that the mean duration of the outpatient unit stay is diminished by one hour when a subcutaneous injection is used instead of an intravenous route. This duration decrease is mainly caused by an 82% average reduction in treatment duration. However, the waiting times before and after the treatment itself are not significantly impacted. Organizational methods related to the treatment prescription and preparation remain indeed the same. Anticipated prescription is not noticeably impacted either. This reduction of the duration of stay will truly be obtained if the whole unit's organization is adapted. Copyright © 2017 Société Française du Cancer. Published by Elsevier Masson SAS. All rights reserved.

A Survey of Routing Protocols in Wireless Body Sensor Networks

PubMed Central

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

2014-01-01

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

A survey of routing protocols in wireless body sensor networks.

PubMed

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

2014-01-13

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

Multicast Routing of Hierarchical Data

NASA Technical Reports Server (NTRS)

Shacham, Nachum

1992-01-01

The issue of multicast of broadband, real-time data in a heterogeneous environment, in which the data recipients differ in their reception abilities, is considered. Traditional multicast schemes, which are designed to deliver all the source data to all recipients, offer limited performance in such an environment, since they must either force the source to overcompress its signal or restrict the destination population to those who can receive the full signal. We present an approach for resolving this issue by combining hierarchical source coding techniques, which allow recipients to trade off reception bandwidth for signal quality, and sophisticated routing algorithms that deliver to each destination the maximum possible signal quality. The field of hierarchical coding is briefly surveyed and new multicast routing algorithms are presented. The algorithms are compared in terms of network utilization efficiency, lengths of paths, and the required mechanisms for forwarding packets on the resulting paths.

Routing architecture and security for airborne networks

NASA Astrophysics Data System (ADS)

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

2009-05-01

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

Roots/Routes: Part I

ERIC Educational Resources Information Center

Swanson, Dalene M.

2009-01-01

This narrative and poetic rendering acts as an articulation of a journey of many routes. It is a storying of critical research issues and events as performances of lived experience. It is a metissage of hybrid, but interrelated, themes that find cohesion through fragmentation and coalescence, severance, and regrowth. These themes are invoked by…

Reliable Freestanding Position-Based Routing in Highway Scenarios

PubMed Central

Galaviz-Mosqueda, Gabriel A.; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur

2012-01-01

Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model. PMID:23202159

Reliable freestanding position-based routing in highway scenarios.

PubMed

Galaviz-Mosqueda, Gabriel A; Aquino-Santos, Raúl; Villarreal-Reyes, Salvador; Rivera-Rodríguez, Raúl; Villaseñor-González, Luis; Edwards, Arthur

2012-10-24

Vehicular Ad Hoc Networks (VANETs) are considered by car manufacturers and the research community as the enabling technology to radically improve the safety, efficiency and comfort of everyday driving. However, before VANET technology can fulfill all its expected potential, several difficulties must be addressed. One key issue arising when working with VANETs is the complexity of the networking protocols compared to those used by traditional infrastructure networks. Therefore, proper design of the routing strategy becomes a main issue for the effective deployment of VANETs. In this paper, a reliable freestanding position-based routing algorithm (FPBR) for highway scenarios is proposed. For this scenario, several important issues such as the high mobility of vehicles and the propagation conditions may affect the performance of the routing strategy. These constraints have only been partially addressed in previous proposals. In contrast, the design approach used for developing FPBR considered the constraints imposed by a highway scenario and implements mechanisms to overcome them. FPBR performance is compared to one of the leading protocols for highway scenarios. Performance metrics show that FPBR yields similar results when considering freespace propagation conditions, and outperforms the leading protocol when considering a realistic highway path loss model.

Etude de l'affaiblissement du comportement mecanique du pergelisol du au rechauffement climatique

NASA Astrophysics Data System (ADS)

Buteau, Sylvie

Le rechauffement climatique predit pour les prochaines decennies, aura des impacts majeurs sur le pergelisol qui sont tres peu documentes pour l'instant. La presente etude a pour but d'evaluer ces impacts sur les proprietes mecaniques du pergelisol et sa stabilite a long terme. Une nouvelle technique d'essai de penetration au cone a taux de deformation controle, a ete developpee pour caracteriser en place le pergelisol. Ces essais geotechniques et la mesure de differentes proprietes physiques ont ete effectues sur une butte de pergelisol au cours du printemps 2000. Le developpement et l'utilisation d'un modele geothermique 1D tenant compte de la thermodependance du comportement mecanique ont permis d'evaluer que les etendues de pergelisol chaud deviendraient instables a la suite d'un rechauffement de l'ordre de 5°C sur cent ans. En effet, la resistance mecanique du pergelisol diminuera alors rapidement jusqu'a 11,6 MPa, ce qui correspond a une perte relative de 98% de la resistance par rapport a un scenario sans rechauffement.

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

PubMed

Wahlgren, Lina; Schantz, Peter

2011-01-17

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

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

PubMed Central

2011-01-01

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

Central East Pacific Flight Routing

NASA Technical Reports Server (NTRS)

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

2006-01-01

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

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

PubMed

Oey, Christian Henry Wijaya; Moh, Sangman

2013-08-02

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

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

PubMed Central

Oey, Christian Henry Wijaya; Moh, Sangman

2013-01-01

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

Cirque du Monde as a health intervention

PubMed Central

Fournier, Cynthia; Drouin, Mélodie-Anne; Marcoux, Jérémie; Garel, Patricia; Bochud, Emmanuel; Théberge, Julie; Aubertin, Patrice; Favreau, Gil; Fleet, Richard

2014-01-01

functioning. According to Cirque du Soleil, there are several projects under way around the world researching the therapeutic value of social circuses. Conclusion Cirque du Monde is able to reach a marginalized population that is otherwise difficult for the health system to reach. This program has therapeutic potential because of its target population, its promotion of healthy habits, and the support that it offers through the group and its workers. Cirque du Soleil is investing heavily in this project. The lack of literature yielding robust data on the social circus is therefore an important issue. PMID:25392449

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

NASA Astrophysics Data System (ADS)

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

2005-03-01

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

W.E.B. DuBois's Challenge to Scientific Racism.

ERIC Educational Resources Information Center

Taylor, Carol M.

1981-01-01

Proposes that a direct and authoritative challenge to the scientific racism of the late eighteenth and early twentieth centuries was urgently needed, and was one of the leading rhetorical contributions of W.E.B. DuBois. Specifically examines three issues: social Darwinism, the eugenics movement, and psychologists' measurement of intelligence.…

Fabrication Routes for Continuous Fiber-Reinforced Ceramic Composites (CFCC)

NASA Technical Reports Server (NTRS)

DiCarlo, James A.; Bansal, Narottam P.

1998-01-01

The primary approaches used for fabrication of continuous fiber-reinforced ceramic composite (CFCC) components have been reviewed. The CFCC fabrication issues related to fiber, interface, and matrix have been analyzed. The capabilities, advantages and limitations of the five matrix-infiltration routes have been compared and discussed. Today, the best fabrication route for the CFCC end-user is not clear and compromises need to be made depending on the details of the CFCC application. However, with time, this problem should be reduced as research continues to develop advanced CFCC constituents and fabrication routes.

Fabrication Routes for Continuous Fiber-Reinforced Ceramic Composites (CFCC)

NASA Technical Reports Server (NTRS)

DiCarlo, James A.; Bansal, Narottam P.

1998-01-01

The primary approaches used for fabrication of continuous fiber-reinforced ceramic composite (CFCC) components have been reviewed. The CFCC fabrication issues related to fiber, interface, and matrix have been analyzed. The capabilities. advantages and limitations of the five matrix-infiltration routes have been compared and discussed. Today. the best fabrication route for the CFCC end-user is not clear and compromises need to be made depending on the details of the CFCC application. However, with time, this problem should be reduced as research continues to develop advanced CFCC constituents and fabrication routes.

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

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

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

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

Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

NASA Astrophysics Data System (ADS)

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

2017-10-01

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

Fund allocation using capacitated vehicle routing problem

NASA Astrophysics Data System (ADS)

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

2014-09-01

In investment fund allocation, it is unwise for an investor to distribute his fund into several assets simultaneously due to economic reasons. One solution is to allocate the fund into a particular asset at a time in a sequence that will either maximize returns or minimize risks depending on the investor's objective. The vehicle routing problem (VRP) provides an avenue to this issue. VRP answers the question on how to efficiently use the available fleet of vehicles to meet a given service demand, subjected to a set of operational requirements. This paper proposes an idea of using capacitated vehicle routing problem (CVRP) to optimize investment fund allocation by employing data of selected stocks in the FTSE Bursa Malaysia. Results suggest that CRVP can be applied to solve the issue of investment fund allocation and increase the investor's profit.

EPA may modify Du Pont waiver for methanol fuel blends

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

Anderson, E.V.

1985-09-02

The Environmental Protection Agency (EPA) granted a Clean Air ACt waiver to DuPont's blendstock of methanol and other cosolvent alcohols for use in unleaded gasoline. The waiver included some stringent fuel volatility requirements to control evaporative emissions that have kept the waiver from becoming the marketing tool for fuel alcohols that everyone expected it to be. EPA seems willing to amend the waiver as long as evaporative emissions controls are kept, but there are some difficult procedural issues to resolve first. To date, only small amounts of alcohol blends have been sold under the DuPont waiver because the blendstock tendsmore » to increase the volatility of gasoline.« less

ROUTES: a computer program for preliminary route location.

Treesearch

S.E. Reutebuch

1988-01-01

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

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

NASA Astrophysics Data System (ADS)

Qadri, Nadia N.; Liotta, Antonio

Mobile ad hoc networks (MANETs) are a fundamental element of pervasive networks and therefore, of pervasive systems that truly support pervasive computing, where user can communicate anywhere, anytime and on-the-fly. In fact, future advances in pervasive computing rely on advancements in mobile communication, which includes both infrastructure-based wireless networks and non-infrastructure-based MANETs. MANETs introduce a new communication paradigm, which does not require a fixed infrastructure - they rely on wireless terminals for routing and transport services. Due to highly dynamic topology, absence of established infrastructure for centralized administration, bandwidth constrained wireless links, and limited resources in MANETs, it is challenging to design an efficient and reliable routing protocol. This chapter reviews the key studies carried out so far on the performance of mobile ad hoc routing protocols. We discuss performance issues and metrics required for the evaluation of ad hoc routing protocols. This leads to a survey of existing work, which captures the performance of ad hoc routing algorithms and their behaviour from different perspectives and highlights avenues for future research.

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

PubMed Central

Wang, Haiyan; He, Ke

2018-01-01

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

PubMed

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

2018-04-23

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

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

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

Nearest greedy for solving the waste collection vehicle routing problem: A case study

NASA Astrophysics Data System (ADS)

Mat, Nur Azriati; Benjamin, Aida Mauziah; Abdul-Rahman, Syariza; Wibowo, Antoni

2017-11-01

This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. This technique has been widely used to devise initial solutions for issues concerning vehicle routing. Basically, the waste collection cycle involves the following steps: i) each vehicle starts from a depot, ii) visits a number of customers to collect waste, iii) unloads waste at the disposal site, and lastly, iv) returns to the depot. Moreover, the sample data set used in this paper consisted of six areas, where each area involved up to 103 customers. In this paper, the NG technique was employed to construct an initial route for each area. The solution proposed from the technique was compared with the present vehicle routes implemented by a waste collection company within the city. The comparison results portrayed that NG offered better vehicle routes with a 11.07% reduction of the total distance traveled, in comparison to the present vehicle routes.

The du Bois sign.

PubMed

Voelpel, James H; Muehlberger, Thomas

2011-03-01

According to the current literature, the term "du Bois sign" characterizes the condition of a shortened fifth finger as a symptom of congenital syphilis, Down syndrome, dyscrania, and encephalic malformation. Modern medical dictionaries and text books attribute the eponym to the French gynecologist Paul Dubois (1795-1871). Yet, a literature analysis revealed incorrect references to the person and unclear definitions of the term. Our findings showed that the origin of the term is based on observations made by the Swiss dermatologist Charles du Bois (1874-1947) in connection with congenital syphilis. In addition, a further eponymical fifth finger sign is closely associated with the du Bois sign. In conclusion, the du Bois sign has only limited diagnostic value and is frequently occurring in the normal healthy population.

Economic Effects of Highway Relief Routes on Small and Medium-Size Communities: Literature Review and Identification Issues

DOT National Transportation Integrated Search

2000-04-01

Highway relief routes around small- or medium-size communities are an important element of the Texas Trunk System. These routes provide for the safe and efficient movement of through traffic and contribute to the growth of the Texas economy. For smal...

"Cirque du Freak."

ERIC Educational Resources Information Center

Rivett, Miriam

2002-01-01

Considers the marketing strategies that underpin the success of the "Cirque du Freak" series. Describes how "Cirque du Freak" is an account of events in the life of schoolboy Darren Shan. Notes that it is another reworking of the vampire narrative, a sub-genre of horror writing that has proved highly popular with both adult and…

Suivi après le traitement du cancer du sein

PubMed Central

Sisler, Jeffrey; Chaput, Geneviève; Sussman, Jonathan; Ozokwelu, Emmanuel

2016-01-01

Résumé Objectif Offrir aux médecins de famille un résumé des recommandations fondées sur les données probantes pour guider les soins aux survivantes traitées pour le cancer du sein. Qualité des données Une recherche documentaire a été effectuée dans MEDLINE entre 2000 et 2016 à l’aide des mots-clés anglais suivants : breast cancer, survivorship, follow-up care, aftercare, guidelines et survivorship care plans, en se concentrant sur la revue des lignes directrices publiées récemment par les organismes nationaux de cancérologie. Les données étaient de niveaux I à III. Message principal Les soins aux survivantes comportent 4 facettes : surveillance et dépistage, prise en charge des effets à long terme, promotion de la santé et coordination des soins. La surveillance des récidives ne se traduit que par une mammographie annuelle, et le dépistage d’autres cancers doit suivre les lignes directrices basées sur la population. La prise en charge des effets à long terme du cancer et de son traitement aborde des problèmes courants tels la douleur, la fatigue, le lymphœdème, la détresse et les effets indésirables des médicaments, de même que les préoccupations à long terme comme la santé du cœur et des os. La promotion de la santé met en relief les bienfaits de l’activité chez les survivantes du cancer, avec l’accent mis sur l’activité physique. Les soins aux survivantes sont de meilleure qualité lorsque divers services et professionnels de la santé participent aux soins, et le médecin de famille joue un rôle important dans la coordination des soins. Conclusion Les médecins de famille sont de plus en plus souvent les principaux fournisseurs de soins de suivi après le traitement du cancer du sein. Le cancer du sein doit être considéré comme une affection médicale chronique, même chez les femmes en rémission, et les patientes profitent de la même approche que celle utilisée pour les autres affections chroniques en

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

NASA Astrophysics Data System (ADS)

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.

76 FR 66350 - Eighth Meeting: RTCA Special Committee 222 Inmarsat Aeronautical Mobile Satellite (Route) Services

Federal Register 2010, 2011, 2012, 2013, 2014

2011-10-26

... Committee 222 Inmarsat Aeronautical Mobile Satellite (Route) Services AGENCY: Federal Aviation..., Inmarsat Aeronautical Mobile Satellite (Route) Services meeting. SUMMARY: The FAA is issuing this notice to advise the public of a meeting of RTCA Special Committee 222, Inmarsat Aeronautical Mobile Satellite...

77 FR 30046 - Ninth Meeting: RTCA Special Committee 222, Inmarsat Aeronautical Mobile Satellite (Route) Services

Federal Register 2010, 2011, 2012, 2013, 2014

2012-05-21

... 222, Inmarsat Aeronautical Mobile Satellite (Route) Services AGENCY: Federal Aviation Administration..., Inmarsat Aeronautical Mobile Satellite (Route) Services. SUMMARY: The FAA is issuing this notice to advise the public of the Ninth meeting of RTCA Special Committee 222, Inmarsat Aeronautical Mobile Satellite...

Prévalence du portage asymptomatique du plasmodium chez les donneurs bénévoles de sang à Kisangani, République Démocratique du Congo

PubMed Central

Bassandja, Jacques Ossinga; Agasa, Salomon Batina; Likwela, Joris Losimba

2014-01-01

Introduction Le paludisme transfusionnel est une réalité en Afrique Sub-saharienne, en raison des transfusions sanguines répétées, peu ou non contrôlées et où les donneurs sont en majorité potentiellement porteurs d'hématozoaires. L'objectif de cette étude était de déterminer la prévalence du portage asymptomatique du plasmodium chez les donneurs bénévoles de sang à Kisangani. Méthodes Une étude transversale a été menée au Centre Provincial de Transfusion Sanguine à Kisangani du 1er Décembre 2012 au 31 Mars 2013 et a concerné 480 donneurs bénévoles de sang. Résultats La prévalence du portage asymptomatique du plasmodium chez les donneurs bénévoles de sang était de 28,3%. Plasmodium falciparum était l'espèce la plus répandue (96,3%). Près de la moitié des donneurs avait une parasitémie supérieure à 2000 parasites/µl. Les facteurs qui étaient significativement associés à la parasitémie étaient le jeune âge, le 1er don, et la non utilisation de la moustiquaire imprégnée d'insecticide à longue durée (MILD). Conclusion Les résultats de cette étude montrent que la prévalence du portage asymptomatique du plasmodium chez les donneurs bénévoles de sang était élevée, constituant ainsi un risque important de transmission du parasite aux receveurs souvent en mauvais état général. Cependant, l'utilisation de la MILD et la fidélisation des donneurs bénévoles semblent constituer des moyens utiles de réduction du risque de portage asymptomatique du Plasmodium. Une sensibilisation et éventuellement des distributions ciblées de MILD aux donneurs, en particuliers les plus jeunes, pourraient réduire considérablement le portage du Plasmodium parmi les donneurs de sang et ainsi réduire le risque de paludisme transfusionnel. PMID:25328616

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

PubMed

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

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

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

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

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

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

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

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

History-based route selection for reactive ad hoc routing protocols

NASA Astrophysics Data System (ADS)

Medidi, Sirisha; Cappetto, Peter

2007-04-01

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

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

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

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

A new method for solving routing and wavelength assignment problems under inaccurate routing information in optical networks with conversion capability

NASA Astrophysics Data System (ADS)

Luo, Yanting; Zhang, Yongjun; Gu, Wanyi

2009-11-01

In large dynamic networks it is extremely difficult to maintain accurate routing information on all network nodes. The existing studies have illustrated the impact of imprecise state information on the performance of dynamic routing and wavelength assignment (RWA) algorithms. An algorithm called Bypass Based Optical Routing (BBOR) proposed by Xavier Masip-Bruin et al can reduce the effects of having inaccurate routing information in networks operating under the wavelength-continuity constraint. Then they extended the BBOR mechanism (for convenience it's called EBBOR mechanism below) to be applied to the networks with sparse and limited wavelength conversion. But it only considers the characteristic of wavelength conversion in the step of computing the bypass-paths so that its performance may decline with increasing the degree of wavelength translation (this concept will be explained in the section of introduction again). We will demonstrate the issue through theoretical analysis and introduce a novel algorithm which modifies both the lightpath selection and the bypass-paths computation in comparison to EBBOR algorithm. Simulations show that the Modified EBBOR (MEBBOR) algorithm improves the blocking performance significantly in optical networks with Conversion Capability.

Maglev guideway route alignment and right-of-way requirements

NASA Astrophysics Data System (ADS)

Carlton, S.; Andriola, T.

1992-12-01

The use of existing rights-of-way (ROW) is assessed for maglev systems by estimating trip times and land acquisition requirements for potential maglev corridors while meeting passenger comfort limits. Right-of-way excursions improve trip time but incur a cost for purchasing land. The final report documents findings of the eight tasks in establishing right-of-way feasibility by examining three city-pair corridors in detail and developing an approximation method for estimating route length and travel times in 20 additional city-pair corridor portions and 21 new corridors. The use of routes independent of existing railroad or highway right-of-way have trip time advantages and significantly reduce the need for aggressive guideway geometries on intercity corridors. Selection of the appropriate alignment is determined by many corridor specific issues. Use of existing intercity rights-of-way may be appropriate for parts of routes on a corridor-specific basis and for urban penetration where vehicle speeds are likely to be reduced by policy due to noise and safety considerations, and where land acquisition costs are high. Detailed aspects of available rights-of-way, land acquisition costs, geotechnical issues, land use, and population centers must be examined in more detail on a specific corridor basis before the proper or best maglev alignment can be chosen.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

46 CFR 45.183 - Load line requirements for the St. Joseph and Muskegon routes.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 2 2010-10-01 2010-10-01 false Load line requirements for the St. Joseph and Muskegon... requirements for the St. Joseph and Muskegon routes. (a) Load line certificate. (1) The load line issued under... certificate is valid for the St. Joseph and Muskegon routes, and intermediate ports. However, operators must...

Command and Control (C2) Agility (Agilite du commandement et du controle (C2))

DTIC Science & Technology

2014-10-01

de la rigueur et de l’emploi des méthodes de mesure et d’amélioration de l’agilité du C2. Le spectre des missions... Control and Intelligence (C2I) Section DRDC Valcartier 2459 de la Bravoure Road Québec (Québec) G3J 1X5 CANADA Email: Micheline.Belanger@drdc...Agilité du commandement et du contrôle (C2) (STO-TR-SAS-085) Synthèse L’agilité est la capacité à effectuer avec succès, s’occuper de

Contact Graph Routing

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

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

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

PubMed Central

Radi, Marjan; Dezfouli, Behnam; Bakar, Kamalrulnizam Abu; Lee, Malrey

2012-01-01

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks. PMID:22368490

Multipath routing in wireless sensor networks: survey and research challenges.

PubMed

Radi, Marjan; Dezfouli, Behnam; Abu Bakar, Kamalrulnizam; Lee, Malrey

2012-01-01

A wireless sensor network is a large collection of sensor nodes with limited power supply and constrained computational capability. Due to the restricted communication range and high density of sensor nodes, packet forwarding in sensor networks is usually performed through multi-hop data transmission. Therefore, routing in wireless sensor networks has been considered an important field of research over the past decade. Nowadays, multipath routing approach is widely used in wireless sensor networks to improve network performance through efficient utilization of available network resources. Accordingly, the main aim of this survey is to present the concept of the multipath routing approach and its fundamental challenges, as well as the basic motivations for utilizing this technique in wireless sensor networks. In addition, we present a comprehensive taxonomy on the existing multipath routing protocols, which are especially designed for wireless sensor networks. We highlight the primary motivation behind the development of each protocol category and explain the operation of different protocols in detail, with emphasis on their advantages and disadvantages. Furthermore, this paper compares and summarizes the state-of-the-art multipath routing techniques from the network application point of view. Finally, we identify open issues for further research in the development of multipath routing protocols for wireless sensor networks.

Application of Game Theory Approaches in Routing Protocols for Wireless Networks

NASA Astrophysics Data System (ADS)

Javidi, Mohammad M.; Aliahmadipour, Laya

2011-09-01

An important and essential issue for wireless networks is routing protocol design that is a major technical challenge due to the function of the network. Game theory is a powerful mathematical tool that analyzes the strategic interactions among multiple decision makers and the results of researches show that applied game theory in routing protocol lead to improvement the network performance through reduce overhead and motivates selfish nodes to collaborate in the network. This paper presents a review and comparison for typical representatives of routing protocols designed that applied game theory approaches for various wireless networks such as ad hoc networks, mobile ad hoc networks and sensor networks that all of them lead to improve the network performance.

75 FR 81721 - Debit Card Interchange Fees and Routing

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-28

... may be processed and from inhibiting the ability of a merchant to direct the routing of an electronic... alternatives, the issuers and networks would be prohibited from inhibiting a merchant's ability to direct the... restrictions, card-issuing arrangements, and incentive programs for both merchants and issuers. Interested...

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

NASA Technical Reports Server (NTRS)

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

2016-01-01

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

Élimination du bore du silicium par plasma inductif sous champ électrique

NASA Astrophysics Data System (ADS)

Combes, R.; Morvan, D.; Picard, G.; Amouroux, J.

1993-05-01

We analyzed purification mechanisms of silicon by inductive plasma with a fluoride slag. The aim is to study boron elimination from doped electronic grade silicon in function of the nature of the slag to obtain a photovoltaic grade silicon. The steady began with the calculation and the comparison of the stability diagram of boron compounds in presence of CaF2, BaF2 and MgF2. This study led us to conclude that BaF2 is the better slag for silicon purification. This has been confirmed by experience. In a second time, we made purifications under electric bias to enhance slag efficiency. We noticed that BaF2 is more sensitive to electric bias than other slags. Nous avons analysé le mécanisme de purification du silicium sous plasma inductif en présence d'un laitier fluoré. L'objectif principal est d'étudier l'élimination du bore du silicium électronique dopé en fonction de la nature du fluorure pour obtenir un silicium de qualité photovoltaïque. L'étude a commencé par l'établissement et la comparaison de diagrammes des composés du bore en présence de CaF2, de MgF2 et de BaF2. Nous avons déduit de cette première étude que BaF2 est le meilleur laitier pour la purification du silicium. Ceci a été corroboré par l'expérience. Nous avons ensuite opéré en présence d'un champ électrique dans le but d'améliorer encore l'efficacité des laitiers. Nous avons constaté que BaF2 est plus sensible au champ électrique que les deux autres laitiers utilisés.

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

NASA Astrophysics Data System (ADS)

Mazi, K.; Koussis, A. D.

2010-09-01

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

Capacitated arc routing problem and its extensions in waste collection

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

Fadzli, Mohammad; Najwa, Nurul; Luis, Martino

2015-05-15

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles mustmore » start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time.« less

Actes du colloque sur le bilinguisme, Universite de Neuchatel, 14/15 Septembre, 1981 (Proceedings of the Colloquium on Bilingualism, University of Neuchatel, September 14-15, 1981).

ERIC Educational Resources Information Center

TRANEL, 1982

1982-01-01

This issue contains proceedings of a colloquium on linguistics at the University of Neuchatel: (1) "Propositions epistemologiques pour une etude du bilinguisme (Epistemological Propositions for a Study of Bilingualism)," by B. Py; (2) "Comment on di ca? Prolegomenes a une etude de la composante semantique du langage des migrants (How Do You Say…

Consequences experimentales des effets des fluctuations du vide sur la fluorescence parametrique et la generation du second harmonique en milieu confine

NASA Astrophysics Data System (ADS)

Robichaud, Luc

Les fluctuations du vide, qui consistent en l'apparition momentanee de particules, ce qui est permit par le principe d'incertitude de Heisenberg, joue un role primordial dans les processus photoniques, en particulier les processus non-lineaires. Par la manipulation de ces fluctuations du vide a l'aide de confinement optique, on retrouve deux phenomenes particuliers : l'intensification de la fluorescence parametrique (Walker, 2008) et l'inhibition de la generation du second harmonique (Collette, 2013). Dans ce travail, on presente les resultats dans le cas classique ; c'est-a-dire sans fluctuations du vide et confinement. Par la suite, on presente les effets des fluctuations du vide et du confinement, ce qui mene aux deux effets mentionnes. Dans le cas de la fluorescence parametrique, le bruit quantique sur le champ interne et externe est calcule, le role du desaccord de phase dans le modele est expose et une generalisation tridimensionnelle est etudiee afin de generaliser la conception du modele d'un cas unidimensionnel a un cas tridimensionnel planaire. Dans le cas de la generation du second harmonique, les difficultes d'un modele purement tridimensionnel sont exposees et ensuite le cas limite planaire est etudie.

Adaptive MANET multipath routing algorithm based on the simulated annealing approach.

PubMed

Kim, Sungwook

2014-01-01

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

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

NASA Technical Reports Server (NTRS)

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

2016-01-01

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

Routing and Scheduling Algorithms for WirelessHART Networks: A Survey

PubMed Central

Nobre, Marcelo; Silva, Ivanovitch; Guedes, Luiz Affonso

2015-01-01

Wireless communication is a trend nowadays for the industrial environment. A number of different technologies have emerged as solutions satisfying strict industrial requirements (e.g., WirelessHART, ISA100.11a, WIA-PA). As the industrial environment presents a vast range of applications, adopting an adequate solution for each case is vital to obtain good performance of the system. In this context, the routing and scheduling schemes associated with these technologies have a direct impact on important features, like latency and energy consumption. This situation has led to the development of a vast number of routing and scheduling schemes. In the present paper, we focus on the WirelessHART technology, emphasizing its most important routing and scheduling aspects in order to guide both end users and the developers of new algorithms. Furthermore, we provide a detailed literature review of the newest routing and scheduling techniques for WirelessHART, discussing each of their features. These routing algorithms have been evaluated in terms of their objectives, metrics, the usage of the WirelessHART structures and validation method. In addition, the scheduling algorithms were also evaluated by metrics, validation, objectives and, in addition, by multiple superframe support, as well as by the redundancy method used. Moreover, this paper briefly presents some insights into the main WirelessHART simulation modules available, in order to provide viable test platforms for the routing and scheduling algorithms. Finally, some open issues in WirelessHART routing and scheduling algorithms are discussed. PMID:25919371

ARPANET Routing Algorithm Improvements. Volume 1

DTIC Science & Technology

1980-08-01

the currently active PROCESS (at the head of the scheduling list). TIME returns the time. PASSIVATE puts the CURRENT PROCESS to sleep , and wakes uD...Ccntract. Network buffer managemenL issues are discussed and a new buffer managemet scheme for f the ARPANET is designed. Logical addressing is discussed...and a design is given for a logical addressing scheme suitable for ARPANET or DIN II. The applicability of ARPANET Routing to DIN II is evaluaced. The

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

PubMed Central

Allison, Samantha; Head, Denise

2017-01-01

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

Le role du phytoplancton de petite taille (<20 mum) dans les variations des proprietes optiques des eaux du Saint-Laurent

NASA Astrophysics Data System (ADS)

Mas, Sebastien

Les mesures satellitaires de couleur des oceans sont largement determinees par les proprietes optiques inherentes (IOPs) des eaux de surface. D'autre part, le phytoplancton de petite taille (<20 mum) est le plus souvent dominant dans les oceans, et peut donc etre une source importante de variation des IOPs dans les oceans. Dans ce contexte, le but principal de ce doctorat etait de definir l'impact du phytoplancton (<20 mum) sur les variations des proprietes optiques de l'Estuaire et du Golfe du Saint-Laurent (Canada). Afin d'atteindre cet objectif, il etait necessaire de determiner en milieu controle les facteurs de variabilite des proprietes optiques cellulaires et des IOPs du phytoplancton (<20 mum) des eaux du Saint-Laurent, et d'evaluer la contribution du phytoplancton (<20 mum) aux proprietes optiques totales des eaux du Saint-Laurent. Des experiences en laboratoire ont montre que les variations des proprietes optiques des cellules phytoplanctoniques soumises a un cycle jour-nuit, ainsi qu'a des changements concomitants d'intensite lumineuse, peuvent contribuer significativement a la variabilite des proprietes optiques observee en milieu naturel. D'autres experiences ont, quant a elles, mis en evidence que les variations des proprietes optiques des cellules phytoplanctoniques dues aux phases de croissance peuvent alterer les IOPs des oceans, particulierement pendant les periodes de floraison. De plus, la presence de bacteries et de particules detritiques peut egalement affecter la variabilite des IOPs totales, notamment la diffusion. Au printemps, dans l'Estuaire et le Golfe du Saint-Laurent, la contribution du phytoplancton <20 mum aux IOPs presentait des differences regionales evidentes pour les proprietes d'absorption et de diffusion. En plus de la variabilite spatiale, les proprietes optiques cellulaires presentaient des variations journalieres, et ce particulierement pour le picophytoplancton. Enfin, la plupart des differences observees dans les

Snow route optimization.

DOT National Transportation Integrated Search

2016-01-01

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

Rupture simultanée du ligament croisé antérieur et du ligament patellaire: à propos d'un cas

PubMed Central

Achkoun, Abdessalam; Houjairi, Khalid; Quahtan, Omar; Hassoun, Jalal; Arssi, Mohamed; Rahmi, Mohamed; Garch, Abdelhak

2016-01-01

La rupture simultanée du tendon rotulien et du ligament croisé antérieur est une lésion relativement rare. Son diagnostic peut facilement manquer lors de l'examen initial. Les options de traitement incluent la réparation immédiate du tendon rotulien avec soit la reconstruction simultanée ou différée de ligament croisé antérieur. Nous rapportons le cas d'une rupture combinée du tendon rotulien et du ligament croisé antérieur chez un jeune footballeur de 22 ans. Une approche de traitement en deux temps a été effectuée avec un excellent résultat fonctionnel. PMID:27366288

La reconstruction du sourcil par greffon composite du cuir chevelu: une astuce pour faciliter la technique

PubMed Central

El Omari, Mounia; El Mazouz, Samir; Gharib, Noureddine; EL Abbassi, Abdallah

2015-01-01

Les sourcils jouent un rôle important dans l’équilibre esthétique du visage. Leur reconstruction ou ophriopoïése, après séquelle de brûlure fait partie intégrante du programme de réhabilitation de la face brûlée. Plusieurs techniques ont été décrites. Nous insistons ici sur l'intérêt d'une technique simple, à la portée de tous les chirurgiens, et dont la méthode et les résultats peuvent être améliorés par un dessin bien planifié des zones donneuse et receveuse: la greffe composite prélevée au niveau du cuir chevelu dessinée à l'aide d'un calque du sourcil controlatéral. PMID:26401195

Visualizing Internet routing changes.

PubMed

Lad, Mohit; Massey, Dan; Zhang, Lixia

2006-01-01

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

Data-centric multiobjective QoS-aware routing protocol for body sensor networks.

PubMed

Razzaque, Md Abdur; Hong, Choong Seon; Lee, Sungwon

2011-01-01

In this paper, we address Quality-of-Service (QoS)-aware routing issue for Body Sensor Networks (BSNs) in delay and reliability domains. We propose a data-centric multiobjective QoS-Aware routing protocol, called DMQoS, which facilitates the system to achieve customized QoS services for each traffic category differentiated according to the generated data types. It uses modular design architecture wherein different units operate in coordination to provide multiple QoS services. Their operation exploits geographic locations and QoS performance of the neighbor nodes and implements a localized hop-by-hop routing. Moreover, the protocol ensures (almost) a homogeneous energy dissipation rate for all routing nodes in the network through a multiobjective Lexicographic Optimization-based geographic forwarding. We have performed extensive simulations of the proposed protocol, and the results show that DMQoS has significant performance improvements over several state-of-the-art approaches.

Does Non-Compliance with Route/Destination Assignment Compromise Evacuation Efficiency?

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

Yuan, Fang; Han, Lee; Chin, Shih-Miao

2007-01-01

This paper documents studies of two real-world network evacuation cases, each with a different, but proven, simulation software package. The purpose of these studies was to examine whether the rate of evacuees' compliance with predetermined route/destination assignments would have an impact on the efficiency of evacuation operations. Results from both cases suggest that a rate of less than 100% compliance does not compromise evacuation efficiency. In fact, although this is counter-intuitive, evacuation efficiency would actually improve as a result of "sensible" non-compliance on the part of the evacuees. A closer observation of the results revealed that the somewhat unexpected improvementmore » results from a reduction in congestion along designated evacuation routes as evacuees spread out to less prominent parallel streets and other non-congested outbound routes. This suggests that by being limited by the zone-to-zone and one-to-one assignment framework, conventional evacuation plans may have fallen short of providing the most efficient guidance to evacuees. To address this issue, some systematic means, perhaps simulation-based, should be performed to assess the zone partitions, route designations, and destination assignments in existing evacuation plans. Thus, evacuation planning with route/destination assignments based on origin zones may be flawed and may deserve reconsideration. After all, once en route, where an evacuee is coming from is of far less consequence than where he or she is going.« less

Routing strategies for efficient deployment of alternative fuel vehicles for freight delivery.

DOT National Transportation Integrated Search

2017-02-01

With increasing concerns on environmental issues, recent research on Vehicle Routing Problems : (VRP) has added new factors such as greenhouse gas emissions and alternative fuel vehicles into : the models. In this report, we consider one such promisi...

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

NASA Technical Reports Server (NTRS)

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

2017-01-01

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

Mise à jour sur le nouveau vaccin 9-valent pour la prévention du virus du papillome humain

PubMed Central

Yang, David Yi; Bracken, Keyna

2016-01-01

Résumé Objectif Informer les médecins de famille quant à l’efficacité, à l’innocuité, aux effets sur la santé publique et à la rentabilité du vaccin 9-valent contre le virus du papillome humain (VPH). Qualité des données Des articles pertinents publiés dans PubMed jusqu’en mai 2015 ont été examinés et analysés. La plupart des données citées sont de niveau I (essais randomisés et contrôlés et méta-analyses) ou de niveau II (études transversales, cas-témoins et épidémiologiques). Des rapports et recommandations du gouvernement sont aussi cités en référence. Message principal Le vaccin 9-valent contre le VPH, qui offre une protection contre les types 6, 11, 16, 18, 31, 33, 45, 52 et 58 du VPH, est sûr et efficace et réduira encore plus l’incidence des infections à VPH, de même que les cas de cancer lié au VPH. Il peut également protéger indirectement les personnes non immunisées par l’entremise du phénomène d’immunité collective. Un programme d’immunisation efficace peut prévenir la plupart des cancers du col de l’utérus. Les analyses montrent que la rentabilité du vaccin 9-valent chez les femmes est comparable à celle du vaccin quadrivalent original contre le VPH (qui protège contre les types 6, 11, 16 et 18 du VPH) en usage à l’heure actuelle. Toutefois, il faut investiguer plus en profondeur l’utilité d’immuniser les garçons avec le vaccin 9-valent contre le VPH. Conclusion en plus d’être sûr, le vaccin 9-valent protège mieux contre le VPH que le vaccin quadrivalent. Une analyse coûtefficacité en favorise l’emploi, du moins chez les adolescentes. Ainsi, les médecins devraient recommander le vaccin 9-valent à leurs patients plutôt que le vaccin quadrivalent contre le VPH.

Connaissances des médecins généralistes de Mohammedia (Maroc) concernant le dépistage du cancer du sein

PubMed Central

Zine, Karima; Nani, Samira; Lahmadi, Imad Ait; Maaroufi, Abderrahmane

2016-01-01

Introduction Le cancer du sein représente un problème de santé publique majeur au Maroc. C'est le premier cancer chez la femme. L'objectif de ce travail était d'évaluer les connaissances des médecins généralistes (MG) en matière de dépistage du cancer du sein dans la préfecture de Mohammedia Maroc. Méthodes Nous avons mené une étude transversale, descriptive, exhaustive incluant les 97 MG exerçant dans les établissements de soins de santé de base du secteur public et privé de la province de Mohammedia. Résultats Le taux de participation était de 87%. L'âge moyen des MG était de 49,6 ± 8,1. Quatre-vingt pour cent (n=55) des MG ont donné une incidence incorrecte, 77,6% (n=85) ont reconnu l'existence d'un plan national de prévention et de contrôle du cancer (PNPCC) au Maroc, et 67,1 des MG ont rapporté l'existence d'un registre du cancer au Maroc. Le secteur d'activité était associé significativement avec les connaissances des MG sur le PNPCC et sur l'existence d'un guide de détection précoce du cancer du sein avec respectivement (p=0,003 et p=0,001). Une association significative entre l'ancienneté et l'existence d'un guide de détection précoce du cancer du sein et d'un registre du cancer du sein a été retrouvée avec (respectivement p=0,005 et p=0.002). Conclusion À la lumière de ces résultats il faudra renforcer les connaissances et les pratiques des MG par la promotion de la formation initiale et continue sur le dépistage. PMID:27800098

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

NASA Technical Reports Server (NTRS)

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.

Cirque du Monde en tant qu’intervention en santé

PubMed Central

Fournier, Cynthia; Drouin, Mélodie-Anne; Marcoux, Jérémie; Garel, Patricia; Bochud, Emmanuel; Théberge, Julie; Aubertin, Patrice; Favreau, Gil; Fleet, Richard

2014-01-01

Résumé Objectif Présenter le programme Cirque du Monde du Cirque du Soleil et son potentiel en tant qu’intervention en soins de santé de première ligne pour les médecins de famille. Sources des données Une revue de la littérature menée dans les bases de données PubMed, Cochrane Library, PsycINFO, La Presse, Eureka, Google Scholar et Érudit à l’aide des mots-clés circus, social circus, Cirque du Monde et Cirque du Soleil. Une initiative à Montréal nommée Espace Transition qui s’inspire directement de Cirque du Monde. Communication personnelle avec le conseiller principal en formation en cirque social du Cirque du Soleil. Sélection d’études Les 50 premiers articles ou sites Internet répertoriés pour chaque mot-clé dans chacune des bases de données ciblées ont été révisés sur la base des titres et des résumés, s’il s’agissait d’un article, ou sur la base du titre et du contenu de la page, s’il s’agissait d’une page Internet. Ensuite, les articles et les sites Internet qui étudiaient un aspect du cirque social ou qui présentaient une intervention impliquant le cirque étaient retenus pour une révision. Aucune contrainte d’année de publication n’a été appliquée étant donné qu’on cherchait une littérature générale sur le cirque social. Synthèse Aucun article n’a été trouvé sur le cirque social en tant qu’intervention en santé. Nous avons trouvé une étude sur l’utilisation du cirque en tant qu’intervention en milieu scolaire. Cette étude a démontré une augmentation de l’estime personnelle des enfants grâce à l’intervention. Nous avons trouvé une étude sur l’utilisation du cirque en tant qu’intervention sur une réserve amérindienne. Cette étude présente des résultats qualitatifs non spécifiques au programme du cirque social. Les autres articles répertoriés n’étaient que des descriptions du cirque social. Un site web concernant l’utilisation du cirque social pour

A comprehensive survey of energy-aware routing protocols in wireless body area sensor networks.

PubMed

Effatparvar, Mehdi; Dehghan, Mehdi; Rahmani, Amir Masoud

2016-09-01

Wireless body area sensor network is a special purpose wireless sensor network that, employing wireless sensor nodes in, on, or around the human body, makes it possible to measure biological parameters of a person for specific applications. One of the most fundamental concerns in wireless body sensor networks is accurate routing in order to send data promptly and properly, and therefore overcome some of the challenges. Routing protocols for such networks are affected by a large number of factors including energy, topology, temperature, posture, the radio range of sensors, and appropriate quality of service in sensor nodes. Since energy is highly important in wireless body area sensor networks, and increasing the network lifetime results in benefiting greatly from sensor capabilities, improving routing performance with reduced energy consumption presents a major challenge. This paper aims to study wireless body area sensor networks and the related routing methods. It also presents a thorough, comprehensive review of routing methods in wireless body area sensor networks from the perspective of energy. Furthermore, different routing methods affecting the parameter of energy will be classified and compared according to their advantages and disadvantages. In this paper, fundamental concepts of wireless body area sensor networks are provided, and then the advantages and disadvantages of these networks are investigated. Since one of the most fundamental issues in wireless body sensor networks is to perform routing so as to transmit data precisely and promptly, we discuss the same issue. As a result, we propose a classification of the available relevant literature with respect to the key challenge of energy in the routing process. With this end in view, all important papers published between 2000 and 2015 are classified under eight categories including 'Mobility-Aware', 'Thermal-Aware', 'Restriction of Location and Number of Relays', 'Link-aware', 'Cluster- and Tree

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

PubMed

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

2016-04-12

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

Hybrid routing technique for a fault-tolerant, integrated information network

NASA Technical Reports Server (NTRS)

Meredith, B. D.

1986-01-01

The evolutionary growth of the space station and the diverse activities onboard are expected to require a hierarchy of integrated, local area networks capable of supporting data, voice, and video communications. In addition, fault-tolerant network operation is necessary to protect communications between critical systems attached to the net and to relieve the valuable human resources onboard the space station of time-critical data system repair tasks. A key issue for the design of the fault-tolerant, integrated network is the development of a robust routing algorithm which dynamically selects the optimum communication paths through the net. A routing technique is described that adapts to topological changes in the network to support fault-tolerant operation and system evolvability.

Participation des médecins généralistes de la province de Benimellal (Maroc) dans le dépistage du cancer du col

PubMed Central

Nani, Samira; Benallal, Mohamed; Hassoune, Samira; Kissi, Dounia; Maaroufi, Abderrahmane

2013-01-01

Introduction Au Maroc, chaque année il y aurait environ 2000 nouveaux cas de cancer du col et les 2/3 des cas sont pris en charge à un stade très avancé. Nous avons mené une étude transversale, exhaustive incluant les 71 médecins généralistes exerçant dans les établissements de soins de santé de base du secteur public et privé de la province de Benimellal. Le but était d’évaluer leurs connaissances et leur participation au dépistage du cancer du col. Méthodes Nous avons mené une étude transversale, exhaustive incluant les 71 médecins généralistes exerçant dans les établissements de soins de santé de base du secteur public et privé de la province de Benimellal. Le but était d’évaluer leurs connaissances et leur participation au dépistage du cancer du col. Résultats Le niveau de connaissance était relativement modeste, 22 médecins généraliste avaient répondu à la question sur l'incidence du cancer du col au Maroc, Parmi eux (81,8%) avaient donné une réponse incorrecte. L'Herpes Papilloma virus comme facteur de risque du cancer du col a été identifié par seulement 21% des médecins généralistes. La participation au dépistage était également défaillante, 92,8% n'avaient jamais pratiqué le FCV chez leurs patientes à cause principalement du manque de formation (95,5%). Conclusion Les résultats montrent la nécessité d'améliorer les connaissances théoriques et pratique des médecins généralistes concernant le dépistage du cancer du col. PMID:23785557

Séroprévalence et facteurs associés à l’acceptation du Conseil et Dépistage Volontaire du VIH chez l’enfant à Lubumbashi, République Démocratique du Congo

PubMed Central

Ngwej, Dieudonné Tshikwej; Mukuku, Olivier; Malonga, Françoise Kaj; Luboya, Oscar Numbi; Kakoma, Jean-Baptiste Sakatolo; Wembonyama, Stanis Okitotsho

2017-01-01

Résumé Introduction Malgré le dépistage du VIH proposé lors de la naissance ou au cours des consultations préscolaires, la proportion des enfants qui croissent ou décèdent sous statut sérologique au VIH inconnu est importante en République Démocratique du Congo (RDC). L’objectif de cette étude était de déterminer la séroprévalence au cours d’un dépistage volontaire et d’identifier les facteurs associés à l’acceptation du conseil et dépistage du VIH (CDV) en dehors de la maladie ou de toute exposition au VIH dans une population pédiatrique à Lubumbashi, RDC. Méthodes Il s’agissait d’une étude prospective transversale à visée analytique menée du 1er août 2006 au 31 septembre 2007. Elle avait été réalisée dans 4 centres communautaires de CDV répartis dans 4 zones de santé de la ville de Lubumbashi en RDC (Lubumbashi, Ruashi, Kampemba et de Kenya). L’étude avait consisté à faire le dépistage volontaire du VIH chez les enfants de moins de 15 ans. Les caractéristiques sociodémographiques et les paramètres relatifs au conseil et dépistage volontaire ont été étudiés. Les analyses statistiques descriptives usuelles et une régression logistique ont été réalisées. Résultats Sur 463 enfants dépistés du VIH, 41 (8,9%; IC 95%: 6,5%-11,9%) ont été testés positifs. L’acceptation du conseil et dépistage volontaire du VIH en dehors de la maladie ou de l’exposition au VIH était significativement plus élevée lorsque l’enfant était âgé de plus de 2 ans (Odds ratio ajusté (ORa) = 3,6 [IC 95%: 1,1-12,2]), lorsque le statut sérologique du VIH des parents était négatif ou inconnu (ORa = 27,4 [IC 95%: 9,4-80,0]), lorsque l’un ou l’autre ou les deux parents biologiques étaient en vie (ORa = 24,9 [IC 95%: 2,4-250,8]) et lorsque la connaissance du lieu de dépistage était fait par des moyens autres que le professionnel de santé (ORa = 2,9 [IC 95%: 1,0-7,9]). Conclusion Notre étude montre une forte

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

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

78 FR 76189 - Supplemental Environmental Impact Statement for the Route 460 Location Study, Prince George...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-12-16

... Army Individual Permit (IP) Application. The purpose of this SEIS is to evaluate new information... the document as part of its evaluation of the IP application submitted by U.S. Route 460 Mobility... available to the USACE for the proposed project are to issue the IP, issue the IP with special conditions...

Non-destructive analysis of DU content in the NIF hohlraums

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

Gharibyan, Narek; Moody, Ken J.; Shaughnessy, Dawn A.

2015-12-16

The advantage of using depleted uranium (DU) hohlraums in high-yield deuterium-tritium (DT) shots at the National Ignition Facility (NIF) is addressed by Döppner, et al., in great detail [1]. This DU based hohlraum incorporates a thin layer of DU, ~7 μm thick, on the inner surface along with a thin layer of a gold coating, ~0.7 μm thick, while the outer layer is ~22 μm thick gold. A thickness measurement of the DU layer can be performed using an optical microscope where the total DU weight can be computed provided a uniform DU layer. However, the uniformity of the thicknessmore » is not constant throughout the hohlraum since CAD drawing calculations of the DU weight do not agree with the computed values from optical measurements [2]. Therefore, a non-destructive method for quantifying the DU content in hohlraums has been established by utilizing gamma-ray spectroscopy. The details of this method, along with results from several hohlraums, are presented in this report.« less

Portage vaginal du streptocoque du groupe B chez la femme enceinte au niveau de la région de Marrakech

PubMed Central

Bassir, Ahlam; Dhibou, Hanane; Farah, Majdi; Mohamed, Lharmis; Amal, Addebous; Nabila, Souraa; Abderahim, Aboulfalah; Asmouki, Hamid; Soummani, Abderraouf

2016-01-01

Introduction Le streptocoque du groupe B est le principal agent impliqué dans les infections materno-fœtales, les septicémies et les méningites du nouveau-né à terme. L'objectif est de déterminer le taux de portage maternel du streptocoque du groupe B (SGB) à terme. Méthodes Un prélèvement vaginal a été réalisé de manière prospective chez 275 parturientes lors de l'entrée en salle d'accouchement sur une période de 06 mois. Résultats Le taux de portage était de 20,2%. Le portage était variable en fonction de l’âge gestationnel, il constitue 57.5% entre 37 et 38 semaines d'aménorrhée. Aucun des facteurs de risque n'a était statistiquement prédictif du portage maternel du SGB. Conclusion Le dépistage doit être réalisé à partir de 37 semaines d'aménorrhée, et comme le portage est intermittent, un prélèvement négatif ne garantirait pas que le portage soit négatif à l'accouchement. PMID:27222693

Cirque du Monde as a health intervention: perceptions of medical students and social circus experts.

PubMed

Fournier, Cynthia; Drouin, Mélodie-Anne; Marcoux, Jérémie; Garel, Patricia; Bochud, Emmanuel; Théberge, Julie; Aubertin, Patrice; Favreau, Gil; Fleet, Richard

2014-11-01

projects under way around the world researching the therapeutic value of social circuses. Cirque du Monde is able to reach a marginalized population that is otherwise difficult for the health system to reach. This program has therapeutic potential because of its target population, its promotion of healthy habits, and the support that it offers through the group and its workers. Cirque du Soleil is investing heavily in this project. The lack of literature yielding robust data on the social circus is therefore an important issue. Copyright© the College of Family Physicians of Canada.

Routing and Scheduling Optimization Model of Sea Transportation

NASA Astrophysics Data System (ADS)

barus, Mika debora br; asyrafy, Habib; nababan, Esther; mawengkang, Herman

2018-01-01

This paper examines the routing and scheduling optimization model of sea transportation. One of the issues discussed is about the transportation of ships carrying crude oil (tankers) which is distributed to many islands. The consideration is the cost of transportation which consists of travel costs and the cost of layover at the port. Crude oil to be distributed consists of several types. This paper develops routing and scheduling model taking into consideration some objective functions and constraints. The formulation of the mathematical model analyzed is to minimize costs based on the total distance visited by the tanker and minimize the cost of the ports. In order for the model of the problem to be more realistic and the cost calculated to be more appropriate then added a parameter that states the multiplier factor of cost increases as the charge of crude oil is filled.

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

NASA Astrophysics Data System (ADS)

Biro, Dora; Meade, Jessica; Guilford, Tim

2006-01-01

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

DCBRP: a deterministic chain-based routing protocol for wireless sensor networks.

PubMed

Marhoon, Haydar Abdulameer; Mahmuddin, M; Nor, Shahrudin Awang

2016-01-01

Wireless sensor networks (WSNs) are a promising area for both researchers and industry because of their various applications The sensor node expends the majority of its energy on communication with other nodes. Therefore, the routing protocol plays an important role in delivering network data while minimizing energy consumption as much as possible. The chain-based routing approach is superior to other approaches. However, chain-based routing protocols still expend substantial energy in the Chain Head (CH) node. In addition, these protocols also have the bottleneck issues. A novel routing protocol which is Deterministic Chain-Based Routing Protocol (DCBRP). DCBRP consists of three mechanisms: Backbone Construction Mechanism, Chain Head Selection (CHS), and the Next Hop Connection Mechanism. The CHS mechanism is presented in detail, and it is evaluated through comparison with the CCM and TSCP using an ns-3 simulator. It show that DCBRP outperforms both CCM and TSCP in terms of end-to-end delay by 19.3 and 65%, respectively, CH energy consumption by 18.3 and 23.0%, respectively, overall energy consumption by 23.7 and 31.4%, respectively, network lifetime by 22 and 38%, respectively, and the energy*delay metric by 44.85 and 77.54%, respectively. DCBRP can be used in any deterministic node deployment applications, such as smart cities or smart agriculture, to reduce energy depletion and prolong the lifetimes of WSNs.

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

DOT National Transportation Integrated Search

2016-07-01

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

The prediction of en route noise levels for a DC-9 aircraft

NASA Technical Reports Server (NTRS)

Weir, Donald S.

1988-01-01

En route noise for advanced propfan powered aircraft has become an issue of concern for the Federal Aviation Administration. The NASA Aircraft Noise Prediction Program (ANOPP) is used to demonstrate the source noise and propagation effects for an aircraft in level flight up to 35,000 feet altitude. One-third octave band spectra of the source noise, atmospheric absorption loss, and received noise are presented. The predicted maximum A-weighted sound pressure level is compared to measured data from the Aeronautical Research Institute of Sweden. ANOPP is shown to be an effective tool in evaluating the en route noise characteristics of a DC-9 aircraft.

Optical slotted circuit switched network: a bandwidth efficient alternative to wavelength-routed network

NASA Astrophysics Data System (ADS)

Li, Yan; Collier, Martin

2007-11-01

Wavelength-routed networks have received enormous attention due to the fact that they are relatively simple to implement and implicitly offer Quality of Service (QoS) guarantees. However, they suffer from a bandwidth inefficiency problem and require complex Routing and Wavelength Assignment (RWA). Most attempts to address the above issues exploit the joint use of WDM and TDM technologies. The resultant TDM-based wavelength-routed networks partition the wavelength bandwidth into fixed-length time slots organized as a fixed-length frame. Multiple connections can thus time-share a wavelength and the grooming of their traffic leads to better bandwidth utilization. The capability of switching in both wavelength and time domains in such networks also mitigates the RWA problem. However, TMD-based wavelength-routed networks work in synchronous mode and strict synchronization among all network nodes is required. Global synchronization for all-optical networks which operate at extremely high speed is technically challenging, and deploying an optical synchronizer for each wavelength involves considerable cost. An Optical Slotted Circuit Switching (OSCS) architecture is proposed in this paper. In an OSCS network, slotted circuits are created to better utilize the wavelength bandwidth than in classic wavelength-routed networks. The operation of the protocol is such as to avoid the need for global synchronization required by TDM-based wavelength-routed networks.

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

NASA Astrophysics Data System (ADS)

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

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

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

NASA Technical Reports Server (NTRS)

Garbell, Maurice A.

1990-01-01

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

ROUTE-SPECIFIC DOSIMETRY

EPA Science Inventory

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

Near real-time traffic routing

NASA Technical Reports Server (NTRS)

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

2012-01-01

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

A game theory-based obstacle avoidance routing protocol for wireless sensor networks.

PubMed

Guan, Xin; Wu, Huayang; Bi, Shujun

2011-01-01

The obstacle avoidance problem in geographic forwarding is an important issue for location-based routing in wireless sensor networks. The presence of an obstacle leads to several geographic routing problems such as excessive energy consumption and data congestion. Obstacles are hard to avoid in realistic environments. To bypass obstacles, most routing protocols tend to forward packets along the obstacle boundaries. This leads to a situation where the nodes at the boundaries exhaust their energy rapidly and the obstacle area is diffused. In this paper, we introduce a novel routing algorithm to solve the obstacle problem in wireless sensor networks based on a game-theory model. Our algorithm forms a concave region that cannot forward packets to achieve the aim of improving the transmission success rate and decreasing packet transmission delays. We consider the residual energy, out-degree and forwarding angle to determine the forwarding probability and payoff function of forwarding candidates. This achieves the aim of load balance and reduces network energy consumption. Simulation results show that based on the average delivery delay, energy consumption and packet delivery ratio performances our protocol is superior to other traditional schemes.

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

PubMed

Alanazi, Adwan; Elleithy, Khaled

2015-09-02

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

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

PubMed Central

Alanazi, Adwan; Elleithy, Khaled

2015-01-01

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

Class network routing

DOEpatents

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

2009-09-08

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

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

USGS Publications Warehouse

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

2016-01-01

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

Developing an eco-routing application.

DOT National Transportation Integrated Search

2014-01-01

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

Dedicated Caravan Sites for French Gens du Voyage

PubMed Central

2017-01-01

Abstract In France, gens du voyage (“people who travel” or “travellers”) is a term used by the government to categorize various itinerant populations, the majority of which are diverse Romani groups. People categorized as gens du voyage are legally required to reside in particular locations called “dedicated caravan sites.” Parliamentary debates about these dedicated caravan sites have clarified that one of the objectives of such sites is to help fulfill the gens du voyage’s right to health. However, there is a significant gap between the officially stated goals of such sites and the reality of life within them. This paper draws on research finding that the conditions in most dedicated caravan sites do not conform with the rights of gens du voyage to acceptable sanitary conditions and other underlying determinants of health. PMID:29302165

Routing channels in VLSI layout

NASA Astrophysics Data System (ADS)

Cai, Hong

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

Robustness of airline route networks

NASA Astrophysics Data System (ADS)

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

2016-03-01

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

Protocol Independent Adaptive Route Update for VANET

PubMed Central

Rasheed, Asim; Qayyum, Amir

2014-01-01

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

Route disruption analysis : final report.

DOT National Transportation Integrated Search

2007-01-01

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

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

ERIC Educational Resources Information Center

Wigglesivorth, John C.

2003-01-01

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

Drug repositioning summit: finding new routes to success.

PubMed

Campas, Clara

2009-03-01

The Third Annual Drug Repositioning Summit 2008 was held at the Hyatt Harborside Hotel in Boston, Massachusetts, October 6-7, and focused on new strategies for drug repositioning. The meeting, organized by The Cambridge Healthtech Institute, brought together a panel of speakers from the industry and the academia, who discussed and proposed new routes for success in drug repositioning based on their own experience in the field. This meeting report summarizes the most relevant presentations and issues discussed. Copyright 2009 Prous Science, S.A.U. or its licensors. All rights reserved.

Polymorphisme de l'apolipoprotéine E dans la population du nord du Maroc: fréquence et influence sur les paramètres lipidiques

PubMed Central

Benyahya, Fatiha; Barakat, Amina; Ghailani, Naima; Bennani, Mohcine

2013-01-01

Introduction L'objectif de ce travail est de déterminer les fréquences alléliques et génotypiques des sites polymorphes situés dans le gène de l'apolipoprotéine E (apo E) ainsi que leur impact sur les paramètres cliniques et lipidiques dans un échantillon de la population du nord du Maroc cliniquement diagnostiqué ADH. Méthodes Le génotype de l'apo E a été analysé par séquençage direct chez 46 patients cliniquement diagnostiqués ADH selon les critères standards. Résultats Les fréquences des allèles epsilon 3, epsilon 2 et epsilon 4 ont été respectivement 78.3%, 2.2% et 19.6%. La fréquence de l'allèle epsilon 4 est très élevée chez la population du nord du Maroc en comparaison avec les populations des autres régions marocaines. Elle est similaire à celle rapportée dans les pays de l'Europe du nord. Les taux du cholestérol total, du cholestérol LDL ainsi que la présence des xanthomes et les maladies cardiovasculaires ne différent pas entre les génotypes de l'apoE. En revanche, les résultats ont montré une influence de l'allèle epsilon4 sur le taux des triglycérides chez les sujets obèses. Conclusion Le génotype de l'apoE ne peut expliquer le phénotype clinique et biochimique présenté par des patients du Nord du Maroc cliniquement diagnostiqués ADH. PMID:24396563

Producing Gestures Facilitates Route Learning

PubMed Central

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

2014-01-01

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

Étude des déterminants individuels de l’adoption du dossier de santé électronique du Québec

PubMed Central

Mezni, H; M-P, Gagnon; Duplantie, J

2016-01-01

Résumé Objectif Selon des études précédentes, les dossiers de santé électroniques peuvent améliorer l’efficacité, la sécurité et la qualité de la prise en charge médicale. Cependant, les prestataires de soins restent réticents quant à son utilisation, ce qui limite son impact sur le système de santé. La présente étude avait pour objectif d’évaluer les perceptions des médecins face au dossier de santé du Québec. Méthodes À partir d’une revue de la littérature sur les facteurs influençant l’adoption des nouvelles technologies de l’information et des communications (NTIC) en général et de la cybersanté en particulier, nous avons élaboré un questionnaire semi-structuré. Au total, 12 médecins utilisateurs potentiels du dossier de santé du Québec (DSQ) ont complété et retourné le questionnaire. Par la suite, nous avons opéré une analyse thématique de contenu, suivie par une théorisation des concepts obtenus. Résultats L’intention d’adopter le DSQ est influencée positivement par l’utilité perçue, la facilité d’utilisation perçue, la démonstrabilité des résultats, la compatibilité du système avec la pratique et l’autoefficacité informatique perçue par les médecins. Inversement, la résistance au changement influence négativement l’adoption du DSQ par les médecins. Conclusion L’identification des déterminants de l’adoption du dossier de santé du Québec est cruciale pour les responsables du secteur de la santé au Québec. Il sera ainsi possible de saisir les attentes des utilisateurs potentiels et d’ajuster les stratégies d’implantation en vue de favoriser une meilleure intégration de cette technologie dans les pratiques médicales. PMID:27867453

Vehicle routing for the eco-efficient collection of household plastic waste.

PubMed

Bing, Xiaoyun; de Keizer, Marlies; Bloemhof-Ruwaard, Jacqueline M; van der Vorst, Jack G A J

2014-04-01

Plastic waste is a special category of municipal solid waste. Plastic waste collection is featured with various alternatives of collection methods (curbside/drop-off) and separation methods (source-/post-separation). In the Netherlands, the collection routes of plastic waste are the same as those of other waste, although plastic is different than other waste in terms of volume to weight ratio. This paper aims for redesigning the collection routes and compares the collection options of plastic waste using eco-efficiency as performance indicator. Eco-efficiency concerns the trade-off between environmental impacts, social issues and costs. The collection problem is modeled as a vehicle routing problem. A tabu search heuristic is used to improve the routes. Collection alternatives are compared by a scenario study approach. Real distances between locations are calculated with MapPoint. The scenario study is conducted based on real case data of the Dutch municipality Wageningen. Scenarios are designed according to the collection alternatives with different assumptions in collection method, vehicle type, collection frequency and collection points, etc. Results show that the current collection routes can be improved in terms of eco-efficiency performance by using our method. The source-separation drop-off collection scenario has the best performance for plastic collection assuming householders take the waste to the drop-off points in a sustainable manner. The model also shows to be an efficient decision support tool to investigate the impacts of future changes such as alternative vehicle type and different response rates. Crown Copyright © 2014. Published by Elsevier Ltd. All rights reserved.

Route visualization using detail lenses.

PubMed

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

2010-01-01

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

An overview of smart grid routing algorithms

NASA Astrophysics Data System (ADS)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

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

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

NASA Astrophysics Data System (ADS)

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.

A survey on routing protocols for large-scale wireless sensor networks.

PubMed

Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

2011-01-01

other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed.

A Survey on Routing Protocols for Large-Scale Wireless Sensor Networks

PubMed Central

Li, Changle; Zhang, Hanxiao; Hao, Binbin; Li, Jiandong

2011-01-01

and other metrics. Finally some open issues in routing protocol design in large-scale wireless sensor networks and conclusions are proposed. PMID:22163808

Le kyste hydatique du cordon spermatique: une localisation exceptionnelle

PubMed Central

Hamdane, Mohamed Moncef; Bougrine, Fethi; Msakni, Issam; Dhaoui-Ghozzi, Amen; Bouziani, Ammar

2011-01-01

L’ hydatidose est une anthropo-zoonose due au développement chez l'homme de la forme larvaire du taenia Echinococcus granulosis. La plupart des kystes hydatiques se localisent dans le foie et les poumons. Le kyste hydatique du cordon spermatique est extrêmement rare avec seulement 4 cas rapportés dans la littérature. Les auteurs rapportent dans cet article un nouveau cas d'hydatidose du cordon spermatique. Il s'agissait d'un homme de 40 ans qui consultait pour des douleurs scrotales évoluant depuis huit mois. L'examen clinique a mis en évidence une tuméfaction mobile, inguino-scrotale, droite. L’échographie testiculaire a objectivé une hernie inguinale droite associée à deux kystes épididymaires bilatéraux. Le patient a été opéré pour cure de son hernie avec découverte en per-opératoire d'un kyste du cordon spermatique qui a été réséqué. L'examen anatomopathologique a conclu à une hydatidose du cordon spermatique. PMID:22384304

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

PubMed Central

Havlin, Shlomo; Krioukov, Dmitri

2015-01-01

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

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

PubMed

Kitsak, Maksim; Elmokashfi, Ahmed; Havlin, Shlomo; Krioukov, Dmitri

2015-01-01

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.

Congestion control and routing over satellite networks

NASA Astrophysics Data System (ADS)

Cao, Jinhua

Satellite networks and transmissions find their application in fields of computer communications, telephone communications, television broadcasting, transportation, space situational awareness systems and so on. This thesis mainly focuses on two networking issues affecting satellite networking: network congestion control and network routing optimization. Congestion, which leads to long queueing delays, packet losses or both, is a networking problem that has drawn the attention of many researchers. The goal of congestion control mechanisms is to ensure high bandwidth utilization while avoiding network congestion by regulating the rate at which traffic sources inject packets into a network. In this thesis, we propose a stable congestion controller using data-driven, safe switching control theory to improve the dynamic performance of satellite Transmission Control Protocol/Active Queue Management (TCP/AQM) networks. First, the stable region of the Proportional-Integral (PI) parameters for a nominal model is explored. Then, a PI controller, whose parameters are adaptively tuned by switching among members of a given candidate set, using observed plant data, is presented and compared with some classical AQM policy examples, such as Random Early Detection (RED) and fixed PI control. A new cost detectable switching law with an interval cost function switching algorithm, which improves the performance and also saves the computational cost, is developed and compared with a law commonly used in the switching control literature. Finite-gain stability of the system is proved. A fuzzy logic PI controller is incorporated as a special candidate to achieve good performance at all nominal points with the available set of candidate controllers. Simulations are presented to validate the theory. An effocient routing algorithm plays a key role in optimizing network resources. In this thesis, we briefly analyze Low Earth Orbit (LEO) satellite networks, review the Cross Entropy (CE

Acceptabilité du test VIH proposé aux nourrissons dans les services pédiatriques, en Côte d'Ivoire, Significations pour la couverture du diagnostic pédiatrique

PubMed Central

Oga, Maxime; Brou, Hermann; Dago-Akribi, Hortense; Coffie, Patrick; Amani-Bossé, Clarisse; Ékouévi, Didier; Yapo, Vincent; Menan, Hervé; Ndondoki, Camille; Timité-Konan, M.; Leroy, Valériane

2014-01-01

Résumé Problème: Le dépistage VIH chez les enfants a rarement été au centre des préoccupations des chercheurs. Quand le dépistage pédiatrique a retenu l'attention, cela a été pour éclairer seulement sur les performances diagnostiques en ignorant même que le test pédiatrique comme bien d'autres peut s'accepter ou se refuser. Cet article met au cœur de son analyse les raisons qui peuvent expliquer qu'on accepte ou qu'on refuse de faire dépister son enfant. Objectif: Etudier chez les parents, les mères, les facteurs explicatifs de l'acceptabilité du test VIH des nourrissons de moins de six mois. Méthodes: Entretien semi-directif à passages répétés avec les parents de nourrissons de moins de six mois dans les formations sanitaires pour la pesée/vaccination et les consultations pédiatriques avec proposition systématique d'un test VIH pour leur nourrisson. Résultats: Nous retenons que la réalisation effective du test pédiatrique du VIH chez le nourrisson repose sur trois éléments. Primo, le personnel de santé par son discours (qui dénote de ses connaissances et perceptions même sur l'infection) orienté vers les mères influence leur acceptation ou non du test. Secundo, la mère qui par ses connaissances et perceptions même sur le VIH, dont le statut particulier, l'impression de bien-être chez elle et son enfant influence toute réalisation du test pédiatrique VIH. Tertio, l'environnement conjugal de la mère, particulièrement caractérisé par les rapports au sein du couple, sur la facilité de parler du test VIH et sa réalisation chez les deux parents ou chez la mère seulement sont autant de facteurs qui influencent la réalisation effective du dépistage du VIH chez l'enfant. Le principe préventif du VIH, et le désir de faire tester l'enfant ne suffisent pas à eux seuls pour aboutir à sa réalisation effective, selon certaines mères confrontées au refus du conjoint. A l'opposé, les autres mères refusant la r

Single-Layer Wire Routing.

DTIC Science & Technology

1987-08-01

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

CURRENT STATE OF PREDICTING THE RESPIRATORY ALLERGY POTENTIAL OF CHEMICALS: WHAT ARE THE ISSUES?

EPA Science Inventory

Current State of Predicting the Respiratory Allergy Potential of Chemicals: What Are the Issues? M I. Gilmour1 and S. E. Loveless2, 1USEPA, Research Triangle Park, NC and 2DuPont Haskell Laboratory, Newark, DE.

Many chemicals are clearly capable of eliciting immune respon...

Brain stem hypoplasia associated with Cri-du-Chat syndrome.

PubMed

Hong, Jin Ho; Lee, Ha Young; Lim, Myung Kwan; Kim, Mi Young; Kang, Young Hye; Lee, Kyung Hee; Cho, Soon Gu

2013-01-01

Cri-du-Chat syndrome, also called the 5p-syndrome, is a rare genetic abnormality, and only few cases have been reported on its brain MRI findings. We describe the magnetic resonance imaging findings of a 1-year-old girl with Cri-du-Chat syndrome who showed brain stem hypoplasia, particularly in the pons, with normal cerebellum and diffuse hypoplasia of the cerebral hemispheres. We suggest that Cri-du-Chat syndrome chould be suspected in children with brain stem hypoplasia, particularly for those with high-pitched cries.

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

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

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

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

Mergers and Anti-trust Issues in Recent CAB Cases

NASA Technical Reports Server (NTRS)

Andrews, A. M.

1972-01-01

The airline industry is surveyed-particularly domestic trunklines-in relation to collective approaches to industry concerns. These actions are classified by the apparent degree of anti-trust issue present. Recent route merger cases are considered from the CAB staff viewpoint.

Information non précise sur la taille du pénis en République Démocratique du Congo: à propos de 21 sources

PubMed Central

Mulenga, Philippe Cilundika; Kazadi, Alex Bukasa

2016-01-01

Introduction La taille du pénis constitue une préoccupation de beaucoup des gens actuellement et certains ne sont pas satisfaits de la dimension de leur pénis comme le montre l’étude de Tiggemann en 2008. Il existe relativement peu d'études sur le pénis en érection. Cela peut refléter les tabous culturels des chercheurs ou des médecins en interaction avec les hommes qui sont dans un état d’excitation sexuelle. Toutes fois, il est important pour les personnes qui annoncent des détails sur la taille du pénis d’annoncer d’abord les repères de la mesure du pénis puis ensuite donner les chiffres que proposent les chercheurs. Méthodes Notre enquête de type descriptif transversale s’est effectuée dans les deux grandes villes de la République Démocratique du Congo à savoir la ville de Kinshasa et la ville de Lubumbashi, pendant une période de deux ans soit de Mai 2014 à Mai 2016. Au total, 21 sources d’information ont constitué notre échantillon dont 8 à Kinshasa et 13 à Lubumbashi et nous avons trouvé cela suffisant car les sujets à caractère sexuel sont souvent rares chez nous. Les paramètres étudiés étaient: la nature de la source, la précision de la technique de la mesure, la présence de référence bibliographique, la longueur annoncée du pénis. Résultats La majorité des sources d’information sont faites des émissions de radio et de télévision (23,8%), ceci pourra s’expliquer par le fait que dans notre milieu il y a de plus en plus des chaines de radio et télévision et surtout dans les grandes villes. Concernant la précision de la technique de la mesure du pénis lors du partage du message sur la taille du pénis, l’étude nous montre que la majorité des sources d’information ne signale pas cela lorsqu’elles annoncent la taille du pénis au public soit 85,7%. Plusieurs sources ne déclarent pas les références bibliographiques (57,1%). Lorsqu’on regarde même les chiffres de la taille du p

Intelligent routing protocol for ad hoc wireless network

NASA Astrophysics Data System (ADS)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

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

Cholestéatome du méat acoustique externe

PubMed Central

Azeddine, Lachkar; Aabach, Ahmed; Chouai, Mohamed; Elayoubi, Fahd; Ghailan, Mohamed Rachid

2016-01-01

Le cholestéatome du méat acoustique externe se définit comme une accumulation de kératine en regard d’une érosion osseuse de nature ostéitique. C’est une entité otologique rare ou peut diagnostiquée. Le but de notre travail est d’illustrer sur la base d’un cas un cholestéatome du méat acoustique externe. Il s’agit d’un patient âgé de 65 ans diabétique et hypertendu sous traitement, présentant depuis 3 mois une otalgie droite intense, insomniante, avec hypoacousie, otorrhée purulente minime et paralysie faciale droite grade V. Le diagnostic évoqué était dans un premier temps celui d’otite externe maligne. Il a été mis sous traitement antibiotique sans amélioration. L’examen otologique a trouvé une lésion ulcéro-bourgeonnante de la paroi postérieure du méat acoustique externe droit, une biopsie systématique de la lésion a été pratiquée et a conclu à un cholestéatome. Le patient a bénéficié d’une tympanoplastie en technique ouverte. Le cholestéatome du méat acoustique externe est rare, la symptomatologie clinique n’est pas spécifique, le scanner des rocher est d’un grand apport pour le diagnostic positif montrant un cratère osseux du méat acoustique externe. Le traitement dépend de l’extension des lésions allant des simples soins locaux à une tympanoplastie en technique ouverte. Le cholestéatome du méat acoustique externe peut revêtir plusieurs aspects, et prêter confusion avec d’autres pathologies du méat acoustique externe. PMID:28154624

Cancer du sein au Maroc: profil phénotypique des tumeurs

PubMed Central

Khalil, Ahmadaye Ibrahim; Bendahhou, Karima; Mestaghanmi, Houriya; Saile, Rachid; Benider, Abdellatif

2016-01-01

Le cancer du sein est le plus fréquent chez la femme et figure parmi les principales causes de mortalité liées au cancer. La curabilité de ce type tumoral est en augmentation, grâce aux programmes de dépistage et aux progrès thérapeutiques, qui ont certes augmenté la survie des patients. Mais des défis restent à relever en rapport avec l’instabilité phénotypique des cellules cancéreuses. L’objectif de ce travail est d’étudier le profil phénotypique du cancer du sein chez les patients pris en charge au Centre Mohammed VI pour le traitement des Cancers, durant les années 2013-2014. Il s’agit d’une étude transversale sur deux années, incluant les cas du cancer du sein pris en charge au Centre. Le recueil des données était fait à partir des dossiers des patients et analysés par le logiciel Epi Info. 1277 patients ont été pris en charge au sein de notre centre. 99,5% des cas de sexe féminin, l’âge moyen était 50,20 ± 11,34 ans. Le type histologique le plus fréquent était le carcinome canalaire infiltrant (80,7% des cas). Le stade diagnostic était précoce (56,9%). Le phénotype moléculaire le plus fréquent était le luminal A (41,4% des cas). Le luminal B, le HER2 et les triples négatifs étaient dans respectivement 10,4%, 6,3%, 11,2% des cas. L’étude du phénotype tumoral des patients atteints du cancer du sein permet l’orientation du clinicien dans le choix du traitement, et des décideurs dans la planification de programmes de lutte contre cette pathologie. PMID:28292037

Dynamic information routing in complex networks

PubMed Central

Kirst, Christoph; Timme, Marc; Battaglia, Demian

2016-01-01

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

Identification d'une loi thermo-élasto-viscoplastique en vue de la modélisation du laminage à chaud du cuivre

NASA Astrophysics Data System (ADS)

Moureaux, P.; Moto Mpong, S.; Remy, M.; Bouffioux, C.; Lecomte-Beckers, J.; Habraken, A. M.

2002-12-01

la mise au point d'un modèle de simulation de la dernière passe du laminage à chaud du cuivre ne présente à priori pas de problème du point de vue numérique pour un code d'éléments finis non linéaire. La collecte d'informations précises tant sur le procédé industriel que sur le comportement du matériau est par contre une opération non triviale. Cet article présente les diverses méthodes expérimentales mises en œuvre pour caractériser le matériau : essais de compression à chaud, mesures d'analyse thermique différentielle, essais de dilatométrie et de diffusivité. Les méthodes permettant d'identifier les paramètres de la loi élasto-visco-plastique de type Norton-Hoff à partir des essais sont présentées et une analyse bibliographique investigue le problème de la détermination du module de Young à haute température. Tant les hypothèses supplémentaires relatives au procédé et nécessaires au modèle que les résultats finaux sont résumés.

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2014 CFR

2014-01-01

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

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2012 CFR

2012-01-01

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

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2013 CFR

2013-01-01

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

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2011 CFR

2011-01-01

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

14 CFR 121.95 - Route width.

Code of Federal Regulations, 2010 CFR

2010-01-01

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

Collective network routing

DOEpatents

Hoenicke, Dirk

2014-12-02

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

FAA/NASA En Route Noise Symposium

NASA Technical Reports Server (NTRS)

Powell, Clemans A. (Compiler)

1990-01-01

Aircraft community noise annoyance is traditionally a concern only in localities near airports. The proposed introduction of large commercial airplanes with advanced turboprop propulsion systems with supersonic propellers has given rise to concerns of noise annoyance in areas previously considered not to be impacted by aircraft noise. A symposium was held to assess the current knowledge of factors important to the impact of en route noise and to aid in the formulation of FAA and NASA programs in the area. Papers were invited on human response to aircraft noise in areas with low ambient noise levels, aircraft noise heard indoors and outdoors, aircraft noise in recreational areas, detection of propeller and jet aircraft noise, and methodological issues relevant to the design of future studies.

Bellman Ford algorithm - in Routing Information Protocol (RIP)

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

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

NASA Astrophysics Data System (ADS)

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

2014-12-01

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

Properties, use and health effects of depleted uranium (DU): a general overview.

PubMed

Bleise, A; Danesi, P R; Burkart, W

2003-01-01

Depleted uranium (DU), a waste product of uranium enrichment, has several civilian and military applications. It was used as armor-piercing ammunition in international military conflicts and was claimed to contribute to health problems, known as the Gulf War Syndrome and recently as the Balkan Syndrome. This led to renewed efforts to assess the environmental consequences and the health impact of the use of DU. The radiological and chemical properties of DU can be compared to those of natural uranium, which is ubiquitously present in soil at a typical concentration of 3 mg/kg. Natural uranium has the same chemotoxicity, but its radiotoxicity is 60% higher. Due to the low specific radioactivity and the dominance of alpha-radiation no acute risk is attributed to external exposure to DU. The major risk is DU dust, generated when DU ammunition hits hard targets. Depending on aerosol speciation, inhalation may lead to a protracted exposure of the lung and other organs. After deposition on the ground, resuspension can take place if the DU containing particle size is sufficiently small. However, transfer to drinking water or locally produced food has little potential to lead to significant exposures to DU. Since poor solubility of uranium compounds and lack of information on speciation precludes the use of radioecological models for exposure assessment, biomonitoring has to be used for assessing exposed persons. Urine, feces, hair and nails record recent exposures to DU. With the exception of crews of military vehicles having been hit by DU penetrators, no body burdens above the range of values for natural uranium have been found. Therefore, observable health effects are not expected and residual cancer risk estimates have to be based on theoretical considerations. They appear to be very minor for all post-conflict situations, i.e. a fraction of those expected from natural radiation.

The Evolution of Depleted Uranium as an Environmental Risk Factor: Lessons from Other Metals

PubMed Central

Briner, Wayne E.

2006-01-01

Depleted uranium (DU) is used in both civilian and military applications. Civilian uses are primarily limited to ballast and counterweights in ships and aircraft with limited risk of environmental release. The very nature of the military use of DU releases DU into the environment. DU released into the environment from military use takes the form of large fragments that are chemically unchanged and dust in the form of oxides. DU dust is nearly insoluble, respirable and shows little mobility in the soil. Exposure to DU occurs primarily from inhalation of dust and possible hand to mouth activity. Toxicity of DU is believed to be primarily chemical in nature with radiological activity being a lesser problem. DU has been shown to have a variety of behavioral and neurological effects in experimental animals. DU has been used the Balkans, Afghanistan, and both Iraq wars and there is a high probability of its use in future conflicts. Further, other nations are developing DU weaponry; some of these nations may use DU with a greater radiological risk than those currently in use. The toxicity of DU has been studied mostly as an issue of the health of military personnel. However, many tons of DU have been left in the former theater of war and indigenous populations continue to be exposed to DU, primarily in the form of dust. Little epidemiological data exists concerning the impact of DU on these groups. It may be possible to extrapolate what the effects of DU may be on indigenous groups by examining the data on similar metals. DU has many similarities to lead in its route of exposure, chemistry, metabolic fate, target organs, and effect of experimental animals. Studies should be conducted on indigenous groups using lead as a model when ascertaining if DU has an adverse effect. PMID:16823086

Elementary students' evacuation route choice in a classroom: A questionnaire-based method

NASA Astrophysics Data System (ADS)

Chen, Liang; Tang, Tie-Qiao; Huang, Hai-Jun; Song, Ziqi

2018-02-01

Children evacuation is a critical but challenging issue. Unfortunately, existing researches fail to effectively describe children evacuation, which is likely due to the lack of experimental and empirical data. In this paper, a questionnaire-based experiment was conducted with children aged 8-12 years to study children route choice behavior during evacuation from in a classroom with two exits. 173 effective questionnaires were collected and the corresponding data were analyzed. From the statistical results, we obtained the following findings: (1) position, congestion, group behavior, and backtracking behavior have significant effects on children route choice during evacuation; (2) age only affects children backtracking behavior, and (3) no prominent effects based on gender and guidance were observed. The above findings may help engineers design some effective evacuation strategies for children.

An Effective Evolutionary Approach for Bicriteria Shortest Path Routing Problems

NASA Astrophysics Data System (ADS)

Lin, Lin; Gen, Mitsuo

Routing problem is one of the important research issues in communication network fields. In this paper, we consider a bicriteria shortest path routing (bSPR) model dedicated to calculating nondominated paths for (1) the minimum total cost and (2) the minimum transmission delay. To solve this bSPR problem, we propose a new multiobjective genetic algorithm (moGA): (1) an efficient chromosome representation using the priority-based encoding method; (2) a new operator of GA parameters auto-tuning, which is adaptively regulation of exploration and exploitation based on the change of the average fitness of parents and offspring which is occurred at each generation; and (3) an interactive adaptive-weight fitness assignment mechanism is implemented that assigns weights to each objective and combines the weighted objectives into a single objective function. Numerical experiments with various scales of network design problems show the effectiveness and the efficiency of our approach by comparing with the recent researches.

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

PubMed

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

2014-03-01

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

A Near-Optimal Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Sensor Networks

PubMed Central

Lin, Frank Yeong-Sung; Hsiao, Chiu-Han; Yen, Hong-Hsu; Hsieh, Yu-Jen

2013-01-01

One of the important applications in Wireless Sensor Networks (WSNs) is video surveillance that includes the tasks of video data processing and transmission. Processing and transmission of image and video data in WSNs has attracted a lot of attention in recent years. This is known as Wireless Visual Sensor Networks (WVSNs). WVSNs are distributed intelligent systems for collecting image or video data with unique performance, complexity, and quality of service challenges. WVSNs consist of a large number of battery-powered and resource constrained camera nodes. End-to-end delay is a very important Quality of Service (QoS) metric for video surveillance application in WVSNs. How to meet the stringent delay QoS in resource constrained WVSNs is a challenging issue that requires novel distributed and collaborative routing strategies. This paper proposes a Near-Optimal Distributed QoS Constrained (NODQC) routing algorithm to achieve an end-to-end route with lower delay and higher throughput. A Lagrangian Relaxation (LR)-based routing metric that considers the “system perspective” and “user perspective” is proposed to determine the near-optimal routing paths that satisfy end-to-end delay constraints with high system throughput. The empirical results show that the NODQC routing algorithm outperforms others in terms of higher system throughput with lower average end-to-end delay and delay jitter. In this paper, for the first time, the algorithm shows how to meet the delay QoS and at the same time how to achieve higher system throughput in stringently resource constrained WVSNs.

Zone routing in a torus network

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

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

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

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

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

Masked Proportional Routing

NASA Technical Reports Server (NTRS)

Wolpert, David

2004-01-01

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

Le traumatisme du colon: l'expérience du CHU Hassan II de Fès

PubMed Central

Benjelloun, El Bachir; Hafid, Hasnai; Karim, Ibnmajdoub; Ousadden, Abdelmalek; Mazaz, Khalid; Taleb, Kahlid Ait

2012-01-01

Introduction Les traumatismes du colon sont associés à un risque majeur de complications septiques et de mortalité. Le but de notre étude est d’évaluer les circonstances, la prise en charge, le suivi et les facteurs pronostic de morbidité postopératoire des malades victimes d'un traumatisme colique. Méthodes Il s'agit d'une étude rétrospective sur une série de 49 patients opérés pour des plaies coliques aux services de chirurgie viscérale du CHU HASSAN II de Fès sur une période de 8 ans de juillet 2003 à juillet 2011. Résultats L’âge moyen de nos patients était de 25ans (16-70) avec une nette prédominance masculine (93.8%). Les plaies coliques secondaires à un traumatisme par arme blanche représentent 85% des cas (42 patients), suivi par les plaies iatrogènes au cours d'une coloscopie chez 6 patients (13%), puis les contusions abdominales chez 1 patient (2%). Les parties du cadre colique les plus touchées étaient le colon transverse chez 19 patients (38%) et le colon descendant chez 12 patients (24, 5%). Le colon sigmoïde était le segment le plus touché au cours d'une coloscopie4/6. Quarante-deux patients (85%) ont eu une suture primaire des plaies coliques, six patients (13%) une diversion fécale et un patient (2%) une résection-anastomose. Deux patients (4%) sont décédés suite à un choc septique. La morbidité globale était de 38,7% dominé essentiellement par l'infection de la paroi chez 14 patients et une péritonite post opératoire chez 3 patients. L'analyse univarié a montré une différence significatif en terme d'infection de la paroi entre le groupe colostomie versus suture simple (50% vs 20,9% p<0,05). L'atteinte du colon gauche et la réalisation d'une colostomie sont associés à un risque plus élevés de complications postopératoires. Conclusion La suture primaire peut être effectuée avec un faible taux de complications postopératoire chez la majorité des patients suite à un traumatisme du colon. PMID

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

PubMed Central

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

2015-01-01

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

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

PubMed

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

2015-11-01

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

Annealing of (DU-10Mo)-Zr Co-Rolled Foils

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

Pacheco, Robin Montoya; Alexander, David John; Mccabe, Rodney James

2017-01-20

Producing uranium-10wt% molybdenum (DU-10Mo) foils to clad with Al first requires initial bonding of the DU-10Mo foil to zirconium (Zr) by hot rolling, followed by cold rolling to final thickness. Rolling often produces wavy (DU-10Mo)-Zr foils that should be flattened before further processing, as any distortions could affect the final alignment and bonding of the Al cladding to the Zr co-rolled surface layer; this bonding is achieved by a hot isostatic pressing (HIP) process. Distortions in the (DU-10Mo)-Zr foil may cause the fuel foil to press against the Al cladding and thus create thinner or thicker areas in the Almore » cladding layer during the HIP cycle. Post machining is difficult and risky at this stage in the process since there is a chance of hitting the DU-10Mo. Therefore, it is very important to establish a process to flatten and remove any waviness. This study was conducted to determine if a simple annealing treatment could flatten wavy foils. Using the same starting material (i.e. DU-10Mo coupons of the same thickness), five different levels of hot rolling and cold rolling, combined with five different annealing treatments, were performed to determine the effect of these processing variables on flatness, bonding of layers, annealing response, microstructure, and hardness. The same final thickness was reached in all cases. Micrographs, textures, and hardness measurements were obtained for the various processing combinations. Based on these results, it was concluded that annealing at 650°C or higher is an effective treatment to appreciably reduce foil waviness.« less

Caching Joint Shortcut Routing to Improve Quality of Service for Information-Centric Networking.

PubMed

Huang, Baixiang; Liu, Anfeng; Zhang, Chengyuan; Xiong, Naixue; Zeng, Zhiwen; Cai, Zhiping

2018-05-29

Hundreds of thousands of ubiquitous sensing (US) devices have provided an enormous number of data for Information-Centric Networking (ICN), which is an emerging network architecture that has the potential to solve a great variety of issues faced by the traditional network. A Caching Joint Shortcut Routing (CJSR) scheme is proposed in this paper to improve the Quality of service (QoS) for ICN. The CJSR scheme mainly has two innovations which are different from other in-network caching schemes: (1) Two routing shortcuts are set up to reduce the length of routing paths. Because of some inconvenient transmission processes, the routing paths of previous schemes are prolonged, and users can only request data from Data Centers (DCs) until the data have been uploaded from Data Producers (DPs) to DCs. Hence, the first kind of shortcut is built from DPs to users directly. This shortcut could release the burden of whole network and reduce delay. Moreover, in the second shortcut routing method, a Content Router (CR) which could yield shorter length of uploading routing path from DPs to DCs is chosen, and then data packets are uploaded through this chosen CR. In this method, the uploading path shares some segments with the pre-caching path, thus the overall length of routing paths is reduced. (2) The second innovation of the CJSR scheme is that a cooperative pre-caching mechanism is proposed so that QoS could have a further increase. Besides being used in downloading routing, the pre-caching mechanism can also be used when data packets are uploaded towards DCs. Combining uploading and downloading pre-caching, the cooperative pre-caching mechanism exhibits high performance in different situations. Furthermore, to address the scarcity of storage size, an algorithm that could make use of storage from idle CRs is proposed. After comparing the proposed scheme with five existing schemes via simulations, experiments results reveal that the CJSR scheme could reduce the total number of

14 CFR 221.41 - Routing.

Code of Federal Regulations, 2010 CFR

2010-01-01

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

Routing Protocols in Wireless Sensor Networks

PubMed Central

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

2009-01-01

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

Routing protocols in wireless sensor networks.

PubMed

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

2009-01-01

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

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

NASA Technical Reports Server (NTRS)

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

2015-01-01

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

Multi-hop routing mechanism for reliable sensor computing.

PubMed

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

2009-01-01

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

An alternative for cost-effective remediation of depleted uranium (DU) at certain environmental restoration sites.

PubMed

Miller, M; Galloway, B; VanDerpoel, G; Johnson, E; Copland, J; Salazar, M

2000-02-01

Numerous sites in the United States and around the world are contaminated with depleted uranium (DU) in various forms. A prevalent form is fragmented DU originating from various scientific tests involving high explosives and DU during weapon development programs, at firing practice ranges, or war theaters where DU was used in armor-piercing projectiles. The contamination at these sites is typically very heterogeneous, with discreet, visually identifiable DU fragments mixed with native soil. That is, the bulk-averaged DU activity is quite low, while specific DU fragments, which are distinct from the soil matrix, have much higher specific activity. DU is best known as a dark, black metal that is nearly twice as dense as lead, but DU in the environment readily weathers (oxidizes) to a distinctive bright yellow color that is readily visible. While the specific activity (amount of radioactivity per mass of soil) of DU is relatively low and presents only a minor radiological hazard, the fact that it is radioactive and visually identifiable makes it desirable to remove the DU "contamination" from the environment. The typical approach to conducting this DU remediation is to use radiation detection instruments to identify the contaminant and separate it from the adjacent soil, packaging it for disposal as radioactive waste. This process can be performed manually or by specialized, automated equipment. Alternatively, in certain situations a more cost-effective approach might be simple mechanical or gravimetric separation of the DU fragments from the host soil matrix. At SNL/NM, both the automated and simple mechanical approaches have recently been employed. This paper discusses the pros/cons of the two approaches.

W.E.B. DuBois and the Concepts of Race and Class.

ERIC Educational Resources Information Center

Green, Dan S.; Smith, Earl

1983-01-01

Summarizes and analyzes W.E.B. DuBois's publications on race and class, particularly as he observed the relationships between White and Black Americans from about 1890 to the 1960s. Contends that DuBois's work has been seriously underrated and cites William J. Wilson's work as corroborating and extending DuBois's theories. (CJM)

Assessment of Air Traffic Controller Acceptability of Aircrew Route Change Requests

NASA Technical Reports Server (NTRS)

Idris, Husni; Enea, Gabriele; Burke, Kelly; Wing, David

2017-01-01

NASA developed the traffic aware strategic aircrew requests concept for a cockpit automation that identifies route improvements and advises the aircrew to request the change from the air traffic controller. In order to increase the chance of air traffic control approval, the automation ensures that the route is clear of known traffic, weather, and airspace restrictions. Hence the technology is anticipated to provide benefits in areas such as flight efficiency, flight schedule compliance, passenger comfort, and pilot and controller workload. In support of a field trial of a prototype of the technology, observations were conducted at the Atlanta and Jacksonville air traffic control centers to identify the main factors that affect the acceptability of aircrew requests by air traffic controllers. Observers shadowed air traffic controllers as the test flight pilot made pre-scripted requests to invoke acceptability issues and then they interviewed voluntarily fifty controllers with experience ranging from one to thirty-five years. The most common reason for rejecting requests is conflicting with traffic followed by violating air traffic procedures, increasing sector workload, and conflicting with major arrival and departure flows and flow restrictions. Quantitative parameters such as the distance that a route should maintain from sector boundaries and special use airspace were identified and recommended for inclusion in the automation.

Sustainable growth, the DuPont way.

PubMed

Holliday, C

2001-09-01

Like many manufacturers, DuPont traditionally has grown by making more and more "stuff." And its business growth has been proportional to the amount of raw materials and energy used--as well as the resulting waste and emissions from operations. Over the years, though, DuPont became aware that cheap supplies of nonrenewable resources wouldn't be endlessly available and that the earth's ecosystems couldn't indefinitely absorb the waste and emissions of production and consumption. Chad Holliday, chairman and CEO of DuPont, believes strongly in the challenge of sustainable growth and makes the business case for it: By using creativity and scientific knowledge effectively, he says, companies can provide strong returns for shareholders and grow their businesses--while also meeting the human needs of societies around the world and reducing the environmental footprint of their operations and products. In fact, a focus on sustainability can help identify new products, markets, partnerships, and intellectual property and lead to substantial business growth. Holliday describes how DuPont developed a three-pronged strategy to translate the concept of sustainability into nuts-and-bolts business practices. Focusing on integrated science, knowledge intensity, and productivity improvement, the strategy was accompanied by a new way to measure progress quantitatively. Sustainable growth should be viewed not as a program for stepped-up environmental performance but as a comprehensive way of doing business, one that delivers tremendous economic value and opens up new opportunities. Ultimately, companies will find that they can generate substantial business value through sustainability while both enhancing the quality of life around the world and protecting the environment.

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

PubMed

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

2018-01-01

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

Biases of STRUCTURE software when exploring introduction routes of invasive species.

PubMed

Lombaert, Eric; Guillemaud, Thomas; Deleury, Emeline

2018-06-01

Population genetic methods are widely used to retrace the introduction routes of invasive species. The unsupervised Bayesian clustering algorithm implemented in STRUCTURE is amongst the most frequently used of these methods, but its ability to provide reliable information about introduction routes has never been assessed. We simulated microsatellite datasets to evaluate the extent to which the results provided by STRUCTURE were misleading for the inference of introduction routes. We focused on an invasion scenario involving one native and two independently introduced populations, because it is the sole scenario that can be rejected when obtaining a particular clustering with a STRUCTURE analysis at K = 2 (two clusters). Results were classified as "misleading" or "non-misleading". We investigated the influence of effective size, bottleneck severity and number of loci on the type and frequency of misleading results. We showed that misleading STRUCTURE results were obtained for 10% of all simulated datasets. Our results highlighted two categories of misleading output. The first occurs when the native population has a low level of diversity. In this case, the two introduced populations may be very similar, despite their independent introduction histories. The second category results from convergence issues in STRUCTURE for K = 2, with strong bottleneck severity and/or large numbers of loci resulting in high levels of differentiation between the three populations. Overall, the risk of being misled by STRUCTURE in the context of introduction routes inferences is moderate, but it is important to remain cautious when low genetic diversity or genuine multimodality between runs are involved.

A radio-aware routing algorithm for reliable directed diffusion in lossy wireless sensor networks.

PubMed

Kim, Yong-Pyo; Jung, Euihyun; Park, Yong-Jin

2009-01-01

In Wireless Sensor Networks (WSNs), transmission errors occur frequently due to node failure, battery discharge, contention or interference by objects. Although Directed Diffusion has been considered as a prominent data-centric routing algorithm, it has some weaknesses due to unexpected network errors. In order to address these problems, we proposed a radio-aware routing algorithm to improve the reliability of Directed Diffusion in lossy WSNs. The proposed algorithm is aware of the network status based on the radio information from MAC and PHY layers using a cross-layer design. The cross-layer design can be used to get detailed information about current status of wireless network such as a link quality or transmission errors of communication links. The radio information indicating variant network conditions and link quality was used to determine an alternative route that provides reliable data transmission under lossy WSNs. According to the simulation result, the radio-aware reliable routing algorithm showed better performance in both grid and random topologies with various error rates. The proposed solution suggested the possibility of providing a reliable transmission method for QoS requests in lossy WSNs based on the radio-awareness. The energy and mobility issues will be addressed in the future work.

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

PubMed

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

PubMed Central

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

Optimization of waste transportation route at waste transfers point in Lowokwaru District, Malang City

NASA Astrophysics Data System (ADS)

Hariyani, S.; Meidiana, C.

2018-04-01

Increasing population led to the emergence of the urban infrastructure services issue including waste problems especially waste transportation system. Data in 2016 shows that the amount of waste in Malang was 659.21 tons / day. The amount of waste transported to landfill only reached 464.74 tons / day. This indicates that not all waste can be transported to the landfill Supiturang because Level of Service (LoS) reached 70.49%. This study aims to determine the effectiveness of waste transportation system and determine the fastest route from waste transfers point in Lowokwaru district to the landfill Supiturang. The data collection method in this research were 1) primary survey by interview officials from the Sanitation and Gardening Agency which questions related to the condition of the waste transportation system in waste transfer point, 2) Secondary survey related to data of waste transportation system in Malang City i.e the amount of waste generation in waste transfer point, number of garbage trucks and other data related to the garbage transportation system. To determine the fastest route analyzed by network analyst using ArcGIS software. The results of network analyst show that not all routes are already using the fastest route to the landfill Supiturang.

Understanding Route Aggregation

DTIC Science & Technology

2010-03-09

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

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

PubMed

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

2018-05-18

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

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

PubMed Central

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

2018-01-01

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

Lambeaux autofermants pour le traitement des brulures electriques du scalp par haut voltage

PubMed Central

Hafidi, J.; El Mazouz, S.; El Mejatti, H.; Fejjal, N.; Gharib, N.E.; Abbassi, A.; Belmahi, A.M.

2011-01-01

Summary Les brûlures électriques par haut voltage sont responsables de gros dégâts tissulaires en immédiat et dans les jours suivant l’accident du fait de la chaleur importante dégagée par effet joule et de la thrombose microvasculaire évolutive. Les pertes de substances du scalp secondaires à ces brûlures nécessitent une couverture par lambeaux vu la destruction du périoste et du calvarium en regard. De juin 1997 à juin 2008, 15 patients ont été traités pour des pertes de substance du scalp secondaires à des brûlures électriques par haut voltage de diamètre allant de 8 à 11 cm et siégeant dans la région tonsurale. Ces patients ont été opérés dans la première semaine suivant l’accident. Les pertes de substance du scalp de taille moyenne secondaires à ces brûlures peuvent être couvertes per primam de façon fiable par des lambeaux locaux axialisés et multiples. Nous relatons l’expérience du Service de Chirurgie Plastique du Centre Hospitalier Universitaire Ibn-Sina, Rabat, Maroc, dans la gestion et la prise en charge de ces brûlures. PMID:22262963

Survie au cancer du sein à Rabat (Maroc) 2005-2008

PubMed Central

Mechita, Nada Bennani; Tazi, Mohammed Adnane; Er-Raki, Abdelouahed; Mrabet, Mustapha; Saadi, Asma; Benjaafar, Noureddine; Razine, Rachid

2016-01-01

Introduction Le cancer du sein représente un problème de santé publique au Maroc. L’objectif de ce travail était d’estimer le taux de survie au cancer du sein chez les patientes habitant la ville de Rabat. Méthodes Etude pronostique réalisée chez les patientes diagnostiquées pour cancer du sein de 2005 à 2008, habitant la ville de Rabat et enregistrées au registre des cancers de Rabat. La date d’inclusion dans l’étude correspondait à la date de confirmation histologique du cancer. L’estimation de la survie a été réalisée par la méthode de Kaplan Meier, et la comparaison entre les différentes classes d’une variable a été réalisée par le test de log rank. L’étude des facteurs associés à la survie a été effectuée par le modèle de Cox. Résultats Durant la période d’étude 628 cas de cancer du sein ont été collectés. Le pourcentage de décès était de 19,9%. La survie globale à un an était de 97,1%, elle était de 89,2% à 3 ans et de 80,6 % à 5 ans. En analyse multivariée la survie au cancer du sein était statistiquement moins bonne chez les patientes âgées de plus de 70 ans (p<0,001), ayantune grande taille de tumeur (p<0,001), un stade avancé d’adénopathies (p=0,007), présentant des métastases (p<0,001) et non traitées par hormonothérapie (p=0,002). Conclusion Une grande taille de la tumeur et la présence de métastases sont des facteurs de mauvais pronostic du cancer du sein d’où la nécessité de renforcer les programmes de dépistage. PMID:28292106

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

EPA Science Inventory

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

DU Processing Efficiency and Reclamation: Plasma Arc Melting

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

Imhoff, Seth D.; Aikin, Jr., Robert M.; Swenson, Hunter

The work described here corresponds to one piece of a larger effort to increase material usage efficiency during DU processing operations. In order to achieve this goal, multiple technologies and approaches are being tested. These technologies occupy a spectrum of technology readiness levels (TRLs). Plasma arc melting (PAM) is one of the technologies being investigated. PAM utilizes a high temperature plasma to melt materials. Depending on process conditions, there are potential opportunities for recycling and material reclamation. When last routinely operational, the LANL research PAM showed extremely promising results for recycling and reclamation of DU and DU alloys. The currentmore » TRL is lower due to machine idleness for nearly two decades, which has proved difficult to restart. This report describes the existing results, promising techniques, and the process of bringing this technology back to readiness at LANL.« less

Accouchements sur utérus cicatriciel en République Démocratique du Congo: épreuve utérine et facteurs déterminants de l’issue

PubMed Central

Momat, Félix Kitenge wa; Zalagile, Pierre Akilimali; Mukalenge, Faustin Chenge; Luboya, Oscar Numbi; Kalala, Cléophas Tshibangu; Mashinda, Désiré; Grangé, Gilles; Mukuku, Olivier; Kaj, Fanny Malonga; Lubamba, Chamy Cham; Bwama, Joseph Bagambe; Mukoko, Célestin Kayembe; Kakoma, Jean Baptiste; Kalungwe, Justin Kizonde

2017-01-01

Introduction L'objectif était d'identifier les principaux facteurs de risque associés à un échec d'épreuve utérine et définir un score prédictif d'accouchement sur utérus cicatriciel en République Démocratique du Congo. Méthodes Étude multicentrique, transversale et analytique des patientes porteuses d'un utérus cicatriciel sur la période du 1er janvier au 31 décembre 2013 dans quatre maternités de la République Démocratique du Congo (RDC). Un modèle de régression logistique a été construit pour identifier les facteurs associés à l'échec de l'épreuve utérine. De ce modèle, un score prédictif a été construit pour prédire l'échec de l'épreuve utérine dans les maternités de la RDC. La courbe ROC a été utilisée pour évaluer la capacité du score construit à identifier les patientes à risque de connaitre un échec de l'épreuve utérine. Le cut off point du score prédictif a été déterminé en fonction de la sensibilité et spécificité optimale via l'index de Youden. Tous les tests ont été réalisés au seuil de signification α=0,05. Résultats Deux types de facteurs explicatifs de l'échec de l'épreuve utérine ont été retenus. Il s'agit d'un facteur sociodémographique (âge maternel) et de trois facteurs obstétricaux (hauteur utérine, présentation du fœtus et rupture prématurée des membranes). Le score de prédiction a été défini pour prédire l'échec de l'épreuve utérine. La construction de ce score s'est basée sur quatre éléments : l'âge maternel, l'état de la poche des eaux à l'admission, la hauteur utérine et la présentation fœtale. Le score minimal est de 4 et le score maximal est de 16. Le seuil est de 7. Un Score total supérieur ou égal à 7 traduit un risque d'échec de l'épreuve utérine. Conclusion L'utilisation de ce score prédictif chez les patientes pourra améliorer la qualité dans les indications de la voie haute, l'augmentation des taux de césariennes prophylactiques

Route monitoring program FY 1994

DOT National Transportation Integrated Search

1994-12-01

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

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

PubMed Central

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

2017-01-01

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

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

PubMed

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

2017-04-26

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

Distributed multiple path routing in complex networks

NASA Astrophysics Data System (ADS)

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

2016-12-01

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

A Survey on Underwater Acoustic Sensor Network Routing Protocols.

PubMed

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

2016-03-22

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

A Survey on Underwater Acoustic Sensor Network Routing Protocols

PubMed Central

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

2016-01-01

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

Cancer du sein bilatéral synchrone au Maroc: caractéristiques épidémiologiques et cliniques

PubMed Central

Boufettal, Houssine; Samouh, Naïma

2015-01-01

Préciser la fréquence, les facteurs de risque et le pronostic du cancer du sein bilatéral, à partir d'une étude rétrospective de 22 cas de cancer du sein bilatéral synchrone dans un pays du Maghreb. De 2002 à 2010, 625 patientes étaient prises en charge pour cancer du sein au service de Gynécologie-Obstétrique «C» du centre hospitalier universitaire de Casablanca. 22 cas de cancer bilatéral synchrone étaient diagnostiqués. Nos résultats sont comparés avec ceux de la littérature. La fréquence de la bilatéralité du cancer du sein synchrone était de 3,52% (22/625). L'intervalle de temps moyen entre les deux cancers est de 4 mois (0 à 6 mois). Les patientes âgées de moins de 40 ans lors du premier cancer avaient six fois plus de risque de développer un cancer au niveau du sein controlatéral que les femmes âgées de plus de 40 ans. Les patientes atteintes d'une tumeur T3 ou T4 avaient un risque neuf fois plus élevé que les autres. 90,9% (2/22) des cas des premiers cancers sont des adénocarcinomes infiltrants. Les types histologiques du premier et du douzième cancer étaient identiques dans 86,4% (19/22) des cas. Quant au pronostic, il dépend à la fois du stade du premier et du deuxième cancer et le traitement de ce dernier doit obéir aux mêmes règles du traitement du premier cancer. L'incidence du cancer bilatéral synchrone du sein est de 3,52% dans notre série. Le cancer du sein unilatéral constitue un facteur de risque de développement d'un cancer du sein controlatéral. Une surveillance à vie est nécessaire au cours d'un cancer du sein pour détecter un cancer controlatéral. PMID:26090066

Les inconvénients de perdre du poids

PubMed Central

Bosomworth, N. John

2012-01-01

Résumé Objectif Explorer les raisons pour lesquelles la perte de poids à long terme échoue la plupart du temps et évaluer les conséquences de diverses trajectoires pondérales, y compris la stabilité, la perte et le gain. Source des données Les études qui évaluent les paramètres pondéraux dans la population sont en majorité observationnelles. Des données probantes de niveau I ont été publiées pour évaluer l’influence des interventions relatives au poids sur la mortalité et la qualité de vie. Message principal Seulement un petit pourcentage des personnes qui désirent perdre du poids réussissent à le faire de manière durable. La mortalité est la plus faible chez les personnes se situant dans la catégorie de poids élevé-normal et surpoids. La trajectoire pondérale la plus sécuritaire est la stabilité du poids avec une optimisation de la condition physique et métabolique. Il est démontré que la mortalité est plus faible chez les personnes ayant des comorbidités reliées à l’obésité si elles perdent du poids. Il est aussi établi que la qualité de vie sur le plan de la santé est meilleure chez les personnes obèses qui perdent du poids. Par contre, la perte de poids chez une personne obèse autrement en santé est associée à une mortalité accrue. Conclusion La perte de poids est recommandable seulement chez les personnes qui ont des comorbidités reliées à l’obésité. Les personnes obèses en santé qui veulent perdre du poids devraient être informées qu’il peut y avoir des risques à le faire. Une stratégie qui se traduit par un indice de masse corporelle stable avec une condition physique et métabolique optimisée, peu importe le poids, est l’option d’intervention la plus sécuritaire en ce qui concerne le poids.

Robust Dynamic Multi-objective Vehicle Routing Optimization Method.

PubMed

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

2017-03-21

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

Transradial Approach as a Default Route in Coronary Artery Interventions

PubMed Central

Kim, Jang-Young

2011-01-01

Advances in percutaneous coronary intervention (PCI) and peri-procedural potent antithrombotic treatments during the past decade have dramatically improved the outcomes of ischemic heart disease. The femoral artery is the vascular route used in PCI in most catheterization labs. However, when the femoral artery is used as the approaching vessel, local hemorrhagic complication is not rare in the era of potent antithrombotics. Recent studies have suggested that peri-procedural bleeding complications after PCI are associated with increased short- and long-term morbidity and mortality. On the other hand, there has been growing interest in transradial PCI due to rare complications at the puncture site, patient conveniences, early discharge and shortened hospitalization periods. Furthermore, the indications of transradial PCI are expanding to the complex lesion subsets due to the miniaturization of devices used, improvement of devices and techniques, and accumulated experience with the use of transradial PCI. In this review, we discuss the data of transradial PCI as a potential default route in coronary artery interventions, as well as other issues that may raise concerns with transradial PCI. PMID:21359061

Transradial approach as a default route in coronary artery interventions.

PubMed

Kim, Jang-Young; Yoon, Junghan

2011-01-01

Advances in percutaneous coronary intervention (PCI) and peri-procedural potent antithrombotic treatments during the past decade have dramatically improved the outcomes of ischemic heart disease. The femoral artery is the vascular route used in PCI in most catheterization labs. However, when the femoral artery is used as the approaching vessel, local hemorrhagic complication is not rare in the era of potent antithrombotics. Recent studies have suggested that peri-procedural bleeding complications after PCI are associated with increased short- and long-term morbidity and mortality. On the other hand, there has been growing interest in transradial PCI due to rare complications at the puncture site, patient conveniences, early discharge and shortened hospitalization periods. Furthermore, the indications of transradial PCI are expanding to the complex lesion subsets due to the miniaturization of devices used, improvement of devices and techniques, and accumulated experience with the use of transradial PCI. In this review, we discuss the data of transradial PCI as a potential default route in coronary artery interventions, as well as other issues that may raise concerns with transradial PCI.

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

NASA Astrophysics Data System (ADS)

Baldwin, Jarret Taylor

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

All-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks.

PubMed

Wang, Na; Zeng, Jiwen

2017-03-17

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes.

All-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks

PubMed Central

Wang, Na; Zeng, Jiwen

2017-01-01

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes. PMID:28304367

Dépistage précoce des retards du développement moteur

PubMed Central

Harris, Susan R.

2016-01-01

Résumé Objectif Décrire le test HINT (Harris Infant Neuromotor Test), un test d’évaluation du développement neuromoteur chez les nourrissons publié en 2010, qui s’appuie sur les normes canadiennes et peut être utilisé pour dépister les retards du développement moteur durant la première année de la vie. Qualité des données D’abondantes recherches ont été publiées sur la fiabilité intra-évaluateur, inter-évaluateur et test-retest ainsi que sur la validité convergente, prédictive, du contenu et des groupes connus du test HINT, de même que sur la sensibilité, la spécificité et les valeurs prédictives négatives et positives des inquiétudes des parents, telles qu’évaluées par le test HINT. La plupart des données probantes sont de niveau II. Message principal Il est important de diagnostiquer les retards du développement moteur durant la première année de vie, car ils sont souvent le signe de retards du développement généralisés ou de déficiences précises, telles que la paralysie cérébrale. Les inquiétudes des parents quant au développement moteur de leur enfant sont une valeur prédictive robuste de diagnostics subséquents de retard du développement moteur. Conclusion Seul le dépistage précoce des retards du développement moteur, initialement par l’entremise d’outils de dépistage comme le test HINT, permet de recommander le patient à une intervention précoce qui profiterait tant à l’enfant qu’à sa famille. PMID:27521405

Cascade defense via routing in complex networks

NASA Astrophysics Data System (ADS)

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

2015-05-01

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

Backtracking search algorithm in CVRP models for efficient solid waste collection and route optimization.

PubMed

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

2017-03-01

Waste collection is an important part of waste management that involves different issues, including environmental, economic, and social, among others. Waste collection optimization can reduce the waste collection budget and environmental emissions by reducing the collection route distance. This paper presents a modified Backtracking Search Algorithm (BSA) in capacitated vehicle routing problem (CVRP) models with the smart bin concept to find the best optimized waste collection route solutions. The objective function minimizes the sum of the waste collection route distances. The study introduces the concept of the threshold waste level (TWL) of waste bins to reduce the number of bins to be emptied by finding an optimal range, thus minimizing the distance. A scheduling model is also introduced to compare the feasibility of the proposed model with that of the conventional collection system in terms of travel distance, collected waste, fuel consumption, fuel cost, efficiency and CO 2 emission. The optimal TWL was found to be between 70% and 75% of the fill level of waste collection nodes and had the maximum tightness value for different problem cases. The obtained results for four days show a 36.80% distance reduction for 91.40% of the total waste collection, which eventually increases the average waste collection efficiency by 36.78% and reduces the fuel consumption, fuel cost and CO 2 emission by 50%, 47.77% and 44.68%, respectively. Thus, the proposed optimization model can be considered a viable tool for optimizing waste collection routes to reduce economic costs and environmental impacts. Copyright © 2017 Elsevier Ltd. All rights reserved.

Hazardous Waste Cleanup: DuPont Imaging Department in Parlin, New Jersey

EPA Pesticide Factsheets

DuPont has owned and operated a chemical manufacturing plant on Cheesequake Road in Parlin, New Jersey, since 1904. DuPont manufactured a variety of products at the plant including, photographic films, automotive paints, pigments, adhesives, thinners,

The Time Window Vehicle Routing Problem Considering Closed Route

NASA Astrophysics Data System (ADS)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

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

Efficient and Stable Routing Algorithm Based on User Mobility and Node Density in Urban Vehicular Network.

PubMed

Al-Mayouf, Yusor Rafid Bahar; Ismail, Mahamod; Abdullah, Nor Fadzilah; Wahab, Ainuddin Wahid Abdul; Mahdi, Omar Adil; Khan, Suleman; Choo, Kim-Kwang Raymond

2016-01-01

Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destination node via multi-hop routing techniques. An appropriate, efficient, and stable routing algorithm must be developed for various VANET applications to address the issues of dynamic topology and intermittent connectivity. Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). The proposed algorithm can adapt to significant changes that may occur in the urban vehicular environment. This algorithm works by selecting an optimal route on the basis of hop count and link duration for delivering data from source to destination, thereby satisfying various quality of service considerations. The validity of the proposed algorithm is investigated by its comparison with ARP-QD protocol, which works on the mechanism of optimal route finding in VANETs in urban environments. Simulation results reveal that the proposed ESRA-MD algorithm shows remarkable improvement in terms of delivery ratio, delivery delay, and communication overhead.

A Machine Learning Concept for DTN Routing

NASA Technical Reports Server (NTRS)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

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

Part 1: Tracing Russian VX to its synthetic routes by multivariate statistics of chemical attribution signatures.

PubMed

Holmgren, Karin Höjer; Valdez, Carlos A; Magnusson, Roger; Vu, Alexander K; Lindberg, Sandra; Williams, Audrey M; Alcaraz, Armando; Åstot, Crister; Hok, Saphon; Norlin, Rikard

2018-08-15

Chemical attribution signatures (CAS) associated with different synthetic routes used for the production of Russian VX (VR) were identified. The goal of the study was to retrospectively determine the production method employed for an unknown VR sample. Six different production methods were evaluated, carefully chosen to include established synthetic routes used in the past for large scale production of the agent, routes involving general phosphorus-sulfur chemistry pathways leading to the agent, and routes whose main characteristic is their innate simplicity in execution. Two laboratories worked in parallel and synthesized a total of 37 batches of VR via the six synthetic routes following predefined synthesis protocols. The chemical composition of impurities and byproducts in each route was analyzed by GC/MS-EI and 49 potential CAS were recognized as important markers in distinguishing these routes using Principal Component Analysis (PCA). The 49 potential CAS included expected species based on knowledge of reaction conditions and pathways but also several novel compounds that were fully identified and characterized by a combined analysis that included MS-CI, MS-EI and HR-MS. The CAS profiles of the calibration set were then analyzed using partial least squares discriminant analysis (PLS-DA) and a cross validated model was constructed. The model allowed the correct classification of an external test set without any misclassifications, demonstrating the utility of this methodology for attributing VR samples to a particular production method. This work is part one of a three-part series in this Forensic VSI issue of a Sweden-United States collaborative effort towards the understanding of the CAS of VR in diverse batches and matrices. This part focuses on the CAS in synthesized batches of crude VR and in the following two parts of the series the influence of food matrices on the CAS profiles are investigated. Copyright © 2018 Elsevier B.V. All rights reserved.

Routing to preserve energy in wireless networks

NASA Astrophysics Data System (ADS)

Block, Frederick J., IV

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

A survey on the taxonomy of cluster-based routing protocols for homogeneous wireless sensor networks.

PubMed

Naeimi, Soroush; Ghafghazi, Hamidreza; Chow, Chee-Onn; Ishii, Hiroshi

2012-01-01

The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided.

Solving Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) using BRKGA with local search

NASA Astrophysics Data System (ADS)

Prasetyo, H.; Alfatsani, M. A.; Fauza, G.

2018-05-01

The main issue in vehicle routing problem (VRP) is finding the shortest route of product distribution from the depot to outlets to minimize total cost of distribution. Capacitated Closed Vehicle Routing Problem with Time Windows (CCVRPTW) is one of the variants of VRP that accommodates vehicle capacity and distribution period. Since the main problem of CCVRPTW is considered a non-polynomial hard (NP-hard) problem, it requires an efficient and effective algorithm to solve the problem. This study was aimed to develop Biased Random Key Genetic Algorithm (BRKGA) that is combined with local search to solve the problem of CCVRPTW. The algorithm design was then coded by MATLAB. Using numerical test, optimum algorithm parameters were set and compared with the heuristic method and Standard BRKGA to solve a case study on soft drink distribution. Results showed that BRKGA combined with local search resulted in lower total distribution cost compared with the heuristic method. Moreover, the developed algorithm was found to be successful in increasing the performance of Standard BRKGA.

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

NASA Astrophysics Data System (ADS)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

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

Hazardous Waste Cleanup: E.I. DuPont de Nemours & Company in Pompton Lakes, New Jersey

EPA Pesticide Factsheets

E.I. DuPont De Nemours & Company is located at 2000 Cannonball Road, Pompton Lakes, New Jersey. The DuPont Pompton Lakes Works site (DuPont) occupies approximately 570 acres of land in Pompton Lakes and Wanaque.

A graph-theoretic method to quantify the airline route authority

NASA Technical Reports Server (NTRS)

Chan, Y.

1979-01-01

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

Drone-borne GPR design: Propagation issues

NASA Astrophysics Data System (ADS)

Chandra, Madhu; Tanzi, Tullio Joseph

2018-01-01

In this paper, we shall address the electromagnetic wave propagation issues that are critical to determining the feasibility of a drone-borne ground-penetrating radar sensor for humanitarian applications, particularly in the context of disaster management. Frequency- and polarization-dependent scattering, attenuation and dispersion of radar signals penetrating into the sub-surface region will determine the applicability of a drone-mounted radar sensor capable of registering radar echoes for observing and monitoring sub-surface features. The functionality of the radar will thus be assessed depending on key radar parameters that include the central radar frequency, the modulation depth, and the mode of radar operation (pulsed FM, FM-CW), the antenna type, the available power-budget. In the analysis to be presented, the radar equation, together with the aforementioned propagation effects, will be used to simulate the signal strength of radar echoes under different conditions arising from the chosen key-radar parameters and the assumed physical properties of the sub-surface earth medium. The analysis to be presented will indicate whether or not the drone-borne ground-penetrating radar is a feasible system and if it could be constructed with the technologies available today. Taking into account the strict constraints involved to design drone applications for Public Protection and Disaster Relief (PPDR), the ideas developed hereafter are both prospective and exploratory. The objective is to see if a solution can be found in the near future. xml:lang="fr" Dans l'analyse présentée, l'équation radar, ainsi que les effets de propagation susmentionnés, serviront à simuler la puissance du signal des échos radar sous différentes conditions découlant des paramètres clés choisis et les propriétés physiques du milieu sous la surface. L'étude a pour objectif de démontrer si le système est réalisable et s'il peut être construit avec les technologies disponibles

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

NASA Technical Reports Server (NTRS)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

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

Routing Based on Length of Time of Available Connection

NASA Technical Reports Server (NTRS)

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

2016-01-01

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

Localisation inhabituelle de la tuberculose: ostéoarthrite tuberculose du pouce

PubMed Central

Mortaji, Aziz; Koulali, Khalid; Galuia, Farid

2014-01-01

L'ostéoarthrite tuberculose est rare au niveau des doigts. Nous rapportons une observation d'atteinte du pouce chez un patient de 55 ans. Il avait présenté une tuméfaction douloureuse du pouce droit suite à un traumatisme du pouce. L’étude bactériologique et une biopsie avaient permis de confirmer le diagnostic. Un traitement antibacillaire de 12 mois avait donné des résultats satisfaisants. Les particularités de la prise en charge sont discutées par rapport aux données de la littérature. PMID:25932075

The Route Analysis Based On Flight Plan

NASA Astrophysics Data System (ADS)

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

2016-02-01

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

Using Ant Colony Optimization for Routing in VLSI Chips

NASA Astrophysics Data System (ADS)

Arora, Tamanna; Moses, Melanie

2009-04-01

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

Etude thermo-hydraulique de l'ecoulement du moderateur dans le reacteur CANDU-6

NASA Astrophysics Data System (ADS)

Mehdi Zadeh, Foad

Etant donne la taille (6,0 m x 7,6 m) ainsi que le domaine multiplement connexe qui caracterisent la cuve des reacteurs CANDU-6 (380 canaux dans la cuve), la physique qui gouverne le comportement du fluide moderateur est encore mal connue de nos jours. L'echantillonnage de donnees dans un reacteur en fonction necessite d'apporter des changements a la configuration de la cuve du reacteur afin d'y inserer des sondes. De plus, la presence d'une zone intense de radiations empeche l'utilisation des capteurs courants d'echantillonnage. En consequence, l'ecoulement du moderateur doit necessairement etre etudie a l'aide d'un modele experimental ou d'un modele numerique. Pour ce qui est du modele experimental, la fabrication et la mise en fonction de telles installations coutent tres cher. De plus, les parametres de la mise a l'echelle du systeme pour fabriquer un modele experimental a l'echelle reduite sont en contradiction. En consequence, la modelisation numerique reste une alternative importante. Actuellement, l'industrie nucleaire utilise une approche numerique, dite de milieu poreux, qui approxime le domaine par un milieu continu ou le reseau des tubes est remplace par des resistances hydrauliques distribuees. Ce modele est capable de decrire les phenomenes macroscopiques de l'ecoulement, mais ne tient pas compte des effets locaux ayant un impact sur l'ecoulement global, tel que les distributions de temperatures et de vitesses a proximite des tubes ainsi que des instabilites hydrodynamiques. Dans le contexte de la surete nucleaire, on s'interesse aux effets locaux autour des tubes de calandre. En effet, des simulations faites par cette approche predisent que l'ecoulement peut prendre plusieurs configurations hydrodynamiques dont, pour certaines, l'ecoulement montre un comportement asymetrique au sein de la cuve. Ceci peut provoquer une ebullition du moderateur sur la paroi des canaux. Dans de telles conditions, le coefficient de reactivite peut varier de maniere

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

NASA Technical Reports Server (NTRS)

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

2013-01-01

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

Route planning in a four-dimensional environment

NASA Technical Reports Server (NTRS)

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

1987-01-01

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

Efficient and Stable Routing Algorithm Based on User Mobility and Node Density in Urban Vehicular Network

PubMed Central

Al-Mayouf, Yusor Rafid Bahar; Ismail, Mahamod; Abdullah, Nor Fadzilah; Wahab, Ainuddin Wahid Abdul; Mahdi, Omar Adil; Khan, Suleman; Choo, Kim-Kwang Raymond

2016-01-01

Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destination node via multi-hop routing techniques. An appropriate, efficient, and stable routing algorithm must be developed for various VANET applications to address the issues of dynamic topology and intermittent connectivity. Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). The proposed algorithm can adapt to significant changes that may occur in the urban vehicular environment. This algorithm works by selecting an optimal route on the basis of hop count and link duration for delivering data from source to destination, thereby satisfying various quality of service considerations. The validity of the proposed algorithm is investigated by its comparison with ARP-QD protocol, which works on the mechanism of optimal route finding in VANETs in urban environments. Simulation results reveal that the proposed ESRA-MD algorithm shows remarkable improvement in terms of delivery ratio, delivery delay, and communication overhead. PMID:27855165

Towards seasonal Arctic shipping route predictions

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Le schwannome malin du nerf grand sciatique chez l'enfant

PubMed Central

Lechqar, Maryem; Elbiache, Imad; Atarraf, Karima; Bouabdellah, Youssef; Afifi, My Abderahman

2012-01-01

Le schwannome malin est une tumeur très rare chez l'enfant (1 à 2% des tumeurs des tissus mous), elle se développe au dépend des cellules de schwanne. Dans ce travail, les auteurs rapportent un cas de schwannome malin développé au dépend du nerf grand sciatique. La radiographie de la cuisse de face et de profil était normale. L'imagerie par résonance magnétique a identifié une lésion le long du trajet du nerf grand sciatique. La tumeur a été réséquée en totalité emportant le nerf grand sciatique. L'examen anatomo-pathologique a confirmé le diagnostic. PMID:23133710

Providing reliable route guidance : phase II.

DOT National Transportation Integrated Search

2010-12-20

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

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

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

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

Context Analysis of Customer Requests using a Hybrid Adaptive Neuro Fuzzy Inference System and Hidden Markov Models in the Natural Language Call Routing Problem

NASA Astrophysics Data System (ADS)

Rustamov, Samir; Mustafayev, Elshan; Clements, Mark A.

2018-04-01

The context analysis of customer requests in a natural language call routing problem is investigated in the paper. One of the most significant problems in natural language call routing is a comprehension of client request. With the aim of finding a solution to this issue, the Hybrid HMM and ANFIS models become a subject to an examination. Combining different types of models (ANFIS and HMM) can prevent misunderstanding by the system for identification of user intention in dialogue system. Based on these models, the hybrid system may be employed in various language and call routing domains due to nonusage of lexical or syntactic analysis in classification process.

Les accidents du travail dans le transport urbain en commun de la ville province de Kinshasa, République Démocratique du Congo: une étude transversale descriptive

PubMed Central

Wangata, Jemima; Elenge, Myriam; De Brouwer, Christophe

2014-01-01

Introduction Le transport en commun urbain constitue un secteur où les travailleurs sont très exposés aux accidents du travail. Cette étude visait une description épidémiologique des accidents du travail dans le secteur informel du transport en commun à Kinshasa en vue d'apporter les pistes d'amélioration de la sécurité des travailleurs dans cette activité. Méthodes Un questionnaire sur les accidents du travail, administré en Décembre 2012 a permis d'explorer les tendances significatives entre les accidents et leurs circonstances, leurs facteurs associés, leurs conséquences au sein d'une population des travailleurs (n = 472) du transport en commun à Kinshasa. Résultats Durant les 12 derniers précédant l’étude 76.5% des travailleurs ont connu au moins un accident du travail, 54,8% ont connu un arrêt d'au moins 1jour. Les accidents liés à la circulation routière étaient plus important suivis des chutes. Les facteurs ayant montré des différences significatives étaient le travail sous l'influence de l'alcool et le port des équipements de protection individuelle. Les plaies (46,3%) et les contusions (39,4%) étaient les lésions les plus courantes. Les membres supérieurs (51,3%) et inférieurs (30,7%) étaient les plus atteints. 76,6% des travailleurs ont assumé seuls leur prise en charge médicale. Conclusion L'incidence des accidents du travail dans ce secteur est très élevée. La mise en place d'une politique de prévention et gestion de différents facteurs associés ainsi qu'un système de déclaration d'accidents est nécessaire dans ce secteur. Les patrons ainsi que les politiques devraient veiller à une prise en charge médicale correcte pour des travailleurs accidentés. PMID:25667703

Route Network Construction with Location-Direction-Enabled Photographs

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

En route air traffic flow simulation.

DOT National Transportation Integrated Search

1971-01-01

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

Development of safe routes for children in urban environment

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

Une forme exceptionnelle de la luxation perilunaire du carpe

PubMed Central

Elouakili, Issam; Ouchrif, Younes; Najib, Abdeljaouad; Ouakrim, Redouane; Lamrani, Omar; Kharmaz, Mohammed; Ismael, Farid; Lahlou, Abdo; Elouadghiri, Mohammed; El Bardouni, Ahmed; Mahfoud, Mustapha; Berrada, Mohammed Saleh; El Yaccoubi, Mouradh

2014-01-01

Les luxations périlunaires (LPL) du carpe sont des lésions extrêmement rares, qui peuvent passer inaperçue en raison d'un tableau clinique souvent trompeur, des radiographies en profil non strict ou d'interprétation difficile. Nous rapportons l'observation d'une luxation périlunaire stade III selon la classification de Witvoët et Allieu chez un patient de 32 ans, il s'agit d'une forme encore plus rare voire exceptionnelle et qui peut induire de sérieux problèmes en raison de la sévérité des dommages ligamentaires et du risque de nécrose du semilunaire plus important dans ce type de lésions. Le traitement est toujours chirurgical et doit être réalisé dans les plus brefs délais afin d’éviter les complications. PMID:25404968

Marihuana: A Conversation with NIDA's Robert L. DuPont.

PubMed

Maugh, T H

1976-05-14

Robert L. DuPont, director of the National Institute on Drug Abuse (NIDA), made headlines recently when he became one of the first Administration officials publicly to recommend a liberalization of marihuana laws. The occasion was a press conference accompanying the release of Marihuana and Health, NIDA's fifth annual report to the Congress on marihuana research. Recently, Science talked with DuPont and asked him to elaborate on those views. DuPont, a 40-year-old Harvard M.D., served as Director of the District of Columbia's Narcotics Treatment Administration from 1970 to 1973, where he conducted a comprehensive program for treatment of heroin addiction. In June 1973, Richard Nixon appointed him director of the White House Special Action Office for Drug Abuse Prevention. He held that position until the office was terminated on 30 June 1975. He has been director of NIDA since September 1973.

Niveaux d'étude du cerveau, et sagesse physique

NASA Astrophysics Data System (ADS)

Toulouse, Gérard

1993-02-01

The brain is a complex spatio-temporal affair. Several brain theories propose the definition of three superposed levels of study. But physics, though the experience of condensed matter physics, suggests that it is unwise to enforce onto brain theories a unified hierarchical scheme, the inspiration for which seems to come from the realm of sub-molecular physics. Le cerveau est une affaire spatio-temporelle complexe. Plusieurs théories du cerveau proposent de définir trois niveaux d'études superposés. Mais la physique, à travers l'expérience de la physique de la matière condensée, suggère qu'il n'est pas sage d'imposer sur les théories du cerveau un schéma hiérarchique unifié, dont l'inspiration semble provenir du domaine de la physique sub-moléculaire.

Annoyance caused by aircraft en route noise

NASA Technical Reports Server (NTRS)

Mccurdy, David A.

1992-01-01

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

Annoyance caused by aircraft en route noise

NASA Astrophysics Data System (ADS)

McCurdy, David A.

1992-03-01

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

Properties of Air Traffic Conflicts for Free and Structured Routing

NASA Technical Reports Server (NTRS)

Bilimoria, Karl D.; Lee, Hilda Q.

2001-01-01

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

A Secure Cluster-Based Multipath Routing Protocol for WMSNs

PubMed Central

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

2011-01-01

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

A secure cluster-based multipath routing protocol for WMSNs.

PubMed

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

2011-01-01

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

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

DOT National Transportation Integrated Search

1975-03-01

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

Municipal solid waste transportation optimisation with vehicle routing approach: case study of Pontianak City, West Kalimantan

NASA Astrophysics Data System (ADS)

Kamal, M. A.; Youlla, D.

2018-03-01

Municipal solid waste (MSW) transportation in Pontianak City becomes an issue that need to be tackled by the relevant agencies. The MSW transportation service in Pontianak City currently requires very high resources especially in vehicle usage. Increasing the number of fleets has not been able to increase service levels while garbage volume is growing every year along with population growth. In this research, vehicle routing optimization approach was used to find optimal and efficient routes of vehicle cost in transporting garbage from several Temporary Garbage Dump (TGD) to Final Garbage Dump (FGD). One of the problems of MSW transportation is that there is a TGD which exceed the the vehicle capacity and must be visited more than once. The optimal computation results suggest that the municipal authorities only use 3 vehicles from 5 vehicles provided with the total minimum cost of IDR. 778,870. The computation time to search optimal route and minimal cost is very time consuming. This problem is influenced by the number of constraints and decision variables that have are integer value.

Quantum chemistry-assisted synthesis route development

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

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-12-31

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

Detailed analysis of routing protocols with different network limitations

NASA Astrophysics Data System (ADS)

Masood, Mohsin; Abuhelala, Mohamed; Glesk, Ivan

2016-12-01

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

The Geomorphological Effects of Old Routes

NASA Astrophysics Data System (ADS)

Martinek, Jan; Bíl, Michal

2017-04-01

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

Security Verification of Secure MANET Routing Protocols

DTIC Science & Technology

2012-03-22

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

49 CFR 236.767 - Locking, route.

Code of Federal Regulations, 2010 CFR

2010-10-01

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

Sigma Routing Metric for RPL Protocol.

PubMed

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

2018-04-21

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

Sigma Routing Metric for RPL Protocol

PubMed Central

Rojas, Aldo; Fernandez, Luis

2018-01-01

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

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

DOEpatents

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

2010-03-16

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

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

DOEpatents

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

2010-11-16

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

41 CFR 109-40.302 - Standard routing principle.

Code of Federal Regulations, 2010 CFR

2010-07-01

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

Direct-To Tool for En Route Controllers

NASA Technical Reports Server (NTRS)

Erzberger, Heinz; McNally, David; Foster, Michelle

2002-01-01

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

Kyste épidermoïde du testicule : Étude de cas

PubMed Central

Diarra, Alkadri; Elammari, Jalal Eddine; Kassogue, Amadou; El Fassi, Mohammed Jamal; Farih, My Hassan

2013-01-01

Résumé Le kyste épidermoïde (KE) du testicule est une tumeur bénigne rare. Le diagnostic peut être évoqué par l’échographie et l’IRM. En cas de lésion unique de petite taille, il est possible d’effectuer une chirurgie conservatrice. Ce traitement nécessite une confirmation anatomopathologique. Le présent article fait état de l’observation d’un patient de 34 ans ayant été admis en consultation d’urologie pour désir d’enfant. Le diagnostic de KE associé à une varicocèle gauche a été retenu. L’énucléation du kyste avec cure de varicocèle a été réalisée sans complications postopératoires. Une revue de la littérature nous a permis de mettre en évidence les différents aspects du KE du testicule et les méthodes thérapeutiques envisageables. PMID:24282476

Des proprietes de l'etat normal du modele de Hubbard bidimensionnel

NASA Astrophysics Data System (ADS)

Lemay, Francois

Depuis leur decouverte, les etudes experimentales ont demontre que les supra-conducteurs a haute temperature ont une phase normale tres etrange. Les proprietes de ces materiaux ne sont pas bien decrites par la theorie du liquide de Fermi. Le modele de Hubbard bidimensionnel, bien qu'il ne soit pas encore resolu, est toujours considere comme un candidat pour expliquer la physique de ces composes. Dans cet ouvrage, nous mettons en evidence plusieurs proprietes electroniques du modele qui sont incompatibles avec l'existence de quasi-particules. Nous montrons notamment que la susceptibilite des electrons libres sur reseau contient des singularites logarithmiques qui influencent de facon determinante les proprietes de la self-energie a basse frequence. Ces singularites sont responsables de la destruction des quasi-particules. En l'absence de fluctuations antiferromagnetiques, elles sont aussi responsables de l'existence d'un petit pseudogap dans le poids spectral au niveau de Fermi. Les proprietes du modele sont egalement etudiees pour une surface de Fermi similaire a celle des supraconducteurs a haute temperature. Un parallele est etabli entre certaines caracteristiques du modele et celles de ces materiaux.

46 CFR 169.209 - Routes permitted.

Code of Federal Regulations, 2011 CFR

2011-10-01

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

46 CFR 169.209 - Routes permitted.

Code of Federal Regulations, 2010 CFR

2010-10-01

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

Advances in optimal routing through computer networks

NASA Technical Reports Server (NTRS)

Paz, I. M.

1977-01-01

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

Two-generation reproductive toxicity study of implanted depleted uranium (DU) in CD rats.

PubMed

Arfsten, D P; Still, K R; Wilfong, E R; Johnson, E W; McInturf, S M; Eggers, J S; Schaeffer, D J; Bekkedal, M Y-V

2009-01-01

Depleted uranium (DU) munitions and armor plating have been used in several conflicts over the last 17 yr, including the Persian Gulf War and the Iraq War. Because of its effectiveness and availability, DU will continue to be used in military applications into the foreseeable future. There is much controversy over the use of DU in weapons and equipment because of its potential radiological and toxic hazards, and there is concern over the chronic adverse health effects of embedded DU shrapnel in war veterans and bystanders. This study evaluated the effects of long-term implantation of DU on the reproductive success of F0 generation adults and development and survival of subsequent F1 and F2 generations in a two-generation reproductive toxicity study. F0 generation Sprague-Dawley rats, 8 wk of age, were surgically implanted with 0, 4, 8, 12, or 20 DU pellets (1 x 2 mm). Inert implant control animals were implanted with 12 or 20 tantallum (Ta) pellets. The F0 generation was then mated at 120 d post DU implantation. In the F0 generation, when measured on postimplantation d 27 and 117, uranium was present in the urine of DU-implanted animals in a dose-dependent manner. F0 reproductive success was similar across treatment groups and the maternal retrieval test revealed no changes in maternal behavior. DU implantation exerted no effect on the survival, health, or well-being of the F0 generation. Necropsy results of F0 animals were negative with the exception of a marked inflammatory response surrounding the implanted DU pellets. For the F1 generation, measures of F1 development through postnatal day (PND) 20 were unremarkable and no gross abnormalities were observed in F1 offspring. No uranium was detected in whole-body homogenates of PND 4 or PND 20 pups. Necropsy findings of F1 PND 20 pups were negative and no instances of ribcage malformation were observed in F1 PND 20 pups. Body weight and body weight gain of F1 rats through PND 120 were similar across treatment

A Survey on the Taxonomy of Cluster-Based Routing Protocols for Homogeneous Wireless Sensor Networks

PubMed Central

Naeimi, Soroush; Ghafghazi, Hamidreza; Chow, Chee-Onn; Ishii, Hiroshi

2012-01-01

The past few years have witnessed increased interest among researchers in cluster-based protocols for homogeneous networks because of their better scalability and higher energy efficiency than other routing protocols. Given the limited capabilities of sensor nodes in terms of energy resources, processing and communication range, the cluster-based protocols should be compatible with these constraints in either the setup state or steady data transmission state. With focus on these constraints, we classify routing protocols according to their objectives and methods towards addressing the shortcomings of clustering process on each stage of cluster head selection, cluster formation, data aggregation and data communication. We summarize the techniques and methods used in these categories, while the weakness and strength of each protocol is pointed out in details. Furthermore, taxonomy of the protocols in each phase is given to provide a deeper understanding of current clustering approaches. Ultimately based on the existing research, a summary of the issues and solutions of the attributes and characteristics of clustering approaches and some open research areas in cluster-based routing protocols that can be further pursued are provided. PMID:22969350

Advanced Algorithms for Local Routing Strategy on Complex Networks.

PubMed

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

2016-01-01

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

Pheromone routing protocol on a scale-free network.

PubMed

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

2009-12-01

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

Pheromone routing protocol on a scale-free network

NASA Astrophysics Data System (ADS)

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

2009-12-01

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

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

DOT National Transportation Integrated Search

2012-04-01

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

Speaking Truth to Power: Du Bois as Educator and Community Activist

ERIC Educational Resources Information Center

Grant, Carl A.; Grant, Paul D.

2017-01-01

This article uses W. E. B. Du Bois's work as an education and community activist to discuss race, oppression, and speaking-back to power in this time of racialized policies enacted by the Trump administration. This article centers a comparative discussion of the racialization of democracy by presidents Wilson and Trump to show the ways Du Bois was…

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2012 CFR

2012-10-01

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

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2011 CFR

2011-10-01

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

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2013 CFR

2013-10-01

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

49 CFR 397.69 - Highway routing designations; preemption.

Code of Federal Regulations, 2014 CFR

2014-10-01

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

Evaluation du niveau de connaissance des patients sur la gestion du traitement par les antis vitamines K dans le service de cardiologie de Ouagadougou

PubMed Central

Samadoulougou, André; Temoua Naibe, Dangwé; Mandi, Germain; Yameogo, Relwendé Aristide; Kabore, Elisé; Millogo, Georges; Yameogo, Nobila Valentin; Kologo, Jonas Koudougou; Thiam/Tall, Anna; Toguyeni, Boubacar Jean Yves; Zabsonre, Patrice

2014-01-01

Introduction Les antivitamines K (AVK), traitement anticoagulant oral le plus largement prescrit, posent un réel problème de santé publique du fait de leur risque iatrogène. L'objectif de cette étude était de préciser le niveau de connaissance des patients sur la gestion de leur traitement par les AVK. Méthodes Il s'est agi d'une enquête transversale descriptive réalisée au CHU-Yalgado Ouédraogo, sur une période de 03 mois : du 1er mars au 31 mai 2012. Un questionnaire a été administré aux patients bénéficiant d'un traitement AVK depuis au moins un mois. Résultats Soixante-dix patients ont été inclus dans l'étude dont 30 hommes. L'âge moyen était de 49 ans ± 16 ans. Les cardiopathies et la maladie thromboembolique veineuse justifiant l'institution du traitement AVK étaient retrouvées respectivement dans 58,6% et 41,4% des cas. Le nom de l'AVK et la raison exacte du traitement étaient connus respectivement dans 91,4% et 67,1% des cas. Plus de la moitié des patients (68,6%) savaient que les AVK rendaient le sang plus fluide. Quarante-six patients (65,7%) citaient l'INR comme examen biologique de surveillance du traitement et seulement 28 patients (40%) connaissaient les valeurs cibles. La majorité des patients ne connaissait pas les risques encourus en cas de surdosage (72,8%) et de sous-dosage (71,4%). Une automédication par anti-inflammatoire non stéroïdien était signalée par 18 patients (25,7%). Les choux (74,3%) et la laitue (62,9%), aliments à consommer avec modération, étaient les plus cités. Conclusion Les connaissances des patients sur la gestion des AVK étaient fragmentaires et insuffisantes pour assurer la sécurité et l'efficacité du traitement. La création d'un programme d'éducation thérapeutique sur les AVK s'avère alors nécessaire. PMID:25870741

Intelligent deflection routing in buffer-less networks.

PubMed

Haeri, Soroush; Trajković, Ljiljana

2015-02-01

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

Route Flap Damping Made Usable

NASA Astrophysics Data System (ADS)

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

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

Using Sphinx to Improve Onion Routing Circuit Construction

NASA Astrophysics Data System (ADS)

Kate, Aniket; Goldberg, Ian

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

Iconic memory-based omnidirectional route panorama navigation.

PubMed

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

2005-01-01

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

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2011 CFR

2011-01-01

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

14 CFR 25.123 - En route flight paths.

Code of Federal Regulations, 2014 CFR

2014-01-01

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

Watershed Data Management (WDM) database for West Branch DuPage River streamflow simulation, DuPage County, Illinois, January 1, 2007, through September 30, 2013

USGS Publications Warehouse

Bera, Maitreyee

2017-10-16

The U.S. Geological Survey (USGS), in cooperation with the DuPage County Stormwater Management Department, maintains a database of hourly meteorological and hydrologic data for use in a near real-time streamflow simulation system. This system is used in the management and operation of reservoirs and other flood-control structures in the West Branch DuPage River watershed in DuPage County, Illinois. The majority of the precipitation data are collected from a tipping-bucket rain-gage network located in and near DuPage County. The other meteorological data (air temperature, dewpoint temperature, wind speed, and solar radiation) are collected at Argonne National Laboratory in Argonne, Ill. Potential evapotranspiration is computed from the meteorological data using the computer program LXPET (Lamoreux Potential Evapotranspiration). The hydrologic data (water-surface elevation [stage] and discharge) are collected at U.S.Geological Survey streamflow-gaging stations in and around DuPage County. These data are stored in a Watershed Data Management (WDM) database.This report describes a version of the WDM database that is quality-assured and quality-controlled annually to ensure datasets are complete and accurate. This database is named WBDR13.WDM. It contains data from January 1, 2007, through September 30, 2013. Each precipitation dataset may have time periods of inaccurate data. This report describes the methods used to estimate the data for the periods of missing, erroneous, or snowfall-affected data and thereby improve the accuracy of these data. The other meteorological datasets are described in detail in Over and others (2010), and the hydrologic datasets in the database are fully described in the online USGS annual water data reports for Illinois (U.S. Geological Survey, 2016) and, therefore, are described in less detail than the precipitation datasets in this report.

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

PubMed

Di Fiore, Anthony; Suarez, Scott A

2007-07-01

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

Selfish Routing

DTIC Science & Technology

2002-05-01

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

Rapport sur l'état du patrimoine astronomique dans les observatoires français de la fin du XIXè siècle

NASA Astrophysics Data System (ADS)

Damm, E.; Pécontal, E.

2012-12-01

Suite au colloque sur la sauvegarde du patrimoine astronomique organisé par le MAEE et la SAF, sous l'égide de l'UNESCO, qui a conduit à l'adoption de la Déclaration de Paris, les directeurs d'observatoires institutionnels qui étaient absents du colloque ont ressenti le besoin de discuter de ces conclusions prises en leur nom. L'initiative d'organiser une réunion des directeurs des Observatoires des Sciences de l'Univers (OSU) à ce sujet le 30 janvier 2012 a été prise par François Vernotte, directeur de l'Observatoire de Besançon. Le présent compte-rendu de visite résulte d'une initiative spontanée d'Emmanuel Pécontal, astronome responsable du Patrimoine à l'observatoire de Lyon, et d'Evelyne Damm, membre de la Commission Nationale de classement des Monuments Historiques (CNMH) et élue à la communauté d'agglomération des Portes de l'Essonne oû est sis l'observatoire de Camille Flammarion.

Advanced Algorithms for Local Routing Strategy on Complex Networks

PubMed Central

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

2016-01-01

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

Locke and Du Bois: Two Major Black Voices Muzzled by Philanthropic Organizations.

ERIC Educational Resources Information Center

Fitchue, M. Anthony

1997-01-01

In 1935, the Howard University philosopher Alain Locke asked W. E. B. Du Bois to contribute to an adult education project for African Americans. Censorship by white-controlled foundations forced Locke to reject the Du Bois essay to protect contributions for causes of great importance to blacks. (Author/SLD)

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

PubMed Central

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

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

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

PubMed

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

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

Coalition Battle Management Language (C-BML) (Language de gestion du champ de bataille (C-BML)

DTIC Science & Technology

2012-02-01

de gestion du champ de bataille (C-BML)) NMSG-048 Final Report. This document...BML) (Langage de gestion du champ de bataille (C-BML)) NMSG-048 Final Report. This document contains information authorized by NATO RTA for...Technical Readiness Level (TRL) that is consistent with an operational deployment. ES - 2 RTO-TR-MSG-048 Langage de gestion du champ de

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

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

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

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

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

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

Hématome spontané du méso de l'angle colique droit et du colon transverse compliquant un traitement par anti vitamine K: à propos d'un cas et revue de la littérature

PubMed Central

Traoré, Ibrahim Alain; Zaré, Cyprien; Barro, Sié Drissa; Guibla, Ismaël

2016-01-01

L'hématome spontané du méso de l'angle colique droit et du transverse est une complication rare du traitement anticoagulant par antivitamine K. Nous rapportons un cas d'hématome spontané du méso de l'angle colique droit et du transverse associé à un hémopéritoine de grande abondance chez un patient traité par antivitamine K pour embolie pulmonaire consécutive à une fracture des plateaux tibiaux droits. Le diagnostic doit être fait en urgence. L’échographie abdominale et la tomodensitométrie confirment le diagnostic. Le traitement non opératoire est la règle. Le traitement chirurgical est indiqué en cas de complications telles que la rupture de l'hématome. PMID:27217878

Characterization of FaDu-R, a radioresistant head and neck cancer cell line, and cancer stem cells.

PubMed

Cho, Kwang-Jae; Park, Eun-Ji; Kim, Min-Sik; Joo, Young-Hoon

2018-06-01

The aim of this study was to evaluate the impact of CSC on insensitivity to radiotherapy in HNSCC. A radioresistant cell line, FaDu-R, was established using fractionated ionizing radiation. Cells with high and low CD44/ALDH activity were isolated. FaDu-R cells demonstrated significantly increased cell viability after radiation exposure compared with parental cells. CD44 high /ALDH high FaDu-R cells demonstrated significantly faster wound closure (p<0.05) and more efficient invasion (p<0.05) compared to the CD44 high /ALDH high FaDu cells or the CD44 low /ALDH low FaDu-R cells. There was a significant difference in tumor volume between the CD44 high /ALDH high FaDu-R cells and the CD44 high /ALDH high FaDu cells (p<0.05) as well as the CD44 low /ALDH low FaDu-R cells (p<0.05). Cancer stem cells (CSC) were associated with invasion and tumorigenesis in a radioresistant head and neck squamous cell carcinoma (HNSCC) cell line. This concept might help to improve the understanding of these mechanisms and to develop drugs that can overcome radioresistance during radiotherapy. Copyright © 2017 Elsevier B.V. All rights reserved.

Genetics Home Reference: cri-du-chat syndrome

MedlinePlus

... Pinkel D. High-resolution mapping of genotype-phenotype relationships in cri du chat syndrome using array comparative ... for Links Data Files & API Site Map Subscribe Customer Support USA.gov Copyright Privacy Accessibility FOIA Viewers & ...

Special issue on network coding

NASA Astrophysics Data System (ADS)

Monteiro, Francisco A.; Burr, Alister; Chatzigeorgiou, Ioannis; Hollanti, Camilla; Krikidis, Ioannis; Seferoglu, Hulya; Skachek, Vitaly

2017-12-01

Future networks are expected to depart from traditional routing schemes in order to embrace network coding (NC)-based schemes. These have created a lot of interest both in academia and industry in recent years. Under the NC paradigm, symbols are transported through the network by combining several information streams originating from the same or different sources. This special issue contains thirteen papers, some dealing with design aspects of NC and related concepts (e.g., fountain codes) and some showcasing the application of NC to new services and technologies, such as data multi-view streaming of video or underwater sensor networks. One can find papers that show how NC turns data transmission more robust to packet losses, faster to decode, and more resilient to network changes, such as dynamic topologies and different user options, and how NC can improve the overall throughput. This issue also includes papers showing that NC principles can be used at different layers of the networks (including the physical layer) and how the same fundamental principles can lead to new distributed storage systems. Some of the papers in this issue have a theoretical nature, including code design, while others describe hardware testbeds and prototypes.

En route care patient safety: thoughts from the field.

PubMed

McNeill, Margaret M; Pierce, Penny; Dukes, Susan; Bridges, Elizabeth J

2014-08-01

The purpose of this study was to describe the patient safety culture of en route care in the United States Air Force aeromedical evacuation system. Almost 100,000 patients have been transported since 2001. Safety concerns in this unique environment are complex because of the extraordinary demands of multitasking, time urgency, long duty hours, complex handoffs, and multiple stressors of flight. An internet-based survey explored the perceptions and experiences of safety issues among nursing personnel involved throughout the continuum of aeromedical evacuation care. A convenience sample of 236 nurses and medical technicians from settings representing the continuum was studied. Descriptive and nonparametric statistics were used to analyze the quantitative data, and thematic analysis was applied to the qualitative data. Results indicate that over 90% of respondents agree or strongly agree safety is a priority in their unit and that their unit is responsive to patient safety initiatives. Many respondents described safety incidents or near misses, and these have been categorized as personnel physical capability limitations, environmental threats, medication and equipment issues, and care process problems. Results suggest the care of patients during transport is influenced by the safety culture, human factors, training, experience, and communication. Suggestions to address safety issues emerged from the survey data. Reprint & Copyright © 2014 Association of Military Surgeons of the U.S.

Modelisation frequentielle de la permittivite du beton pour le controle non destructif par georadar

NASA Astrophysics Data System (ADS)

Bourdi, Taoufik

Le georadar (Ground Penetrating Radar (GPR)) constitue une technique de controle non destructif (CND) interessante pour la mesure des epaisseurs des dalles de beton et la caracterisation des fractures, en raison de ses caracteristiques de resolution et de profondeur de penetration. Les equipements georadar sont de plus en plus faciles a utiliser et les logiciels d'interpretation sont en train de devenir plus aisement accessibles. Cependant, il est ressorti dans plusieurs conferences et ateliers sur l'application du georadar en genie civil qu'il fallait poursuivre les recherches, en particulier sur la modelisation et les techniques de mesure des proprietes electriques du beton. En obtenant de meilleures informations sur les proprietes electriques du beton aux frequences du georadar, l'instrumentation et les techniques d'interpretation pourraient etre perfectionnees plus efficacement. Le modele de Jonscher est un modele qui a montre son efficacite dans le domaine geophysique. Pour la premiere fois, son utilisation dans le domaine genie civil est presentee. Dans un premier temps, nous avons valide l'application du modele de Jonscher pour la caracterisation de la permittivite dielectrique du beton. Les resultats ont montre clairement que ce modele est capable de reproduire fidelement la variation de la permittivite de differents types de beton sur la bande de frequence georadar (100 MHz-2 GHz). Dans un deuxieme temps, nous avons montre l'interet du modele de Jonscher en le comparant a d'autres modeles (Debye et Debye-etendu) deja utilises dans le domaine genie civil. Nous avons montre aussi comment le modele de Jonscher peut presenter une aide a la prediction de l'efficacite de blindage et a l'interpretation des ondes de la technique GPR. Il a ete determine que le modele de Jonscher permet de donner une bonne presentation de la variation de la permittivite du beton dans la gamme de frequence georadar consideree. De plus, cette modelisation est valable pour differents

Prediction du profil de durete de l'acier AISI 4340 traite thermiquement au laser

NASA Astrophysics Data System (ADS)

Maamri, Ilyes

Les traitements thermiques de surfaces sont des procedes qui visent a conferer au coeur et a la surface des pieces mecaniques des proprietes differentes. Ils permettent d'ameliorer la resistance a l'usure et a la fatigue en durcissant les zones critiques superficielles par des apports thermiques courts et localises. Parmi les procedes qui se distinguent par leur capacite en terme de puissance surfacique, le traitement thermique de surface au laser offre des cycles thermiques rapides, localises et precis tout en limitant les risques de deformations indesirables. Les proprietes mecaniques de la zone durcie obtenue par ce procede dependent des proprietes physicochimiques du materiau a traiter et de plusieurs parametres du procede. Pour etre en mesure d'exploiter adequatement les ressources qu'offre ce procede, il est necessaire de developper des strategies permettant de controler et regler les parametres de maniere a produire avec precision les caracteristiques desirees pour la surface durcie sans recourir au classique long et couteux processus essai-erreur. L'objectif du projet consiste donc a developper des modeles pour predire le profil de durete dans le cas de traitement thermique de pieces en acier AISI 4340. Pour comprendre le comportement du procede et evaluer les effets des differents parametres sur la qualite du traitement, une etude de sensibilite a ete menee en se basant sur une planification experimentale structuree combinee a des techniques d'analyse statistiques eprouvees. Les resultats de cette etude ont permis l'identification des variables les plus pertinentes a exploiter pour la modelisation. Suite a cette analyse et dans le but d'elaborer un premier modele, deux techniques de modelisation ont ete considerees, soient la regression multiple et les reseaux de neurones. Les deux techniques ont conduit a des modeles de qualite acceptable avec une precision d'environ 90%. Pour ameliorer les performances des modeles a base de reseaux de neurones, deux

How Effective is Routing for Wireless Networking

DTIC Science & Technology

2016-03-05

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

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

NASA Technical Reports Server (NTRS)

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

1989-01-01

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

Research on dynamic routing mechanisms in wireless sensor networks.

PubMed

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

2014-01-01

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

Subject Matter Expert Evaluation of Multi-Flight Common Route Advisories

NASA Technical Reports Server (NTRS)

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

2017-01-01

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

Predicting the Operational Acceptability of Route Advisories

NASA Technical Reports Server (NTRS)

Evans, Antony; Lee, Paul

2017-01-01

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

3D Building Evacuation Route Modelling and Visualization

NASA Astrophysics Data System (ADS)

Chan, W.; Armenakis, C.

2014-11-01

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

Benefits Analysis of Multi-Center Dynamic Weather Routes

NASA Technical Reports Server (NTRS)

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

2014-01-01

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

L'Abondance du Deutérium, de l'Ultraviolet au Visible

NASA Astrophysics Data System (ADS)

Hébrard, Guillaume

2000-12-01

Dans le cadre du modèle standard du Big Bang, le deutérium est l'élément dont l'abondance primordiale est la plus sensible à la densité baryonique de l'Univers. Cet élément est uniquement créé lors de la nucléosynthèse primordiale, quelques minutes après le Big Bang ; aucune théorie standard n'en prédit actuellement d'autres sources significatives. Au contraire, étant brûlé dans les étoiles, son abondance D/H décroît au cours de l'évolution cosmique. Les mesures de D/H apportent ainsi des contraintes sur les modèles de Big Bang et d'évolution chimique des galaxies. On peut distinguer trois types de mesures de D/H: les abondances primordiale, proto-solaire et interstellaire, respectivement représentatives de l'Univers il y a environ 15 milliards d'années, 4.5 milliards d'années et à l'époque actuelle. Si l'évolution du deutérium semble qualitativement claire, les résultats concernant ces trois types d'abondance ne convergent pas pour l'instant vers trois valeurs bien définies. Les travaux entrepris durant cette thèse sont reliés à la mesure de l'abondance interstellaire du deutérium. Celle-ci s'obtient habituellement par l'observation spectroscopique en absorption des séries de Lyman de l'hydrogène et du deutérium. Ces observations se font dans le domaine ultraviolet, au moyen d'observatoires spatiaux. Les résultats présentés ici ont été obtenus avec le Télescope spatial Hubble puis le satellite FUSE, récemment mis en orbite. D'autre part, une nouvelle méthode d'observation du deutérium a été proposée, dans le domaine visible à partir de télescopes au sol. Ce travail a mené aux premières détections et à l'identification de la série de Balmer du deutérium, observée en émission dans des régions HII avec le Télescope Canada-France-Hawaii et le Very Large Telescope. On-line Thesis, Guillaume Hébrard

Improved Efficient Routing Strategy on Scale-Free Networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liang, Man-Gui

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

Osm-Oriented Method of Multimodal Route Planning

NASA Astrophysics Data System (ADS)

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

2015-07-01

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

An Overlay Architecture for Throughput Optimal Multipath Routing

DTIC Science & Technology

2017-01-14

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

Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem.

PubMed

Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

2015-01-01

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA.

A flexible routing scheme for patients with topographical disorientation.

PubMed

Torres-Solis, Jorge; Chau, Tom

2007-11-28

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

Technologies for user-preferred routing

NASA Astrophysics Data System (ADS)

McNally, B. D.; Sridhar, Banavar

1996-05-01

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

The cultural route of present and lost landscapes in the centre of Bucharest - digital model

NASA Astrophysics Data System (ADS)

Bostenaru-Dan, Maria

2015-04-01

We are developing a digital model of the Magheru boulevard in central Bucharest. This N-S axis in the centre of the city is a unique encounter with interwar architecture. It is a protected area in the city, with buildings listed individually or as group of monuments, and also with protection at urban planning level. But at the same time the landscape does not facilitate the building of urban routes between monuments. A GIS model of the area exists, but does not yet take into account this heritage value of the buildings, being developed in a civil engineering environment. It is also one of the few partial 3D models of Bucharest. It allows datascapes of various buidling characteristics. At the same time a 3D model which equally covers all items in an area is ressources expensive. Hence, we propose, similarly to strategic planning to do a Kevin Lynch type selection. Landmarks will be identified as nodes of the routes, and the remaining area treated as zone. Ways connect the nodes and we paid special attention as we will see to their landscape. We developed a concept on how to further build from the idea of layers in GIS to include the issue of scale. As such, floor plans can build strategic points for the nodes of the route such as in Nolli or Sitte plans. Cooperation between GIS and GoogleEarth is envisaged, since GoogleEarth allows for detailing in SketchUp for the interior space. This way we developed an alternative digital model to the levels of detail of CityGML, the classical for 3D city models. The route itself is to be analysed with the method of Space Syntax. While this part of the research focused on the built heritage, on culture, we included also issues of landscape. First, the landscape of the boulevard has to be shaped as to build the route between these nodes of the route. Our concept includes the creation of pocket parks and of links between the pocket parks through vegetal and mineral elements to connect them. Existing urban spaces and empty plots are

75 FR 29471 - The New York North Shore Helicopter Route

Federal Register 2010, 2011, 2012, 2013, 2014

2010-05-26

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

Computer-based route-definition system for peripheral bronchoscopy.

PubMed

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

2012-04-01

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

An Overview of Data Routing Approaches for Wireless Sensor Networks

PubMed Central

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

2012-01-01

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

A Measurement Study of BGP Blackhole Routing Performance

DTIC Science & Technology

2006-09-01

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

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

PubMed

Santos, Andrés; Manzano, Gema

2010-04-14

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

An energy efficient distance-aware routing algorithm with multiple mobile sinks for wireless sensor networks.

PubMed

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-08-18

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.

An Energy Efficient Distance-Aware Routing Algorithm with Multiple Mobile Sinks for Wireless Sensor Networks

PubMed Central

Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk

2014-01-01

Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption. PMID:25196015

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

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

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

Analysis of Multi-Flight Common Routes for Traffic Flow Management

NASA Technical Reports Server (NTRS)

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

2016-01-01

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

Service discovery with routing protocols for MANETs

NASA Astrophysics Data System (ADS)

Gu, Xuemai; Shi, Shuo

2005-11-01

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

W.E.B. Du Bois and Caste Education: Racial Capitalist Schooling from Reconstruction to Jim Crow

ERIC Educational Resources Information Center

Pierce, Clayton

2017-01-01

This essay provides the first account and examination of caste education in the work of W.E.B. Du Bois. In so doing, I argue that caste education plays a central role in realizing the political and social goals of racial capitalist society for Du Bois. Using Du Bois's caste analytic, I take up and articulate three biopolitical governing strategies…

Underground pedestrian routes as an option for arranging the transfer from one type of public transport to another

NASA Astrophysics Data System (ADS)

Glozman, O.

2017-10-01

The article highlights the issues of pedestrian movements within cities and focuses on the architectural and planning organization of transfer between two types of public transport. The amount of time citizens lose on the pedestrian sections of their way from home to work were analyzed. The article describes factors that influence the speed and the comfort of pedestrian movements as well as provides rationalization for connecting two types of transport in the underground space. The article also touches upon the issue of the negative cost impact caused by excessive time losses, including the ones that appear on the pedestrian sections of the route. Architectural methods that may ease a pedestrian’s psychological adaptation to the underground space are listed in the article. The results of experimental designing that prove the reduction of the travel time by forming underground pedestrian ways in cities were described. The article features the model of a multi-functional underground space under Serpukhovskaya Zastava square in Moscow. It is noted that pedestrian routes in the cities which do not allow easy movement on the above-the-surface space provide comfortable movement for the citizens.

Network-wide BGP route prediction for traffic engineering

NASA Astrophysics Data System (ADS)

Feamster, Nick; Rexford, Jennifer

2002-07-01

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

School Bus Crash Rates on Routine and Nonroutine Routes

ERIC Educational Resources Information Center

O'Neal, Elizabeth; Ramirez, Marizen; Hamann, Cara; Young, Tracy; Stahlhut, Mary; Peek-Asa, Corinne

2014-01-01

Background: Although prior research has established that school buses are a safe form of transportation, crashes can produce catastrophic consequences. School buses have 2 types of routes: predictable, routine routes that take children to and from school and less predictable, nonroutine routes for school events. No studies have examined school bus…

Operational Evaluatioin of Dynamic Weather Routes at American Airlines

NASA Technical Reports Server (NTRS)

McNally, David; Sheth, Kapil; Gong, Chester; Borchers, Paul; Osborne, Jeff; Keany, Desmond; Scott, Brennan; Smith, Steve; Sahlman, Scott; Lee, Chuhan;

OAM-labeled free-space optical flow routing.

PubMed

Gao, Shecheng; Lei, Ting; Li, Yangjin; Yuan, Yangsheng; Xie, Zhenwei; Li, Zhaohui; Yuan, Xiaocong

2016-09-19

Space-division multiplexing allows unprecedented scaling of bandwidth density for optical communication. Routing spatial channels among transmission ports is critical for future scalable optical network, however, there is still no characteristic parameter to label the overlapped optical carriers. Here we propose a free-space optical flow routing (OFR) scheme by using optical orbital angular moment (OAM) states to label optical flows and simultaneously steer each flow according to their OAM states. With an OAM multiplexer and a reconfigurable OAM demultiplexer, massive individual optical flows can be routed to the demanded optical ports. In the routing process, the OAM beams act as data carriers at the same time their topological charges act as each carrier's labels. Using this scheme, we experimentally demonstrate switching, multicasting and filtering network functions by simultaneously steer 10 input optical flows on demand to 10 output ports. The demonstration of data-carrying OFR with nonreturn-to-zero signals shows that this process enables synchronous processing of massive spatial channels and flexible optical network.

Single-photon routing with whispering-gallery resonators

NASA Astrophysics Data System (ADS)

Huang, Jin-Song; Zhang, Jia-Hao; Wei, L. F.

2018-04-01

Quantum routing of single photons in a system with two waveguides coupled to two whispering-gallery resonators (WGRs) are investigated theoretically. Using a real-space full quantum theory, photonic scattering amplitudes along four ports of the waveguide network are analytically obtained. It is shown that, by adjusting the geometric and physical parameters of the two-WGR configuration, the quantum routing properties of single photons along the present waveguide network can be controlled effectively. The routing capability from input waveguide to another one can significantly exceed 0.5 near the resonance point of scattering spectra, which can be achieved with only one resonator. By properly designing the distance between two WGRs and the waveguide-WGR coupling strengths, the transfer rate between the waveguides can also reach certain sufficiently high values even in the non-resonance regime. Moreover, Fano-like resonances in the scattering spectra are designable. The proposed system may provide a potential application in controlling single-photon quantum routing.

Coordinated Platoon Routing in a Metropolitan Network

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

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing themore » platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.« less

A Survey on Clustering Routing Protocols in Wireless Sensor Networks

PubMed Central

Liu, Xuxun

2012-01-01

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions. PMID:23112649

A survey on clustering routing protocols in wireless sensor networks.

PubMed

Liu, Xuxun

2012-01-01

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in a wide range of applications and it has become a hot research area. Based on network structure, routing protocols in WSNs can be divided into two categories: flat routing and hierarchical or clustering routing. Owing to a variety of advantages, clustering is becoming an active branch of routing technology in WSNs. In this paper, we present a comprehensive and fine grained survey on clustering routing protocols proposed in the literature for WSNs. We outline the advantages and objectives of clustering for WSNs, and develop a novel taxonomy of WSN clustering routing methods based on complete and detailed clustering attributes. In particular, we systematically analyze a few prominent WSN clustering routing protocols and compare these different approaches according to our taxonomy and several significant metrics. Finally, we summarize and conclude the paper with some future directions.

Expression, purification, and characterization of almond (Prunus dulcis) allergen Pru du 4.

PubMed

Zhang, Yuzhu; Du, Wen-Xian; Fregevu, Cécile; Kothary, Mahendra H; Harden, Leslie; McHugh, Tara H

2014-12-31

Biochemical characterizations of food allergens are required for understanding the allergenicity of food allergens. Such studies require a relatively large amount of highly purified allergens. The level of Pru du 4 in almond is low, and its expression in a soluble form in Escherichia coli required an expression tag. An MBP tag was used to enhance its expression and solubility. Sumo was used for the first time as a peptidase recognition site. The expression tag was removed with a sumo protease, and the resulting wild-type Pru du 4 was purified chromatographically. The stability of the allergen was investigated with chemical denaturation. The Gibbs free energy of Pru du 4 folding-unfolding transition was determined to be 5.4 ± 0.7 kcal/mol.

Cognitive load during route selection increases reliance on spatial heuristics.

PubMed

Brunyé, Tad T; Martis, Shaina B; Taylor, Holly A

2018-05-01

Planning routes from maps involves perceiving the symbolic environment, identifying alternate routes and applying explicit strategies and implicit heuristics to select an option. Two implicit heuristics have received considerable attention, the southern route preference and initial segment strategy. This study tested a prediction from decision-making theory that increasing cognitive load during route planning will increase reliance on these heuristics. In two experiments, participants planned routes while under conditions of minimal (0-back) or high (2-back) working memory load. In Experiment 1, we examined how memory load impacts the southern route heuristic. In Experiment 2, we examined how memory load impacts the initial segment heuristic. Results replicated earlier results demonstrating a southern route preference (Experiment 1) and initial segment strategy (Experiment 2) and further demonstrated that evidence for heuristic reliance is more likely under conditions of concurrent working memory load. Furthermore, the extent to which participants maintained efficient route selection latencies in the 2-back condition predicted the magnitude of this effect. Together, results demonstrate that working memory load increases the application of heuristics during spatial decision making, particularly when participants attempt to maintain quick decisions while managing concurrent task demands.

On-Board Switching and Routing Advanced Technology Study

NASA Technical Reports Server (NTRS)

Yegenoglu, F.; Inukai, T.; Kaplan, T.; Redman, W.; Mitchell, C.

1998-01-01

Future satellite communications is expected to be fully integrated into National and Global Information Infrastructures (NII/GII). These infrastructures will carry multi gigabit-per-second data rates, with integral switching and routing of constituent data elements. The satellite portion of these infrastructures must, therefore, be more than pipes through the sky. The satellite portion will also be required to perform very high speed routing and switching of these data elements to enable efficient broad area coverage to many home and corporate users. The technology to achieve the on-board switching and routing must be selected and developed specifically for satellite application within the next few years. This report presents evaluation of potential technologies for on-board switching and routing applications.

Nouvelles approches en theorie du champ moyen dynamique: le cas du pouvoir thermoelectrique et celui de l'effet orbital d'un champ magnetique

NASA Astrophysics Data System (ADS)

Arsenault, Louis-Francois

Les applications reliees a la generation d'energie motivent la recherche de materiaux ayant un fort pouvoir thermoelectrique (S). De plus, S nous renseigne sur certaines proprietes fondamentales des materiaux, comme, par exemple, la transition entre l'etat coherent et incoherent des quasi-particules lorsque la temperature augmente. Empiriquement, la presence de fortes interactions electron-electron peut mener a un pouvoir thermoelectrique geant. Nous avons donc etudie le modele le plus simple qui tient compte de ces fortes interactions, le modele de Hubbard. La theorie du champ moyen dynamique (DMFT) est tout indiquee dans ce cas. Nous nous sommes concentres sur un systeme tridimensionnel (3d) cubique a face centree (fcc), et ce, pour plusieurs raisons. A) Ce type de cristal est tres commun dans la nature. B) La DMFT donne de tres bons resultats en 3d et donc ce choix sert aussi de preuve de principe de la methode. C) Finalement, a cause de la frustration electronique intrinseque au fcc, celui-ci ne presente pas de symetrie particule-trou, ce qui est tres favorable a l'apparition d'une grande valeur de S. Ce travail demontre que lorsque le materiau est un isolant a demi-remplissage a cause des fortes interactions (isolant de Mott), il est possible d'obtenir de grands pouvoirs thermoelectriques en le dopant legerement. C'est un resultat pratique important. Du point de vue methodologique, nous avons montre comment la limite de frequence infinie de S et l'approche dite de Kelvin, qui considere la limite de frequence nulle avant la limite thermodynamique pour S, donnent des estimations fiables de la vraie limite continue (DC) dans les domaines de temperature appropriee. Ces deux approches facilitent grandement les calculs en court-circuit ant la necessite de recourir a de problematiques prolongements analytiques. Nous avons trouve que la methode de calcul a frequence infinie fonctionne bien lorsque les echelles d'energie sont relativement faibles. En d'autres termes

MODFLOW-LGR-Modifications to the streamflow-routing package (SFR2) to route streamflow through locally refined grids

USGS Publications Warehouse

Mehl, Steffen W.; Hill, Mary C.

2011-01-01

This report documents modifications to the Streamflow-Routing Package (SFR2) to route streamflow through grids constructed using the multiple-refined-areas capability of shared node Local Grid Refinement (LGR) of MODFLOW-2005. MODFLOW-2005 is the U.S. Geological Survey modular, three-dimensional, finite-difference groundwater-flow model. LGR provides the capability to simulate groundwater flow by using one or more block-shaped, higher resolution local grids (child model) within a coarser grid (parent model). LGR accomplishes this by iteratively coupling separate MODFLOW-2005 models such that heads and fluxes are balanced across the shared interfacing boundaries. Compatibility with SFR2 allows for streamflow routing across grids. LGR can be used in two- and three-dimensional, steady-state and transient simulations and for simulations of confined and unconfined groundwater systems.

Mesure de haute resolution de la fonction de distribution radiale du silicium amorphe pur

NASA Astrophysics Data System (ADS)

Laaziri, Khalid

1999-11-01

Cette these porte sur l'etude de la structure du silicium amorphe prepare par irradiation ionique. Elle presente des mesures de diffraction de rayons X sur de la poudre de silicium cristallin, du silicium amorphe relaxe et non relaxe, ainsi que tous les developpements mathematiques et physiques necessaires pour extraire la fonction de distribution radiale correspondant a chaque echantillon. Au Chapitre I, nous presentons une methode de fabrication de membranes minces de silicium amorphe pur. Il y a deux etapes majeures lors du processus de fabrication: l'implantation ionique, afin de creer une couche amorphe de plusieurs microns et l'attaque chimique, pour enlever le reste du materiau cristallin. Nous avons caracterise premierement les membranes de silicium amorphe par spectroscopie Raman pour verifier qu'il ne reste plus de trace de materiau cristallin dans les films amorphes. Une deuxieme caracterisation par detection de recul elastique (ERD-TOF) sur ces memes membranes a montre qu'il y a moins de 0.1% atomique de contaminants tels que l'oxygene, le carbone, et l'hydrogene. Au Chapitre II, nous proposons une nouvelle methode de correction de la contribution inelastique "Compton" des spectres de diffusion totale afin d'extraire les pics de diffusion elastique, responsable de la diffraction de Bragg. L'article presente tout d'abord une description simplifiee d'une theorie sur la diffusion inelastique dite "Impulse Approximation" (IA) qui permet de calculer des profils de Compton en fonction de l'energie et de l'angle de diffusion 2theta. Ces profils sont utilises comme fonction de lissage de la diffusion Compton experimentale. Pour lisser les pics de diffusion elastique, nous avons utilise une fonction pic de nature asymetrique. Aux Chapitre III, nous exposons de maniere detaillee les resultats des experiences de diffraction de rayons X sur les membranes de silicium amorphe et la poudre de silicium cristallin que nous avons preparees. Nous abordons aussi les

Method and apparatus for routing data in an inter-nodal communications lattice of a massively parallel computer system by semi-randomly varying routing policies for different packets

DOEpatents

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

2010-11-23

A massively parallel computer system contains an inter-nodal communications network of node-to-node links. Nodes vary a choice of routing policy for routing data in the network in a semi-random manner, so that similarly situated packets are not always routed along the same path. Semi-random variation of the routing policy tends to avoid certain local hot spots of network activity, which might otherwise arise using more consistent routing determinations. Preferably, the originating node chooses a routing policy for a packet, and all intermediate nodes in the path route the packet according to that policy. Policies may be rotated on a round-robin basis, selected by generating a random number, or otherwise varied.

Selective epidemic vaccination under the performant routing algorithms

NASA Astrophysics Data System (ADS)

Bamaarouf, O.; Alweimine, A. Ould Baba; Rachadi, A.; EZ-Zahraouy, H.

2018-04-01

Despite the extensive research on traffic dynamics and epidemic spreading, the effect of the routing algorithms strategies on the traffic-driven epidemic spreading has not received an adequate attention. It is well known that more performant routing algorithm strategies are used to overcome the congestion problem. However, our main result shows unexpectedly that these algorithms favor the virus spreading more than the case where the shortest path based algorithm is used. In this work, we studied the virus spreading in a complex network using the efficient path and the global dynamic routing algorithms as compared to shortest path strategy. Some previous studies have tried to modify the routing rules to limit the virus spreading, but at the expense of reducing the traffic transport efficiency. This work proposed a solution to overcome this drawback by using a selective vaccination procedure instead of a random vaccination used often in the literature. We found that the selective vaccination succeeded in eradicating the virus better than a pure random intervention for the performant routing algorithm strategies.

Trade routes and plague transmission in pre-industrial Europe.

PubMed

Yue, Ricci P H; Lee, Harry F; Wu, Connor Y H

2017-10-11

Numerous historical works have mentioned that trade routes were to blame for the spread of plague in European history, yet this relationship has never been tested by quantitative evidence. Here, we resolve the hypothetical role of trade routes through statistical analysis on the geo-referenced major trade routes in the early modern period and the 6,656 geo-referenced plague outbreak records in AD1347-1760. Ordinary Least Square (OLS) estimation results show that major trade routes played a dominant role in spreading plague in pre-industrial Europe. Furthermore, the negative correlation between plague outbreaks and their distance from major trade ports indicates the absence of a permanent plague focus in the inland areas of Europe. Major trade routes decided the major plague outbreak hotspots, while navigable rivers determined the geographic pattern of sporadic plague cases. A case study in Germany indicates that plague penetrated further into Europe through the local trade route network. Based on our findings, we propose the mechanism of plague transmission in historical Europe, which is imperative in demonstrating how pandemics were spread in recent human history.

Constraint-Based Routing Models for the Transport of Radioactive Materials

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

Peterson, Steven K

2015-01-01

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

DuSable High School Program Flourishes.

ERIC Educational Resources Information Center

Graff, Pat

1995-01-01

Describes the fall and rise of the Panther Press, the scholastic newspaper of the DuSable High School in Chicago. States that despite being located in the midst of public housing projects, the school's newspaper is thriving where others in similar circumstances have failed. Describes how the school's principal and an advisor revitalized and…

Prejudice: From Allport to DuBois.

ERIC Educational Resources Information Center

Gaines, Stanley O., Jr.; Reed, Edward S.

1995-01-01

Examines the differences between Gordon Allport's and W. E. B. DuBois's theories on the origins of prejudice and the impact of discrimination on the personality and social development of blacks. The article argues that prejudice is a historically developed process, not a universal feature of human psychology. Implications for U.S. race relations…

Facteurs de risque cardiovasculaires au cours du lupus systémique

PubMed Central

Harzallah, Amel; Hajji, Mariem; Kaaroud, Hayet; Hamida, Fethi Ben; Abdallah, Taieb Ben

2015-01-01

Cette étude a pour objectif d’évaluer la fréquence des facteurs de risque cardiovasculaires au cours du lupus et de préciser leur prévalence. Etude rétrospective portant sur 250 patients ayant un lupus, diagnostiqué selon les critères de l'ACR, hospitalisés entre 1970 et 2013. Les données cliniques et para cliniques ont été recueillies à partir des observations médicales. Il s'agit de 228 femmes et 22 hommes d’âge moyen au diagnostic du lupus de 30, 32 ans (extrêmes: 16-69). La durée moyenne du suivi des patients était de 64 mois (extrêmes: 7 jours- 382mois). Quatre vingt dix patients (36%) étaient hypertendus, 74% avaient une hypercholestérolémie et 22% étaient diabétiques. Pour les autres facteurs de risque cardiovasculaire traditionnels, un âge > 50 ans a été retrouvé dans 40% des cas, le sexe masculin dans 8% des cas, l'obésité dans 76% des cas et le tabagisme dans 11% des cas. Les facteurs de risque surajoutés sont représentés par la présence des anticorps antiphospholipides (47% des cas), la néphropathie lupique (49% des cas), l'insuffisance rénale (42% des cas), la corticothérapie au long cours (74% des cas) et la chronicité de la maladie dans 35% des cas. Les complications cardiovasculaires retrouvées dans notre série étaient: les accidents vasculaires cérébraux (2%) et l'insuffisance coronarienne (5,6%). Devant l'importance du risque cardiovasculaire au cours du lupus, une surveillance rapprochée des facteurs de risque cardio-vasculaires semble primordiale chez les lupiques. PMID:27022427

A double candidate survivable routing protocol for HAP network

NASA Astrophysics Data System (ADS)

He, Panfeng; Li, Chunyue; Ni, Shuyan

2016-11-01

To improve HAP network invulnerability, and at the same time considering the quasi-dynamic topology in HAP network, a simple and reliable routing protocol is proposed in the paper. The protocol firstly uses a double-candidate strategy for the next-node select to provide better robustness. Then during the maintenance stage, short hello packets instead of long routing packets are used only to check link connectivity in the quasi-dynamic HAP network. The route maintenance scheme based on short hello packets can greatly reduce link spending. Simulation results based on OPNET demonstrate the effectiveness of the proposed routing protocol.

What is the optimal architecture for visual information routing?

PubMed

Wolfrum, Philipp; von der Malsburg, Christoph

2007-12-01

Analyzing the design of networks for visual information routing is an underconstrained problem due to insufficient anatomical and physiological data. We propose here optimality criteria for the design of routing networks. For a very general architecture, we derive the number of routing layers and the fanout that minimize the required neural circuitry. The optimal fanout l is independent of network size, while the number k of layers scales logarithmically (with a prefactor below 1), with the number n of visual resolution units to be routed independently. The results are found to agree with data of the primate visual system.

World heritage site - Bien du Patrimoine Mondial - Kluane/Wrangell-St. Elias/Glacier Bay/Tatshenshini-Alsek

USGS Publications Warehouse

Labay, Keith A.; Wilson, Frederic H.

2004-01-01

The four parks depicted on this map make up a single World Heritage Site that covers 24.3 million acres. Together, they comprise the largest internationally protected land-based ecosystem on the planet. The United Nations Educational, Scientific and Cultural Organization (UNESCO) established the World Heritage Program in 1972 for the identification and protection of the world?s irreplaceable natural and cultural resources. World Heritage Sites are important as storehouses of memory and evolution, as anchors for sustainable tourism and community, and as laboratories for the study and understanding of the earth and culture. This World Heritage Site protects the prominent mountain ranges of Kluane, Wrangell, Saint Elias, and Chugach. It includes many of the tallest peaks on the continent, the world's largest non-polar icefield, extensive glaciers, vital watersheds, and expanses of dramatic wilderness. [Les quatre parcs figurant sur cette carte ne constituent qu?un seul site du patrimoine mondial recouvrant plus de 99 millions de km2, ce qui en fait le plus grand ecosysteme terrestre protege par loi internationale. En 1972, L?UNESCO (l?organisation des Nations Unies pour les sciences, l'education et la culture) a etabli le programme du patrimoine mondial afin d?identifier et de proteger les ressources naturelles et culturelles irremplacables de notre plan?te. Si les sites du patrimoine mondial sont si importants c'est parce qu'ils representent a la fois des livres ouverts sur l?histoire de la Terre, le point de depart du tourisme durable et du developpement des collectivites, des laboratoires pour etudier et comprendre la nature et la culture. Ce site du patrimoine mondial assure la protection des chaines de montagnes de Kluane, Wrangell, Saint Elias, et Chugach. On y trouve plusieurs des plus hauts sommets du continent, le plus grand champ de glace non-polaire du monde, d?immenses glaciers, des bassins hydrologiques essentiels, et de la nature sauvage a perte de vue.

Supracervical hysterectomy - the vaginal route.

PubMed

Wilczyński, Miłosz; Cieślak, Jarosław; Malinowski, Andrzej

2014-06-01

Removal of the cervix during hysterectomy is not mandatory. There has been no irrefutable evidence so far that total hysterectomy is more beneficial to patients in terms of pelvic organ function. The procedure that leaves the cervix intact is called a subtotal hysterectomy. Traditional approaches to this surgery include laparoscopic and abdominal routes. Vaginal total hysterectomy has been proven to present many advantages over the other approaches. Therefore, it seems that this route should also be applied in the case of subtotal hysterectomy. We present 9 cases of patients who underwent subtotal hysterectomy performed through the vagina for benign gynecological diseases.

Improved efficient routing strategy on two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Han, Weizhan; Guo, Qing; Zhang, Shuai; Wang, Junfang; Wang, Zhihao

2016-10-01

The traffic dynamics of multi-layer networks has become a hot research topic since many networks are comprised of two or more layers of subnetworks. Due to its low traffic capacity, the traditional shortest path routing (SPR) protocol is susceptible to congestion on two-layer complex networks. In this paper, we propose an efficient routing strategy named improved global awareness routing (IGAR) strategy which is based on the betweenness centrality of nodes in the two layers. With the proposed strategy, the routing paths can bypass hub nodes of both layers to enhance the transport efficiency. Simulation results show that the IGAR strategy can bring much better traffic capacity than the SPR and the global awareness routing (GAR) strategies. Because of the significantly improved traffic performance, this study is helpful to alleviate congestion of the two-layer complex networks.

Aspects épidémiologiques des traumatismes du rachis: à propos de 139 cas

PubMed Central

Bemora, Joseph Synèse; Rakotondraibe, Willy Francis; Ramarokoto, Mijoro; Ratovondrainy, Willy; Andriamamonjy, Clément

2017-01-01

Les traumatismes du rachis représentent une des lésions les plus fréquemment observées, chez les victimes d’accidents de circulation, d’accident de sportifs, domestique et du travail. Il s’agissait d’une étude rétrospective de 3 ans portant sur 139 cas de traumatismes du rachis hospitalisés et pris en charge dans le service de neurochirurgie du CHUJRA Madagascar. A travers cette étude, 25,17% des traumatisés étaient entre 21 et 30 ans avec une nette prédominance masculine de 69,78% (sexe ratio 2,3). L’étiologie était dominéepar la chute dans 33,09% des cas avec des facteurs de risque dont prise d’alcool (8,63%). Le traumatisme entrait dans le cadre d’un polytraumatisme dont un traumatisme crânien dans 34,63%. Les patients étaient admis dans le service 1 à 5h après le traumatisme dans 31,65% en utilisant comme moyen de transport une voiture personnelle dans 36,69%. Pendant l’hospitalisation 20 patients ont signé une décharge et 6,34% des patients sont décédés. Les traumatismes du rachis posent un problème de santé publique avec une prise en charge lourde surtout pour les patients déficitaires à vie. Devant tout traumatisme du rachis, il faut rechercher systématiquement une lésion crânienne. PMID:28450995

Identifying and prioritizing ungulate migration routes for landscape-level conservation

USGS Publications Warehouse

Sawyer, H.; Kauffman, M.J.; Nielson, R.M.; Horne, J.S.

2009-01-01

As habitat loss and fragmentation increase across ungulate ranges, identifying and prioritizing migration routes for conservation has taken on new urgency. Here we present a general framework using the Brownian bridge movement model (BBMM) that: (1) provides a probabilistic estimate of the migration routes of a sampled population, (2) distinguishes between route segments that function as stopover sites vs. those used primarily as movement corridors, and (3) prioritizes routes for conservation based upon the proportion of the sampled population that uses them. We applied this approach to a migratory mule deer (Odocoileus hemionus) population in a pristine area of southwest Wyoming, USA, where 2000 gas wells and 1609 km of pipelines and roads have been proposed for development. Our analysis clearly delineated where migration routes occurred relative to proposed development and provided guidance for on-the-ground conservation efforts. Mule deer migration routes were characterized by a series of stopover sites where deer spent most of their time, connected by movement corridors through which deer moved quickly. Our findings suggest management strategies that differentiate between stopover sites and movement corridors may be warranted. Because some migration routes were used by more mule deer than others, proportional level of use may provide a reasonable metric by which routes can be prioritized for conservation. The methods we outline should be applicable to a wide range of species that inhabit regions where migration routes are threatened or poorly understood. ?? 2009 by the Ecological Society of America.

Identifying and prioritizing ungulate migration routes for landscape-level conservation

USGS Publications Warehouse

Sawyer, Hall; Kauffman, Matthew J.; Nielson, Ryan M.; Horne, Jon S.

2009-01-01

As habitat loss and fragmentation increase across ungulate ranges, identifying and prioritizing migration routes for conservation has taken on new urgency. Here we present a general framework using the Brownian bridge movement model (BBMM) that: (1) provides a probabilistic estimate of the migration routes of a sampled population, (2) distinguishes between route segments that function as stopover sites vs. those used primarily as movement corridors, and (3) prioritizes routes for conservation based upon the proportion of the sampled population that uses them. We applied this approach to a migratory mule deer (Odocoileus hemionus) population in a pristine area of southwest Wyoming, USA, where 2000 gas wells and 1609 km of pipelines and roads have been proposed for development. Our analysis clearly delineated where migration routes occurred relative to proposed development and provided guidance for on-the-ground conservation efforts. Mule deer migration routes were characterized by a series of stopover sites where deer spent most of their time, connected by movement corridors through which deer moved quickly. Our findings suggest management strategies that differentiate between stopover sites and movement corridors may be warranted. Because some migration routes were used by more mule deer than others, proportional level of use may provide a reasonable metric by which routes can be prioritized for conservation. The methods we outline should be applicable to a wide range of species that inhabit regions where migration routes are threatened or poorly understood.

An optimal routing strategy on scale-free networks

NASA Astrophysics Data System (ADS)

Yang, Yibo; Zhao, Honglin; Ma, Jinlong; Qi, Zhaohui; Zhao, Yongbin

Traffic is one of the most fundamental dynamical processes in networked systems. With the traditional shortest path routing (SPR) protocol, traffic congestion is likely to occur on the hub nodes on scale-free networks. In this paper, we propose an improved optimal routing (IOR) strategy which is based on the betweenness centrality and the degree centrality of nodes in the scale-free networks. With the proposed strategy, the routing paths can accurately bypass hub nodes in the network to enhance the transport efficiency. Simulation results show that the traffic capacity as well as some other indexes reflecting transportation efficiency are further improved with the IOR strategy. Owing to the significantly improved traffic performance, this study is helpful to design more efficient routing strategies in communication or transportation systems.

On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks.

PubMed

Monowar, Muhammad Mostafa; Bajaber, Fuad

2015-06-15

In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches.

On Designing Thermal-Aware Localized QoS Routing Protocol for in-vivo Sensor Nodes in Wireless Body Area Networks

PubMed Central

Monowar, Muhammad Mostafa; Bajaber, Fuad

2015-01-01

In this paper, we address the thermal rise and Quality-of-Service (QoS) provisioning issue for an intra-body Wireless Body Area Network (WBAN) having in-vivo sensor nodes. We propose a thermal-aware QoS routing protocol, called TLQoS, that facilitates the system in achieving desired QoS in terms of delay and reliability for diverse traffic types, as well as avoids the formation of highly heated nodes known as hotspot(s), and keeps the temperature rise along the network to an acceptable level. TLQoS exploits modular architecture wherein different modules perform integrated operations in providing multiple QoS service with lower temperature rise. To address the challenges of highly dynamic wireless environment inside the human body. TLQoS implements potential-based localized routing that requires only local neighborhood information. TLQoS avoids routing loop formation as well as reduces the number of hop traversal exploiting hybrid potential, and tuning a configurable parameter. We perform extensive simulations of TLQoS, and the results show that TLQoS has significant performance improvements over state-of-the-art approaches. PMID:26083228

Dynamic real-time routing for evacuation response planning and execution.

DOT National Transportation Integrated Search

2011-01-01

This study addresses the problem of dynamic routing operations in the emergency response context, primarily in terms : of the routing of response vehicles and evacuees. The study focuses on identifying the paths used for routing response : vehicles a...

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

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

Konjevod, Goran; Richa, Andréa W.; Xia, Donglin

In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names aremore » independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.« less

Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension

DOE PAGES

Konjevod, Goran; Richa, Andréa W.; Xia, Donglin

2016-06-15

In this work, we consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 α balls of half radius. There are two variants of routing-scheme design: (i) labeled (name-dependent) routing, in which the designer is allowed to rename the nodes so that the names (labels) can contain additional routing information, for example, topological information; and (ii) name-independent routing, which works on top of the arbitrary original node names in the network, that is, the node names aremore » independent of the routing scheme. In this article, given any constant ε ϵ (0, 1) and an n-node edge-weighted network of doubling dimension α ϵ O(loglog n), we present —a (1 + ε)-stretch labeled compact routing scheme with Γlog n-bit routing labels, O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node; —a (9 + ε)-stretch name-independent compact routing scheme with O(log 2 n/loglog n)-bit packet headers, and ((1/ε) O(α) log 3 n)-bit routing information at each node. In addition, we prove a lower bound: any name-independent routing scheme with o(n (ε/60)2) bits of storage at each node has stretch no less than 9 - ε for any ε ϵ (0, 8). Therefore, our name-independent routing scheme achieves asymptotically optimal stretch with polylogarithmic storage at each node and packet headers. Note that both schemes are scale-free in the sense that their space requirements do not depend on the normalized diameter Δ of the network. Finally, we also present a simpler nonscale-free (9 + ε)-stretch name-independent compact routing scheme with improved space requirements if Δ is polynomial in n.« less

Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

PubMed Central

Zhang, Hang; Maddula, Soumya V.; Maloney, Laurence T.

2010-01-01

We designed an economic task to investigate human planning of routes in landscapes where travel in different kinds of terrain incurs different costs. Participants moved their finger across a touch screen from a starting point to a destination. The screen was divided into distinct kinds of terrain and travel within each kind of terrain imposed a cost proportional to distance traveled. We varied costs and spatial configurations of terrains and participants received fixed bonuses minus the total cost of the routes they chose. We first compared performance to a model maximizing gain. All but one of 12 participants failed to adopt least-cost routes and their failure to do so reduced their winnings by about 30% (median value). We tested in detail whether participants’ choices of routes satisfied three necessary conditions (heuristics) for a route to maximize gain. We report failures of one heuristic for 7 out of 12 participants. Last of all, we modeled human performance with the assumption that participants assign subjective utilities to costs and maximize utility. For 7 out 12 participants, the fitted utility function was an accelerating power function of actual cost and for the remaining 5, a decelerating power function. We discuss connections between utility aggregation in route planning and decision under risk. Our task could be adapted to investigate human strategy and optimality of route planning in full-scale landscapes. PMID:21833269

Évaluation des caractéristiques mécaniques du polissoir en polyuréthanne utilisé comme porte abrasifs durant le processus du polissage du verre optique

NASA Astrophysics Data System (ADS)

Aliouane, T.; Bouzid, D.; Belkhir, N.; Bouzid, S.; Herold, V.

2005-05-01

La fabrication des composants en verre optique nécessite des moyens de grande précision dans les procédés de finition vue l'importance accordée à leur qualité.
Durant le processus de polissage des verres optiques, le polissoir est un élément clé et a un impact direct sur les performances des composants optiques, non seulement il est utilisé comme support de grains abrasifs mais il doit posséder la fonction de transmission de la pression aux grains. La connaissance de ses propriétés, essentiellement mécanique, est impérative afin d'obtenir un état de surface optimal des composants optiques destinés à remplir des fonctions très précises dans des appareils optiques très performants.
Dans cette étude, nous avons constaté que les propriétés des polissoirs en polyuréthanne tel que la dureté, le module d'élasticité et la densité varient au cours du polissage. Ce changement a des effets sur l'état de surface de verre optique, causé par le changement microstructural de la surface du polissoir (distribution et dimensions des pores) et par conséquent sur la quantité des abrasifs (en oxyde de cérium) insérée dans les pores, ce qui influe sur la quantité de verre enlevée et sur l'état de surface du composant.
Sur la base des résultats obtenus, il a été prouvé que le polissoir subit des modifications très importantes ce qui influe considérablement sur son efficacité de polissage.

Association between Fatigue and Autistic Symptoms in Children with Cri du Chat Syndrome

ERIC Educational Resources Information Center

Claro, Anthony; Cornish, Kim; Gruber, Reut

2011-01-01

In the current study, the authors examined whether the fatigue level of children diagnosed with cri du chat syndrome was associated with the expression of autistic symptoms. Sixty-nine children with cri du chat syndrome were compared with 47 children with moderate to severe intellectual disabilities who did not differ on intellectual severity.…

Innovative routing and scheduling concepts for transit systems.

DOT National Transportation Integrated Search

1984-01-01

The objective of this research was to investigate innovative routing and scheduling concepts to determine how transit systems in Virginia may improve ridership and reduce operating costs. Information on innovative routing and scheduling concepts was ...

Improved Fractal Space Filling Curves Hybrid Optimization Algorithm for Vehicle Routing Problem

PubMed Central

Yue, Yi-xiang; Zhang, Tong; Yue, Qun-xing

2015-01-01

Vehicle Routing Problem (VRP) is one of the key issues in optimization of modern logistics system. In this paper, a modified VRP model with hard time window is established and a Hybrid Optimization Algorithm (HOA) based on Fractal Space Filling Curves (SFC) method and Genetic Algorithm (GA) is introduced. By incorporating the proposed algorithm, SFC method can find an initial and feasible solution very fast; GA is used to improve the initial solution. Thereafter, experimental software was developed and a large number of experimental computations from Solomon's benchmark have been studied. The experimental results demonstrate the feasibility and effectiveness of the HOA. PMID:26167171

An Adaptive Jitter Mechanism for Reactive Route Discovery in Sensor Networks

PubMed Central

Cordero, Juan Antonio; Yi, Jiazi; Clausen, Thomas

2014-01-01

This paper analyses the impact of jitter when applied to route discovery in reactive (on-demand) routing protocols. In multi-hop non-synchronized wireless networks, jitter—a small, random variation in the timing of message emission—is commonly employed, as a means to avoid collisions of simultaneous transmissions by adjacent routers over the same channel. In a reactive routing protocol for sensor and ad hoc networks, jitter is recommended during the route discovery process, specifically, during the network-wide flooding of route request messages, in order to avoid collisions. Commonly, a simple uniform jitter is recommended. Alas, this is not without drawbacks: when applying uniform jitter to the route discovery process, an effect called delay inversion is observed. This paper, first, studies and quantifies this delay inversion effect. Second, this paper proposes an adaptive jitter mechanism, designed to alleviate the delay inversion effect and thereby to reduce the route discovery overhead and (ultimately) allow the routing protocol to find more optimal paths, as compared to uniform jitter. This paper presents both analytical and simulation studies, showing that the proposed adaptive jitter can effectively decrease the cost of route discovery and increase the path quality. PMID:25111238

Research on the optimization of vehicle distribution routes in logistics enterprises

NASA Astrophysics Data System (ADS)

Fan, Zhigou; Ma, Mengkun

2018-01-01

With the rapid development of modern logistics, the vehicle routing problem has become one of the urgent problems in the logistics industry. The rationality of distribution route planning directly affects the efficiency and quality of logistics distribution. This paper first introduces the definition of logistics distribution and the three methods of optimizing the distribution routes, and then analyzes the current vehicle distribution route by using a representative example, finally puts forward the optimization schemes of logistics distribution route.

Tour time in a two-route traffic system controlled by signals

NASA Astrophysics Data System (ADS)

Nagatani, Takashi; Naito, Yuichi

2011-11-01

We study the dynamic behavior of vehicular traffic in a two-route system with a series of signals (traffic lights) at low density where the number of signals on route A is different from that on route B. We investigate the dependence of the tour time on the route for some strategies of signal control. The nonlinear dynamic model of a two-route traffic system controlled by signals is presented by nonlinear maps. The vehicular traffic exhibits a very complex behavior, depending on the cycle time, the phase difference, and the irregularity. The dependence of the tour time on the route choice is clarified for the signal strategies.

A Mixed Integer Linear Program for Solving a Multiple Route Taxi Scheduling Problem

NASA Technical Reports Server (NTRS)

Montoya, Justin Vincent; Wood, Zachary Paul; Rathinam, Sivakumar; Malik, Waqar Ahmad

2010-01-01

Aircraft movements on taxiways at busy airports often create bottlenecks. This paper introduces a mixed integer linear program to solve a Multiple Route Aircraft Taxi Scheduling Problem. The outputs of the model are in the form of optimal taxi schedules, which include routing decisions for taxiing aircraft. The model extends an existing single route formulation to include routing decisions. An efficient comparison framework compares the multi-route formulation and the single route formulation. The multi-route model is exercised for east side airport surface traffic at Dallas/Fort Worth International Airport to determine if any arrival taxi time savings can be achieved by allowing arrivals to have two taxi routes: a route that crosses an active departure runway and a perimeter route that avoids the crossing. Results indicate that the multi-route formulation yields reduced arrival taxi times over the single route formulation only when a perimeter taxiway is used. In conditions where the departure aircraft are given an optimal and fixed takeoff sequence, accumulative arrival taxi time savings in the multi-route formulation can be as high as 3.6 hours more than the single route formulation. If the departure sequence is not optimal, the multi-route formulation results in less taxi time savings made over the single route formulation, but the average arrival taxi time is significantly decreased.

Route Monopolie and Optimal Nonlinear Pricing

NASA Technical Reports Server (NTRS)

Tournut, Jacques

2003-01-01

To cope with air traffic growth and congested airports, two solutions are apparent on the supply side: 1) use larger aircraft in the hub and spoke system; or 2) develop new routes through secondary airports. An enlarged route system through secondary airports may increase the proportion of route monopolies in the air transport market.The monopoly optimal non linear pricing policy is well known in the case of one dimension (one instrument, one characteristic) but not in the case of several dimensions. This paper explores the robustness of the one dimensional screening model with respect to increasing the number of instruments and the number of characteristics. The objective of this paper is then to link and fill the gap in both literatures. One of the merits of the screening model has been to show that a great varieD" of economic questions (non linear pricing, product line choice, auction design, income taxation, regulation...) could be handled within the same framework.VCe study a case of non linear pricing (2 instruments (2 routes on which the airline pro_ddes customers with services), 2 characteristics (demand of services on these routes) and two values per characteristic (low and high demand of services on these routes)) and we show that none of the conclusions of the one dimensional analysis remain valid. In particular, upward incentive compatibility constraint may be binding at the optimum. As a consequence, they may be distortion at the top of the distribution. In addition to this, we show that the optimal solution often requires a kind of form of bundling, we explain explicitly distortions and show that it is sometimes optimal for the monopolist to only produce one good (instead of two) or to exclude some buyers from the market. Actually, this means that the monopolist cannot fully apply his monopoly power and is better off selling both goods independently.We then define all the possible solutions in the case of a quadratic cost function for a uniform

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

PubMed Central

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-hoon

2017-01-01

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. PMID:28531159

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks.

PubMed

Rupérez Cañas, Delfín; Sandoval Orozco, Ana Lucila; García Villalba, Luis Javier; Kim, Tai-Hoon

2017-05-22

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads.

Pheromone Static Routing Strategy for Complex Networks

NASA Astrophysics Data System (ADS)

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

2012-12-01

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

8. View southeast, Route 100 (Montchanin Road) to left duck ...

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

8. View southeast, Route 100 (Montchanin Road) to left duck and large stand of old growth oak trees at back entrance to Winterthur center right. - Winterthur Farms, Intersection State Routes 92 & 100, Intersection State Routes 92 & 100, Winterthur, New Castle County, DE

Short-term memory, executive control, and children's route learning.

PubMed

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

2012-10-01

The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11years and to relate route-learning performance to the components of Baddeley's model of working memory. Children carried out tasks that included measures of verbal and visuospatial short-term memory and executive control and also measures of verbal and visuospatial long-term memory; the route-learning task was conducted using a maze in a virtual environment. In contrast to previous research, correlations were found between both visuospatial and verbal memory tasks-the Corsi task, short-term pattern span, digit span, and visuospatial long-term memory-and route-learning performance. However, further analyses indicated that these relationships were mediated by executive control demands that were common to the tasks, with long-term memory explaining additional unique variance in route learning. Copyright © 2012 Elsevier Inc. All rights reserved.

Standardization of databases for AMDB taxi routing functions

NASA Astrophysics Data System (ADS)

Pschierer, C.; Sindlinger, A.; Schiefele, J.

2010-04-01

Input, management, and display of taxi routes on airport moving map displays (AMM) have been covered in various studies in the past. The demonstrated applications are typically based on Aerodrome Mapping Databases (AMDB). Taxi routing functions require specific enhancements, typically in the form of a graph network with nodes and edges modeling all connectivities within an airport, which are not supported by the current AMDB standards. Therefore, the data schemas and data content have been defined specifically for the purpose and test scenarios of these studies. A standardization of the data format for taxi routing information is a prerequisite for turning taxi routing functions into production. The joint RTCA/EUROCAE special committee SC-217, responsible for updating and enhancing the AMDB standards DO-272 [1] and DO-291 [2], is currently in the process of studying different alternatives and defining reasonable formats. Requirements for taxi routing data are primarily driven by depiction concepts for assigned and cleared taxi routes, but also by database size and the economic feasibility. Studied concepts are similar to the ones described in the GDF (geographic data files) specification [3], which is used in most car navigation systems today. They include - A highly aggregated graph network of complex features - A modestly aggregated graph network of simple features - A non-explicit topology of plain AMDB taxi guidance line elements This paper introduces the different concepts and their advantages and disadvantages.

A Hop-Sensitive Mechanism to Establish Route Optimization in Mobile Networks

NASA Astrophysics Data System (ADS)

Gnanaraj, J. Isac; Newton, P. Calduwel; Arockiam, L.; Kim, Tai-Hoon

The mobile network plays a vital role in mobile communications. It supports both host mobility and network mobility. The mobile network which supports network mobility can be called as NEMO. The NEMO refers to NEtwork MObility or mobile network that moves. Though NEMO provides many supports, it also suffers due to Quality of Service (QoS) issues. One such issue is Route Optimization (RO). When a Mobile Node (MN) is away from Home Network (HN), it will send a binding update to Home Agent (HA) in HN to inform its movement. If the Correspondent Node (CN) wants to send data to MN, it will send data through HA. In this scenario, three networks such as HN, Foreign Network (FN) and Correspondent Network are involved in data transfer. The involvement of these three networks affects the QoS. This paper concentrates on some of the QoS parameters to propose a QoS mechanism to establish RO among these three networks and significantly increases performance of the mobile network.

A Conversation with Lee Alvin DuBridge - Part I

NASA Astrophysics Data System (ADS)

Goodstein, Judith R.

Physicist Lee A. DuBridge became president of the California Institute of Technology in 1946. In this interview he recalls the immediate problems he faced, including his dealings with Robert A. Millikan, whom he replaced as chief administrator of the institute; institute financing and inadequate salaries. DuBridge also talks about the advent of federal support for peacetime science and Millikan's distaste for it; his close working relationship with Robert F. Bacher, who came to the institute in 1949 as chairman of the Division of Physics, Mathematics, and Astronomy; his recollections of the meteorologist Irving P. Krick, the physicist Alexander Goetz, and the chemist Linus Pauling; and his attempts to build up the Humanities Division.

Indoor 3D Route Modeling Based On Estate Spatial Data

NASA Astrophysics Data System (ADS)

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

2014-04-01

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

Familiar route loyalty implies visual pilotage in the homing pigeon

PubMed Central

Biro, Dora; Meade, Jessica; Guilford, Tim

2004-01-01

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

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

Federal Register 2010, 2011, 2012, 2013, 2014

2012-02-21

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

A new routing enhancement scheme based on node blocking state advertisement in wavelength-routed WDM networks

NASA Astrophysics Data System (ADS)

Hu, Peigang; Jin, Yaohui; Zhang, Chunlei; He, Hao; Hu, WeiSheng

2005-02-01

The increasing switching capacity brings the optical node with considerable complexity. Due to the limitation in cost and technology, an optical node is often designed with partial switching capability and partial resource sharing. It means that the node is of blocking to some extent, for example multi-granularity switching node, which in fact is a structure using pass wavelength to reduce the dimension of OXC, and partial sharing wavelength converter (WC) OXC. It is conceivable that these blocking nodes will have great effects on the problem of routing and wavelength assignment. Some previous works studied the blocking case, partial WC OXC, using complicated wavelength assignment algorithm. But the complexities of these schemes decide them to be not in practice in real networks. In this paper, we propose a new scheme based on the node blocking state advertisement to reduce the retry or rerouting probability and improve the efficiency of routing in the networks with blocking nodes. In the scheme, node blocking state are advertised to the other nodes in networks, which will be used for subsequent route calculation to find a path with lowest blocking probability. The performance of the scheme is evaluated using discrete event model in 14-node NSFNET, all the nodes of which employ a kind of partial sharing WC OXC structure. In the simulation, a simple First-Fit wavelength assignment algorithm is used. The simulation results demonstrate that the new scheme considerably reduces the retry or rerouting probability in routing process.

Towards seasonal Arctic shipping route predictions

NASA Astrophysics Data System (ADS)

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

2017-08-01

The continuing decline in Arctic sea-ice will likely lead to increased human activity and opportunities for shipping in the region, suggesting that seasonal predictions of route openings will become ever more important. Here we present results from a set of ‘perfect model’ experiments to assess the predictability characteristics of the opening of Arctic sea routes. We find skilful predictions of the upcoming summer shipping season can be made from as early as January, although typically forecasts show lower skill before a May ‘predictability barrier’. We demonstrate that in forecasts started from January, predictions of route opening date are twice as uncertain as predicting the closing date and that the Arctic shipping season is becoming longer due to climate change, with later closing dates mostly responsible. We find that predictive skill is state dependent with predictions for high or low ice years exhibiting greater skill than medium ice years. Forecasting the fastest open water route through the Arctic is accurate to within 200 km when predicted from July, a six-fold increase in accuracy compared to forecasts initialised from the previous November, which are typically no better than climatology. Finally we find that initialisation of accurate summer sea-ice thickness information is crucial to obtain skilful forecasts, further motivating investment into sea-ice thickness observations, climate models, and assimilation systems.

Effective bandwidth guaranteed routing schemes for MPLS traffic engineering

NASA Astrophysics Data System (ADS)

Wang, Bin; Jain, Nidhi

2001-07-01

In this work, we present online algorithms for dynamic routing bandwidth guaranteed label switched paths (LSPs) where LSP set-up requests (in terms of a pair of ingress and egress routers as well as its bandwidth requirement) arrive one by one and there is no a priori knowledge regarding future LSP set-up requests. In addition, we consider rerouting of LSPs in this work. Rerouting of LSPs has not been well studied in previous work on LSP routing. The need of LSP rerouting arises in a number of ways: occurrence of faults (link and/or node failures), re-optimization of existing LSPs' routes to accommodate traffic fluctuation, requests with higher priorities, and so on. We formulate the bandwidth guaranteed LSP routing with rerouting capability as a multi-commodity flow problem. The solution to this problem is used as the benchmark for comparing other computationally less costly algorithms studied in this paper. Furthermore, to more efficiently utilize the network resources, we propose online routing algorithms which route bandwidth demands over multiple paths at the ingress router to satisfy the customer requests while providing better service survivability. Traffic splitting and distribution over the multiple paths are carefully handled using table-based hashing schemes while the order of packets within a flow is preserved. Preliminary simulations are conducted to show the performance of different design choices and the effectiveness of the rerouting and multi-path routing algorithms in terms of LSP set-up request rejection probability and bandwidth blocking probability.

Acquisition of business intelligence from human experience in route planning

NASA Astrophysics Data System (ADS)

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

2015-04-01

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

Learning a Nonmediated Route for Response Selection in Task Switching

PubMed Central

Schneider, Darryl W.; Logan, Gordon D.

2015-01-01

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

Peninsula transportation district commission route deviation feasibility study.

DOT National Transportation Integrated Search

1998-11-01

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

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

NASA Technical Reports Server (NTRS)

Jardin, Matthew R.

2004-01-01

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

Diagnostic et prévalence du syndrome métabolique chez les diabétiques suivis dans un contexte de ressources limitées: cas du Burkina-Faso

PubMed Central

Marceline, Yaméogo Téné; Issiaka, Sombié; Gilberte, Kyélem Carole; Nadège, Rouamba; Macaire, Ouédraogo Sampawindé; Arsène, Yaméogo Aimé; Djingri, Lankoandé; Apollinaire, Sawadogo; Joseph, Drabo Youssouf

2014-01-01

Introduction Les conséquences du syndrome métabolique impliquent son diagnostic effectif pour une prise en charge globale des comorbidités dépistées. Objectif: Déterminer la capacité à diagnostiquer le syndrome métabolique en routine, sa prévalence chez les diabétiques, leurs connaissances et pratiques vis-à-vis du risque cardio-métabolique. Méthodes Il s'est agi d'une étude transversale auprès de 388 diabétiques au CHU de Bobo-Dioulasso. Les critères de la fédération internationale du diabète (2009) ont été utilisés. Résultats l’âge moyen était de 53,5±13,5 ans, le sex ratio de 0,7. L'obésité abdominale était présente dans 61,9% des cas; L'HTA l’était dans 56,4% des cas. La prescription du bilan lipidique a été documentée dans 55,4% des cas pour le HDL et 56,2% pour les triglycérides pour un taux de réalisation de 49,3% et 62,9%. Le taux de dépistage des critères lipidiques était de 26,8%. Un taux de HDL bas a été noté dans 46 cas (43,4%) et une hypertriglycéridémie dans 24 cas (17,6%). In fine, la prévalence du syndrome métabolique était de 48,9% (n = 190). Seuls 27,4% savaient que d'autres facteurs de risque cardiovasculaire pouvaient être associés au diabète et seulement 6,7% pratiquaient une activité physique régulière. Conclusion Malgré la faible contribution du laboratoire, le syndrome métabolique est fréquent parmi nos diabétiques. Les patients sont peu sensibilisés sur le risque vasculaire et la pratique d'une activité physique régulière reste faible. Un programme d’éducation adaptée contribuerait à un meilleur dépistage et à une prise en charge optimale des cas. PMID:25932077

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

Code of Federal Regulations, 2012 CFR

2012-07-01

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

Hybrid songbirds employ intermediate routes in a migratory divide.

PubMed

Delmore, Kira E; Irwin, Darren E

2014-10-01

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

Using Collective Intelligence to Route Internet Traffic

NASA Technical Reports Server (NTRS)

Wolpert, David H.; Tumer, Kagan; Frank, Jeremy

1998-01-01

A Collective Intelligence (COIN) is a community of interacting reinforcement learning (RL) algorithms designed so that their collective behavior maximizes a global utility function. We introduce the theory of COINs, then present experiments using that theory to design COINs to control internet traffic routing. These experiments indicate that COINs outperform previous RL-based systems for such routing that have previously been investigated.

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

PubMed Central

2014-01-01

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

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

PubMed

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

2014-02-14

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

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network

PubMed Central

Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A.; Othman, Mohamed

2018-01-01

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26

Totally opportunistic routing algorithm (TORA) for underwater wireless sensor network.

PubMed

Rahman, Ziaur; Hashim, Fazirulhisyam; Rasid, Mohd Fadlee A; Othman, Mohamed

2018-01-01

Underwater Wireless Sensor Network (UWSN) has emerged as promising networking techniques to monitor and explore oceans. Research on acoustic communication has been conducted for decades, but had focused mostly on issues related to physical layer such as high latency, low bandwidth, and high bit error. However, data gathering process is still severely limited in UWSN due to channel impairment. One way to improve data collection in UWSN is the design of routing protocol. Opportunistic Routing (OR) is an emerging technique that has the ability to improve the performance of wireless network, notably acoustic network. In this paper, we propose an anycast, geographical and totally opportunistic routing algorithm for UWSN, called TORA. Our proposed scheme is designed to avoid horizontal transmission, reduce end to end delay, overcome the problem of void nodes and maximize throughput and energy efficiency. We use TOA (Time of Arrival) and range based equation to localize nodes recursively within a network. Once nodes are localized, their location coordinates and residual energy are used as a matrix to select the best available forwarder. All data packets may or may not be acknowledged based on the status of sender and receiver. Thus, the number of acknowledgments for a particular data packet may vary from zero to 2-hop. Extensive simulations were performed to evaluate the performance of the proposed scheme for high network traffic load under very sparse and very dense network scenarios. Simulation results show that TORA significantly improves the network performance when compared to some relevant existing routing protocols, such as VBF, HHVBF, VAPR, and H2DAB, for energy consumption, packet delivery ratio, average end-to-end delay, average hop-count and propagation deviation factor. TORA reduces energy consumption by an average of 35% of VBF, 40% of HH-VBF, 15% of VAPR, and 29% of H2DAB, whereas the packet delivery ratio has been improved by an average of 43% of VBF, 26

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

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

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

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2012 CFR

2012-01-01

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

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2011 CFR

2011-01-01

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

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2013 CFR

2013-01-01

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

14 CFR 399.63 - Role of staff in route proceedings.

Code of Federal Regulations, 2014 CFR

2014-01-01

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

Prevalence of Autism Spectrum Phenomenology in Cornelia de Lange and Cri du Chat Syndromes

ERIC Educational Resources Information Center

Moss, Joanna F.; Oliver, Chris; Berg, Katy; Kaur, Gurmeash; Jephcott, Lesley; Cornish, Kim

2008-01-01

Autism spectrum disorder characteristics have not been evaluated in Cornelia de Lange and Cri du Chat syndromes using robust assessments. The Autism Diagnostic Observation Schedule and Social Communication Questionnaire were administered to 34 participants with Cornelia de Lange syndrome and a comparison group of 23 participants with Cri du Chat…

Design of a mesoscale continuous flow route towards lithiated methoxyallene.

PubMed

Seghers, Sofie; Heugebaert, Thomas S A; Moens, Matthias; Sonck, Jolien; Thybaut, Joris; Stevens, Chris Victor

2018-05-11

The unique nucleophilic properties of lithiated methoxyallene allow for C-C bond formation with a wide variety of electrophiles, thus introducing an allenic group for further functionalization. This approach has yielded a tremendously broad range of (hetero)cyclic scaffolds, including API precursors. To date, however, its valorization at scale is hampered by the batch synthesis protocol which suffers from serious safety issues. Hence, the attractive heat and mass transfer properties of flow technology were exploited to establish a mesoscale continuous flow route towards lithiated methoxyallene. An excellent conversion of 94% was obtained, corresponding to a methoxyallene throughput of 8.2 g/h. The process is characterized by short reaction times, mild reaction conditions and a stoichiometric use of reagents. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

[Herbal textual research of common Mongolian medicine "Du Ge Mo Nong"].

PubMed

Xi, Jie; Zhong, Hua-Rong; Wucharila-Tu; Buhe Bater; Li, Hui-Hu; Zhong, Guo-Yue

2016-11-01

This study is aimed to provide the source for clinical medication by clarifing the common base of Mongolia medicinal materials "Du Ge Mo Nong". In this paper literature research and plant taxonomy method were adopted combined with investigation of the markets and clinical use status to clarify the origin of common traditional Mongolian medicine "Du Ge Mo Nong". The results showed that the Mongolian medicine "Du Ge Mo Nong" and Tibetan medicine "Du Mu Niu" were the same crude drug and originated from the seeds of Holarrhena antidysenteriaca of family Apocynaceae in earliest time. In Mongolian medicine clinic, the seed of Cynanchum thesioides of family Asclepiadaceae and the fruit of Forsythia suspense of family Oleaceae was used respectively about 18 century and recent time, as the substitutes of H. antidysenteriaca. In present standards on Mongolian material medicine, C. thesioides is including only, and H. antidysenterica is not used almost. In Tibetan medicine clinic, H. antidysenterica is being used so far. But there are various substitutes including the seeds, fruits or grass of many species classified to family Apocynaceae, Asclepiadaceae and Onagraceae from ancient time to the present, and C. forrestii and C. komarovii may be used at present. It's necessary to strengthen the arrangement on Mongolian medicine's varieties by the multidisciplinary methods including literature research, investigation of resources and the use state, and comparison of active substances and biological activities between the different substitutes,and so on. Copyright© by the Chinese Pharmaceutical Association.

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

PubMed

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

2006-01-01

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

49 CFR 397.103 - Requirements for State routing designations.

Code of Federal Regulations, 2010 CFR

2010-10-01

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

49 CFR 397.103 - Requirements for State routing designations.

Code of Federal Regulations, 2011 CFR

2011-10-01

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

Automated Flight Routing Using Stochastic Dynamic Programming

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Morando, Alex; Grabbe, Shon

2010-01-01

Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

The influence of advertisements on the conspicuity of routing information.

PubMed

Boersema, T; Zwaga, H J

1985-12-01

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

Improved routing strategy based on gravitational field theory

NASA Astrophysics Data System (ADS)

Song, Hai-Quan; Guo, Jin

2015-10-01

Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase, and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently. Project supported by the Technology and Development Research Project of China Railway Corporation (Grant No. 2012X007-D) and the Key Program of Technology and Development Research Foundation of China Railway Corporation (Grant No. 2012X003-A).

Epidémiologie et prise en charge des infections du per-partum à la maternité du centre hospitalier départemental de l'Ouémé-Plateau au Bénin

PubMed Central

Saizonou, Jacques; Ouédraogo, Laurent; Paraiso, Moussiliou Noël; Ayélo, Paul; Kpozèhouen, Alphonse; Daraté, René; Traoré, Esther

2014-01-01

Introduction La présente étude avait pour objectif de mesurer l'ampleur des infections du per-partum à la maternité du Centre Hospitalier Départemental de l'Ouémé-Plateau d'analyser les conditions de survenue et de prise en charge dans la perspective de l'amélioration des soins et services maternels et néonataux. Méthodes Une étude descriptive et analytique a été conduite de Août 2009 à Février 2010 et a impliqué 110 mères victimes d'infections du per-partum; elles ont été soumises à un questionnaire durant tout leur séjour hospitalier; des observations des pratiques de prise en charge des prestataires de soins ont été menées et des registres et autres supports de données sanitaires ont été exploités. L'analyse des données a été effectuée à l'aide du logiciel Epi Info 6.4 dans sa version française. Résultats L'incidence des infections du per-partum était de 5,9 pour 100 accouchements (110/ 1875); les types d'infections les plus incriminés étaient les endométrites (27,3%), les chorioamniotites (18,2%), les infections du site opératoire (12,7%) et les infections urinaires (2,7%). Les examens cliniques ont été relativement acceptables. En revanche, les examens biologiques ont été très insuffisants expliquant l'imprécision importante au niveau des diagnostics. L'antibiothérapie a été instaurée systématiquement. Le taux de mortinaissance était de 25,6% et les enfants de petit poids représentaient 23,2%. Conclusion L'incidence des infections du per-partum dans la présente étude était assez élevée. Des efforts de préventions et de dépistage de ces infections sont nécessaire afin d'améliorer la qualité des soins PMID:25120854

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

NASA Astrophysics Data System (ADS)

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

2014-06-01

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

A secure 3-way routing protocols for intermittently connected mobile ad hoc networks.

PubMed

Sekaran, Ramesh; Parasuraman, Ganesh Kumar

2014-01-01

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET.

A Secure 3-Way Routing Protocols for Intermittently Connected Mobile Ad Hoc Networks

PubMed Central

Parasuraman, Ganesh Kumar

2014-01-01

The mobile ad hoc network may be partially connected or it may be disconnected in nature and these forms of networks are termed intermittently connected mobile ad hoc network (ICMANET). The routing in such disconnected network is commonly an arduous task. Many routing protocols have been proposed for routing in ICMANET since decades. The routing techniques in existence for ICMANET are, namely, flooding, epidemic, probabilistic, copy case, spray and wait, and so forth. These techniques achieve an effective routing with minimum latency, higher delivery ratio, lesser overhead, and so forth. Though these techniques generate effective results, in this paper, we propose novel routing algorithms grounded on agent and cryptographic techniques, namely, location dissemination service (LoDiS) routing with agent AES, A-LoDiS with agent AES routing, and B-LoDiS with agent AES routing, ensuring optimal results with respect to various network routing parameters. The algorithm along with efficient routing ensures higher degree of security. The security level is cited testing with respect to possibility of malicious nodes into the network. This paper also aids, with the comparative results of proposed algorithms, for secure routing in ICMANET. PMID:25136697

Analysis of Multi-Flight Common Routes for Traffic Flow Management

NASA Technical Reports Server (NTRS)

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

2016-01-01

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

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

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

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

W. E. B. Du Bois at the center: from science, civil rights movement, to Black Lives Matter.

PubMed

Morris, Aldon

2017-03-01

I am honoured to present the 2016 British Journal of Sociology Annual Lecture at the London School of Economics. My lecture is based on ideas derived from my new book, The Scholar Denied: W.E.B. Du Bois and the Birth of Modern Sociology. In this essay I make three arguments. First, W.E.B. Du Bois and his Atlanta School of Sociology pioneered scientific sociology in the United States. Second, Du Bois pioneered a public sociology that creatively combined sociology and activism. Finally, Du Bois pioneered a politically engaged social science relevant for contemporary political struggles including the contemporary Black Lives Matter movement. © London School of Economics and Political Science 2017.

Les traces matérielles de la Carte du Ciel. Le cas des observatoires d'Alger et de Bordeaux.

NASA Astrophysics Data System (ADS)

Le Guet Tully, F.; Davoigneau, J.; Lamy, J.; de La Noë, J.; Rousseau, J.-M.; Sadsaoud, H.

2008-06-01

Le chapitre évoque les traces matérielles de la Carte du ciel subsistant dans les observatoires d'Alger et de Bordeaux. Les auteurs examinent d'abord l'opération d'inventaire du patrimoine astronomique entreprise à partir du milieu des années 1990. Ils examinent ensuite les éléments concrets constituant aujourd'hui le patrimoine de la Carte du Ciel : lunettes, abris, accessoires, laboratoires, réseaux, plaques de verre, registres, machines à mesurer les clichés, et cartes.

Fault-tolerant onboard digital information switching and routing for communications satellites

NASA Technical Reports Server (NTRS)

Shalkhauser, Mary JO; Quintana, Jorge A.; Soni, Nitin J.; Kim, Heechul

1993-01-01

The NASA Lewis Research Center is developing an information-switching processor for future meshed very-small-aperture terminal (VSAT) communications satellites. The information-switching processor will switch and route baseband user data onboard the VSAT satellite to connect thousands of Earth terminals. Fault tolerance is a critical issue in developing information-switching processor circuitry that will provide and maintain reliable communications services. In parallel with the conceptual development of the meshed VSAT satellite network architecture, NASA designed and built a simple test bed for developing and demonstrating baseband switch architectures and fault-tolerance techniques. The meshed VSAT architecture and the switching demonstration test bed are described, and the initial switching architecture and the fault-tolerance techniques that were developed and tested are discussed.

Assessing green waste route by using Network Analysis

NASA Astrophysics Data System (ADS)

Hasmantika, I. H.; Maryono, M.

2018-02-01

Green waste, such as waste from park need treat proper. One of the main problems of green waste management is how to design optimum collection. This research aims to determine the optimum green waste collection by determining optimum route among park. The route optimum was assessed by using network analysis method. And the region five of Semarang city’s park within 20 parks in chose as case study. To enhancing recycle of green waste, three scenarios of treatment are proposed. Scenario 1 used one integrated treatment facility as terminal for enhancing recycle of green waste, Scenario 2 used two sites and scenario 3 used three sites. According to the assessment, the length of route of scenario 1 is 36.126 km and the time for collection estimated is 46 minutes. In scenario 2, the length of route is 36.471 km with a travel time is 47 minutes. The length of scenario three is 46.934 km and the time of collection is 60 minutes.

I/O routing in a multidimensional torus network

DOEpatents

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

2017-02-07

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

I/O routing in a multidimensional torus network

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

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destinationmore » address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.« less

Genetic algorithms for the vehicle routing problem

NASA Astrophysics Data System (ADS)

Volna, Eva

2016-06-01

The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.

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

Federal Register 2010, 2011, 2012, 2013, 2014

2013-04-15

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

The extended TRIP supporting VoIP routing reservation with distributed QoS

NASA Astrophysics Data System (ADS)

Wang, Furong; Wu, Ye

2004-04-01

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

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