WorldWideScience

Sample records for access route fast

  1. Fast Access Data Acquisition System

    Dr. Vladimir Katsman

    1998-03-17

    Our goal in this program is to develop Fast Access Data Acquisition System (FADAS) by combining the flexibility of Multilink's GaAs and InP electronics and electro-optics with an extremely high data rate for the efficient handling and transfer of collider experimental data. This novel solution is based on Multilink's and Los Alamos National Laboratory's (LANL) unique components and technologies for extremely fast data transfer, storage, and processing.

  2. Basic cable routing guidelines for a fast reactor plant

    In this paper the guidelines evolved for cable routing in 500 MWe Prototype Fast Breeder Reactor (PFBR) are presented. Safety related redundant system cables in a nuclear plant shall not become unavailable due to cable fire. This is ensured by proper cable routing in the plant in addition to the other general fire protection measures

  3. Fast reactor calculational route for Pu burning core design

    This document provides a description of a calculational route, used in the Reactor Physics Research Section for sensitivity studies and initial design optimization calculations for fast reactor cores. The main purpose in producing this document was to provide a description of and user guides to the calculational methods, in English, as an aid to any future user of the calculational route who is (like the author) handicapped by a lack of literacy in Japanese. The document also provides for all users a compilation of information on the various parts of the calculational route, all in a single reference. In using the calculational route (to model Pu burning reactors) the author identified a number of areas where an improvement in the modelling of the standard calculational route was warranted. The document includes comments on and explanations of the modelling assumptions in the various calculations. Practical information on the use of the calculational route and the computer systems is also given. (J.P.N.)

  4. Fast Access Data Acquisition System (FADAS)

    Our goal in this program is to develop Fast Access Data Acquisition System (FADAS) by combining the flexibility of Multilink's GaAs and InP electronics and electro-optics with an extremely high data rate for the efficient handling and transfer of collider experimental data. This novel solution is based on Multilink's and Los Alamos National Laboratory's (LANL) unique components and technologies for extremely fast data transfer, storage, and processing

  5. FFA-CONTEXT AWARE ENERGY EFFICIENT ROUTING USING FAST REACTIVE AND ADAPTIVE ALGORITHM

    P. Kavitha Rani; E. Kannan

    2014-01-01

    A vital issue of routing is how to efficiently strengthen energy consumption of the whole network and to avoid the energy-hole which leads to node failure or node death; this scenario makes the network to work improperly and leads to network death, Here we proves our hypothesis with linearity between routing and linear principles. Our proposed work effectively utilizes the adaption of Optimized particle swarm algorithm (Fast Reactive and fast adaptive algorithm) in order to solve the routing ...

  6. Optical multiple access techniques for on-board routing

    Mendez, Antonio J.; Park, Eugene; Gagliardi, Robert M.

    1992-01-01

    The purpose of this research contract was to design and analyze an optical multiple access system, based on Code Division Multiple Access (CDMA) techniques, for on board routing applications on a future communication satellite. The optical multiple access system was to effect the functions of a circuit switch under the control of an autonomous network controller and to serve eight (8) concurrent users at a point to point (port to port) data rate of 180 Mb/s. (At the start of this program, the bit error rate requirement (BER) was undefined, so it was treated as a design variable during the contract effort.) CDMA was selected over other multiple access techniques because it lends itself to bursty, asynchronous, concurrent communication and potentially can be implemented with off the shelf, reliable optical transceivers compatible with long term unattended operations. Temporal, temporal/spatial hybrids and single pulse per row (SPR, sometimes termed 'sonar matrices') matrix types of CDMA designs were considered. The design, analysis, and trade offs required by the statement of work selected a temporal/spatial CDMA scheme which has SPR properties as the preferred solution. This selected design can be implemented for feasibility demonstration with off the shelf components (which are identified in the bill of materials of the contract Final Report). The photonic network architecture of the selected design is based on M(8,4,4) matrix codes. The network requires eight multimode laser transmitters with laser pulses of 0.93 ns operating at 180 Mb/s and 9-13 dBm peak power, and 8 PIN diode receivers with sensitivity of -27 dBm for the 0.93 ns pulses. The wavelength is not critical, but 830 nm technology readily meets the requirements. The passive optical components of the photonic network are all multimode and off the shelf. Bit error rate (BER) computations, based on both electronic noise and intercode crosstalk, predict a raw BER of (10 exp -3) when all eight users are

  7. 76 FR 27287 - Port Access Route Study: In the Bering Strait; Extension of Comment Period

    2011-05-11

    ... of Study and request for comments for the Port Access Route Study: In the Bering Strait (75 FR 68568..., 2008, issue of the Federal Register (73 FR 3316). This notice is issued under authority of 33 U.S.C... SECURITY Coast Guard 33 CFR Part 167 Port Access Route Study: In the Bering Strait; Extension of...

  8. An evaluation of rail access routes to Yucca Mountain

    This paper provides a preliminary evaluation and characterization of potential rail routes for the transport of high level radioactive waste from their current storage locations (76 power plants and 4 federal facilities) to the proposed geologic repository at Yucca Mountain, Nevada. Individual routes were determined for shipments from each origin using the INTERLINE model. They were characterized in terms of shipment distance, number of transfers and states transversed. Additionally, specific routing constraints were imposed for a selected subset of the origins to address policy and operational alternatives such as minimizing shipment distance, number of transfers or number of states traversed. Results of the analysis indicate that the imposition of the routing constraint count result in reducing shipment distances, and the number of states traversed. But a tradeoff between these factors and the number of transfers exists

  9. 76 FR 27288 - Port Access Route Study: The Atlantic Coast From Maine to Florida

    2011-05-11

    ... records notice regarding our public dockets in the January 17, 2008, issue of the Federal Register (73 FR...'' column. If you do not have access to the Internet, you may view the docket online by visiting the Docket.... Deep-water route means a route within defined limits, which has been accurately surveyed for...

  10. Formulation and Evaluation of Fast Dissolving Oral Film of Dicyclomine as potential route of Buccal Delivery

    Alka Tomar; Kiran Sharma; Chauhan, Nitesh S.; Ashu Mittal; Umakant Bajaj

    2012-01-01

    Buccal delivery is considered to be an important alternative to the peroral route for the systemic administration of drugs, as it considered the most convenient, easy, safest route of administration. Oral mucosa has rich vasculization, offers better permeability to many drugs & it act as an excellent site for the absorption of drugs. Fast dissolving oral film (FDOF) is used as a novel approach, as it dissolve rapidly in mouth and directly reaches to the systemic circulation. Oral film technol...

  11. Price Dispersion and Accessibility: A Case study of Fast Food

    Stewart, Hayden; David E. Davis

    2005-01-01

    This study examines spatial variation in the price and accessibility of fast food across a major urban area. We use novel data on the price of a representative fast food meal and the location of fast food restaurants belonging to one of three major chains in the District of Columbia and its surrounding suburbs. These data are used to test a structural model of spatial competition. The results of this study are easily interpreted and compared with a past analysis. We find that spatial differen...

  12. Fast and efficient combustion synthesis route to produce novel nanocarbons

    Dabrowska, Agnieszka; Huczko, Andrzej [Faculty of Chemistry, University of Warsaw, 1 Pasteura Street, 02-093 Warsaw (Poland); Dyjak, Slawomir [Institute of Chemistry, Military University of Technology, 2 Kaliskiego Street, 00-908 Warsaw (Poland)

    2012-12-15

    We report the preliminary results on simple one-step chemical synthesis of exfoliated graphite and other carbon-related nanostructures via a novel combustion synthesis route. We found previously that different solid carbonates could be decomposed to elements upon reducing in solid phase by using a strong reducers and the produced carbon vapors instantly condense towards 1-D nanocarbons. Here such combustion processing is extended towards the direct heterogeneous, efficient, and autothermic high-pressure reduction of gaseous carbon oxides (CO{sub 2} and CO) to elements using the following reducers: Li, Mg, Ca, B, Ti, Zr, and Al. The solid products (layered graphite and nanocarbides) were chemically purified and characterized using XRD, SEM, and Raman spectroscopy. (Copyright copyright 2012 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  13. Route to nonlocality and observation of accessible solitons

    Conti, Claudio; Peccianti, Marco; Assanto, Gaetano

    2003-01-01

    We develop a general theory of spatial solitons in a liquid crystalline medium exhibiting a nonlinearity with an arbitrary degree of effective nonlocality. The model accounts the observability of "accessible solitons" and establishes an important link with parametric solitons.

  14. Fast route to nonlinear clustering statistics in modified gravity theories

    Winther, Hans A.; Ferreira, Pedro G.

    2015-06-01

    We propose a simple and computationally fast method for performing N -body simulations for a large class of modified gravity theories with a screening mechanism such as chameleons, symmetrons, and Galileons. By combining the linear Klein-Gordon equation with a screening factor, calculated from analytical solutions of spherical symmetric configurations, we obtain a modified field equation of which the solution is exact in the linear regime while at the same time taking screening into account on nonlinear scales. The resulting modified field equation remains linear and can be solved just as quickly as the Poisson equation without any of the convergence problems that can arise when solving the full equation. We test our method with N -body simulations and find that it compares remarkably well with full simulations well into the nonlinear regime.

  15. A fast IPv6 route lookup scheme for high-speed optical link

    Yao, Xingmiao; Li, Lemin

    2004-05-01

    A fast IPv6 route lookup scheme implemented by hardware is proposed in this paper. It supports a fast IP address lookup and can insert and delete the prefixes effectively. A novel compressed multibit trie algorithm that decreases the memory space occupied and the average searching time is applied. The scheme proposed in this paper is superior to other IPV6 route lookup ones, for example, by using SRAM pipeline, a lookup speed of 125 x 106 per second can be realized to satisfy 40Gbps optical link rate with only 1.9Mbyte consumption of memory space. As there is no actual IPv6 route prefix, we generate various simulation databases in which prefix length distribution is different. Simulation results show that our scheme has reasonable lookup time, memory space for all the prefix length distribution.

  16. Acoustic Waves: A Route to Enhance Sodium Fast Reactor Safety

    The properties of sodium – both thermohydraulic and neutronic – offer a number of advantages when used as a coolant for fourth generation fast reactors. However, the opacity of sodium is a major drawback for the instrumentation. Acoustic waves could be an efficient means to sound this medium. An ultrasonic telemetry instrument called SONAR was used in the Phénix reactor to detect core movement, to check for missing objects and for sub-assembly handling. Acoustic methods were also used in Superphenix and considered for the EFR project as one of the monitoring solutions to detect anomalies. This paper focuses on the efforts made to develop acoustic techniques to meet the system protection and monitoring requirements. It covers various fields: the development of ultrasonic transducers such as the high-temperature ultrasonic transducer (TUSHT) which have recently been re-developed and manufactured, and current research on instrumentation methods using acoustic transducers for ASTRID. This paper discusses the development of acoustic-based instrument techniques as a means to strengthen the primary and secondary sodium system monitoring approach. In the case of TUSHTs, for example, the potential uses are: core monitoring during nominal operation, the detection of core meltdown accident initiators and fuel handling guidance. (author)

  17. A Combined Solution for Routing and Medium Access Control Layer Attacks in Mobile Ad Hoc Networks

    R. Murugan; Shanmugam, A.

    2010-01-01

    Problem statement: In Mobile Ad hoc Network (MANET), both the routing layer and the Medium Access Control (MAC) layer are vulnerable to several attacks. There are very few techniques to detect and isolate the attacks of both these layers simultaneously. In this study, we developed a combined solution for routing and MAC layer attacks. Approach: Our approach, makes use of three techniques simultaneously which consists of a cumulative frequency based detection technique for&...

  18. Fast food purchasing and access to fast food restaurants: a multilevel analysis of VicLANES

    Kavanagh Anne M

    2009-05-01

    Full Text Available Abstract Background While previous research on fast food access and purchasing has not found evidence of an association, these studies have had methodological problems including aggregation error, lack of specificity between the exposures and outcomes, and lack of adjustment for potential confounding. In this paper we attempt to address these methodological problems using data from the Victorian Lifestyle and Neighbourhood Environments Study (VicLANES – a cross-sectional multilevel study conducted within metropolitan Melbourne, Australia in 2003. Methods The VicLANES data used in this analysis included 2547 participants from 49 census collector districts in metropolitan Melbourne, Australia. The outcome of interest was the total frequency of fast food purchased for consumption at home within the previous month (never, monthly and weekly from five major fast food chains (Red Rooster, McDonalds, Kentucky Fried Chicken, Hungry Jacks and Pizza Hut. Three measures of fast food access were created: density and variety, defined as the number of fast food restaurants and the number of different fast food chains within 3 kilometres of road network distance respectively, and proximity defined as the road network distance to the closest fast food restaurant. Multilevel multinomial models were used to estimate the associations between fast food restaurant access and purchasing with never purchased as the reference category. Models were adjusted for confounders including determinants of demand (attitudes and tastes that influence food purchasing decisions as well as individual and area socio-economic characteristics. Results Purchasing fast food on a monthly basis was related to the variety of fast food restaurants (odds ratio 1.13; 95% confidence interval 1.02 – 1.25 after adjusting for individual and area characteristics. Density and proximity were not found to be significant predictors of fast food purchasing after adjustment for individual socio

  19. 49 CFR 37.185 - Fleet accessibility requirement for OTRB fixed-route systems of large operators.

    2010-10-01

    ... 49 Transportation 1 2010-10-01 2010-10-01 false Fleet accessibility requirement for OTRB fixed....185 Fleet accessibility requirement for OTRB fixed-route systems of large operators. Each large... percent of the buses in its fleet with which it provides fixed-route service are readily accessible to...

  20. FFA-CONTEXT AWARE ENERGY EFFICIENT ROUTING USING FAST REACTIVE AND ADAPTIVE ALGORITHM

    P. Kavitha Rani

    2014-01-01

    Full Text Available A vital issue of routing is how to efficiently strengthen energy consumption of the whole network and to avoid the energy-hole which leads to node failure or node death; this scenario makes the network to work improperly and leads to network death, Here we proves our hypothesis with linearity between routing and linear principles. Our proposed work effectively utilizes the adaption of Optimized particle swarm algorithm (Fast Reactive and fast adaptive algorithm in order to solve the routing problem in wireless sensor networks to avoid the energy hole. Our approach effectively defines the node leader based on energy level and path optimization for node traversing using particle swarm which effectively utilizes the solution for problem in linearity into routing problem. Our algorithm FFA redefines the particle swarm rules which are reliable in routing strategies and adapts to the working principle. The optimization in our algorithm is to balance energy level and to withstand for its context. This study proves the accuracy using our algorithm respectively by theoretical survey and analysis with simulated results.

  1. Access Routes of Internet Finance Dictionaries: Present Solutions and Future Opportunities

    Deny Arnos Kwary

    2011-10-01

    Full Text Available

    ABSTRACT: Lexicographers working on finance dictionaries have not properly exploited the fast development of the Internet. This is revealed by the poor utilization of the access routes found in current Internet finance dictionaries. Consequently, users cannot effectively and efficiently find answers to their lexicographical problems. Firstly, there are Internet finance dictionaries which lack technological features and can simply be called meagre Internet dictionaries. Secondly, there are Internet finance dictionaries which utilize so many technological features that users incur high lexicographical information costs. In order to create better access routes, a sound theoretical foundation has to be established. This article shows that the implementation of the modern theory of lexicographical functions, which focuses on the users, results in a better design for future Internet finance dictionaries. With the proper theoretical basis, lexicographers will be able to create state-ofthe- art dictionaries that can provide effective and efficient solutions to lexicographical problems.

    OPSOMMING: Toegangsroetes van Internet- finansiële woordeboeke: Huidige oplossings en toekomstige geleenthede. Leksikograwe wat aan finansiële woordeboeke werk, het nie die vinnige ontwikkeling van die Internet behoorlik benut nie. Dit blyk uit die gebrekkige aanwending van die toegangsroetes wat in huidige Internet- finansiële woordeboeke aangetref word. Gevolglik kan gebruikers nie doeltreffend en doelmatig antwoorde kry op hul leksikografiese probleme nie. Eerstens is daar Internet- finansiële woordeboeke waarin tegnologiese kenmerke ontbreek en wat gewoon karige Internetwoordeboeke genoem kan word. Tweedens is daar Internet- finansiële woordeboeke wat so baie tegnologiese kenmerke aanwend dat gebruikers hoë leksikografiese inligtingskoste oploop. Om beter toegangsroetes te skep, moet 'n deeglike teoretiese grondslag gevestig word. Hierdie artikel toon

  2. Enhanced Multiple Routing Configurations for Fast IP Network Recovery from Multiple Failures

    T. Anji Kumar

    2011-10-01

    Full Text Available Now a days, Internet plays a major role in our day to day activities e.g., for online transactions, online shopping, and other network related applications. Internet suffers from slow convergence of routing protocols after a network failure which becomes a growing problem. Multiple Routing Configurations [MRC] recovers network from single node/link failures, but does not support network from multiple node/link failures. In this paper, we propose Enhanced MRC [EMRC], to support multiple node/link failures during data transmission in IP networks without frequent global re-convergence. By recovering these failures, data transmission in network will become fast.

  3. Enhanced Multiple Routing Configurations For Fast IP Network Recovery From Multiple Failures

    T Anji Kumar & Dr MHM Krishna Prasad

    2011-11-01

    Full Text Available Now a days, Internet plays a major role in our day to day activities e.g., for online transactions,online shopping, and other network related applications. Internet suffers from slow convergenceof routing protocols after a network failure which becomes a growing problem. Multiple RoutingConfigurations [MRC] recovers network from single node/link failures, but does not supportnetwork from multiple node/link failures. In this paper, we propose Enhanced MRC [EMRC], tosupport multiple node/link failures during data transmission in IP networks without frequent globalre-convergence. By recovering these failures, data transmission in network will become fast.

  4. The TARDis Route Map to Open Access: Developing an Institutional Repository Model

    Hey, J.; Simpson, P.; L.A. Carr

    2005-01-01

    Extended abstract: Open access to peer reviewed journal articles is one of the key messages of the current international movement that is changing the paradigm of scholarly communication. Creating open access journals is one such route and creating institutional repositories containing author generated electronic text is another complementary alternative. Pioneering subject based repositories, such as arXiv, have shown the way in specific disciplines but a joined up approach is required f...

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

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

    2002-01-01

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

  6. Fast food purchasing and access to fast food restaurants: a multilevel analysis of VicLANES

    Kavanagh Anne M; Bentley Rebecca J; Thornton Lukar E

    2009-01-01

    Abstract Background While previous research on fast food access and purchasing has not found evidence of an association, these studies have had methodological problems including aggregation error, lack of specificity between the exposures and outcomes, and lack of adjustment for potential confounding. In this paper we attempt to address these methodological problems using data from the Victorian Lifestyle and Neighbourhood Environments Study (VicLANES) – a cross-sectional multilevel study con...

  7. Cross-layer rate control, medium access control and routing design in cooperative VANET

    Zhou, Liang; Zheng, Baoyu; Geller, Benoit; Wei, Anne; Xu, Shan; Li, Yajun

    2008-01-01

    In this paper, we address the rate control, the Medium Access Control (MAC) and the routing problem for cooperative Vehicular Ad-Hoc Network (VANET) in the framework of cross-layer design. At first, we introduce the cooperative communication conception to VANET, and propose an opportunistic cooperation strategy to improve the system performance. And then, we develop a cross-layer solution which consists of the link capacity detection with adjusting persistence probability at the MAC Layer, th...

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

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

  9. Maturation of the Tract After Percutaneous Cholecystostomy with Regard to the Access Route

    Purpose: To assess the shortest time for catheter removal with regard to the transhepatic or transperitoneal approach in patients undergoing percutaneous cholecystostomy (PC). Methods: In this prospective study, 40 consecutive high-risk patients with acute cholecystitis (calculous, n= 22; acalculous, n= 18) underwent PC by means of a transhepatic (n= 20) or transperitoneal (n= 20) access route. In 28 patients (70%) computed tomography was used for puncture guidance, while in the remaining 12 (30%) the procedures were performed under ultrasound control. A fistulography was performed on the 14th postprocedural day in all patients and was repeated weekly if the tract was found to be immature. The catheter was removed only if a mature tract without evidence of leakage was delineated. Results: In 36 of 40 patients the procedure was technically successful (90%). Three of the unsuccessful punctures were attempted transperitoneally and one transhepatically. Thirty-five of 36 patients showed rapid improvement within the first 48 hr following the procedure (96%). Three of them died of their severe underlying disease (7.5%) and in another three the catheter was accidentally removed prior to the first fistulography (7.5%). A total of 30 patients could be fully evaluated after the procedure: 15 with a transhepatic, and 15 with a transperitoneal PC. Whereas 14 of 15 patients (93%) with transhepatic gallbladder access developed a mature tract after 14 days and the remaining patient after 3 weeks, only 2 of 15 patients (13%) with a transperitoneal route presented a mature tract after 2 weeks (p 2 test with Yates' correction). Eleven patients (73%) with transperitoneal access required 3 weeks and two patients (13%) 4 weeks for complete tract formation. Conclusion: A period of 2 weeks suffices for the majority of patients to develop a mature tract when the transhepatic access route is used; when using the trans- peritoneal route at least 3 weeks are required. We suggest that the

  10. Accessibility of a cadeirante in a public institution of higher education: routes and routines

    Rita de Cássia Silveira Cambruzzi

    2013-06-01

    Full Text Available The physical disability is group is heterogeneous, even within a “category”, since that covers a diversity, because each has a mechanism to organize in spaces in which attends but all participate of the same challenges. However, due to the challenges encountered by persons with disabilities in establishing routes and routines within a University is that we have developed this research. We chose search access of physically disabled person in your external displacement of student housing to the classroom and the classroom until the Secretariat Department that frequents. Research whose goal is the identification and analysis of routes as its accessibility, on the campus of a public institution of higher education. The survey was submitted to the Ethics Committee that approves their implementation. Direct observations were performed, as well as records via photos and footage, which were authorized by the University. The information collected were analyzed qualitatively as the standards of the Brazilian Association of technical norms and the guiding document for the Regional Council of engineering and architecture, Rio Grande do Sul, titled: Roadmap survey. In data analysis, we see that there are needs for providing accessibility with safety and convenience, as well as establish mechanisms for the community library and the University restaurant part of living as part of the University community and also, in the exercise of their constitutional rights.

  11. Models for IP/MPLS routing performance: convergence, fast reroute, and QoS impact

    Choudhury, Gagan L.

    2004-09-01

    We show how to model the black-holing and looping of traffic during an Interior Gateway Protocol (IGP) convergence event at an IP network and how to significantly improve both the convergence time and packet loss duration through IGP parameter tuning and algorithmic improvement. We also explore some congestion avoidance and congestion control algorithms that can significantly improve stability of networks in the face of occasional massive control message storms. Specifically we show the positive impacts of prioritizing Hello and Acknowledgement packets and slowing down LSA generation and retransmission generation on detecting congestion in the network. For some types of video, voice signaling and circuit emulation applications it is necessary to reduce traffic loss durations following a convergence event to below 100 ms and we explore that using Fast Reroute algorithms based on Multiprotocol Label Switching Traffic Engineering (MPLS-TE) that effectively bypasses IGP convergence. We explore the scalability of primary and backup MPLS-TE tunnels where MPLS-TE domain is in the backbone-only or edge-to-edge. We also show how much extra backbone resource is needed to support Fast Reroute and how can that be reduced by taking advantage of Constrained Shortest Path (CSPF) routing of MPLS-TE and by reserving less than 100% of primary tunnel bandwidth during Fast Reroute.

  12. An accessibility graph-based model to optimize tsunami evacuation sites and routes in Martinique, France

    Péroche, M.; Leone, F.; Gutton, R.

    2014-01-01

    The risk of tsunami threatens the whole Caribbean coastline especially the Lesser Antilles. The first available models of tsunami propagation estimate that the travel time from the closest seismic sources would only take few minutes to impact the Martinique Island. Considering this threat, the most effective measure is a planned and organized evacuation of the coastal population. This requires an efficient regional warning system, estimation of the maximum expected tsunami flood height, preparation of the population to evacuate, and drawing up of local and regional emergency plans. In order to produce an efficient evacuation plan, we have to assess the number of people at risk, the potential evacuation routes, the safe areas and the available time to evacuate. However, this essential information is still lacking in the French West Indies emergency plans. This paper proposes a model of tsunami evacuation sites accessibility for Martinique directly addressed to decision makers. It is based on a population database at a local scale, the development of connected graphs of roads, the identification of potential safe areas and the velocity setting for pedestrians. Evacuation routes are calculated using the Dijkstra's algorithm which gives the shortest path between areas at risk and designated evacuation sites. The first results allow us to map the theoretical times and routes to keep the exposed population safe and to compare these results with a tsunami travel time scenario.

  13. Formulation and Evaluation of Fast Dissolving Oral Film of Dicyclomine as potential route of Buccal Delivery

    Alka Tomar

    2012-06-01

    Full Text Available Buccal delivery is considered to be an important alternative to the peroral route for the systemic administration of drugs, as it considered the most convenient, easy, safest route of administration. Oral mucosa has rich vasculization, offers better permeability to many drugs & it act as an excellent site for the absorption of drugs. Fast dissolving oral film (FDOF is used as a novel approach, as it dissolve rapidly in mouth and directly reaches to the systemic circulation. Oral film technology fulfills all the requirements of potential solid dosage form. The aim of this study is to formulate and evaluate the (FDOF of an anticholinergic drug (Dicyclomine and improved bioavailability of drugs as compared to conventional solid oral dosage forms. Oral films were prepared by using HPMC (hydroxypropylmethylcellulose, PVA (polyvinylalcohol, Eudragid RL-100, combination of two polymers and other excipients. Films were prepared by the solvent casting method. Films were evaluated for mechanical properties, Morphology study, swelling properties, disintegration time, dissolution time and in- vitro drug release. X1 formulation shows maximum in- vitro drug release 93.88%, following first order kinetics (r2 =0.9915. The release exponent ‘n’ was found to be for X1 is 0.4487, which appears to indicate a Fickian diffusion and may indicate that the drug release was controlled by first order release.

  14. Underwater acoustic sensor networks: Medium access control, routing and reliable transfer

    Xie, Peng

    Recently there have been growing interests in monitoring aquatic environments for scientific exploration, commercial exploitation and coastline protection. The ideal vehicle for this type of extensive monitoring is a mobile underwater sensor network (M-UWSN), consisting of a large number of low cost underwater sensors that can move with water currents and dispersion. M-UWSNs are significantly different from terrestrial sensor networks: (1) Radio channels do not work well under water. They must be replaced by acoustic channels, which feature long propagation delays, low communication bandwidth and high channel error rates; (2) While most ground sensors are static, underwater sensor nodes may move with water currents (and other underwater activities), as introduces passive sensor mobility. Due to the very different environment properties and the unique characteristics of acoustic channels, the protocols developed for terrestrial sensor networks are not applicable to M-UWSNs, and new research at every level of the protocol suite is demanded. In this dissertation work, we investigate three fundamental networking problems in M-UWSN design: medium access control, multi-hop routing and reliable data transfer. (1) Medium access control (MAC): the long propagation delays and narrow communication bandwidth of acoustic channels pose the major challenges to the energy-efficient MAC design in M-UWSNs. For the first time, we formally investigate the random access and RTS/CTS techniques in networks with long propagation delays and low communication bandwidth (as in M-UWSNs). Based on this study, we propose a novel reservation-based MAC approach, called R-MAC, for dense underwater sensor networks with unevenly distributed (spatially and temporally) traffic. Simulation results show that R-MAC is not only energy efficient but also supports fairness. (2) Multi-hop routing: In M-UWSNs, energy efficiency and mobility handling are the two major concerns for multi-hop routing, which have

  15. CONVENIENCE, ACCESSIBILITY, AND THE DEMAND FOR FAST FOOD

    Jekanowski, Mark D.; Binkley, James K.; Eales, James S.

    2001-01-01

    This study explores the growth in demand for fast food. A distinguishing characteristic of fast food is its convenience; in today's pervasive marketplace, consumers need not travel far to find a fast food outlet. This greater availability translates into a decrease in the full price of obtaining a meal, which contributes to greater consumption. Market-level data are used to estimate demand equations in two time periods, incorporating changes in availability as well as prices, income, and vari...

  16. Comparison of routes for achieving parenteral access with a focus on the management of patients with Ebola virus disease

    Ker, K; Tansley, G; Beecher, D.; Perner, A; Shakur, H; Harris, T; Roberts, I.

    2015-01-01

    Background Dehydration is an important cause of death in patients with Ebola virus disease (EVD). Parenteral fluids are often required in patients with fluid requirements in excess of their oral intake. The peripheral intravenous route is the most commonly used method of parenteral access, but inserting and maintaining an intravenous line can be challenging in the context of EVD. Therefore it is important to consider the advantages and disadvantages of different routes for achieving parentera...

  17. A Combined Solution for Routing and Medium Access Control Layer Attacks in Mobile Ad Hoc Networks

    R. Murugan

    2010-01-01

    Full Text Available Problem statement: In Mobile Ad hoc Network (MANET, both the routing layer and the Medium Access Control (MAC layer are vulnerable to several attacks. There are very few techniques to detect and isolate the attacks of both these layers simultaneously. In this study, we developed a combined solution for routing and MAC layer attacks. Approach: Our approach, makes use of three techniques simultaneously which consists of a cumulative frequency based detection technique for detecting MAC layers attacks, data forwarding behavior based detection technique for detecting packet drops and message authentication code based technique for packet modification. Results: Our combined solution presents a reputation value for detecting the malicious nodes and isolates them from further network participation till its revocation. Our approach periodically checks all nodes, including the isolated nodes, at regular time period λ. A node which recovers from its misbehaving condition is revoked to its normal condition after the time period λ. Conclusion/Recommendations: By simulation results, we show that our combined solution provides more security by increased packet delivery ratio and reduced packet drops. We also shown that our approach has less overhead compared to the existing technique.

  18. Fast Energy-Efficient Secure Dynamic Address Routing For Scalable WSNs

    G. Ravi

    2012-03-01

    Full Text Available Secure Routing is one of the important issues in wireless sensor networks. A number of approaches have been proposed for secure routing in wireless sensor networks, but there is a lack of sufficient support for quick secure routing in large-scale sensor networks. We consider the dynamic address routing for wireless sensor networks. We consider two security algorithms namely RSA (Rivest, Shamir Adleman, Elliptic Curve Cryptography (ECC as an initial test for dynamic address routing protocol for wireless sensor networks. We consider five routing attacks such as Directory attack, Brutal attack, Wormhole attack, Sinkhole attack and Sybil attack against dynamic address routing in wireless sensor networks. In this paper, we propose a common key cryptographic security algorithm named Random Number Addressing Cryptography (RAC for providing energy efficient secure dynamic address routing protocol for scalable wireless sensor networks. RAC security algorithm works energy-efficiently and provides better security than RSA and ECC.

  19. Comparison of routes for achieving parenteral access with a focus on the management of patients with Ebola virus disease

    Ker, Katharine; Tansley, Gavin; Beecher, Deirdre;

    2015-01-01

    BACKGROUND: Dehydration is an important cause of death in patients with Ebola virus disease (EVD). Parenteral fluids are often required in patients with fluid requirements in excess of their oral intake. The peripheral intravenous route is the most commonly used method of parenteral access, but...

  20. Study and Evaluation of Innovative Fuel Handling Systems for Sodium-Cooled Fast Reactors: Fuel Handling Route Optimization

    Franck Dechelette; Franck Morin; Guy Laffont; Gilles Rodriguez; Emmanuel Sanseigne; Sébastien Christin; Xavier Mognot; Aurélien Morcillo

    2014-01-01

    International audience The research for technological improvement and innovation in sodium-cooled fast reactor is a matter of concern in fuel handling systems in a view to perform a better load factor of the reactor thanks to a quicker fuelling/defueling process. An optimized fuel handling route will also limit its investment cost. In that field, CEA has engaged some innovation study either of complete FHR or on the optimization of some specific components. This paper presents the study of...

  1. Remote I/O : fast access to distant storage.

    Foster, I.; Kohr, D., Jr.; Krishnaiyer, R.; Mogill, J.

    1997-12-17

    As high-speed networks make it easier to use distributed resources, it becomes increasingly common that applications and their data are not colocated. Users have traditionally addressed this problem by manually staging data to and from remote computers. We argue instead for a new remote I/O paradigm in which programs use familiar parallel I/O interfaces to access remote file systems. In addition to simplifying remote execution, remote I/O can improve performance relative to staging by overlapping computation and data transfer or by reducing communication requirements. However, remote I/O also introduces new technical challenges in the areas of portability, performance, and integration with distributed computing systems. We propose techniques designed to address these challenges and describe a remote I/O library called RIO that we have developed to evaluate the effectiveness of these techniques. RIO addresses issues of portability by adopting the quasi-standard MPI-IO interface and by defining a RIO device and RIO server within the ADIO abstract I/O device architecture. It addresses performance issues by providing traditional I/O optimizations such as asynchronous operations and through implementation techniques such as buffering and message forwarding to off load communication overheads. RIO uses the Nexus communication library to obtain access to configuration and security mechanisms provided by the Globus wide area computing tool kit. Microbenchmarks and application experiments demonstrate that our techniques achieve acceptable performance in most situations and can improve turnaround time relative to staging.

  2. Fast Freenet: Improving Freenet Performance by Preferential Partition Routing and File Mesh Propagation

    Skogh, Hans-Emil; Haeggström, Jonas; Ghodsi, Ali; Ayani, Rassul

    2006-01-01

    The Freenet Peer-to-Peer network is doing a good job in providing anonymity to the users. But the performance of the network in terms of download speed and request hit ratio is not that good. We propose two modifications to Freenet in order to improve the download speed and request hit ratio for all participants. To improve download speed we propose Preferential Partition Routing, where nodes are grouped according to bandwidth and slow nodes are discriminated when rout...

  3. Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes

    Goodrich, Michael T.; Pszona, Paweł

    2014-01-01

    The problem of finding an electric vehicle route that optimizes both driving time and energy consumption can be modeled as a bicriterion path problem. Unfortunately, the problem of finding optimal bicriterion paths is NP-complete. This paper studies such problems restricted to two-phase paths, which correspond to a common way people drive electric vehicles, where a driver uses one driving style (say, minimizing driving time) at the beginning of a route and another driving style (say, minimizi...

  4. Impairments Computation for Routing Purposes in a Transparent-Access Optical Network Based on Optical CDMA and WDM

    Musa, Ahmed

    2016-06-01

    Optical access networks are becoming more widespread and the use of multiple services might require a transparent optical network (TON). Multiplexing and privacy could benefit from the combination of wavelength division multiplexing (WDM) and optical coding (OC) and wavelength conversion in optical switches. The routing process needs to be cognizant of different resource types and characteristics such as fiber types, fiber linear impairments such as attenuation, dispersion, etc. as well as fiber nonlinear impairments such as four-wave mixing, cross-phase modulation, etc. Other types of impairments, generated by optical nodes or photonic switches, also affect the signal quality (Q) or the optical signal to noise ratio (OSNR), which is related to the bit error rate (BER). Therefore, both link and switch impairments must be addressed and somehow incorporated into the routing algorithm. However, it is not practical to fully integrate all photonic-specific attributes in the routing process. In this study, new routing parameters and constraints are defined that reflect the distinct characteristics of photonic networking. These constraints are applied to the design phase of TON and expressed as a cost or metric form that will be used in the network routing algorithm.

  5. A solvent evaporation route towards fabrication of hierarchically porous ZSM-11 with highly accessible mesopores

    Song, Wen; Liu, Zhiting; Liu, Liping;

    2015-01-01

    A route to generate hierarchically porous zeolite ZSM-11 has been paved via solvent evaporation induced self-assembly assisted by hexadecyltrimethoxysilane to produce a preformed dry gel, followed by its subsequent transformation into zeolite via steam-assisted-crystallization. The crystallization...

  6. Symptomatic radial artery thrombosis successfully treated with endovascular approach via femoral access route

    Pasha, Ahmed Khurshid [Department of Internal Medicine, University of Arizona (United States); Elder, Mahir D. [Heart and Vascular Institute, Detroit, MI (United States); Division of Cardiology, Wayne State University, Detroit, MI (United States); Malik, Umer Ejaz [Department of Internal Medicine, Texas Tech University Health Science Center at Permian Basin, TX (United States); Khalid, Abdullah Mian [Department of Internal Medicine, University of Pittsburg Medical Center, Mercy Hospital, Pittsburg, PA (United States); Noor, Zeeshan [Department of Internal Medicine, St. Joseph Mercy Hospital, Ann Arbor, MI (United States); Movahed, Mohammad Reza, E-mail: rmova@aol.com [Department of Internal Medicine, University of Arizona (United States); Sarver Heart Center, University of Arizona (United States); CareMore HealthCare, AZ (United States)

    2014-09-15

    Radial access has been increasingly utilized for coronary intervention due to higher safety profile in comparison to femoral access site with lower bleeding rate. Radial artery occlusion is not uncommon with radial access site. This usually does not lead to any harm due to ulnar artery collaterals that are sufficient to prevent hand ischemia and is usually left alone. However, in the case of significant hand ischemia, treatment is often necessary. We are reporting an interesting case of symptomatic radial artery thrombosis leading to arm ischemia that was successfully treated percutaneously using femoral access. Using femoral access for radial artery intervention has not been reported previously. This case is followed by review of the literature.

  7. Superconducting Switch for Fast On-Chip Routing of Quantum Microwave Fields

    Pechal, M.; Besse, J.-C.; Mondal, M.; Oppliger, M.; Gasparinetti, S.; Wallraff, A.

    2016-08-01

    A switch capable of routing microwave signals at cryogenic temperatures is a desirable component for state-of-the-art experiments in many fields of applied physics, including but not limited to quantum-information processing, communication, and basic research in engineered quantum systems. Conventional mechanical switches provide low insertion loss but disturb operation of dilution cryostats and the associated experiments by heat dissipation. Switches based on semiconductors or microelectromechanical systems have a lower thermal budget but are not readily integrated with current superconducting circuits. Here we design and test an on-chip switch built by combining tunable transmission-line resonators with microwave beam splitters. The device is superconducting and as such dissipates a negligible amount of heat. It is compatible with current superconducting circuit fabrication techniques, operates with a bandwidth exceeding 100 MHz, is capable of handling photon fluxes on the order of 1 05 μ s-1 , equivalent to powers exceeding -90 dBm , and can be switched within approximately 6-8 ns. We successfully demonstrate operation of the device in the quantum regime by integrating it on a chip with a single-photon source and using it to route nonclassical itinerant microwave fields at the single-photon level.

  8. Study and Evaluation of Innovative Fuel Handling Systems for Sodium-Cooled Fast Reactors: Fuel Handling Route Optimization

    Franck Dechelette

    2014-01-01

    Full Text Available The research for technological improvement and innovation in sodium-cooled fast reactor is a matter of concern in fuel handling systems in a view to perform a better load factor of the reactor thanks to a quicker fuelling/defueling process. An optimized fuel handling route will also limit its investment cost. In that field, CEA has engaged some innovation study either of complete FHR or on the optimization of some specific components. This paper presents the study of three SFR fuel handling route fully described and compared to a reference FHR option. In those three FHR, two use a gas corridor to transfer spent and fresh fuel assembly and the third uses two casks with a sodium pot to evacuate and load an assembly in parallel. All of them are designed for the ASTRID reactor (1500 MWth but can be extrapolated to power reactors and are compatible with the mutualisation of one FHS coupled with two reactors. These three concepts are then intercompared and evaluated with the reference FHR according to four criteria: performances, risk assessment, investment cost, and qualification time. This analysis reveals that the “mixed way” FHR presents interesting solutions mainly in terms of design simplicity and time reduction. Therefore its study will be pursued for ASTRID as an alternative option.

  9. Le code de la route reste peu accessible à un grand nombre de personnes sourdes

    Paire-Ficout, Laurence; BORGETTO, Julie

    2012-01-01

    Actuellement, l’examen du code de la route est difficile d’accès à un nombre important de jeunes sourds. Cela peut constituer un véritable obstacle à l’intégration sociale, personnelle et professionnelle. Les motifs des nombreux échecs à l’examen sont : 1) le faible niveau de français écrit d’un grand nombre de jeunes sourds spécialement ceux qui présentent une surdité sévère ou profonde 2) le nombre réduit de centres ressources de formation disposant d’un...

  10. A Fast Route to Non-Linear Clustering Statistics in Modified Gravity Theories

    Winther, Hans A

    2014-01-01

    We propose a simple and computationally fast method for performing N-body simulations for a large class of modified gravity theories with a screening mechanism such as chameleons, symmetrons and galileons. By combining the linear Klein-Gordon equation with a screening factor, calculated from analytical solutions of spherical symmetric configurations, we obtain a modified field equation whose solution is exact in the linear regime while at the same time takes screening into account on non-linear scales. The resulting modified field equation remains linear and can be solved just as quickly as the Poisson equation without any of the convergence problems that can arise when solving the full equation. We test our method with N-body simulations and find that it compares remarkably well with full simulations well into the non-linear regime.

  11. A facile and fast route to prepare antimony (Sb) nanostructures without additives

    Shah, M.A.

    2011-12-01

    Herein, we report a safe, low cost and reproducible approach for the synthesis of antimony (Sb) nanostructures with most of them having prism like morphology and having well defined faces in the range of ∼70210 nm. The organics free approach is based on a reaction of antimony powder and pure water at ∼210 °C without using any harmful additives and amines. The XRD pattern confirmed the composition and crystallinity of the grown nanostructures. The reported method besides being organics free is economical, fast and free of pollution, which will make it suitable for large scale production. Furthermore, it is well expected that such a technique could be extended to prepare many other important metal and metal oxide nanostructures. The prospects of the process are bright and promising. © 2012 Sharif University of Technology. Production and hosting by Elsevier B.V. All rights reserved.

  12. Unsynchronized Energy-Efficient Medium Access Control and Routing in Wireless Sensor Networks

    Hurni, Philipp

    This master thesis investigates optimizations on recently proposed fully unsynchronized power saving sensor MAC protocols. In contrast to many other sensor MAC protocols, unsynchronized sensor MAC protocols renounce on any kind of network- or cluster-wide synchronization for channel access coordination and maintenance of a common wake-sleep pattern, because in wireless sensor networks with low traffic requirements, the overhead for maintaining synchronization is likely to exceed the energy spent for the actual data traffic.

  13. Fast distributed strategic learning for global optima in queueing access games

    Tembine, Hamidou

    2014-08-24

    In this paper we examine combined fully distributed payoff and strategy learning (CODIPAS) in a queue-aware access game over a graph. The classical strategic learning analysis relies on vanishing or small learning rate and uses stochastic approximation tool to derive steady states and invariant sets of the underlying learning process. Here, the stochastic approximation framework does not apply due to non-vanishing learning rate. We propose a direct proof of convergence of the process. Interestingly, the convergence time to one of the global optima is almost surely finite and we explicitly characterize the convergence time. We show that pursuit-based CODIPAS learning is much faster than the classical learning algorithms in games. We extend the methodology to coalitional learning and proves a very fast formation of coalitions for queue-aware access games where the action space is dynamically changing depending on the location of the user over a graph.

  14. Early Activity in Broca's Area During Reading Reflects Fast Access to Articulatory Codes From Print.

    Klein, Michael; Grainger, Jonathan; Wheat, Katherine L; Millman, Rebecca E; Simpson, Michael I G; Hansen, Peter C; Cornelissen, Piers L

    2015-07-01

    Prior evidence for early activity in Broca's area during reading may reflect fast access to articulatory codes in left inferior frontal gyrus pars opercularis (LIFGpo). We put this hypothesis to test using a benchmark for articulatory involvement in reading known as the masked onset priming effect (MOPE). In masked onset priming, briefly presented pronounceable strings of letters that share an initial phoneme with subsequently presented target words (e.g., gilp-GAME) facilitate word naming responses compared with unrelated primes (dilp-GAME). Crucially, these priming effects only occur when the task requires articulation (naming), and not when it requires lexical decisions. A standard explanation of masked onset priming is that it reflects fast computation of articulatory output codes from letter representations. We therefore predicted 1) that activity in left IFG pars opercularis would be modulated by masked onset priming, 2) that priming-related modulation in LIFGpo would immediately follow activity in occipital cortex, and 3) that this modulation would be greater for naming than for lexical decision. These predictions were confirmed in a magnetoencephalography (MEG) priming study. MOPEs emerged in left IFG at ∼100 ms posttarget onset, and the priming effects were more sustained when the task involved articulation. PMID:24448559

  15. Association between neighborhood need and spatial access to food stores and fast food restaurants in neighborhoods of Colonias

    Han Daikwon

    2009-02-01

    Full Text Available Abstract Objective To determine the extent to which neighborhood needs (socioeconomic deprivation and vehicle availability are associated with two criteria of food environment access: 1 distance to the nearest food store and fast food restaurant and 2 coverage (number of food stores and fast food restaurants within a specified network distance of neighborhood areas of colonias, using ground-truthed methods. Methods Data included locational points for 315 food stores and 204 fast food restaurants, and neighborhood characteristics from the 2000 U.S. Census for the 197 census block group (CBG study area. Neighborhood deprivation and vehicle availability were calculated for each CBG. Minimum distance was determined by calculating network distance from the population-weighted center of each CBG to the nearest supercenter, supermarket, grocery, convenience store, dollar store, mass merchandiser, and fast food restaurant. Coverage was determined by calculating the number of each type of food store and fast food restaurant within a network distance of 1, 3, and 5 miles of each population-weighted CBG center. Neighborhood need and access were examined using Spearman ranked correlations, spatial autocorrelation, and multivariate regression models that adjusted for population density. Results Overall, neighborhoods had best access to convenience stores, fast food restaurants, and dollar stores. After adjusting for population density, residents in neighborhoods with increased deprivation had to travel a significantly greater distance to the nearest supercenter or supermarket, grocery store, mass merchandiser, dollar store, and pharmacy for food items. The results were quite different for association of need with the number of stores within 1 mile. Deprivation was only associated with fast food restaurants; greater deprivation was associated with fewer fast food restaurants within 1 mile. CBG with greater lack of vehicle availability had slightly better

  16. FAST

    Zuidmeer-Jongejan, Laurian; Fernandez-Rivas, Montserrat; Poulsen, Lars K.;

    2012-01-01

    ABSTRACT: The FAST project (Food Allergy Specific Immunotherapy) aims at the development of safe and effective treatment of food allergies, targeting prevalent, persistent and severe allergy to fish and peach. Classical allergen-specific immunotherapy (SIT), using subcutaneous injections with...... aqueous food extracts may be effective but has proven to be accompanied by too many anaphylactic side-effects. FAST aims to develop a safe alternative by replacing food extracts with hypoallergenic recombinant major allergens as the active ingredients of SIT. Both severe fish and peach allergy are caused...... lower their threshold for fish or peach intake, thereby decreasing their anxiety and dependence on rescue medication....

  17. Supermarket and fast food accessibility in Copenhagen: associations with socioeconomic and demographic characteristics

    Svastisalee, Chalida; Nordahl Jensen, Helene; Glümer, Charlotte;

    Purpose: To investigate whether fast food outlets and supermarkets are socially patterned in the city of Copenhagen. Methods: The study was based on a cross-sectional multivariate approach to examine the association between the number of fast food outlets, supermarkets, and neighborhood level socio......-economic indicators in 2006. Food business addresses were obtained from commercial and public business locators for all neighborhoods in the city of Copenhagen (n = 400). We applied area-level socio-economic and demographic information from Statistics Denmark. Counts of fast food outlets and supermarkets were...... regressed on SES indicators (percentage of: recent immigrants, lack of high school diploma, population under 35 yr, and average household income in Euros) using negative binomial analysis. Findings: In the fully adjusted models, income was significantly associated with fast food exposure, but not with...

  18. Association between neighborhood need and spatial access to food stores and fast food restaurants in neighborhoods of Colonias

    Han Daikwon; Horel Scott; Sharkey Joseph R; Huber John C

    2009-01-01

    Abstract Objective To determine the extent to which neighborhood needs (socioeconomic deprivation and vehicle availability) are associated with two criteria of food environment access: 1) distance to the nearest food store and fast food restaurant and 2) coverage (number) of food stores and fast food restaurants within a specified network distance of neighborhood areas of colonias, using ground-truthed methods. Methods Data included locational points for 315 food stores and 204 fast food rest...

  19. Religious Broadcasting. Focused Access to Selected Topics (FAST) Bibliography No. 7.

    Shermis, Michael

    This annotated bibliography on religious broadcasting contains 23 references of articles in the ERIC database. The first section of this FAST Bib lists sources which relate to the historical development of religious broadcasting. The next section looks at the role that television plays in religious broadcasting. A section on the Christian Right…

  20. Availability and accessibility of healthier options and nutrition information at New Zealand fast food restaurants.

    Chand, Ashmita; Eyles, Helen; Ni Mhurchu, Cliona

    2012-02-01

    The aim of this study was to assess the availability of healthier options and nutrition information at major New Zealand fast food chains. A cross-sectional survey was undertaken at 24 fast food stores (two from each of 12 major chains) using on-site visits, telephone calls, and website searches. Of available products, only 234/1126 (21%) were healthier options. Healthier options were generally cheaper and lower in energy, total fat, saturated fat, sugar, and sodium per serve than their regular counterparts. Regular options were commonly high in sugar or sodium per serve (mean sugar content of beverages=56 g (11 teaspoons) and sodium content of burgers and pasta=1095 mg and 1172 mg, respectively). Nutrition information was available at 11/12 (92%) restaurant chains (range=0% at Tank Juice to 99% at Domino's Pizza). However, <1% of this information was available at the point-of-purchase. Therefore, there is huge potential for improving nutrition in the New Zealand fast food restaurant setting. Implications of these findings for policy and food industry include: consideration of mandatory menu labelling, increasing the percentage of healthier options available, and improving the nutrient content of regular options at New Zealand fast food restaurants. PMID:22019449

  1. Effect of Poor Access to Water and Sanitation As Risk Factors for Soil-Transmitted Helminth Infection: Selectiveness by the Infective Route.

    Adriana Echazú

    2015-09-01

    Full Text Available Soil-transmitted helminth (STH infections are a public health problem in resource-limited settings worldwide. Chronic STH infection impairs optimum learning and productivity, contributing to the perpetuation of the poverty-disease cycle. Regular massive drug administration (MDA is the cardinal recommendation for its control; along with water, sanitation and hygiene (WASH interventions. The impact of joint WASH interventions on STH infections has been reported; studies on the independent effect of WASH components are needed to contribute with the improvement of current recommendations for the control of STH. The aim of this study is to assess the association of lacking access to water and sanitation with STH infections, taking into account the differences in route of infection among species and the availability of adequate water and sanitation at home.Cross-sectional study, conducted in Salta province, Argentina. During a deworming program that enrolled 6957 individuals; 771 were randomly selected for stool/serum sampling for parasitological and serological diagnosis of STH. Bivariate stratified analysis was performed to explore significant correlations between risk factors and STH infections grouped by mechanism of entry as skin-penetrators (hookworms and Strongyloides stercoralis vs. orally-ingested (Ascaris lumbricoides and Trichuris trichiura. After controlling for potential confounders, unimproved sanitation was significantly associated with increased odds of infection of skin-penetrators (adjusted odds ratio [aOR] = 3.9; 95% CI: 2.6-5.9. Unimproved drinking water was significantly associated with increased odds of infection of orally-ingested (aOR = 2.2; 95% CI: 1.3-3.7.Lack of safe water and proper sanitation pose a risk of STH infections that is distinct according to the route of entry to the human host used by each of the STH species. Interventions aimed to improve water and sanitation access should be highlighted in the recommendations

  2. Fast access to the CMS detector condition data employing HTML5 technologies

    This paper focuses on using HTML version 5 (HTML5) for accessing condition data for the CMS experiment, evaluating the benefits and risks posed by the use of this technology. According to the authors of HTML5, this technology attempts to solve issues found in previous iterations of HTML and addresses the needs of web applications, an area previously not adequately covered by HTML. We demonstrate that employing HTML5 brings important benefits in terms of access performance to the CMS condition data. The combined use of web storage and web sockets allows increasing the performance and reducing the costs in term of computation power, memory usage and network bandwidth for client and server. Above all, the web workers allow creating different scripts that can be executed using multi-thread mode, exploiting multi-core microprocessors. Web workers have been employed in order to substantially decrease the web page rendering time to display the condition data stored in the CMS condition database.

  3. An integrated web environment for fast access and easy management of a synchrotron beam line

    Tired of all the time spent on the phone or sending emails to schedule beam time? Why not make your own schedule when it is convenient to you? The integrated web environment at the NIGMS East Coast Structural Biology Research Facility allows users to schedule their own beam time as if they were making travel arrangements and provides staff with a set of toolkits for management of routine tasks. These unique features are accessible through the MediaWiki-powered home pages. Here we describe the main features of this web environment that have shown to allow for an efficient and effective interaction between the users and the facility

  4. Acesso vascular por via intraóssea em emergências pediátricas Vascular access through the intraosseous route in pediatric emergencies

    Ricardo Américo Ribeiro de Sá

    2012-12-01

    Full Text Available A obtenção do acesso venoso em crianças gravemente enfermas é um procedimento essencial para o restabelecimento da volemia e a administração de fármacos nas emergências pediátricas. A primeira opção para obtenção de acesso vascular é pela punção de uma veia periférica. Quando essa via não pode ser utilizada ou sua obtenção se torna demorada, a via intraóssea consiste em efetiva opção para obtenção de um acesso venoso rápido e seguro. O presente estudo possui caráter descritivo e exploratório, realizado por meio de pesquisa bibliográfica, com o objetivo de descrever os princípios técnicos, as atribuições profissionais e os cuidados relacionados à obtenção do acesso venoso pela via intraóssea em emergências pediátricas. Foram selecionados 22 artigos disponibilizados nas bases de dados LILACS e MEDLINE e na biblioteca eletrônica SciELO, publicados entre o período de 2000 a 2011, além do protocolo vigente de ressuscitação cardiopulmonar da American Heart Association, de 2010. Após a leitura das publicações, os dados foram agrupados, possibilitando a construção de cinco categorias de análise: aspectos históricos e princípios fisiológicos; indicações, vantagens e contraindicações; atribuições dos profissionais; princípios técnicos; cuidados com o acesso; e possíveis complicações. Os resultados desse estudo mostraram que a via intraóssea consolida-se, hoje, como uma segunda opção de acesso vascular no atendimento a emergências, por ser uma técnica de fácil e rápida execução, apresentar vários sítios de punção não colapsáveis e permitir que a administração de fármacos e a reposição volêmica sejam rápidas e eficazes.Obtaining venous access in critically ill children is an essential procedure to restore blood volume and administer drugs during pediatric emergencies. The first option for vascular access is through a peripheral vein puncture. If this route cannot be used

  5. Expedient Route To Access Rare Deoxy Amino l-Sugar Building Blocks for the Assembly of Bacterial Glycoconjugates.

    Sanapala, Someswara Rao; Kulkarni, Suvarn S

    2016-04-13

    Bacterial glycoproteins and oligosaccharides contain several rare deoxy amino l-sugars which are virtually absent in the human cells. This structural difference between the bacterial and host cell surface glycans can be exploited for the development of carbohydrate based vaccines and target specific drugs. However, the unusual deoxy amino l-sugars present in the bacterial glycoconjugates are not available from natural sources. Thus, procurement of orthogonally protected rare l-sugar building blocks through efficient chemical synthesis is a crucial step toward the synthesis of structurally well-defined and homogeneous complex glycans. Herein, we report a general and expedient methodology to access a variety of unusual deoxy amino l-sugars starting from readily available l-rhamnose and l-fucose via highly regioselective, one-pot double serial and double parallel displacements of the corresponding 2,4-bistriflates using azide and nitrite anions as nucleophiles. Alternatively, regioselective monotriflation at O2, O3, and O4 of l-rhamnose/l-fucose allowed selective inversions at respective positions leading to diverse rare sugars. The orthogonally protected deoxy amino l-sugar building blocks could be stereoselectively assembled to obtain biologically relevant bacterial O-glycans, as exemplified by the first total synthesis of the amino linker-attached, conjugation-ready tetrasaccharide of O-PS of Yersinia enterocolitica O:50 strain 3229 and the trisaccharide of Pseudomonas chlororaphis subsp. aureofaciens strain M71. PMID:27002789

  6. A Fairness-Based Access Control Scheme to Optimize IPTV Fast Channel Changing

    Junyu Lai

    2014-01-01

    Full Text Available IPTV services are typically featured with a longer channel changing delay compared to the conventional TV systems. The major contributor to this lies in the time spent on intraframe (I-frame acquisition during channel changing. Currently, most widely adopted fast channel changing (FCC methods rely on promptly transmitting to the client (conducting the channel changing a retained I-frame of the targeted channel as a separate unicasting stream. However, this I-frame acceleration mechanism has an inherent scalability problem due to the explosions of channel changing requests during commercial breaks. In this paper, we propose a fairness-based admission control (FAC scheme for the original I-frame acceleration mechanism to enhance its scalability by decreasing the bandwidth demands. Based on the channel changing history of every client, the FAC scheme can intelligently decide whether or not to conduct the I-frame acceleration for each channel change request. Comprehensive simulation experiments demonstrate the potential of our proposed FAC scheme to effectively optimize the scalability of the I-frame acceleration mechanism, particularly in commercial breaks. Meanwhile, the FAC scheme only slightly increases the average channel changing delay by temporarily disabling FCC (i.e., I-frame acceleration for the clients who are addicted to frequent channel zapping.

  7. Towards transparent all-optical label-swapped networks: 40 Gbit/s ultra-fast dynamic wavelength routing using integrated devices

    Seoane, Jorge; Holm-Nielsen, Pablo Villanueva; Jeppesen, Palle;

    2006-01-01

    All-optical routing of 40 Gbit/s 1.6 ns packets is demonstrated employing integrated devices based on SOA-MZIs. The scheme allows wavelength transparent operation and sub-nanosecond dynamic wavelength selection for future packet/label switched networks.......All-optical routing of 40 Gbit/s 1.6 ns packets is demonstrated employing integrated devices based on SOA-MZIs. The scheme allows wavelength transparent operation and sub-nanosecond dynamic wavelength selection for future packet/label switched networks....

  8. Fast-Forward on the Green Road to Open Access: The Case Against Mixing Up Green and Gold

    Harnad, Stevan

    2005-01-01

    This article is a critique of: "The 'Green' and 'Gold' Roads to Open Access: The Case for Mixing and Matching" by Jean-Claude Guedon (in Serials Review 30(4) 2004). Open Access (OA) means: free online access to all peer-reviewed journal articles. Jean-Claude Guedon argues against the efficacy of author self-archiving of peer-reviewed journal articles (the "Green" road to OA). He suggests instead that we should convert to Open Access Publishing (the "Golden" road to OA) by "mixing and matching...

  9. MP-RCP:ACHIEVING FAST RECOVERY OF iBGP USING ROUTE CONTROL PLATFORM%MP-RCP:基于RCP的快速恢复iBGP协议

    程柏林; 胡乔林; 陈新; 吕树君

    2014-01-01

    Mechanism of iBGP single best path propagation may prevent the router from acquiring diverse paths,which results in connection disruption and inter-domain churn in the scene of transient link.MP-RCP optimises the route control platform (RCP)to reduce the session numbers and configuration complexity,makes use of global visible routes to compute and disseminate multiple paths for each router.When a router detects the failure in best path,the router encapsulates the packets and forwards them to the backup path to avoid the connection disruption.MP-RCP also separates the failure detection and processing in order to prevent the frequent convergence triggered by transient failures,which reduces the inter-domain disturbance.It is proved through Abilene topology and the experiment of topology generation that the MP-RCP structure reduces the forwarding disruption and inter-domain churn effectively.%iBGP 传播单条最佳路径机制不能保证路由器获得多样性路径,造成链路瞬时故障场景下连接中断及域间扰动。MP-RCP(MultiPath Route Control Platform)优化路由控制平台RCP以降低会话数量及配置复杂性,利用全局可视路由对每台路由器计算、分发多路径。当路由器检测到最佳路径失效后,将报文封装转发到备份路径中避免连接中断;MP-RCP中将失效检测、处理进行分离以避免瞬时故障引起的频繁收敛,从而降低了域间扰动。通过使用Abilene拓扑以及生成拓扑的实验证明了MP-RCP结构能有效避免转发中断和域间扰动。

  10. Evaluation of online accessed systems: example of qualitative research of Fast Addresses of GeaBios System

    Aleš Klemen

    2006-01-01

    Full Text Available An efficient online information service user interface enables independent use of these online. Designers of the GeaBios Internet information system intended to evaluate the user-friendliness of their service »Fast adresses« (»Hitri naslovi«. In December 2003, as a research project for a graduation thesis, an evaluation of »Fast adresses« was conducted. The study consisted of 10 study participants performing assigned tasks and a survey of the same individuals. During the study research questions were developed as well as list of tasks to be assigned to the participants for the observations. Each observation was performed using a qualitative research paradigm. This paradigm was enhanced with an adaptation of Shneiderman’s (1998 questionnaire. Identified difficulties participants had in using »Fast adresses« fell into four types: (1 formulation of queries, (2 display of results, (3 the influence of the operating system, Windows, and, (4 the color and design of the display background and elements of the Web page. Results indicate that the difficulties encountered were not limited to the inappropriate design of the user interface, but also are attributable to user error.

  11. Fast generating algorithm of radar detection blind region in defense penetration route planning%突防航迹规划中雷达探测盲区的快速生成算法

    钟文武; 周新力; 金慧琴; 张烨

    2015-01-01

    Low altitude defense penetration utilizing radar detection blind region can improve the survival probability of air-crafts effectively,and is an offensive means adopted widely in aircrafts defense penetration combat. The blind region models of earth curvature and terrain masking are analyzed. A fast generating algorithm of radar detection blind region is proposed,which is combined with DEM. Based on this,the generated radar detection blind region is applied to the route planning of aircrafts de-fense penetration by adopting A* algorithm. The simulation results show that the algorithm is quick and effective,and can be used in defense penetration route planning of aircrafts.%利用雷达探测盲区进行低空突防,能有效提高飞机生存概率,是飞机突防作战广泛采用的进攻手段.研究了地球曲率盲区和地形遮蔽盲区模型,提出了一种结合DEM的雷达探测盲区快速生成算法,并在此基础上采用A*算法将生成的雷达探测盲区用于飞机突防航迹规划.仿真结果表明了算法的快速有效,能直接应用于突防飞机航迹规划.

  12. Dilemma with the route of venous access for hemodialysis catheter insertion in a patient with dilated ischemic cardiomyopathy treated by cardiac resynchronization therapy

    Devanahalli Ashokananda

    2016-01-01

    Full Text Available A 68 year old patient requiring urgent dialysis due to raising potassium was referred to our center. He had 3 indwelling catheters in his heart via right subclavian vein. His left subclavian and interngal jugular veins were thrombosed possibly due to earlier indwelling catheters. The dilemma was if right internal jugular venous route could be used for insertion of dialysis catheter. Under fluoroscopic guidance, right internal jugular vein was cannulated with the dialysis catheter without problems. This case is being presented to highlight the need for imaging both by ultrasound and radiography during the procedure.

  13. Optimising locational access of deprived populations to farmers' markets at a national scale: one route to improved fruit and vegetable consumption?

    Pearson, Amber L; Wilson, Nick

    2013-01-01

    Background. Evidence suggests that improved locational access to farmers' markets increases fruit and vegetable (FV) consumption, particularly for low-income groups. Therefore, we modelled potential alternative distributions of farmers' markets in one country (New Zealand) to explore the potential impact for deprived populations and an indigenous population (Māori). Methods. Data were collected on current farmers' markets (n = 48), population distributions, area deprivation, and roads. Geographic analyses were performed to optimize market locations for the most deprived populations. Results. We found that, currently, farmers' markets provided fairly poor access for the total population: 7% within 12.5 km (15 min driving time); 5% within 5 km; and 3% within 2 km. Modelling the optimal distribution of the 48 markets substantially improved access for the most deprived groups: 9% (vs 2% currently) within 12.5 km; 5% (vs 1%) within 5 km; and 3% (vs 1%) within 2 km. Access for Māori also improved: 22% (vs 7%) within 12.5 km; 12% (vs 4%) within 5 km; and 6% (vs 2%) within 2 km. Smaller pro-equity results arose from optimising the locations of the 18 least pro-equity markets or adding 10 new markets. Conclusion. These results highlight the potential for improving farmers' market locations to increase accessibility for groups with low FV consumption. Given that such markets are easily established and relocated, local governments could consider these results to inform decisions, including subsidies for using government land and facilities. Such results can also inform central governments planning around voucher schemes for such markets and exempting them from taxes (e.g., VAT/GST). PMID:23862107

  14. Optimising locational access of deprived populations to farmers’ markets at a national scale: one route to improved fruit and vegetable consumption?

    Amber L. Pearson

    2013-07-01

    Full Text Available Background. Evidence suggests that improved locational access to farmers’ markets increases fruit and vegetable (FV consumption, particularly for low-income groups. Therefore, we modelled potential alternative distributions of farmers’ markets in one country (New Zealand to explore the potential impact for deprived populations and an indigenous population (Māori. Methods. Data were collected on current farmers’ markets (n = 48, population distributions, area deprivation, and roads. Geographic analyses were performed to optimize market locations for the most deprived populations. Results. We found that, currently, farmers’ markets provided fairly poor access for the total population: 7% within 12.5 km (15 min driving time; 5% within 5 km; and 3% within 2 km. Modelling the optimal distribution of the 48 markets substantially improved access for the most deprived groups: 9% (vs 2% currently within 12.5 km; 5% (vs 1% within 5 km; and 3% (vs 1% within 2 km. Access for Māori also improved: 22% (vs 7% within 12.5 km; 12% (vs 4% within 5 km; and 6% (vs 2% within 2 km. Smaller pro-equity results arose from optimising the locations of the 18 least pro-equity markets or adding 10 new markets. Conclusion. These results highlight the potential for improving farmers’ market locations to increase accessibility for groups with low FV consumption. Given that such markets are easily established and relocated, local governments could consider these results to inform decisions, including subsidies for using government land and facilities. Such results can also inform central governments planning around voucher schemes for such markets and exempting them from taxes (e.g., VAT/GST.

  15. A capacitive DAC with custom 3-D 1-fF MOM unit capacitors optimized for fast-settling routing in high speed SAR ADCs

    Asynchronous successive approximation register (SAR) analog-to-digital converters (ADC) feature high energy efficiency but medium performance. From the point of view of speed, the key bottleneck is the unit capacitor size. In this paper, a small size three-dimensional (3-D) metal—oxide—metal (MOM) capacitor is proposed. The unit capacitor has a capacitance of 1-fF. It shapes as an umbrella, which is designed for fast settling consideration. A comparison among the proposed capacitor with other 3-D MOM capacitors is also given in the paper. To demonstrate the effectiveness of the MOM capacitor, a 6-b capacitive DAC is implemented in TSMC 1P9M 65 nm LP CMOS technology. The DAC consumes a power dissipation of 0.16 mW at the rate of 100 MS/s, excluding a source-follower based output buffer. Static measurement result shows that INL is less than ±1 LSB and DNL is less than ±0.5 LSB. In addition, a 100 MS/s 9-bit SAR ADC with the proposed 3-D capacitor is simulated. (paper)

  16. A capacitive DAC with custom 3-D 1-fF MOM unit capacitors optimized for fast-settling routing in high speed SAR ADCs

    Chixiao, Chen; Jixuan, Xiang; Huabin, Chen; Jun, Xu; Fan, Ye; Ning, Li; Junyan, Ren

    2015-05-01

    Asynchronous successive approximation register (SAR) analog-to-digital converters (ADC) feature high energy efficiency but medium performance. From the point of view of speed, the key bottleneck is the unit capacitor size. In this paper, a small size three-dimensional (3-D) metal—oxide—metal (MOM) capacitor is proposed. The unit capacitor has a capacitance of 1-fF. It shapes as an umbrella, which is designed for fast settling consideration. A comparison among the proposed capacitor with other 3-D MOM capacitors is also given in the paper. To demonstrate the effectiveness of the MOM capacitor, a 6-b capacitive DAC is implemented in TSMC 1P9M 65 nm LP CMOS technology. The DAC consumes a power dissipation of 0.16 mW at the rate of 100 MS/s, excluding a source-follower based output buffer. Static measurement result shows that INL is less than ±1 LSB and DNL is less than ±0.5 LSB. In addition, a 100 MS/s 9-bit SAR ADC with the proposed 3-D capacitor is simulated.

  17. Speed limit on the Route de l’Europe

    2016-01-01

    Construction work to create a cycle path is under way on the Route de l’Europe, between CERN’s Meyrin and Prévessin sites. The new cycle path is expected to be ready for use in August.   On the part of the road under construction, only one lane is open and the speed limit is 30 km/h. Unfortunately, drivers frequently exceed this limit. Those who drive too fast put their own lives at risk as well as those of the people working on the site.  Please respect the speed limit.  In addition, access to the Route de l’Europe from the SM18, SM19 and BA1 areas and from the tunnel may be in the part of the road where only one lane is open. In this case, please join the road only when the traffic lights allow travel in the relevant direction.

  18. Living in a 'fat swamp': exposure to multiple sources of accessible, cheap, energy-dense fast foods in a deprived community.

    Saunders, Patrick; Saunders, Annie; Middleton, John

    2015-06-14

    This study assesses the levels of fats, including trans-fatty acids, and salt in common takeaway fast foods in a deprived urban municipality in the West Midlands, England, and implications in the context of the spatial distribution of fast food takeaways. The results of the compositional analysis of over 250 take-out foods were compared with established and derived standards. About 70% of products exceeded the recommendation that a meal should contain less than 30% of a Guideline Daily Amount (GDA). More than half of them exceeded 50% GDA for at least one metric, including 81% of all analyses for SFA. And 17% of samples exceeded the GDA for SFA, including each of two meals that contained about twice the GDA. Over 30% samples exceeded the children's GDA for total fat or SFA. 27% of salt analyses exceeded the GDA. People in Sandwell are exposed to large portion sizes and high levels of fats and salt in takeaway foods, with levels in some foods having increased since 2010. Given this population's limited options to break out of a highly compromising environment of living simultaneously in a 'swamp' of unhealthy, readily accessible and cheap takeaways, and a 'desert' of healthy options, an immediate and innovative package of interventions is required. PMID:25885785

  19. Heritage Route

    Chlustiková, Katarína; Válová, Katarína

    2013. [Kulturstraßen als Konzept. 20 Jahre Straße der Romanik. 14.11.2013-16.11.2013, Merseburg] Grant ostatní: Culture Programme of European Commission(SI) CU7-MULT7/2010-0653/001-001 Source of funding: R - rámcový projekt EK Keywords : cultural routes * Romanesque * heritage Subject RIV: AC - Archeology, Anthropology, Ethnology

  20. Routing Protocols in MANET: Comparative Study

    Jayanti; Vikram Nandal

    2014-01-01

    A Mobile Ad Hoc Network (MANET) is composed of mobile nodes without any infrastructure like wireless access points or base stations. MANET describes wireless, mobile and multi-hop networks that operate without the benefit of any existing infrastructure except for the nodes themselves. The main goal of an ad hoc network routing protocol is to establish correct and efficient route between a pair of mobile nodes so that messages delivered within the active route timeout interval. Several protoco...

  1. Via de acesso cirúrgico posterossuperior para o tratamento das luxações acromioclaviculares: resultados de 84 casos operados Posterosuperior surgical access route for treatment of acromioclavicular dislocations: results from 84 surgical cases

    Danilo Canesin Dal Molin

    2012-10-01

    Full Text Available OBJETIVO: Avaliar os resultados do tratamento cirúrgico de 84 luxações acromioclaviculares agudas com a utilização da via de acesso posterossuperior do ombro. MÉTODOS: Foram avaliados 84 casos de luxações acromioclaviculares agudas grau III da classificação de Allman-Tossy operados de novembro de 2002 a maio de 2010. A média de idade dos pacientes foi de 34 anos. O diagnóstico foi realizado por avaliação clínica e radiográfica. Os pacientes foram operados pela mesma equipe cirúrgica em até três semanas da data do trauma realizando-se a via de acesso posterossuperior do ombro com acesso ao topo da base do processo coracoide para colocação de duas âncoras utilizadas na redução da luxação. O seguimento mínimo foi de 12 meses. A avaliação clínica-radiográfica pós-operatória foi realizada pelos critérios de Karlsson modificados e do escore da Universidade da Califórnia em Los Angeles (UCLA. RESULTADOS: Dos 84 pacientes operados, 92,8% apresentavam resultados bons ou excelentes e 7,2% de resultados regulares ou fracos pelo escore de avaliação da UCLA. Pelos critérios de Karlsson modificados 76,2% foram avaliados como grau A, 17,9% como grau B e 5,9% como grau C. CONCLUSÃO: A VIA de acesso posterossuperior do ombro é uma nova opção para acesso ao processo coracoide e tratamento das luxações acromioclaviculares, com resultados clínicos e radiográficos equivalentes aos da literatura.OBJECTIVE: To evaluate the results from surgical treatment of 84 cases of acute acromioclavicular dislocation, using a posterosuperior access route. METHODS: Eighty-four cases of acute acromioclavicular dislocation (grade III in the Allman-Tossy classification operated between November 2002 and May 2010 were evaluated. The patients' mean age was 34 years. The diagnoses were made using clinical and radiographic evaluations. The patients were operated by the same surgical team, within three weeks of the date of the trauma, using a

  2. The impact of the Medicines Control Council backlog and fast-track review system on access to innovative and new generic and biosimilar medicines of public health importance in South Africa.

    Leng, Henry Martin John; Pollock, Allyson M; Sanders, David

    2016-04-01

    The fast-track registration policy of the South African National Department of Health allows for rapid registration of new medicines of public health importance and of all medicines on the Essential Medicines List, most of which are generics. No limit is placed on the number of generic brands of a medicine that can be submitted for fast-track registration. This, together with resource constraints at the regulator, may delay access to important new medicines, new fixed-dose combinations of critical medicines or affordable versions of biological medicines (biosimilars). One reason for not limiting the number of fast-track generic applications was to promote price competition among generic brands. We found this not to be valid, since market share correlated poorly with price. Generic brands with high market share were, mostly, those that were registered first. We propose that the number of generic brands accepted for fast-tracking be limited to not more than seven per medicine. PMID:27032846

  3. A wavelength-switched time-slot routing scheme for wavelength-routed networks

    Li, CY.; Li, GM; Wai, PKA; Li, VOK

    2004-01-01

    Optical time division multiplexing (OTDM) is an effective approach to improve the performance of wavelength-routed (WR) networks. Implementation of all-optical time-slot routing in OTDM-WR networks is difficult owing to the lack of practical optical buffer and sophisticated optical processing devices. In this paper, we proposed a wavelength-switched time-slot routing scheme that can be implemented with fast wavelength converters only. Simulation results demonstrate that the performance of the...

  4. Network Resilience through Multiple Routing Configurations

    Naga Raju Pamidi

    2011-11-01

    Full Text Available We propose the use of multi-topology (MT routing for network resilience against link and node failures. We describe the multi-topologies by an n-dimensional vector of different link costs for all links in the network. It is the base for the calculation of n shortest path trees from any node to all other destinations, i.e. for n virtual routing topologies. We define the link costs in such a way that the routing topologies complement each other in the sense that at least one valid route remains in a single link or node failure scenario for each pair of nodes in at least one routing topology. In such a failure case, packets are rather deviated over the intact routing topology than discarded. The recovery speed of the presented mechanism is very fast and can be compared to fast rerouting mechanisms in MPLS, which reduce packet, drops to a minimum. In contrast to MPLS, MT routing is still a pure IP-based solution that retains the scalability and the robustness of IP routing. As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC. Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions.

  5. Fast Access to Space Tourism

    Favata', P.; Martineau, N.

    2002-01-01

    creating a revolutionary space-orbiting habitat dedicated to tourism. Up to now, such proposals have focused on two approaches. The first accounts for financial and technological constraints on space flight and living, and sacrifices creativity for practicality. The second is more utopic in nature and proposes projects, which are imaginative but unfeasible in the near future. This proposal is innovative because it considers the current obstacles to space tourism and utilizes existing technologies and infrastructures, but also includes the forethinking of futuristic commercial projects. Project Objectives: NASA claims that commercialization of space activities is so difficult that it will require decades more funding of so-called space-technology development. The benefits of this project show that this is not true. First, safety has been addressed because this proposal utilizes already space tested and assured technologies. Second, the project demonstrates potential for significant economic profit within the near future. Because we are using the least expensive technology available, we have limited start up costs. We forecast up to forty flights per year, with a potential capacity of eighty tourists. The design objectives focus on the proposal of a new approach to space tourism. These include: the expansion of the living space in the interiors, innovative and creative interior design, increased concern for the physiological and psychological comfort of tourists, and attention to entertainment possibilities. Project Content: The efficiency of the launch and configuration phase is one of the strengths of the proposed project. We propose the use of the Zenith 2 launcher, a large two-stage vehicle developed in the Soviet Union in the early 1980s, for the configuration of the orbiting platform. Following the Russian outfitting philosophy, once in orbit, the platform is already functional. The interior design is based on advanced lightweight inflatable technologies which are characterized by high packing density performance, and which decrease the mass of the module and the manufacturing costs. This reduces the overall cost, time and complexity of the configuration phase. for up to two weeks. They will be transported by two Soyuz flights. Supplies and fuel will be delivered by the Progress vehicle. The lowering of the module mass will allow extra storage volume and therefore the reduction of one logistic flight per month. production capacity. By stimulating a market use for the Soyuz and Progress, our project will increase production demand, thus, exponentially decreasing production costs over time. This private-public venture will offer Russia both significant employment opportunities as well as the investment of capital. project includes significant technological and design modifications. It utilizes traditional rigid structure but revolutionizes the interiors. In terms of engineering, the present homogeneous distribution of subsystems is replaced by a concentrated model. At the same time, we assure the facilitation of maintenance and eventual substitution of parts, through the use of mobile, modular components. Architecturally, the project is focused on the physiological and psychological needs of tourists, with particular attention paid to: circadian rhythms, and therefore, illumination, the variety of compatible materials and shapes, and noise and vibration reduction. Interchangeable and mobile furniture creates multi-functional areas, with innovative colors and details. This also guarantees the enlargement of the habitable volume in order to provide innovative tourist activities. Contributions: As stated earlier, this project, which is the result of collaboration between an engineer and an architect, reconciles the realities of current space exploration with new ideas for opening space tourism in the near future, responding to an emerging market. The project suggests a new way to utilize current technologies for commercial purposes. This facilitates cooperation between space agencies and business sectors. Such an approach

  6. Urban sidewalks: visualization and routing for individuals with limited mobility

    Bolten, Nicholas; Amini, Amirhossein; Hao, Yun; Ravichandran, Vaishnavi; Stephens, Andre; Caspi, Anat

    2016-01-01

    People with limited mobility in the U.S. (defined as having difficulty or inability to walk a quarter of a mile without help and without the use of special equipment) face a growing informational gap: while pedestrian routing algorithms are getting faster and more informative, planning a route with a wheeled device in urban centers is very difficult due to lack of integrated pertinent information regarding accessibility along the route. Moreover, reducing access to street-spaces translates to...

  7. Compressed Transmission of Route Descriptions

    Batz, Gernot Veit; Luxen, Dennis; Sanders, Peter

    2010-01-01

    We present two methods to compress the description of a route in a road network, i.e., of a path in a directed graph. The first method represents a path by a sequence of via edges. The subpaths between the via edges have to be unique shortest paths. Instead of via edges also via nodes can be used, though this requires some simple preprocessing. The second method uses contraction hierarchies to replace subpaths of the original path by shortcuts. The two methods can be combined with each other. Also, we propose the application to mobile server based routing: We compute the route on a server which has access to the latest information about congestions for example. Then we transmit the computed route to the car using some mobile radio communication. There, we apply the compression to save costs and transmission time. If the compression works well, we can transmit routes even when the bandwidth is low. Although we have not evaluated our ideas with realistic data yet, they are quite promising.

  8. Routing Proposals for Multipath Interdomain Routing

    Bilal, Sardar M.; Dilber, Muhammad Naveed; Khan, Atta ur Rehman

    2013-01-01

    Internet is composed of numbers of independent autonomous systems. BGP is used to disseminate reachability information and establishing path between autonomous systems. Each autonomous system is allowed to select a single route to a destination and then export the selected route to its neighbors. The selection of single best route imposes restrictions on the use of alternative paths during interdomain link failure and thus, incurred packet loss. Packet loss still occurs even when multiple pat...

  9. Routing in opportunistic networks

    Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

    2013-01-01

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

  10. FAST: FAST Analysis of Sequences Toolbox

    Travis J. Lawrence

    2015-05-01

    Full Text Available FAST (FAST Analysis of Sequences Toolbox provides simple, powerful open source command-line tools to filter, transform, annotate and analyze biological sequence data. Modeled after the GNU (GNU’s Not Unix Textutils such as grep, cut, and tr, FAST tools such as fasgrep, fascut, and fastr make it easy to rapidly prototype expressive bioinformatic workflows in a compact and generic command vocabulary. Compact combinatorial encoding of data workflows with FAST commands can simplify the documentation and reproducibility of bioinformatic protocols, supporting better transparency in biological data science. Interface self-consistency and conformity with conventions of GNU, Matlab, Perl, BioPerl, R and GenBank help make FAST easy and rewarding to learn. FAST automates numerical, taxonomic, and text-based sorting, selection and transformation of sequence records and alignment sites based on content, index ranges, descriptive tags, annotated features, and in-line calculated analytics, including composition and codon usage. Automated content- and feature-based extraction of sites and support for molecular population genetic statistics makes FAST useful for molecular evolutionary analysis. FAST is portable, easy to install and secure thanks to the relative maturity of its Perl and BioPerl foundations, with stable releases posted to CPAN. Development as well as a publicly accessible Cookbook and Wiki are available on the FAST GitHub repository at https://github.com/tlawrence3/FAST. The default data exchange format in FAST is Multi-FastA (specifically, a restriction of BioPerl FastA format. Sanger and Illumina 1.8+ FastQ formatted files are also supported. FAST makes it easier for non-programmer biologists to interactively investigate and control biological data at the speed of thought.

  11. Routing and scheduling problems

    Reinhardt, Line Blander

    to a destination on a predefined network, the routing and scheduling of vessels in a liner shipping network given a demand forecast to be covered, the routing of manpower and vehicles transporting disabled passengers in an airport and the vehicle routing with time windows where one version studied includes edge...

  12. Sea ice meiofauna abundance in coastal fast ice off Barrow, Alaska, with a focus on Scolelepis squamata (Polychaeta), July 12, 2005 - April 4, 2006 (NODC Accession 0064869)

    National Oceanic and Atmospheric Administration, Department of Commerce — The fast ice along the Alaskan coastline forms in November/December and reaches a thickness of 1.5-1.8m by April. Break-up usually occurs between late June and...

  13. State alternative route designations

    1989-07-01

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

  14. State alternative route designations

    1989-07-01

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

  15. Secure Routing and Identifying Hacking In P2p System

    Gowsiga Subramaniam

    2014-08-01

    Full Text Available Packet forwarding is the procedure to route the packet from source to destination via routers. Getting the systems ip address in a LAN and decides the source, destination and the intermediate systems for our routing process. Using any database form the routing table with columns like source address, destination address and router addresses. After creating the routing table enters the ip address in the respective columns. As per this procedure by comparing ip addresses in the routing table the packet will be forward to next ip address. The ip addresses in the routing table, are the path selected by the user according to the respective path the packet will be forward and finally reach destination. Source generate a packet and forward to ip address which is in router ip as per in routing table. Source need to know whether the packet received by authenticated router or not thus each router send an acknowledgement packet to the source. Thus each and every router follows the same procedure to avoid unauthenticated router access in a routing process. As per acknowledgement received from each router source finds out the unauthenticated router access. As per security concern added the signature scheme in a routing process. Before send the packet, source generates the signature with peer ID of destination then forwards the packet to the ip address as per routing table. The packet will be decrypted only the system matched with the signature otherwise just forwards the packet to the next system. Tracer routing is to find out the unauthorized router access in a routing process. This is verifying by getting acknowledgment from each and every router in the routing process by a source. Then source compare the acknowledgement with the predefined routing table if any ip mismatch then it will be consider as unauthorized ip.

  16. Route Scherrer and Route Einstein closed for construction work

    2015-01-01

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

  17. IPv6 Network Mobility Route Optimization Survey

    Samer S. Hassan

    2011-01-01

    Full Text Available Problem statement: This study describes that the Next Generation of Networks (NGN communication will supports multiple technologies, handles the mobility of end users to move through heterogeneous access networks, with ability to connect to different networks. Where the Internet Engineer Task Force maintain (IETF the Mobile IPv6 (MIPv6 to handles the mobility of networks (NEMO, to provide wide band and more scalable network services. One of the MIPv6 built-in features is Route Optimization (RO to solve the inefficient route problem. Conclusion/Recommendations: The main objective of this article is to survey, classify and make a compression between the available schemes for route optimization over the last years depends on the basic criteria generated from the published articles within different network topology. This article presents the problem of suboptimal route which is further increased with increasing of nesting levels and there is no such one scheme is perfect for all network environments.

  18. Traffic-Adaptive Routing

    Kammenhuber, Nils

    2011-01-01

    Despite the bursty and highly volatile traffic, routing in the Internet today is optimised only on coarse time scales, as load-adaptive routing is known to induce performance deterioration by causing massive oscillations. We describe ReplEx, an universally applicable distributed algorithm for dynamic routing/traffic engineering, which is based on game theory. We show through extensive realistic simulations that ReplEx does not oscillate, and that it achieves performance gains comparable to tr...

  19. Contact Graph Routing

    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

  20. Hyperview-fast, economical access to large data sets: a system for the archiving and distribution of hyperspectral data sets and derived products

    Lurie, Joan B.

    1996-12-01

    TRW, under a Small Satellite Technology Initiative (SSTI) contract, is building the Lewis satellite. The principal sensor on Lewis is a hyperspectral imaging spectrometer. Part of the SSTI mission is to establish the commercial and educational utility of this data and the hyperspectral data already being acquired on airborne platforms. Essential requirements are rapid availability (after data acquisition) and easy accessibility to a catalog of images and imagery products. Each image is approximately 256 by 512 pixels with 384 bands of data acquired at each pixel. For some applications, some users will want the entire data sets; in other cases partial data sets (e.g. three band images) will be all that a user can handle or need for a given application. In order to make the most effective use of this new imagery and justify the cost of collecting it, we must find ways to make the information it contains more readily accessible to an ever broadening community of potential users. Tools are needed to store, access, and communicate the data more efficiently, to place it in context, and to derive both qualitative and quantitative information from it. A variety of information products which address the specific needs of particular user communities will be derived from the imagery. The data is unique in its ability to provide high spatial and spectral resolution simultaneously, and shows great promise in both military and civilian applications. A data management and analysis system has been built at TRW. This development has been prompted by the business opportunities, by the series of instruments built here and by the availability of data from other instruments. The products of the processing system have been shown to prospective customers in the U.S. and abroad. The system has been used to process data produced by TRW sensors and other instruments. This paper provides an overview of the TRW hyperspectral collection, data handling and exploitation capability.

  1. FAST DISSOLVING TABLETS: NEEDS TO ENHANCE BIOAVAILABILITY

    Raj Kumari; Chandel Priya; Kapoor Ankita

    2013-01-01

    Oral route is the most important and preferred route for drug administration due to the convenience, ease of administration and patient compliance. Tablet is the most preferred conventional oral unit dosage form. During tablet administration dysphasia is the main problem. Fast dissolving tablets can reduce this problem by dissolving and disintegrating rapidly within few seconds in mouth without water. Fast dissolving tablets become advantageous for those patients which have swallowing problem...

  2. A wide dynamics and fast scan interrogating method for a fiber Bragg grating sensor network implemented using code division multiple access.

    Kim, Youngbok; Jeon, Sie-Wook; Kwon, Won-Bae; Park, Chang-Soo

    2012-01-01

    We propose and demonstrate a fiber Bragg grating (FBG) sensor network employing the code division multiple access (CDMA) technique to identify information from individual sensors. To detect information without considering time delays between sensors, a sliding correlation method is applied, in which two different signals with the same pseudo-random binary sequence (PRBS) pattern, but slightly different frequencies, are applied to the source and detector sides. Moreover, for time domain detection, a wavelength-to-time conversion technique using a wavelength dispersive medium is introduced. The experimental results show that the proposed sensor network has a wide strain dynamic range of 2,400 με and a low crosstalk of 950:1. PMID:22778619

  3. A Wide Dynamics and Fast Scan Interrogating Method for a Fiber Bragg Grating Sensor Network Implemented Using Code Division Multiple Access

    Chang-Soo Park

    2012-05-01

    Full Text Available We propose and demonstrate a fiber Bragg grating (FBG sensor network employing the code division multiple access (CDMA technique to identify information from individual sensors. To detect information without considering time delays between sensors, a sliding correlation method is applied, in which two different signals with the same pseudo-random binary sequence (PRBS pattern, but slightly different frequencies, are applied to the source and detector sides. Moreover, for time domain detection, a wavelength-to-time conversion technique using a wavelength dispersive medium is introduced. The experimental results show that the proposed sensor network has a wide strain dynamic range of 2,400 μe and a low crosstalk of 950:1.

  4. Genetic algorithms for the vehicle routing problem

    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.

  5. The impact of the migration processes on the low cost airlines’ routs between EU countries and Poland after its accession to the EU, and on the territorial cohesion of Polish regions.

    Olipra, Lukasz; Pancer-Cybulska, Ewa; Szostak, Ewa

    2011-01-01

    After the accession of Poland to the European Union in 2004 we could observe two phenomena: huge emigration of Poles to the old member states of the EU (mainly to United Kingdom and Ireland) and on the second hand a very dynamic increase in the number of flight destinations from regional airports served by low cost carriers (what meant also increase in the number of passengers). The aim of this article is to answer the question, whether directions of the emigration after accession of Poland t...

  6. Understanding individual routing behaviour.

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

    2016-03-01

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

  7. Sleep-Route: Routing through Sleeping Sensors

    Sarkar, Chayan; Rao, Vijay S.; Prasad, R. Venkatesha

    2014-01-01

    In this article, we propose an energy-efficient data gathering scheme for wireless sensor network called Sleep-Route, which splits the sensor nodes into two sets - active and dormant (low-power sleep). Only the active set of sensor nodes participate in data collection. The sensing values of the dormant sensor nodes are predicted with the help of an active sensor node. Virtual Sensing Framework (VSF) provides the mechanism to predict the sensing values by exploiting the data correlation among ...

  8. Dahomey Breeding Bird Survey Route

    US Fish and Wildlife Service, Department of the Interior — Document contains route directions and map for the naitonal Dahomey BBS route. Includes milage for where specific listening stations are located along the route...

  9. Class network routing

    Bhanot, Gyan; Blumrich, Matthias A.; Chen, Dong; Coteus, Paul W.; Gara, Alan G.; Giampapa, Mark E.; Heidelberger, Philip; Steinmacher-Burow, Burkhard D.; Takken, Todd E.; Vranas, Pavlos M.

    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.

  10. Modeling Routing Overhead Generated by Wireless Reactive Routing Protocols

    Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A

    2011-01-01

    In this paper, we have modeled the routing over- head generated by three reactive routing protocols; Ad-hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR) and DYnamic MANET On-deman (DYMO). Routing performed by reactive protocols consists of two phases; route discovery and route maintenance. Total cost paid by a protocol for efficient routing is sum of the cost paid in the form of energy consumed and time spent. These protocols majorly focus on the optimization performed by expanding ring search algorithm to control the flooding generated by the mechanism of blind flooding. So, we have modeled the energy consumed and time spent per packet both for route discovery and route maintenance. The proposed framework is evaluated in NS-2 to compare performance of the chosen routing protocols.

  11. Modeling Routing Overhead Generated by Wireless Proactive Routing Protocols

    Javaid, Nadeem; Javaid, Akmal; Malik, Shahzad A

    2011-01-01

    In this paper, we present a detailed framework consisting of modeling of routing overhead generated by three widely used proactive routing protocols; Destination-Sequenced Distance Vector (DSDV), Fish-eye State Routing (FSR) and Optimized Link State Routing (OLSR). The questions like, how these protocols differ from each other on the basis of implementing different routing strategies, how neighbor estimation errors affect broadcast of route requests, how reduction of broadcast overhead achieves bandwidth, how to cope with the problem of mobility and density, etc, are attempted to respond. In all of the above mentioned situations, routing overhead and delay generated by the chosen protocols can exactly be calculated from our modeled equations. Finally, we analyze the performance of selected routing protocols using our proposed framework in NS-2 by considering different performance parameters; Route REQuest (RREQ) packet generation, End-to-End Delay (E2ED) and Normalized Routing Load (NRL) with respect to varyi...

  12. Estudo anatômico da via de acesso suprapatelar lateral para a haste intramedular bloqueada na fratura da tíbia Anatomical study on the lateral suprapatellar access route for locked intramedullary nails in tibial fractures

    Italo Scanavini Cerqueira

    2012-04-01

    Full Text Available OBJETIVO: A haste intramedular (HIM é o padrão ouro no tratamento das fraturas diafisárias da tíbia. Uma das complicações frequentes é a dor no joelho após o procedimento. MÉTODOS: Vias alternativas, como a suprapatelar para a introdução da haste como opção para evitar a dor no joelho no período pós-operatório tardio, têm sido estudadas. A questão é se nesta nova via ocorre alguma lesão às estruturas intra-articulares do joelho. RESULTADOS: Este estudo analisa a via suprapatelar e o risco para as estruturas adjacentes através da sua reprodução em 10 joelhos de cinco cadáveres. CONCLUSÃO: Foi visto facilidade para a localização do ponto de entrada por esta via, lesando apenas a gordura de Hoffa. Em três dos nossos casos houve lesão da superfície condral, sendo um obstáculo de difícil transposição e indicando necessidade de fabricação de material específico para minimizar a lesão das estruturas intra-articulares por essa via.OBJECTIVE: Intramedullary nails are the gold standard for treating tibial shaft fractures. Knee pain is a frequent complication after the procedure. Alternative routes such as the suprapatellar approach for nail insertion are seen as an option for avoiding late postoperative knee pain. The question is whether this approach might give rise to any injury to intra-articular structures of the knee. METHODS: This study analyzed the suprapatellar approach and the risk to adjacent structures by reproducing it in 10 knees of five cadavers. RESULTS: This approach was seen to make it easy to locate the entry point, with lesions only occurring in the Hoffa fat. In three of our cases, there were lesions of the chondral surface, which is an obstacle that is difficult to overcome. CONCLUSION: There is a need to develop specific material to minimize injury to intra-articular structures when using this route.

  13. Advanced routing protocols for wireless networks

    Campista , Miguel Elias Mitre

    2014-01-01

    This text introduces the principles of routing protocols and metrics as they affect wireless networking environments, specifically in urban areas. Timely because of the recent rise in small city life, this topic includes the consideration of ad hoc, mesh, vehicular, sensor, and delay tolerant networks. These approaches are each unique, and author Miguel Mitre Campista provides a thorough, but accessible, explanation of their individual characteristics for engineers, computer scientists, IT professionals, and curious Internet users.

  14. A Fast Algorithm for Railway Route Planning on Restricted Network%限制网络上的铁路旅程规划快速求解算法

    林冬梅; 刘军

    2013-01-01

    以服务网络设计理论为指导,构建基于铁路列车网的换乘服务网络.以出行方案目标权重值最小为目标函数,在旅客指定始发站、终到站、不限定中转地点的条件下,建立铁路旅程规划问题模型.提出换乘节点匹配法,通过匹配列车发到站的衔接关系,得出始发终到车站间的所有可行出行方案,然后按一定的筛选原则剔除明显不合理方案,最终根据目标权值对方案进行排序,得到K优解.算法用Python语言编程实现,以2010年我国铁路客票系统的数据验算,可实现不指定换乘地点条件下的同城换乘方案计算,向旅客提供出行方案参考.算法不仅适合高速计算设备,也适用于有限计算能力的移动设备.%According to Service Network Design theories, a railway transit service network was constructed out of train timetables. Taking the minimum of the travel plan's weight as the objective function, given a specific origin and destination without designated transfer nodes, a model for railway route planning was established. Transfer node matching was proposed to acquire all feasible travel plans by searching connecting trains arriving at and depart from a same transfer node. Then according to certain filters, a considerable amount of unfavorable travel plans were removed. K optimal travel plans were obtained by ordering the remaining travel plans by objective weights. The algorithm was implemented using Python programming language with the 2010 data of the China Railway Ticketing System. Results show that without designating transfer nodes, travel plans with co-terminal transfer(s) can be calculated and provided as references for passengers. Efficiency of this algorithm is notably improved compared to existing researches. The algorithm can be applied in both high-speed computing devices and mobile devices with computing limits.

  15. Multihop Wireless Networks Opportunistic Routing

    Zeng, Kai; Li, Ming

    2011-01-01

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

  16. Collective network routing

    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.

  17. Roots and routes

    Christensen, Ann-Dorte; Jensen, Sune Qvotrup

    2011-01-01

    arguing that there is a dynamic interplay between roots and routes in people's lives. The empirical point of departure is narratives about roots and routes by ethnic minorities settled in Aalborg East, an underprivileged neighbourhood in northern Denmark. One of the main findings is a gap between the...... somewhat paradoxical finding is that it appears to be more difficult for transnational migrants to maintain their roots in the country of origin when they go back than it was to establish new roots in the host country...

  18. Torch Route Twist

    2008-01-01

    San Francisco changes Olympic flame route due to security fears The city of San Francisco,the only North American stop for the 2008 Beijing Olympic torch,surprised thousands of supporters,demon- strators and visitors on April 9,by com- pletely changing the planned torch route at the last minute without notification. As scheduled,the torch was expected to start from the McCovey Cove in the south- east of the city at 1:00 p.m.before heading along the waterfront northbound to famous tourist spot Fisherman’s Wharf and finally

  19. Route based forecasting

    Zuurendonk, I. W.; Wokke, M. J. J.

    2009-09-01

    Road surface temperatures can differ several degrees on a very short distance due to local effects. In order to get more insight in the local temperature differences and to develop safer gritting routes, Meteogroup has developed a system for route based temperature forecasting. The standard version of the road model is addressed to forecast road surface temperature and condition for a specific location. This model consists of two parts. First a physical part, based on the energy balance equations. The second part of the model performs a statistical correction on the calculated physical road surface temperature. The road model is able to create a forecast for one specific location. From infrared measurements, we know that large local differences in road surface temperature exist on a route. Differences can be up to 5 degrees Celsius over a distance of several hundreds of meters. Based on those measurements, the idea came up to develop a system that forecasts road surface temperature and condition for an entire route: route based forecasting. The route is split up in sections with equal properties. For each section a temperature and condition will be calculated. The main factors that influence the road surface temperature are modelled in this forecasting system: •The local weather conditions: temperature, dew point temperature, wind, precipitation, weather type, cloudiness. •The sky view: A very sheltered place will receive less radiation during daytime and emit less radiation during nighttime. For a very open spot, the effects are reversed. •The solar view: A road section with trees on the southern side, will receive less solar radiation during daytime than a section with tress on the southern side. The route based forecast shows by means of a clear Google Maps presentation which sections will be slippery at what time of the coming night. The final goal of this type of forecast, is to make dynamical gritting possible: a variable salt amount and a different

  20. SET-Routes programme

    Marietta Schupp, EMBL Photolab

    2008-01-01

    Dr Sabine Hentze, specialist in human genetics, giving an Insight Lecture entitled "Human Genetics – Diagnostics, Indications and Ethical Issues" on 23 September 2008 at EMBL Heidelberg. Activities in a achool in Budapest during a visit of Angela Bekesi, Ambassadors for the SET-Routes programme.

  1. SET-Routes programme

    CERN audiovisual service

    2009-01-01

    The SET-Routes programme, launched in 2007 with the goal of attracting girls and young women to careers in science, came to an end in April this year. The result of a collaboration between EMBL, EMBO and CERN, the programme established a network of "ambassadors", women scientists who went out to talk about their careers in science at schools and universities across Europe.

  2. Whirlpool routing for mobility

    Lee, Jung Woo

    2010-01-01

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

  3. Issues of Routing in VANET

    Raja, Umar Waqas; Mustafa, Bilal

    2010-01-01

    Vehicular Ad Hoc Network (VANET) is a sub class of mobile ad hoc networks. VANET provides wireless communication among vehicles and vehicle to road side equipments. The communication between vehicles is used for safety, comfort and for entertainment as well. The performance of communication depends on how better the routing takes place in the network. Routing of data depends on the routing protocols being used in network. In this study we investigated about different ad hoc routing protocols ...

  4. Alternative iron making routes

    Kaushik, P.; Sharma, T. [Indian School of Mines, Dhanbad (India)

    2002-07-01

    The versatile route of iron production 'blast furnace' technique is being replaced by widely accepted Corex technology, Midrex process using Fastmelt ironmaking, eco-friendly Romelt process, more innovative Ausmelt & Hismelt technology, TATA KORF Mini blast furnace improvement, 'quickest iron through Orbiting Plasma', Direct iron ore smelting process, Conred, AISI-Hyl, Inred processes, Direct iron ore reduction methods, their comparison and proposed modifications. 18 refs., 11 figs., 14 tabs.

  5. Energy-Efficient Routing in GMPLS Network

    Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée;

    2011-01-01

    In this paper, a GMPLS controlled core network model that takes energy efficiency into account is built using OPNET MODELER. By extending the standard GMPLS routing protocol -- OSPF-TE, we are able to spread desired energy related information over the local area, and subsequently use RSVP-TE for...... connection setup. The OSPF designing process of the simulation model is given in details, including necessary simplifications to enable a fast implementation while keeping the key characteristics of the GMPLS protocol behaviors. The efficiency of the proposed extensions are analyzed, and improved energy...... efficiency is shown through the results collected from OPNET MODELER simulation models....

  6. A Genetic Algorithm for Delay-constrained Least-cost Multicast Routing

    2000-01-01

    The delay-constrained least-cost multicast routing problem is introduced and then a related genetic algorithm is proposed. Finally, simulation results are shown to prove that the genetic algorithm is fast and effective.

  7. Effective local dynamic routing strategy for air route networks

    Wu Wenjun; Zhao Lingxi

    2015-01-01

    With the rapid development of air transportation, network service ability has attracted a lot of attention in academe. Aiming to improve the throughput of the air route network (ARN), we propose an effective local dynamic routing strategy in this paper. Several factors, such as the rout-ing distance, the geographical distance and the real-time local traffic, are taken into consideration. When the ARN is in the normal free-flow state, the proposed strategy can recover the shortest path routing (SPR) strategy. When the ARN undergoes congestion, the proposed strategy changes the paths of flights based on the real-time local traffic information. The throughput of the Chinese air route network (CARN) is evaluated. Results confirm that the proposed strategy can significantly improve the throughput of CARN. Meanwhile, the increase in the average flying distance and time is tiny. Results also indicate the importance of the distance related factors in a routing strategy designed for the ARN.

  8. Bionic Optimization Based Stability and Congestion Aware Routing Algorithm for Airborne Highly Dynamic Network

    Yunlong Yu; Le Ru; Sheng Mao; Kangning Sun; Qiangqiang Yu; Kun Fang

    2016-01-01

    Airborne highly dynamic ad hoc UAV network has features of high node mobility, fast changing network topology, and complex application environment. The performance of traditional routing algorithms is so poor over aspects such as end to end delay, data packet delivery ratio, and routing overhead that they cannot provide efficient communication for multi-UAVs carrying out missions synergistically. A bionic optimization based stability and congestion aware routing algorithm—BSCAR algorithm—is p...

  9. ZERO: Probabilistic Routing for Deploy and Forget Wireless Sensor Networks

    Jose Carlos Pacho

    2010-09-01

    Full Text Available As Wireless Sensor Networks are being adopted by industry and agriculture for large-scale and unattended deployments, the need for reliable and energy-conservative protocols become critical. Physical and Link layer efforts for energy conservation are not mostly considered by routing protocols that put their efforts on maintaining reliability and throughput. Gradient-based routing protocols route data through most reliable links aiming to ensure 99% packet delivery. However, they suffer from the so-called ”hot spot” problem. Most reliable routes waste their energy fast, thus partitioning the network and reducing the area monitored. To cope with this ”hot spot” problem we propose ZERO a combined approach at Network and Link layers to increase network lifespan while conserving reliability levels by means of probabilistic load balancing techniques.

  10. Stochastic vehicle routing with recourse

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

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage problem, where demand is satisfied using two routes: fixed and recourse. The fixed route is computed using only a demand distribution. Then after observing the demand...... instantiations, a recourse route is computed - but costs here become more expensive by a factor λ. We present an O(log2n ·log(nλ))-approximation algorithm for this stochastic routing problem, under arbitrary distributions. The main idea in this result is relating StochVRP to a special case of submodular...

  11. Robustness of airline route networks

    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.

  12. A fast-slow logic system

    A fast-slow logic system has been made for use in multi-detector experiments in nuclear physics such as particle-gamma and particle-particle coincidence experiments. The system consists of a fast logic system and a slow logic system. The fast logic system has a function of fast coincidences and provides timing signals for the slow logic system. The slow logic system has a function of slow coincidences and a routing control of input analog signals to the ADCs. (auth.)

  13. Personal continuous route pattern mining

    Qian YE; Ling CHEN; Gen-cai CHEN

    2009-01-01

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

  14. A Recovery Method for Greedy Routing Protocols in Web Communications

    Sheetal Kaushik

    2012-01-01

    Full Text Available Greedy Perimeter Stateless Routing (GPSR protocol is an appropriate and the most well-known routing protocol for high mobile vehicular ad-hoc networks. The protocol includes two routing modes, the greedy mode and the recovery mode, and utilizes a neighbor list to make a route decision. However, not only does the neighbor list in the protocol involve stale neighbor information, but also the stale nodes inherit a higher selection priority in the greedy mode according to the routing policy; besides, the useful redundant route information can be eliminated during planarization in the recovery mode. To overcome those problems, we propose a new recovery mode, named as Greedy Border Superiority Routing (GBSR, along with an Adaptive Neighbor list Management (ANM scheme. A node generates aborder superior graph instead of generating a planar graph whenthe node faces the local maximum. Packets in the recovery modecan escape from the recovery mode as fast as possible using thegraph. Here, GBSR protocol has the same assumption as that ofGPSR, and does not require any additional information. With anetwork simulator, GBSR and ANM are evaluated using two vehicle mobility scenarios. GBSR shows higher network performance in comparison with GPSR protocol. In addition, we accomplish a nearly stale-free neighbor list using the ANM scheme.

  15. Linear Network Fractional Routing

    S.ASOKAN,

    2011-07-01

    Full Text Available A Network is a finite directed acyclic graph with source messages from a fixed alphabet and message demands at sink nodes. Linear Programming is an algorithm design method. It can be used whenthe solution to a problem can be viewed as the result of a sequence of decisions. The Linear Programming model for the network problem where in every variable has a value one or zero. The problem is todetermine a method of transmitting the messages through the network such that all sink demands are satisfied. We will prove fractional routing capacity for some solvable network using Linear Programmingmodel.

  16. Uncovering the Missing Routes

    Tsirogiannis, Constantinos; Tsirogiannis, Christos

    2016-01-01

    In the present work we model and analyse the global network of the illegal trade in antiquities. Our goal is to use this network to estimate for any given artefact the potential sequence of people in the network among whom this artefact was traded. For this reason, we have implemented and evaluated...... three different algorithms that estimate potential trade routes within the network. We also evaluate the performance of a popular method that estimates direct links in the network, links which may not have been documented in the police records....

  17. Effective ANT based Routing Algorithm for Data Replication in MANETs

    N.J. Nithya Nandhini

    2013-12-01

    Full Text Available In mobile ad hoc network, the nodes often move and keep on change its topology. Data packets can be forwarded from one node to another on demand. To increase the data accessibility data are replicated at nodes and made as sharable to other nodes. Assuming that all mobile host cooperative to share their memory and allow forwarding the data packets. But in reality, all nodes do not share the resources for the benefits of others. These nodes may act selfishly to share memory and to forward the data packets. This paper focuses on selfishness of mobile nodes in replica allocation and routing protocol based on Ant colony algorithm to improve the efficiency. The Ant colony algorithm is used to reduce the overhead in the mobile network, so that it is more efficient to access the data than with other routing protocols. This result shows the efficiency of ant based routing algorithm in the replication allocation.

  18. The Adversarial Route Analysis Tool: A Web Application

    Casson, William H. Jr. [Los Alamos National Laboratory

    2012-08-02

    The Adversarial Route Analysis Tool is a type of Google maps for adversaries. It's a web-based Geospatial application similar to Google Maps. It helps the U.S. government plan operations that predict where an adversary might be. It's easily accessible and maintainble and it's simple to use without much training.

  19. Asymmetric effect of route-length difference and bottleneck on route choice in two-route traffic system

    Hino, Yuki; Nagatani, Takashi

    2015-06-01

    We study the traffic behavior in the asymmetric two-route traffic system with real-time information. In the asymmetric two-route system, the length on route A is different from that on route B and there exists a bottleneck on route A. We extend the symmetric two-route dynamic model to the asymmetric case. We investigate the asymmetric effects of the route-length difference and bottleneck on the route choice with real-time information. The travel time on each route depends on the road length, bottleneck, and vehicular density. We derive the dependence of the travel time and mean density on the route-length ratio. We show where, when, and how the congestion occurs by the route choice in the asymmetric two-route system. We clarify the effect of the route-length ratio on the traffic behavior in the route choice.

  20. Central Control Over Distributed Routing

    Vissicchio, Stefano; Tilmans, Olivier; Vanbever, Laurent; Rexford, Jennifer; ACM SIGCOMM

    2015-01-01

    Centralizing routing decisions offers tremendous flexibility, but sacrifices the robustness of distributed protocols. In this paper, we present Fibbing, an architecture that achieves both flexibility and robustness through central control over distributed routing. Fibbing introduces fake nodes and links into an underlying link-state routing protocol, so that routers compute their own forwarding tables based on the augmented topology. Fibbing is expressive, and readily supports flexible load b...

  1. Alternative routes of insulin delivery

    Ranjith K. Krishnankutty; Aju Mathew; Saikiran K. Sedimbi; Shrikumar Suryanarayan; Carani B. Sanjeevi

    2009-01-01

    Parenteral route of insulin administration has been the mode of treatment for all Type 1 diabetics and Type 2 diabetics with complications. Patient compliance has really been a major concern for this route of administration. Several alternative routes of administration are under consideration for effective glycemic control, including oral, inhaled, buccal, nasal, and patch routes. One of the approaches involving inhaled insulin has now reached the market. Several other candidates may reach the market in the near future, the promising one being oral insulin.

  2. Southern States' Routing Agency Report

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

  3. A Primer of Multicast Routing

    Rosenberg, Eric

    2012-01-01

    Whereas unicast routing determines a path from one source node to one destination node, multicast routing determines a path from one source to many destinations, or from many sources to many destinations. We survey multicast routing methods for when the set of destinations is static, and for when it is dynamic. While most of the methods we review are tree based, some non-tree methods are also discussed. We survey results on the shape of multicast trees, delay constrained multicast routing, aggregation of multicast traffic, inter-domain multicast, and multicast virtual private networks. We focu

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

    Patrick Booz

    2016-06-01

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

  5. Secure Routing in Wireless Mesh Networks

    Sen, Jaydip

    2011-01-01

    Wireless mesh networks (WMNs) have emerged as a promising concept to meet the challenges in next-generation networks such as providing flexible, adaptive, and reconfigurable architecture while offering cost-effective solutions to the service providers. Unlike traditional Wi-Fi networks, with each access point (AP) connected to the wired network, in WMNs only a subset of the APs are required to be connected to the wired network. The APs that are connected to the wired network are called the Internet gateways (IGWs), while the APs that do not have wired connections are called the mesh routers (MRs). The MRs are connected to the IGWs using multi-hop communication. The IGWs provide access to conventional clients and interconnect ad hoc, sensor, cellular, and other networks to the Internet. However, most of the existing routing protocols for WMNs are extensions of protocols originally designed for mobile ad hoc networks (MANETs) and thus they perform sub-optimally. Moreover, most routing protocols for WMNs are des...

  6. Route Elimination Heuristic for Vehicle Routing Problem with Time Windows

    Sándor Csiszár

    2005-11-01

    Full Text Available The paper deals with the design of a route elimination (RE algorithm for thevehicle routing problem with time windows (VRPTW. The problem has two objectives, oneof them is the minimal number of routes the other is the minimal cost. To cope with theseobjectives effectively two-phase solutions are often suggested in the relevant literature. Inthe first phase the main focus is the route elimination, in the second one it is the costreduction. The algorithm described here is a part of a complete VRPWT study. The methodwas developed by studying the graph behaviour during the route elimination. For thispurpose a model -called “Magic Bricks” was developed. The computation results on theSolomon problem set show that the developed algorithm is competitive with the best ones.

  7. Inter-Domain Routing Under Scrutiny: Routing Models and Alternative Routing Architectures

    Mühlbauer, Wolfgang

    2010-01-01

    Inter-Domain Routing, also die Verkehrslenkung zwischen Autonomen Systemen (ASen), ist seit Jahren ein lebendiges Forschungsgebiet. Hauptursache hierfür ist dessen Komplexität: Zusammenspiel zwischen Interior und Exterior Gateway Protokollen, eine Vielfalt unterschiedlicher Routing Policies, komplexe Verbindungsstrukturen zwischen ASen, usw. Ein wesentliches Ziel der vorliegenden Dissertation besteht in einem verbesserten Allgemeinverständnis des Inter-Domain Routings. Desweiteren werden neua...

  8. A Reliable Routing Protocol for Wireless Vehicular Networks

    Mohsen Madani

    2012-07-01

    Full Text Available Recently, much attention has been paid to Vehicular Ad hoc Network (VANET. VANETs address direct communication between vehicle-to-vehicle and vehicles to roadside units (RSUs. They are similar to the Mobile and Ad hoc Networks (MANET in their rapid and dynamic network topology changes due to the fast motion of nodes. High mobility of nodes and network resources limitations have made the routing, one of the most important challenges in VANET researches. Therefore, guaranteeing a stable and reliable routing algorithm over VANET is one of the main steps to realize an effective vehicular communications. In this paper, a two-step AODV-based routing protocol is proposed for VANET networks. At first, node-grouping is done using their mobility information such as speed and movement direction. If the first step cannot respond efficiently, the algorithm enters the second step which uses link expiration time (LET information in the formation of the groups. The goal of the proposed protocol is increasing the stability of routing algorithm by selecting long-lived routes and decreasing link breakages. The comparison of proposed algorithm with AODV and DSR protocols is performed via the Network Simulator NS-2. It is shown that the proposed algorithm increases the delivery ratio and also decreases the routing control overhead.

  9. Routing Discovery Algorithm Using Parallel Chase Packet

    Amera Al-Ameri; Muneer Bani Yassein; Khamayseh, Yaser M.

    2013-01-01

    On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV) initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been...

  10. Producing gestures facilitates route learning.

    Wing Chee So

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

  11. Producing gestures facilitates route learning.

    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

  12. Perception bias in route choice

    Vreeswijk, J.D.; Thomas, T.; Berkum, van E.C.; Arem, van B.

    2014-01-01

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

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

    Nguyen Thanh Long

    2015-02-01

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

  14. Generalized Maneuvers in Route Planning

    Hlineny, Petr

    2011-01-01

    We study an important practical aspect of the route planning problem in real-world road networks -- maneuvers. Informally, maneuvers are walks that might either decrease or increase the weight of a route by additional costs. One can model a wide range of route restrictions or traffic regulations by maneuvers. For instance turn-prohibitions, traffic light delays, round-abouts, forbidden passages and so on. A new approach to tackle maneuvers during route planning queries without prior adjustments of the underlying road network graph is presented. First, a generic maneuver is defined so that we are able to model almost arbitrarily complex route restriction. In the rest we show how to modify Dijkstra's algorithm to respect maneuvers together with a formal proof of correctness and a complexity analysis of our algorithm.

  15. Security Consideration With Dynamic Routing

    VISWESWARARAO BOLLA

    2012-03-01

    Full Text Available One of the major issues for data communication over wired and wireless networks is the security. the past work is on the designs of cryptography algorithms and system infrastructures. Dynamic routing algorithm called improved dynamic routing with security consideration, which is based on the concept of Zone Routing Protocol (ZRP that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol (RIP in wired networks and Destination-Sequenced Distance Vector (DSDV protocol in wireless networks, without introducing extra control messages. This algorithm is mainly proposed to improve the and to overcome the limitations existing with the present cryptographic algorithms and protocols. Although some designs like IP security, Secure Socket Layer provide essential security, E-Mail security they unavoidably introduce substantial overheads in the Gateway/Host performance and effective network bandwidths.

  16. Vehicle Routing With User Generated Trajectory Data

    Ceikute, Vaida; Jensen, Christian S.

    shortest nor fastest, indicating that drivers value route properties that are diverse and hard to quantify or even identify. We propose a routing service that uses an existing routing service while exploiting the availability of historical route usage data from local drivers. Given a source and destination......, the service recommends a corresponding route that is most preferred by local drivers. It uses a route preference function that takes into account the number of distinct drivers and the number of trips associated with a route, as well as temporal aspects of the trips. The paper provides empirical...... studies with real route usage data and an existing online routing service....

  17. A Complete Study on Unipath Routing Protocols in MANETs

    D.Ganesh Kumar

    2013-12-01

    Full Text Available Mobile Ad hoc network is a cluster of wireless mobile nodes making a network with dynamically changing topology without using any permanent access point as a base station. To create connectivity among nodes more than single hop is needed due to low transmission range. Increasing of mobile nodes enhances this overhead. Many standards have been developed for transmission and to find effective routes from a source to some destination. In this paper, we have analyzed the main protocols and issues of routing in MANETs.

  18. Simulation Results of the OLSR Routing Protocol for Wireless Network

    Laouti, Anis; Mühlethaler, Paul; Najid, Abdellah; Plakoo, Epiphane

    2002-01-01

    In this research report, we present simulation results for the Optimized Link State Routing protocol: «OLSR». «OLSR» is a routing protocol currently submitted at the IETF in the Mobile Ad-hoc NETwork workgroup. «OLSR» is a proactive protocol, thus it periodically sends «control» packets to build and up-date the topolgy. The aim of this article is to study the performance of the OLSR protocol. Although most of the results that we show remain valid for any kind of above medium access control an...

  19. Reliable Point to Multipoint Hierarchical Routing in Scatternet Sensor Network

    R.Dhaya

    2011-01-01

    Full Text Available In the recent development of communication, Bluetooth Scatternet wireless is a technology developed for wideband local accesses. Bluetooth technology is very popular because of its low cost and easy deployment which is based on IEEE 802.11standards. On the other hand Wireless Sensor Network (WSN consists of large number of sensor nodes distributed to monitor an environment and each node in a WSN consists of a small CPU, a sensing device and battery. Mostly, the sensor networks are distributed in an inconvenient location and it is difficult to recharge often. So routing in WSN is an important issue to consume energy and as well as to increase the life of the network, since a routing protocol finds the path between sources and sink. Moreover it is a challenging task to schedule the data between nodes in a scatternet in a congestive environment. Here this paper presents a new scheduling method for point to multi- point routing in Scatternet sensor network and the new dynamic routing method designed is cluster-based with hierarchical routing. The efficiency of this method is also compared in terms of energy consumption and the results show that the proposed routing is an energy efficient one which simultaneously increases the lifetime of the network.

  20. Open access

    Dorch, Bertil Fabricius; Demaio, Alessandro; Hersch, Fred

    2012-01-01

    This week, we celebrate open access week – an event aimed at bringing attention to this rapidly emerging form of scientific publication and its ethical imperatives. Traditionally, knowledge breakthroughs and scientific discoveries are shared through publication in academic journals. Peer...... ideas, break down barriers to science and make knowledge accessible to the masses – but this is not actually the case....

  1. Open Access

    Suber, Peter

    2012-01-01

    The Internet lets us share perfect copies of our work with a worldwide audience at virtually no cost. We take advantage of this revolutionary opportunity when we make our work "open access": digital, online, free of charge, and free of most copyright and licensing restrictions. Open access is made possible by the Internet and copyright-holder…

  2. Road Routes for Waste Disposal - MDC_RecyclingRoute

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

  3. Stable Infrastructure-based Routing for Intelligent Transportation Systems

    Al-Kubati, Gubran; Mackenzie, Lewis; Pezaros, Dimitrios P.; Al-Dubai, A.

    2015-01-01

    Intelligent Transportation Systems (ITSs) have been instrumental in reshaping transportation towards safer roads, seamless logistics, and digital business-oriented services under the umbrella of smart city platforms. Undoubtedly, ITS applications will demand stable routing protocols that not only focus on Inter-Vehicle Communications but also on providing a fast, reliable and secure interface to the infrastructure. In this paper, we propose a novel stable infrastructure- ...

  4. Critical Route Network for Earthquake Response and Dynamic Route Analysis

    Peeta, Srinivas; Kalafatas, Georgios

    2007-01-01

    Earthquakes can significantly disrupt societal functioning, cause ecological damage, and lead to loss of human lives and property, warranting a coordinated and efficient response to mitigate their negative impacts. Preparedness against earthquakes entails a pre-disaster planning aspect and a post disaster operational aspect. In the JTRP study “Emergency Earthquake Routes for the State of Indiana; Part I: Criteria for Selection of Primary Routes: Transportation Aspects”, a multicommodity maxim...

  5. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    Shekhar, Shashi; George, Betsy; Lu, Qingsong

    2010-01-01

    Efficient tools are needed to identify routes and schedules to evacuate affected populations to safety in face of natural disasters or terrorist attacks. Challenges arise due to violation of key assumptions (e.g. stationary ranking of alternative routes, Wardrop equilibrium) behind popular shortest path algorithms (e.g. Dijktra's, A*) and microscopic traffic simulators (e.g. DYNASMART). Time-expanded graphs (TEG) based mathematical programming paradigm does not scale up to large urban scenari...

  6. Securing AODV Routing Protocol in MANET Based on Cryptographic Authentication Mechanism

    Preeti Sachan

    2011-10-01

    Full Text Available In mobile ad hoc wireless network (MANET, secure communication is morechallenging task due to its fundamental characteristics like infrastructure less, wirelesslink, distributed cooperation, dynamic topology, lack of association, resource constrainedand physical vulnerability of node. In MANET, attacks can be broadly classified in twocategories: routing attacks and data forwarding attacks. Any action not following rules ofrouting protocols belongs to routing attacks. The main objective of routing attacks tomislead or disrupt normal functioning of network by advertising false routing updates. Onthe other hand data forwarding attacks include actions such as modification or droppingof data packet that does not disrupt routing protocol. In this thesis work, we proposed amethod to secure ad hoc on-demand distance vector (AODV routing protocol. Theproposed method provides security for routing packets and can efficiently prevent theattacks such as black hole, modifying routing information and impersonation. Theproposed method uses hashed message authentication code (HMAC function whichprovides fast message verification and sender as well as intermediate nodesauthentication. We simulate and compare the proposed method with original AODV andsecure AODV (SAODV protocol using network simulator tool (NS2. Simulation resultshows that proposed method minimizes the time delay and network routing load involvedin computation and verification of security fields during route discovery process andperforms better than the original AODV protocol in the presence of malicious nodesperforming black hole attack.

  7. SECURE ROUTING IN WSN

    Rachid Haboub

    2011-12-01

    Full Text Available The growing diffusion of wireless sensors and the recent advances in Wireless Sensor Networks (WSNsopen new scenarios where sensors can be rapidly deployed without any existing infrastructure. Suchnetworks are useful in many fields, such as emergency rescue, disaster relief, smart homes systems,patient monitoring, industrial applications, health monitoring, environmental control, militaryapplications, etc. However WSN presents many challenges. These networks are prone to malicious usersattack, because any device within the frequency range can get access to the WSN. There is a need forsecurity mechanisms aware of the sensor challenges (low energy, computational resources, memory,etc.. Thus, this work aims to provide a secure WSN by changing the frequency of data transmission. Thissecurity approach was tested, and the results shows an interesting decreased of throughput frommalicious node when the number of frequency used is increased, that way the WSN will not waste it’sresources treating malicious packets.

  8. Protocol Independent Adaptive Route Update for VANET

    Asim Rasheed; Sana Ajmal; Amir Qayyum

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

  9. Implementation of a Locator-Based Route Switching Scheme for Improved Routing in Proxy Mobile IPv6

    M. Okwori

    2014-11-01

    Full Text Available Proxy Mobile IPv6 (PMIPv6 is a promising IP mobility protocols that is being deployed in emerging wireless technologies. This however has a non-optimal packet route as a result of the triangular routing problem. This creates a bottle neck at the Local Mobility Anchor (LMA thereby increasing packet delays. This paper presents the implementation of a locator-based route switching scheme on OPNET Modeler. The Mobility Access Gateway (MAG and the LMA were enhanced by making them intelligent. This enables them to be able to check the position of the Corresponding Node (CN with respect to the Mobile Node (MN and also determine the available bandwidth on each link. From the checks made, a three-stage decision process is used to switch routing to the most optimal route that guarantees the best QoS. Node Models were developed for the MAG and LMA, network models were deployed and simulation tests were carried out. The results show that the developed scheme switched packets to a more optimal route according to the designed algorithm. The impact of this switching on differences between transmitted throughput at MN and the received throughput at CN was also evaluated. The receiver activity result shows a reduction in the bottleneck at the LMA-MAG link. The end-to-end delay results show over 50 milliseconds drop in packet delay as a result of the switching to a more optimal route. This shows that the packet delays result from the congestion at the LMA-MAG interface due to suboptimal routing.

  10. Photonic-assisted ultrafast THz wireless access

    Yu, Xianbin; Chen, Ying; Galili, Michael;

    THz technology has been considered feasible for ultrafast wireless data communi- cation, to meet the increasing demand on next-generation fast wireless access, e.g., huge data file transferring and fast mobile data stream access. This talk reviews recent progress in high-speed THz wireless...... communications enabled by photonics technologies, as well as the needed technical breakthroughs for achieving ultrafast data rates beyond 100Gbit/s...

  11. Secure Multicast Routing Algorithm for Wireless Mesh Networks

    Rakesh Matam

    2016-01-01

    Full Text Available Multicast is an indispensable communication technique in wireless mesh network (WMN. Many applications in WMN including multicast TV, audio and video conferencing, and multiplayer social gaming use multicast transmission. On the other hand, security in multicast transmissions is crucial, without which the network services are significantly disrupted. Existing secure routing protocols that address different active attacks are still vulnerable due to subtle nature of flaws in protocol design. Moreover, existing secure routing protocols assume that adversarial nodes cannot share an out-of-band communication channel which rules out the possibility of wormhole attack. In this paper, we propose SEMRAW (SEcure Multicast Routing Algorithm for Wireless mesh network that is resistant against all known active threats including wormhole attack. SEMRAW employs digital signatures to prevent a malicious node from gaining illegitimate access to the message contents. Security of SEMRAW is evaluated using the simulation paradigm approach.

  12. Robust message routing for mobile (wireless) ad hoc networks.

    Goldsby, Michael E.; Johnson, Michael M.; Kilman, Dominique Marie (Sandia National Laboratories, Albuquerque, NM); Bierbaum, Neal Robert; Chen, Helen Y.; Ammerlahn, Heidi R.; Tsang, Rose P.; Nicol, David M. (University of Illinois, Urbana, IL)

    2004-01-01

    This report describes the results of research targeting improvements in the robustness of message transport in wireless ad hoc networks. The first section of the report provides an analysis of throughput and latency in the wireless medium access control (MAC) layer and relates the analysis to the commonly used 802.11 protocol. The second section describes enhancements made to several existing models of wireless MAC and ad hoc routing protocols; the models were used in support of the work described in the following section. The third section of the report presents a lightweight transport layer protocol that is superior to TCP for use in wireless networks. In addition, it introduces techniques that improve the performance of any ad hoc source routing protocol. The fourth section presents a novel, highly scalable ad hoc routing protocol that is based on geographic principles but requires no localization hardware.

  13. New TPG bus route 28

    2003-01-01

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

  14. Protocol independent adaptive route update for VANET.

    Rasheed, Asim; Ajmal, Sana; 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

  15. Celestial data routing network

    Bordetsky, Alex

    2000-11-01

    Imagine that information processing human-machine network is threatened in a particular part of the world. Suppose that an anticipated threat of physical attacks could lead to disruption of telecommunications network management infrastructure and access capabilities for small geographically distributed groups engaged in collaborative operations. Suppose that small group of astronauts are exploring the solar planet and need to quickly configure orbital information network to support their collaborative work and local communications. The critical need in both scenarios would be a set of low-cost means of small team celestial networking. To the geographically distributed mobile collaborating groups such means would allow to maintain collaborative multipoint work, set up orbital local area network, and provide orbital intranet communications. This would be accomplished by dynamically assembling the network enabling infrastructure of the small satellite based router, satellite based Codec, and set of satellite based intelligent management agents. Cooperating single function pico satellites, acting as agents and personal switching devices together would represent self-organizing intelligent orbital network of cooperating mobile management nodes. Cooperative behavior of the pico satellite based agents would be achieved by comprising a small orbital artificial neural network capable of learning and restructing the networking resources in response to the anticipated threat.

  16. Impact of Flooding on Traffic Route Choices

    Othman M.H.

    2014-01-01

    Full Text Available Traffic route choice using road network modelling can play a key role in preventing and minimizing traffic problems during disasters. Using road network modelling, real road conditions during flooding are simulated in order to produce a response plan for road users to evacuate based on the roads' real risks and situation. Using a Geographical Information System (GIS we can forecast and provide road users with available alternatives when certain access roads or links need to be closed due to catastrophic hazards such as floods. This study focuses on floods as it is the most common form of natural disaster occurring in Malaysia, and due to the fact that the chance and risk of a flood occurring cannot be accurately predicted nor measured. Therefore, as a response to this problem, the outcome of this study is highly useful for the retrieval of information on flooded roads and the impacts on road users. Using GIS's capability to display both spatial and attributive information, we have provided an attractive alternative to conventional methods in order to show available traffic route choices and a transportation network plan.

  17. Route Scherrer closed for construction work

    2015-01-01

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

  18. The Use of an Improved Access Structure in Dictionaries*

    Rufus H Gouws

    2011-01-01

    Abstract: Dictionary consultation procedures often fail because the structure of a dictionary impedes the user from sufficient access to the data. Modern-day metalexicography has identified the access structure as one of the most important structural components of a dictionary. The access structure represents the search route a user follows to reach the required data in order to retrieve the necessary information. This paper focuses on a few aspects of the access structure. It is arg...

  19. Adaptive routing for intermittently connected mobile ad hoe networks

    M. Musolesi; Hailes, S; Mascolo, C.

    2005-01-01

    The vast majority of mobile ad hoc networking research makes a very large assumption: that communication can only take place between nodes that are simultaneously accessible within in the same connected cloud (i.e., that communication is synchronous). In reality, this assumption is likely to be a poor one, particularly for sparsely or irregularly populated environments.In this paper we present the Context-Aware Routing (CAR) algorithm. CAR is a novel approach to the provision of asynchronous ...

  20. The vehicle routing problem with edge set costs

    Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

    2011-01-01

    We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications and other costly investments. The certifications and contributions impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. Different versions for defining the e...

  1. A High-Speed Active Switch Routing Architecture

    2001-01-01

    In this paper, combining with active networks, we design a new kind of programmable routing switch architecture to provide a common intelligent switch platform for multi-protocol switching and multi-service accessing. We elaborate how programmable switch and network intelligence are achieved, and how packets are classified, queued and scheduled. We point out that edge intelligence and network software are the tendency for the development of future networks.

  2. Fast breeder reactors an engineering introduction

    Judd, A M

    1981-01-01

    Fast Breeder Reactors: An Engineering Introduction is an introductory text to fast breeder reactors and covers topics ranging from reactor physics and design to engineering and safety considerations. Reactor fuels, coolant circuits, steam plants, and control systems are also discussed. This book is comprised of five chapters and opens with a brief summary of the history of fast reactors, with emphasis on international and the prospect of making accessible enormous reserves of energy. The next chapter deals with the physics of fast reactors and considers calculation methods, flux distribution,

  3. Scalable Lunar Surface Networks and Adaptive Orbit Access

    Wang, Xudong

    2015-01-01

    Teranovi Technologies, Inc., has developed innovative network architecture, protocols, and algorithms for both lunar surface and orbit access networks. A key component of the overall architecture is a medium access control (MAC) protocol that includes a novel mechanism of overlaying time division multiple access (TDMA) and carrier sense multiple access with collision avoidance (CSMA/CA), ensuring scalable throughput and quality of service. The new MAC protocol is compatible with legacy Institute of Electrical and Electronics Engineers (IEEE) 802.11 networks. Advanced features include efficiency power management, adaptive channel width adjustment, and error control capability. A hybrid routing protocol combines the advantages of ad hoc on-demand distance vector (AODV) routing and disruption/delay-tolerant network (DTN) routing. Performance is significantly better than AODV or DTN and will be particularly effective for wireless networks with intermittent links, such as lunar and planetary surface networks and orbit access networks.

  4. Accessible Knowledge - Knowledge on Accessibility

    Kirkeby, Inge Mette

    2015-01-01

    Although serious efforts are made internationally and nationally, it is a slow process to make our physical environment accessible. In the actual design process, architects play a major role. But what kinds of knowledge, including research-based knowledge, do practicing architects make use of when...... designing accessible environments? The answer to the question is crucially important since it affects how knowledge is distributed and how accessibility can be ensured. In order to get first-hand knowledge about the design process and the sources from which they gain knowledge, 11 qualitative interviews...... were conducted with architects with experience of designing for accessibility. The analysis draws on two theoretical distinctions. The first is research-based knowledge versus knowledge used by architects. The second is context-independent knowledge versus context-dependent knowledge. The practitioners...

  5. Association between proximity to and coverage of traditional fast-food restaurants and non-traditional fast-food outlets and fast-food consumption among rural adults

    Horel Scott A; Dean Wesley R; Johnson Cassandra M; Sharkey Joseph R

    2011-01-01

    Abstract Objective The objective of this study is to examine the relationship between residential exposure to fast-food entrées, using two measures of potential spatial access: proximity (distance to the nearest location) and coverage (number of different locations), and weekly consumption of fast-food meals. Methods Traditional fast-food restaurants and non-traditional fast-food outlets, such as convenience stores, supermarkets, and grocery stores, from the 2006 Brazos Valley Food Environmen...

  6. Dynamic routing using maximal road capacity

    Rothkrantz, L.J.M.

    2015-01-01

    Current routing devices route an individual car driver from start to destination in the shortest time. In this paper we propose a routing algorithm, routing the whole population of car drivers in the shortest time. The algorithm is an adapted dynamic version of the shortest path algorithm of Dijkstr

  7. FAST DISSOLVING TABLETS: AN UPDATE

    Darna Bikshapathi

    2011-06-01

    Full Text Available Fast dissolving tablets are dissolving rapidly in the saliva without the need for water. Some tablets are designed to dissolve in saliva remarkably fast, within a few seconds, and are true fast-dissolving tablets. Other ingredients to enhance the rate of tablet disintegration in the oral cavity, and are more appropriately termed fast-disintegrating tablets, as they may take up to a minute to completely disintegrate. Fast or mouth dissolving tablets have been formulated for pediatric, geriatric, and bedridden patients and for active patients who are busy and traveling and may not have access to water. Fast dissolving tablets (FDTs have received ever-increasing demand during the last decade, and the field has become a rapidly growing area in the pharmaceutical industry. This article describes various formulations and technologies developed to achieve fast dissolution/dispersion of tablets in the oral cavity. In this review describes in detail about FDT technologies based on lyophilization, molding, sublimation, spray drying, mass extrusion and direct compression. Several techniques have been developed in the recent past, to improve the disintegration quality of these delicate dosage forms without affecting their integrity. This article focuses on the technologies available and the advances made so far in the field of fabrication of fast dissolving tablets. Apart from the conventional methods of fabrication, this review also provides the detailed concept of some unique patented technologies like Zydis, Orasolv, Durasolv, Flashtab, Flash dose and Wowtab, Lyoc, Pharmaburst technology, Frosta technology, OraQuick, Quick-Dis Technology, Sheaform Technology, Ceform Technology, Nano technology, Advatab.Fast dissolving, Patented technologies, Sudisintegrants, Evaluation techn

  8. Open access

    Suber, Peter

    2012-01-01

    The Internet lets us share perfect copies of our work with a worldwide audience at virtually no cost. We take advantage of this revolutionary opportunity when we make our work "open access": digital, online, free of charge, and free of most copyright and licensing restrictions. Open access is made possible by the Internet and copyright-holder consent, and many authors, musicians, filmmakers, and other creators who depend on royalties are understandably unwilling to give their consent. But for 350 years, scholars have written peer-reviewed journal articles for impact, not for money, and are free to consent to open access without losing revenue. In this concise introduction, Peter Suber tells us what open access is and isn't, how it benefits authors and readers of research, how we pay for it, how it avoids copyright problems, how it has moved from the periphery to the mainstream, and what its future may hold. Distilling a decade of Suber's influential writing and thinking about open access, this is the indispe...

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

    Zhang, Xiaoning; Li, Lemin; Wang, Sheng

    2006-09-01

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

  10. 78 FR 38101 - Passenger Vessels Accessibility Guidelines

    2013-06-25

    .... See 69 FR 69244 and 69245, November 26, 2004. The ANPRM requested comment on whether and how to... guidelines for comment. See 71 FR 38563, July 7, 2006. We received more than 175 comments on the 2006 draft... include onboard accessible routes connecting passenger decks and passenger amenities within...

  11. Network Coding Based Security for Routing Attacks in WRN: Frechet Interference and Rayleigh Outage Evaluation

    R. Villalpando-Hernández

    2011-08-01

    Full Text Available We present a network coding security method capable of detecting several routing attacks in wireless reconfigurablenetworks. Routing security attacks include selective forwarding, black holes, and wormholes. The proposed methodperforms linear network coding over intermediate nodes composing a given route, not only to distribute content, butalso to provide data confidentiality by cooperation as a mechanism of detection. The method presents a robust,accurate and fast response under security attacks for varying network conditions, such as interference and outagedue to channel fading. It also provides a gain in network throughput by increasing the number of successfully receivedpackets without a significant increase of the bandwidth usage.

  12. ACO based routing for MANETs

    Arif, Mohammad

    2012-01-01

    Mobile ad hoc network (MANET) is a collection of wireless mobile nodes. It dynamically forms a temporary network without using any pre existing network infrastructure or centralized administration i.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to other nodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiences alterations during deployment. The biggest challenge in MANETs is to find a path between communicating nodes. The considerations of the MANET environment and the nature of the mobile nodes create further complications which results in the need to develop special routing algorithms to meet these challenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in other problem domains, has been applied to the MANET routing problem as it forms a good fit to the problem. In ant societies the activities of the individuals are not regulated by any explicit form of centralized control but ar...

  13. Access French

    Grosz, Bernard

    2014-01-01

    Access is the major new language series designed with the needs of today's generation of students firmly in mind. Whether learning for leisure or business purposes or working towards a curriculum qualification, Access French is specially designed for adults of all ages and gives students a thorough grounding in all the skills required to understand, speak, read and write contemporary French from scratch. The coursebook consists of 10 units covering different topic areas, each of which includes Language Focus panels explaining the structures covered and a comprehensive glossary. Learning tips

  14. Routing Discovery Algorithm Using Parallel Chase Packet

    Amera Al-Ameri

    2013-04-01

    Full Text Available On demand routing protocols for ad hoc networks such as Ad Hoc On Demand Distance Vector (AODV initiate a route discovery process when a route is needed by flooding the network with a route request packet. The route discovery process in such protocols depends on a simple flooding as a broadcast technique due to its simplicity. Simple flooding results in packet congestion, route request overhead and excessive collisions, namely broadcast storm problem. A number of routing techniques have been proposed to control the simple flooding technique. Ideally, the broadcast of route request or the route discovery process must be stopped as soon as the destination node is found. This will free the network from many redundant packets that may cause network collision and contention. In this paper, chasing packet technique is used with standard AODV routing protocol to end the fulfilled route requests. The chase packet is initiated by the source node and is broadcasted in parallel with route request packet. As soon as the destination is found the chase packet starts its work by trying to catch and discard the route request in early stages before it broadcasts further in the network. Performance evaluation is conducted using simulation to investigate the performance of the proposed scheme against the existing approach that uses chase packet technique such as Traffic Locality Route Discovery Algorithm with Chase (TLRDA-C. Results reveal that the proposed scheme minimizes end-to-end packet delays and achieves low routing request overhead.

  15. Optimal routing of electric vehicles

    Andelmin, Juho

    2014-01-01

    In this thesis, a vehicle routing problem (VRP) variant tailored for plug-in battery electric vehicles (BEVs) is studied. The studied problem involves a fleet of identical BEVs located at a central depot, a set of customers that must be serviced within given time windows, and a set of charging stations where the vehicles can recharge their batteries. The objective is to design a set of vehicle routes, each starting and ending at the depot, so that each customer is serviced exactly once and th...

  16. Price-Based Information Routing in Complex Satellite Networks for

    Hussein, I.; Su, J.; Wang, Y.; Wyglinski, A.

    Future space-based situational awareness and space surveillance systems are envisioned to include a large array of satellites that seek to cooperatively achieve full awareness over given space and terrestrial domains. Given the complexity of the communication network architecture of such a system, in this paper we build on the system architecture that was proposed by the presenting author in the 2008 AMOS conference and propose an efficient, adaptable and scalable price-based routing and bandwidth allocation algorithm for the generation, routing and delivery of surveillance information in distributed wireless satellite networks. Due to the potentially large deployments of these satellites, the access points employed in a centralized network control scheme would easily be overwhelmed due to lack of spectral bandwidth, synchronization issues, and multiple access coordination. Alternatively, decentralized schemes could facilitate the flow and transference of information between data gatherers and data collectors via mechanisms such as (multi-hop) routing, allocation of spectral bandwidths per relaying node, and coordination between adjacent nodes. Although there are numerous techniques and concepts focusing on the network operations, control, and management of sensor networks, existing solution approaches require the use of information for routing, allocation, and decision-making that may not be readily available to the satellites in a timely fashion. This is especially true in the literature on price-based routing, where the approach is almost always game theoretic or relies on optimization techniques. Instead of seeking such techniques, in this paper we present algorithms that will (1) be energy-aware, (2) be highly adaptable and responsive to demands and seek delivery of information to desired nodes despite the fact that the source and destination are not globally known, (3) be secure, (4) be efficient in allocating bandwidth, (5) be decentralized and allow for

  17. Construction of a new wastewater treatment plant, building 676, route Maxwell

    SC Unit

    2008-01-01

    A new wastewater treatment plant is being constructed on Route Maxwell to treat the effluents from the TS/MME/CCS surface treatment workshops. For this purpose, excavation work is being performed in two separate locations along Route Maxwell, causing a slight disruption to traffic in these areas. Site access through Gate C should, however, be maintained. The work is scheduled to continue through until February 2009.

  18. Construction of a new waste-water treatment plant, building 676, route Maxwell

    TS Department

    2008-01-01

    A new waste-water treatment plant is being constructed on Route Maxwell to treat the effluents from the TS/MME/CCS surface treatment workshops. For this purpose, excavation work is being performed in two separate locations along Route Maxwell, causing a slight disruption to traffic in these areas. Site access through Gate C should, however, be maintained. The work is scheduled to continue until February 2009.

  19. Estimated transportation routes to a candidate salt repository site in Deaf Smith County, Texas

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

    1987-10-01

    This report presents a preliminary analysis of possible highway and rail transportation routes within Texas, Oklahoma, and New Mexico for shipments of spent fuel to the candidate repository site in Deaf Smith County, Texas. Two cases are examined for highway shipments. The initial case analyzes shipments following the Department of Transportation's HM-164 regulations for shipment of spent fuel. The second case analyzes normal commercial routes. Three rail cases are also examined. Each case analyzes potential routes that would be used based for different access spurs into the repository site. Two appendices are included which examine additional scenarios generated by restricting routes from passing through various metropolitan areas. The major finding is that most shipments to the Deaf Smith site will pass through Amarillo, Texas. There are few, if any, feasible alternative routes which would significantly reduce the amount of traffic passing through Amarillo.

  20. High throughput route selection in multi-rate wireless mesh networks

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

    2008-01-01

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

  1. Estimated transportation routes to a candidate salt repository site in Deaf Smith County, Texas

    This report presents a preliminary analysis of possible highway and rail transportation routes within Texas, Oklahoma, and New Mexico for shipments of spent fuel to the candidate repository site in Deaf Smith County, Texas. Two cases are examined for highway shipments. The initial case analyzes shipments following the Department of Transportation's HM-164 regulations for shipment of spent fuel. The second case analyzes normal commercial routes. Three rail cases are also examined. Each case analyzes potential routes that would be used based for different access spurs into the repository site. Two appendices are included which examine additional scenarios generated by restricting routes from passing through various metropolitan areas. The major finding is that most shipments to the Deaf Smith site will pass through Amarillo, Texas. There are few, if any, feasible alternative routes which would significantly reduce the amount of traffic passing through Amarillo

  2. Dynamic Weather Routes Architecture Overview

    Eslami, Hassan; Eshow, Michelle

    2014-01-01

    Dynamic Weather Routes Architecture Overview, presents the high level software architecture of DWR, based on the CTAS software framework and the Direct-To automation tool. The document also covers external and internal data flows, required dataset, changes to the Direct-To software for DWR, collection of software statistics, and the code structure.

  3. ACO Based Routing for MANETs

    Mohammad Arif

    2012-05-01

    Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile nodes. It dynamically forms atemporary network without using any pre existing network infrastructure or centralized administrationi.e. with minimal prior planning. All nodes have routing capabilities and forward data packets to othernodes in multi-hop fashion. As the network is dynamic, the network topology continuously experiencesalterations during deployment. The biggest challenge in MANETs is to find a path betweencommunicating nodes. The considerations of the MANET environment and the nature of the mobile nodescreate further complications which results in the need to develop special routing algorithms to meet thesechallenges. Swarm intelligence, a bio-inspired technique, which has proven to be very adaptable in otherproblem domains, has been applied to the MANET routing problem as it forms a good fit to the problem.In ant societies the activities of the individuals are not regulated by any explicit form of centralizedcontrol but are the result of self-organizing dynamics driven by local interactions and communicationsamong a number of relatively simple individuals. This unique characteristic has made ant societies anattractive and inspiring model for building new algorithms and new multi-agent systems. In this paper,we have studied and reviewed Ant Colony based routing algorithms and its variants. Finally, aperformance evaluation of the original ARA and the EARA is carried out with respect to each other.

  4. Transosseous Access for Decompression of an Obstructed Pelvic Kidney

    We report a case of an obstructed pelvic kidney which was decompressed using a transosseous access route. The patient presented with obstructive uropathy and fever, necessitating decompression. Initial access was gained to the kidney by traversing the ilium, allowing subsequent retrograde placement of a double-Jureteric catheter

  5. Do Adolescents Who Live or Go to School Near Fast Food Restaurants Eat More Frequently From Fast Food Restaurants?

    Forsyth, Ann; Wall, Melanie; Larson, Nicole; Story, Mary; Neumark-Sztainer, Dianne

    2012-01-01

    This population-based study examined whether residential or school neighborhood access to fast food restaurants is related to adolescents’ eating frequency of fast food. A classroom-based survey of racially/ethnically diverse adolescents (n=2,724) in 20 secondary schools in Minneapolis/St. Paul, Minnesota was used to assess eating frequency at five types of fast food restaurants. Black, Hispanic, and Native American adolescents lived near more fast food restaurants than white and Asian adoles...

  6. Energy efficient routing in mobile ad-hoc networks for Healthcare Environments

    Sohail Abid

    2013-01-01

    Full Text Available The modern and innovative medical applications based on wireless network are being developed in the commercial sectors as well as in research. The emerging wireless networks are rapidly becoming a fundamental part of medical solutions due to increasing accessibility for healthcare professionals/patients reducing healthcare costs. Discovering the routes among hosts that are energy efficient without compromise on smooth communication is desirable. This work investigates energy efficiency of some selected proactive and reactive routing protocols in wireless network for healthcare environments. After simulation and analysis we found that DSR is best energy efficient routing protocol among DSR, DSDV and AODV, because DSR has maximum remaining energy.

  7. Automated Computer Access Request System

    Snook, Bryan E.

    2010-01-01

    The Automated Computer Access Request (AutoCAR) system is a Web-based account provisioning application that replaces the time-consuming paper-based computer-access request process at Johnson Space Center (JSC). Auto- CAR combines rules-based and role-based functionality in one application to provide a centralized system that is easily and widely accessible. The system features a work-flow engine that facilitates request routing, a user registration directory containing contact information and user metadata, an access request submission and tracking process, and a system administrator account management component. This provides full, end-to-end disposition approval chain accountability from the moment a request is submitted. By blending both rules-based and rolebased functionality, AutoCAR has the flexibility to route requests based on a user s nationality, JSC affiliation status, and other export-control requirements, while ensuring a user s request is addressed by either a primary or backup approver. All user accounts that are tracked in AutoCAR are recorded and mapped to the native operating system schema on the target platform where user accounts reside. This allows for future extensibility for supporting creation, deletion, and account management directly on the target platforms by way of AutoCAR. The system s directory-based lookup and day-today change analysis of directory information determines personnel moves, deletions, and additions, and automatically notifies a user via e-mail to revalidate his/her account access as a result of such changes. AutoCAR is a Microsoft classic active server page (ASP) application hosted on a Microsoft Internet Information Server (IIS).

  8. Building new access network using reconfigurable optical grid network and wireless network

    Qiu, Yinghui; Wu, Runze; Ji, Yuefeng; Xu, Daxiong

    2007-11-01

    Recently wireless mesh network has been gaining increasing attention and early versions are being deployed as municipal access solutions to eliminate the wired drop to every wireless router at customer premise. In this paper, we propose a novel access network using reconfigurable optical burst switching grid network and wireless mesh network. The proposed access network architecture saves network deployment cost because fiber need not penetrate to each end user. We also propose a hierarchical routing protocol to enhance the routing efficiency.

  9. An embedded route finder and tracing system for a stepped robot

    Wang, Xiangjun; Li, Zhi; Zhou, Xinling

    2003-09-01

    The paper presents a new embedded sensor method of non-contact automatic route-finding and route-tracing for stepped robot. The final system is designed and integrated into a single hardware PCB with size of 30x30x15 mm3. A line scanning charge couple device (CCD) with 1024 pixels is used to obtain the plane scene of route, and a pair of infrared LED is employed to provide the illumination of the route-finder. Moreover, this route-finder still includes a micro lens, CCD driver, instrumentation pre-amplifier, edge extracting circuit, FPGA circuit for position measure and logic control, direction and state display of the route-finder by LED, moving direction control pins output and power manage circuits. The router-finder for stepped robot has the advantages of simple and fast operation, easy assembly with robot, small volume, high sensitivity and precision for route-finding and tracing. The paper outlines in detail the principle of the route-finding and tracing by edge extraction and edge position measure using a CCD image sensor with a micro lens assisted by infrared illumination and a FPGA circuit. Some relational edge extraction and measure algorithms suitable for embedded system with FPGA are introduced in the paper too. Finally, the actual experiment results are given.

  10. A BROADCAST BASED ROUTING PROTOCOL FOR INTER-CLUSTER DATA DISSEMINATION IN VEHICULAR COMMUNICATION

    Auxeeliya Jesudoss

    2014-01-01

    Full Text Available Vehicular communication is one of the fast growing and promising technologies for a safe and comfortable driving environment. These technologies do not end up with economic and safety ramifications, but also extended with other informational and entertainment oriented services. Data are being propagated multi-hop between source and destination vehicles for many real-life applications. Clustering is one of the effective and scalable solutions for data dissemination in wireless ad hoc networks. Though many cluster-based methods have been proposed for multi-hop data delivery in vehicular ad hoc networks, most of them do not consider the real-time changes in the network topology or imposes large penalties in routing such as unstable clusters, broken links, updating route tables. In order to address these issues, we propose a broadcast based routing protocol for inter-cluster data dissemination in this study that works on real-time vehicle information. Unlike, most existing routing algorithms, it only uses hello messages to obtain routing information without many other control messages. In addition, it alleviates the storage of routing information in every node, which largely reduces the overheads in routing. We performed extensive simulation to demonstrate the effectiveness and efficiency of the proposed routing protocol. Results show that the proposed protocol outperforms other approaches in terms of average delay, average delivery ratio and average number of hops.

  11. An integrated approach to route selection in slurry pipeline design

    Betinol, Roy G.; Altmann, Nara [Brass Chile S.A., Santiago (Chile)

    2009-12-19

    The pressure to get engineering projects done and constructed as fast as possible in order to take advantage of the high prices in metals and petrochemicals has been driving companies to skip the conceptual phase and go straight into basic engineering with cost estimates in the level of 15% accuracy. By-passing early engineering and demanding higher cost estimating accuracy is a contradiction. In most cases, savings made on capital investment is much higher had money been spent in conceptual studies which allow for the optimal solution to be found. This paper reviews one of the key aspects in conceptual engineering of slurry pipeline designs: route selection. This activity is often overlooked, causing capital cost and operating difficulties to rise unnecessarily. This paper describes and gives example on how an integrated client/engineering company's approach to route selection can produce significant savings in pipeline construction and operating costs. (author)

  12. Joint Routing and Protection Using p-cycles

    Stidsen, Thomas K.; Thomadsen, Tommy

    2005-01-01

    these networks is paramount. Protection is possible by rerouting the electronic communication, bypassing the failed network component. In order to be able to reroute, extra capacity is, nevertheless, needed. This article considers the recently suggested fast protection method, p- cycles. We develop a...... method for minimizing the capacity needed for protection using p-cycles. The routing of tra c in uence the amount of extra capacity needed, thus we consider joint optimization of routing and protection. An integer linear programming model is presented and a column generation algorithm is developed. The...... algorithm is faster and obtains better bounds and solutions than existing methods. The algorithm enables an experimental study of the capacity e ciency of p-cycles. The results show that p-cycles are comparable to any other protection method, with respect to the capacity usage. The results also show that...

  13. A Study of Urgency Vehicle Routing Disruption Management Problem

    Xuping Wang

    2010-12-01

    Full Text Available If a transit vehicle breaks down on a schedule trip, there are some vehicles in the system need to serve this trip and the former plan must be changed. For solving the urgency vehicle routing problem with disruption that may be vehicle breakdowns or traffic accidents in the logistics distribution system, through the analysis of the problem and the disruption measurement, the mathematics model is given based on the thought of disruption management. For the characteristics of the problem, a Lagrangian relaxation is given to simplify the model, and decompose the problem into two parts. The Lagrangian multiplier is given by subgradient method and the subproblems are solved by saving approach to gain the initial solution. A fast insertion algorithm is given to obtain a feasible solution for the primal problem. The results show that the algorithm designed in this paper performs very well for solving the urgency vehicle routing disruption management problem.

  14. OPTIMIZING LOCALIZATION ROUTE USING PARTICLE SWARM-A GENETIC APPROACH

    L. Lakshmanan

    2014-01-01

    Full Text Available One of the most key problems in wireless sensor networks is finding optimal algorithms for sending packets from source node to destination node. Several algorithms exist in literature, since some are in vital role other may not. Since WSN focus on low power consumption during packet transmission and receiving, finally we adopt by merging swarm particle based algorithm with genetic approach. Initially we order the nodes based on their energy criterion and then focusing towards node path; this can be done using Proactive route algorithm for finding optimal path between Source-Destination (S-D nodes. Fast processing and pre traversal can be done using selective flooding approach and results are in genetic. We have improved our results with high accuracy and optimality in rendering routes.

  15. Highway route controlled quantity shipment routing reports - An overview

    US Department of Transportation (DOT) regulations require a postnotification report from the shipper for all shipments of radioactive materials categorized as a Highway Route Controlled Quantity. These postnotification reports, filed in compliance with 49 CFR 172.203(d), have been compiled by the DOT in a database known as the Radioactive Materials Routing Report (RAMRT) since 1982. The data were sorted by each of its elements to establish historical records and trends of Highway Route Controlled Quantity shipments from 1982 through 1987. Approximately 1520 records in the RAMRT database were compiled for this analysis. Approximately half of the shipments reported for the study period were from the US Department of Energy (DOE) and its contractors, with the others being commercial movements. Two DOE installations, EG and G Idaho and Oak Ridge, accounted for nearly half of the DOE activities. Similarly, almost half of the commercial movements were reported by two vendors, Nuclear Assurance Corporation and Transnuclear, Incorporated. Spent fuel from power and research reactors accounted for approximately half of all shipments

  16. Easing access for lifelong learners

    Müller, Romina; Remdisch, Sabine; Köhler, Katharina;

    2015-01-01

    Easing access to higher education (HE) for those engaging in lifelong learning has been a common policy objective across the European Union since the late 1990s. To reach this goal, the transition between vocational and academic routes must be simplified, but European countries are at different...... learning. The cases are at widely different stages, but the following factors were considered essential in all countries for opening universities: the establishment of transition paths from secondary education and working life into HE and links between HE, businesses and adult education from a national...

  17. Energy Efficient Location Aided Routing Protocol for Wireless MANETs

    Mikki, Mohammad A

    2009-01-01

    A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes forming a temporary network without using any centralized access point, infrastructure, or centralized administration. In this paper we introduce an Energy Efficient Location Aided Routing (EELAR) Protocol for MANETs that is based on the Location Aided Routing (LAR). EELAR makes significant reduction in the energy consumption of the mobile nodes batteries by limiting the area of discovering a new route to a smaller zone. Thus, control packets overhead is significantly reduced. In EELAR a reference wireless base station is used and the network's circular area centered at the base station is divided into six equal sub-areas. At route discovery instead of flooding control packets to the whole network area, they are flooded to only the sub-area of the destination mobile node. The base station stores locations of the mobile nodes in a position table. To show the efficiency of the proposed protocol we present simulations using NS-2. Simulation...

  18. An Efficient Agent-Based AODV Routing Protocol in MANET

    Preeti Bhati,

    2011-07-01

    Full Text Available A MANET (Mobile Adhoc Network consists of a collection of mobile nodes communicating with each other without any fixed infrastructure such as access points or base stations. MANETS are self organizing or self restoring. Network topology in MANETS is subject to continuous and precipitous (unpredictable change. The limited bandwidth availability, energy constraints and highly dynamic topology make the routing process as exigent. The routing process in MANET relies (based on the cooperation of individual nodes which constitute the network. In this paper, we have tried to remove the existence of misbehaving nodes that may paralyze or slows down the routing operation in MANET. This increases the efficiency of a network. Efficiency can be calculated by the parameters or factors such astransmission capacity, battery power and scalability. Here we are considering the most crucial factor named as transmission capacity of a node. In MANET, as the network size increases complexity of anetwork also increases. To overcome this we make network as modular. So the network becomes task specific which refer to a particular work only. This is the reason of infusing the concept of agents in anefficient network. This proposed protocol provides the most efficient and reliable route which may or may not be minimum hop count.

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

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

    2014-01-01

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

  20. Comparison of on Demand Routing Protocols

    Bharat Bhushan

    2013-02-01

    Full Text Available A routing protocol is used to facilitate communication in ad hoc network. The primary goal of such a routing protocol is to provide an efficient and reliable path between a pair of nodes. The routing protocols for ad hoc network can be categorized into three categories: table driven, on demand and hybrid routing. The table driven and hybrid routing strategies require periodic exchange of hello messages between nodes of the ad hoc network and thus have high processing and bandwidth requirements. On the other hand on demand routing strategy creates routes when required and hence is very much suitable for ad hoc network. This paper therefore examines the performance of three on demand routing protocols at application layer using QualNet-5.01 simulator.

  1. Chemical Routes to Colloidal Chalcogenide Nanosheets

    Schaak, Raymond

    2015-02-19

    This project sought to develop new low-temperature synthetic pathways to intermetallic and chalcogenide nanostructures and powders, with an emphasis on systems that are relevant to advancing the synthesis, processing, and discovery of superconducting materials. The primary synthetic routes involved solution chemistry methods, and several fundamental synthetic challenges that underpinned the formation of these materials were identified and investigated. Methods for incorporating early transition metals and post transition metals into nanoscale and bulk crystals using low-temperature solution chemistry methods were developed and studied, leading to colloidal nanocrystals of elemental indium, manganese, and germanium, as well as nanocrystalline and bulk intermetallic compounds containing germanium, gallium, tin, indium, zinc, bismuth, and lithium. New chemical tools were developed to help target desired phases in complex binary intermetallic and metal chalcogenide systems that contain multiple stable phases, including direct synthesis methods and chemical routes that permit post-synthetic modification. Several phases that are metastable in bulk systems were targeted, synthesized, and characterized as nanocrystalline solids and bulk powders, including the L12-type intermetallic compounds Au3Fe, Au3Ni, and Au3Co, as well as wurtzite-type MnSe. Methods for accessing crystalline metal borides and carbides using direct solution chemistry methods were also developed, with an emphasis on Ni3B and Ni3C, which revealed useful correlations of composition and magnetic properties. Methods for scale-up and nanoparticle purification were explored, providing access to centimeter-scale pressed pellets of polyol-synthesized nanopowders and a bacteriophage-mediated method for separating impure nanoparticle mixtures into their components. Several advances were made in the synthesis of iron selenide and related superconducting materials, including the production of colloidal Fe

  2. Fast food tips

    ... page: //medlineplus.gov/ency/patientinstructions/000105.htm Fast food tips To use the sharing features on this ... fast food. When You Go to a Fast Food Restaurant Knowing the amount of calories, fat, and ...

  3. Vehicle routing and the value of postponement

    Pang, G.; L Muyldermans

    2013-01-01

    We study capacitated vehicle routing problems (CVRPs) in which the client demands occur over time and the collector or distributor performing the service can decide when to visit the clients. It has been reported in the literature that postponement of collection (or delivery) services may decrease the overall routing cost or distance. We investigate this issue in greater detail and report on experiments in different routing settings to uncover the impact of postponement on routing efficiency....

  4. Algorithmic generation of railroad and highway routes

    Low, J. T.; Bushnell, R. C.; Shannon, R.; Borsos, R.; Graham, J.; Sherry, R.

    1979-01-01

    A minimum-time algorithm can be used to generate realistic highway routes between specific origins and destinations. Minimizing distances on links will not produce realistic railroad routes if links bear any resemblance to physical trackage. There are also multiple routes between two points since each carrier has its own philosophy. This paper outlines a systematic method of preparing information such that a computer algorithm can generate realistic routes for single- or multiple-carrier movements.

  5. VANET Routing Protocols: Pros and Cons

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

    2012-01-01

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

  6. Analyzing security of Authenticated Routing Protocol (ARAN)

    Seema Mehla; Bhawna Gupta; Preeti Nagrath

    2010-01-01

    Ad hoc network allow nodes to communicate beyond their direct wireless transmission range by introducing cooperation in mobile computer (nodes). Many proposed routing protocol for ad hoc network operate in an ad hoc fashion, as on demand routing protocol often have low overhead and faster reaction time than other type of routingbased on periodic protocol. However variety of attacks targeting routing protocol have been identified. By attacking the routing protocol attacker can absorb network t...

  7. Thematic Routes - Tourist Destinations in Romania

    Mihaela DINU; Adrian CIOACA

    2008-01-01

    Thematic routes have become greatly demanded ”fashionable” tourist destinations, in recent years. In many countries they gained popularity not only through their value as individual objectives, but also through their attraction, generated by the association of tourist objectives, in a larger region. The main purpose of this article is to analyze the main Romanian thematic routes, as part of the European routes, or as regional/local routes, specific on a national level, their actual condition ...

  8. Routing Data Authentication in Wireless Networks; TOPICAL

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

  9. Blind Alley Aware ACO Routing Algorithm

    Yoshikawa, Masaya; Otani, Kazuo

    2010-10-01

    The routing problem is applied to various engineering fields. Many researchers study this problem. In this paper, we propose a new routing algorithm which is based on Ant Colony Optimization. The proposed algorithm introduces the tabu search mechanism to escape the blind alley. Thus, the proposed algorithm enables to find the shortest route, even if the map data contains the blind alley. Experiments using map data prove the effectiveness in comparison with Dijkstra algorithm which is the most popular conventional routing algorithm.

  10. A route towards immune protection

    Groot Nibbelink, Milou

    2016-01-01

    This work describes a route towards an immune protective device for islet of Langerhans transplantation. We developed a protocol to use MIN6 β cells aggregates as pseudo-islets to overcome the donor shortage issue (chapter 3). In this thesis we explored two different immune protective strategies; a multibore hollow fiber and flat microwell membranes. In chapter 4 we investigated the possibility to use a commercial multibore hollow fiber. In this chapter we showed that we were capable to physi...

  11. Shortest Paths and Vehicle Routing

    Petersen, Bjørn; Pisinger, David

    2011-01-01

    This thesis presents how to parallelize a shortest path labeling algorithm. It is shown how to handle Chvátal-Gomory rank-1 cuts in a column generation context. A Branch-and-Cut algorithm is given for the Elementary Shortest Paths Problem with Capacity Constraint. A reformulation of the Vehicle Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown.

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

    Nenad Kojić

    2012-06-01

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

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

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

    2012-01-01

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

  14. Efficient Routing using Geographical information and directional spreading in VANET

    Anand Kumar

    2012-06-01

    Full Text Available Transmit Data Packet in Vanet using flooding from source to destination. When the packet transmit using nearest node and they use their nearest node cache table in next hop actually generate a lot of redundancy with the the area coverage. One node use the network channel and create a cause of collision to other which create a worst routing with the congested network . With the gps position locator system with some node processing we limit the path of the packet to the real direction of the destination by which we over come the channel collision and redundancy of packet .hence result a fast delivery of message.

  15. Multiple constraints QoS multicast routing optimization algorithm based on Genetic Tabu Search Algorithm

    Alaa M. Allakany

    Full Text Available With the fast evolution of real time and multimedia applications, some quality of service (QoS constraints need to be guaranteed in the underlying network. In this paper, we present a new method for least-cost QoS multicast routing problem based on genet ...

  16. Cultural Routes and Intangible Heritage

    Enza Zabbini

    2012-08-01

    Full Text Available The theoretical interpretation of thematic routes helps to predict the effects on the territories visited by cultured tourists who want to enrich their cultural and emotional baggage. After the analysis of some interpretations, this paper will examine how the practical implementation of an itinerary approved by the Council of Europe has evolved over the years. And it will also reflect on the practical results in the areas involved in that project. "The Hannibal Pathway ", the main overland walk on the "Phoenician Route - Cultural Route recognized by the Council of Europe" – represents a case of study that allows to reflect over the impact of cultural tourism based on immaterial heritage. In fact, in the areas where the battle of 21 June 217 BC took place, nothing tangible is left, except the landscape that has kept its conformation intact. In these areas, thanks to the foresight of the local governments in the last three decades, the landscape of the plain has been preserved. This makes possible today to propose an historical path precisely based on the landscape and on the new techniques for the valorization of the heritage. In the Tuoro plain it is possible to see the battlefields, thus retracing the various stages of the battle, supported by the Documentation Centre of the Capra Palace and virtual reconstructions of high technical quality.

  17. The Pyramidal Capacitated Vehicle Routing Problem

    Lysgaard, Jens

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

  18. Classification of Dynamic Vehicle Routing Systems

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

    2007-01-01

    classify dynamic vehicle routing systems. Methods for evaluation of the performance of algorithms that solve on-line routing problems are discussed and we list some of the most important issues to include in the system objective. Finally, we provide a three-echelon classification of dynamic vehicle routing...... systems based on their degree of dynamism and the system objective....

  19. The pyramidal capacitated vehicle routing problem

    Lysgaard, Jens

    2010-01-01

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

  20. Optimal migration route of Cu in HfO2

    The movement of Cu in a HfO2-based resistive random access memory (RRAM) device is investigated in depth by first-principle calculations. Thermodynamics analysis shows that the dominant motion of Cu tends to be along the [001] orientation with a faster speed. The migration barriers along different routes are compared and reveal that the [001] orientation is the optimal migration route of Cu in HfO2, which is more favorable for Cu transportation. Furthermore, the preferable HfO2 growth orientation along [100], corresponding to Cu migration along [001], is also observed. Therefore, it is proposed that the HfO2 material should grow along [100] and the operating voltage should be applied along [001], which will contribute to the improvement of the response speed and the reduction of power consumption of RRAM. (semiconductor materials)

  1. A SURVEY ON PROTOCOLS & ATTACKS IN MANET ROUTING

    Meenakshi

    2012-09-01

    Full Text Available A mobile ad hoc network (MANET is a dynamic wirelessnetwork that can be formed without any pre-existinginfrastructure in which each node can act as a router.MANET has no clear line of defense, so, it is accessible toboth legitimate network users and malicious attackers. Inthe presence of malicious nodes, one of the main challengesin MANET is to design the robust security solution that canprotect MANET from various routing attacks. Differentmechanisms have been proposed using variouscryptographic techniques to countermeasure the routingattacks against MANET. However, these mechanisms arenot suitable for MANET resource constraints, i.e., limitedbandwidth and battery power, because they introduce heavytraffic load to exchange and verifying keys. In this paper,the current security issues in MANET are investigated.Particularly, we have examined different routing attacks,such as flooding, blackhole, link spoofing, wormhole, andcolluding misrelay attacks, as well as existing solutions toprotect MANET protocols.

  2. INTERLINE, a railroad routing model: program description and user's manual

    INTERLINE is an interactive computer program that finds likely routes for shipments over the US railroad system. It is based on a shortest path algorithm modified both to reflect the nature of railroad company operations and to accommodate computer resource limitations in dealing with a large transportation network. The first section of the report discusses the nature of railroad operations and routing practices in the United States, including the tendency to concentrate traffic on a limited number of mainlines, the competition for traffic by different companies operating in the same corridors, and the tendency of originating carriers to retain traffic on their systems before transferring it to terminating carriers. The theoretical foundation and operation of shortest path algorithms are described, as well as the techniques used to simulate actual operating practices within this framework. The second section is a user's guide that describes the program operation and data structures, program features, and user access. 11 refs., 11 figs

  3. Optimal migration route of Cu in HfO2

    Jinlong, Lu; Jing, Luo; Hongpeng, Zhao; Jin, Yang; Xianwei, Jiang; Qi, Liu; Xiaofeng, Li; Yuehua, Dai

    2014-01-01

    The movement of Cu in a HfO2-based resistive random access memory (RRAM) device is investigated in depth by first-principle calculations. Thermodynamics analysis shows that the dominant motion of Cu tends to be along the [001] orientation with a faster speed. The migration barriers along different routes are compared and reveal that the [001] orientation is the optimal migration route of Cu in HfO2, which is more favorable for Cu transportation. Furthermore, the preferable HfO2 growth orientation along [100], corresponding to Cu migration along [001], is also observed. Therefore, it is proposed that the HfO2 material should grow along [100] and the operating voltage should be applied along [001], which will contribute to the improvement of the response speed and the reduction of power consumption of RRAM.

  4. Roman digit naming: evidence for a semantic route.

    Duyck, Wouter; Lagrou, Evelyne; Gevers, Wim; Fias, Wim

    2008-01-01

    Earlier research with monolinguals and bilinguals showed that numbers may be named through both a semantic and a phonological route, depending on the number's language and format (Arabic or verbal), task demands, and naming language. The present study investigated the importance of the semantic route for the processing of a third representation of magnitude, namely Roman digits. Using an interference paradigm, we showed that the processing of Roman target digits is influenced by Arabic digit distractors, both in a naming task and a parity judgment task. Roman digits were processed faster if the target and distractor were of the same magnitude. If this was not the case, processing speed slowed down as the numerical distance between target and distractor increased. This strongly suggests that semantic access is mandatory when naming Roman digits. Implications are discussed for the number processing domain and for models of translation in bilinguals. PMID:18444517

  5. Metaheuristics applied to vehicle routing. A case study. Part 3: Genetic Clustering and Tabu Routing

    Guillermo González Vargas

    2010-04-01

    Full Text Available This paper presents hybrid meta-heuristics called Genetic Clustering and Tabu Routing for solving a vehicle routing problem using two phases methodology: first clustering and then routing. The results are compared with those obtained using meta-heuristics and heuristic techniques presented in previous papers. Genetic clustering and Tabu routing average results were 23% and 9.1% better, respectively.

  6. When Is Open Access Not Open Access?

    MacCallum, Catriona J.

    2007-01-01

    As open access grows in prominence, so too has confusion about what open access means; such confusion arises from a genuine misunderstanding of open access by funders, authors, editors, and publishers alike.

  7. A hybrid GA-TS algorithm for open vehicle routing optimization of coal mines material

    Yu, S.W.; Ding, C.; Zhu, K.J. [China University of Geoscience, Wuhan (China)

    2011-08-15

    In the open vehicle routing problem (OVRP), the objective is to minimize the number of vehicles and the total distance (or time) traveled. This study primarily focuses on solving an open vehicle routing problem (OVRP) by applying a novel hybrid genetic algorithm and the Tabu search (GA-TS), which combines the GA's parallel computing and global optimization with TS's Tabu search skill and fast local search. Firstly, the proposed algorithm uses natural number coding according to the customer demands and the captivity of the vehicle for globe optimization. Secondly, individuals of population do TS local search with a certain degree of probability, namely, do the local routing optimization of all customer sites belong to one vehicle. The mechanism not only improves the ability of global optimization, but also ensures the speed of operation. The algorithm was used in Zhengzhou Coal Mine and Power Supply Co., Ltd.'s transport vehicle routing optimization.

  8. A differential evolution-based routing algorithm for environmental monitoring wireless sensor networks.

    Li, Xiaofang; Xu, Lizhong; Wang, Huibin; Song, Jie; Yang, Simon X

    2010-01-01

    The traditional Low Energy Adaptive Cluster Hierarchy (LEACH) routing protocol is a clustering-based protocol. The uneven selection of cluster heads results in premature death of cluster heads and premature blind nodes inside the clusters, thus reducing the overall lifetime of the network. With a full consideration of information on energy and distance distribution of neighboring nodes inside the clusters, this paper proposes a new routing algorithm based on differential evolution (DE) to improve the LEACH routing protocol. To meet the requirements of monitoring applications in outdoor environments such as the meteorological, hydrological and wetland ecological environments, the proposed algorithm uses the simple and fast search features of DE to optimize the multi-objective selection of cluster heads and prevent blind nodes for improved energy efficiency and system stability. Simulation results show that the proposed new LEACH routing algorithm has better performance, effectively extends the working lifetime of the system, and improves the quality of the wireless sensor networks. PMID:22219670

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

    Estévez, Francisco José; Glösekötter, Peter; González, Jesús

    2016-01-01

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

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

    Estévez, Francisco José; Glösekötter, Peter; González, Jesús

    2016-01-01

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

  11. Routing for wireless multi-hop networks

    Hamid, Sherin Abdel; Takahara, Glen

    2013-01-01

    The focus of this brief is to identify what unifies and what distinguishes the routing functions in four wireless multi-hop network paradigms. The brief introduces a generic routing model that can be used as a foundation of wireless multi-hop routing protocol analysis and design. It demonstrates that such model can be adopted by any wireless multi-hop routing protocol. Also presented is a glimpse of the ideal wireless multi-hop routing protocol along with several open issues.

  12. Submarine Pipeline Routing Risk Quantitative Analysis

    徐慧; 于莉; 胡云昌; 王金英

    2004-01-01

    A new method for submarine pipeline routing risk quantitative analysis was provided, and the study was developed from qualitative analysis to quantitative analysis.The characteristics of the potential risk of the submarine pipeline system were considered, and grey-mode identification theory was used. The study process was composed of three parts: establishing the indexes system of routing risk quantitative analysis, establishing the model of grey-mode identification for routing risk quantitative analysis, and establishing the standard of mode identification result. It is shown that this model can directly and concisely reflect the hazard degree of the routing through computing example, and prepares the routing selection for the future.

  13. Risk-minimal routes for emergency cars

    Woelki, Marko; Nippold, Ronald; Bonert, Michael; Ruppe, Sten

    2013-01-01

    The computation of an optimal route for given start and destination in a static transportation network is used in many applications of private route planning. In this work we focus on route planning for emergency cars, such as for example police, fire brigade and ambulance. In case of private route planning typical quantities to be minimized are travel time or route length. However, the idea of this paper is to minimize the risk of a travel time exceeding a certain limit. This is inspired by ...

  14. Association between proximity to and coverage of traditional fast-food restaurants and non-traditional fast-food outlets and fast-food consumption among rural adults

    Horel Scott A

    2011-05-01

    Full Text Available Abstract Objective The objective of this study is to examine the relationship between residential exposure to fast-food entrées, using two measures of potential spatial access: proximity (distance to the nearest location and coverage (number of different locations, and weekly consumption of fast-food meals. Methods Traditional fast-food restaurants and non-traditional fast-food outlets, such as convenience stores, supermarkets, and grocery stores, from the 2006 Brazos Valley Food Environment Project were linked with individual participants (n = 1409 who completed the nutrition module in the 2006 Brazos Valley Community Health Assessment. Results Increased age, poverty, increased distance to the nearest fast food, and increased number of different traditional fast-food restaurants, non-traditional fast-food outlets, or fast-food opportunities were associated with less frequent weekly consumption of fast-food meals. The interaction of gender and proximity (distance or coverage (number indicated that the association of proximity to or coverage of fast-food locations on fast-food consumption was greater among women and opposite of independent effects. Conclusions Results provide impetus for identifying and understanding the complex relationship between access to all fast-food opportunities, rather than to traditional fast-food restaurants alone, and fast-food consumption. The results indicate the importance of further examining the complex interaction of gender and distance in rural areas and particularly in fast-food consumption. Furthermore, this study emphasizes the need for health promotion and policy efforts to consider all sources of fast-food as part of promoting healthful food choices.

  15. On board processing for future satellite communications systems: Comparison of FDM, TDM and hybrid accessing schemes

    Berk, G.; Jean, P. N.; Rotholz, E.

    1982-01-01

    Several satellite uplink and downlink accessing schemes for customer premises service are compared. Four conceptual system designs are presented: satellite-routed frequency division multiple access (FDMA), satellite-switched time division multiple access (TDMA), processor-routed TDMA, and frequency-routed TDMA, operating in the 30/20 GHz band. The designs are compared on the basis of estimated satellite weight, system capacity, power consumption, and cost. The systems are analyzed for fixed multibeam coverage of the continental United States. Analysis shows that the system capacity is limited by the available satellite resources and by the terminal size and cost.

  16. Personalized Alert Notifications and Evacuation Routes in Indoor Environments

    Teresa Onorati

    2012-06-01

    Full Text Available The preparedness phase is crucial in the emergency management process for reaching an adequate level of readiness to react to potential threats and hazards. During this phase, emergency plans are developed to establish, among other procedures, evacuation and emergency escape routes. Information and Communication Technologies (ICT can support and improve these procedures providing appropriate, updated and accessible information to all people in the affected zone. Current emergency management and evacuation systems do not adapt information to the context and the profile of each person, so messages received in the emergency might be useless. In this paper, we propose a set of criteria that ICT-based systems could achieve in order to avoid this problem adapting emergency alerts and evacuation routes to different situations and people. Moreover, in order to prove the applicability of such criteria, we define a mechanism that can be used as a complement of traditional evacuation systems to provide personalized alerts and evacuation routes to all kinds of people during emergency situations in working places. This mechanism is composed by three main components: CAP-ONES for notifying emergency alerts, NERES for defining emergency plans and generating personalized evacuation routes, and iNeres as the interface to receive and visualize these routes on smartphones. The usability and understandability of proposed interface has been assessed through a user study performed in a fire simulation in an indoor environment. This evaluation demonstrated that users considered iNeres easy to understand, to learn and to use, and they also found very innovative the idea to use smartphones as a support for escaping instead of static signals on walls and doors.

  17. SCRAM: A Sharing Considered Route Assignment Mechanism for Fair Taxi Route Recommendations

    Qian, Shiyou; Cao, Jian; Le Mouël, Frédéric; Sahel, Issam; Li, Minglu

    2015-01-01

    Recommending routes for a group of competing taxi drivers is almost untouched in most route recommender systems. For this kind of problem, recommendation fairness and driving efficiency are two fundamental aspects. In the paper, we propose SCRAM, a sharing considered route assignment mechanism for fair taxi route recommendations. SCRAM aims to provide recommendation fairness for a group of competing taxi drivers, without sacrificing driving efficiency. By designing a concise route assignment ...

  18. Dynamic information routing in complex networks

    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

  19. Dynamic information routing in complex networks

    Kirst, Christoph; Timme, Marc; Battaglia, Demian

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

  20. VANET Routing Protocols: Pros and Cons

    Paul, Bijan; Bikas, Md Abu Naser

    2012-01-01

    VANET (Vehicular Ad-hoc Network) is a new technology which has taken enormous attention in the recent years. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles, called V2V or vehicle to vehicle communication and vehicle to road side infrastructure, called V2I. The existing routing protocols for VANET are not efficient to meet every traffic scenarios. Thus design of an efficient routing protocol has taken significant attention. So, it is very necessary to identify the pros and cons of routing protocols which can be used for further improvement or development of any new routing protocol. This paper presents the pros and cons of VANET routing protocols for inter vehicle communication.

  1. LINK STABILITY WITH ENERGY AWARE AD HOC ON DEMAND MULTIPATH ROUTING PROTOCOL IN MOBILE AD HOC NETWORKS

    Senthil Murugan Tamilarasan

    2013-01-01

    Full Text Available Mobile Ad Hoc Network is one of the wireless network in which mobile nodes are communicate with each other and have no infrastructure because no access point. The MANET protocols can be classified as proactive and reactive routing protocol. The proactive routing protocols, all nodes which participated in network have routing table. This table updated periodically and is used to find the path between source and destination. The reactive routing protocol, nodes are initiate route discovery procedure when on-demand routes. In order to find the better route in MANET, many routing protocols are designed in the recent years. But those protocols are not concentrating about communication links and battery energy. Communication links between nodes and energy of nodes are very important factor for improving quality of routing protocols. This study presents innovative Link Stability with Energy Aware (LSEA multipath routing protocol. The key idea of the protocol is find the link quality, maximum remaining energy and lower delay. Reflections of these factors are increasing the qualities like packet delivery ratio, throughputs and reduce end-to-end delay. The LSEAMRP was simulated on NS-2 and evaluation results also shown.

  2. Potential Routes for Thermochemical Biorefineries

    García Haro, Pedro; Ollero de Castro, Pedro Antonio; Vidal-Barrero, José Fernando; Villanueva Perales, Ángel Luis

    2013-01-01

    This critical review focuses on potential routes for the multi-production of chemicals and fuels in the framework of thermochemical biorefineries. The up-to-date research and development in this field has been limited to BTL/G (biomass-to-liquids/gases) studies, where biomass-derived synthesis gas (syngas) is converted into a single product with/without the co-production of electricity and heat. Simultaneously, the interest on biorefineries is growing but mostly refers to the biochemical proc...

  3. The line planning routing game

    Gattermann, P.; Schiewe, A.; Schmidt, M.

    2014-01-01

    In this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s best-response ...

  4. The line planning routing game

    Gattermann, Philine; Schiewe, Alexander; Schmidt, Marie

    2014-01-01

    textabstractIn this paper, we propose a novel algorithmic approach to solve line planning problems. To this end, we model the line planning problem as a game where the passengers are players which aim at minimizing individual objective functions composed of travel time, transfer penalties, and a share of the overall cost of the solution. To find equilibria of this routing game, we use a best-response algorithm. We investigate, under which conditions on the line planning model a passenger’s be...

  5. The vehicle routing problem with edge set costs

    Reinhardt, Line Blander; Jepsen, Mads Kehlet; Pisinger, David

    We consider an important generalization of the vehicle routing problem with time windows in which a fixed cost must be paid for accessing a set of edges. This fixed cost could reflect payment for toll roads, investment in new facilities, the need for certifications and other costly investments. The...... certifications and contributions impose a cost for the company while they also give unlimited usage of a set of roads to all vehicles belonging to the company. Different versions for defining the edge sets are discussed and formulated. A MIP-formulation of the problem is presented, and a solution method based on...

  6. Access 2007 for Starters: The Missing Manual

    MacDonald, Matthew

    2009-01-01

    This fast-paced book teaches you the basics of Access 2007 so you can start using the program right away. You'll learn how to design databases, maintain them, search for valuable nuggets of information, and build attractive forms for quick-and-easy data entry. The new Access is radically different from previous versions, but with this book, you'll breeze through the new interface and its timesaving features in no time.

  7. Energy Efficient Routing Protocol for MANET

    S.Gopinath

    2012-03-01

    Full Text Available In recent years, many energy-efficient routing protocols have been proposed. However, very little efforts have been taken in studying the energy consumption of individual node, overhead and route maintaining issues. While not considering the design of energy efficient routing protocol, it may perform very worst than the normal routing protocol. Here, we have proposed On Demand Based Energy Efficient Routing Protocol (ODBEERP. The main aim of proposed protocol is to discover the minimum power-limitation route. The power limitation of a route is decided by the node which has the minimum energy in that route. So compared with the minimum node energy in any other route, the minimum node energy in the minimum power-limitation route has more energy. We have also proposed a more accurate analysis to track the energy consumptions due to various factors, and improve the performance during path discovery and in mobility scenarios. The proposed protocol is evaluated with object oriented discrete event simulator environment. Simulation results shows that the ODBEERP achieves good throughput, less delay, high packet delivery ratio and good energy efficiency than the existing protocol PEER.

  8. Load Balancing Routing with Bounded Stretch

    Chen Siyuan

    2010-01-01

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

  9. Bicretieria Optimization in Routing Games

    Busch, Costas

    2008-01-01

    Two important metrics for measuring the quality of routing paths are the maximum edge congestion $C$ and maximum path length $D$. Here, we study bicriteria in routing games where each player $i$ selfishly selects a path that simultaneously minimizes its maximum edge congestion $C_i$ and path length $D_i$. We study the stability and price of anarchy of two bicriteria games: - {\\em Max games}, where the social cost is $\\max(C,D)$ and the player cost is $\\max(C_i, D_i)$. We prove that max games are stable and convergent under best-response dynamics, and that the price of anarchy is bounded above by the maximum path length in the players' strategy sets. We also show that this bound is tight in worst-case scenarios. - {\\em Sum games}, where the social cost is $C+D$ and the player cost is $C_i+D_i$. For sum games, we first show the negative result that there are game instances that have no Nash-equilibria. Therefore, we examine an approximate game called the {\\em sum-bucket game} that is always convergent (and ther...

  10. Wine routes as an element of the regional development of borderline regions

    Vladimir Drozg

    1993-12-01

    Full Text Available The article examines the role of winw routes in promoting the development of wine-growing regions. It focuses both on the criteria for tracing wine routes (landscape value of a region, distribution of tourist supply settlements and events, natural and cultural monuments, existing road netivorks and transport accessibility, supplemenlary activities along the wine routes and on the impact that wine exert on the landscape/region (an increased income of individual households, better infrastructure equipment, recuttivation ol desert land lots, decreasing depopulalion and development of supplementary activities. The wine route through the Svečinske gorice region is presented as an example of countryside regulation.

  11. A Novel Linear Programming Formulation of Maximum Lifetime Routing Problem in Wireless Sensor Networks

    Cetin, Bilge Kartal; Prasad, Neeli R.; Prasad, Ramjee

    2011-01-01

    protocols, and the energy model for transmission. In this paper, we tackle the routing challenge for maximum lifetime of the sensor network. We introduce a novel linear programming approach to the maximum lifetime routing problem. To the best of our knowledge, this is the first mathematical programming...... of the maximum lifetime routing problem that considers the operation modes of the node. Solution of the linear programming gives the upper analytical bound for the network lifetime. In order to illustrate teh application of the optimization model, we solved teh problem for different parameter settings......In wireless sensor networks, one of the key challenge is to achieve minimum energy consumption in order to maximize network lifetime. In fact, lifetime depends on many parameters: the topology of the sensor network, the data aggregation regime in the network, the channel access schemes, the routing...

  12. Route Prediction Based Vehicular Mobility Management Scheme for VANET

    DaeWon Lee; Yoon-Ho Kim; HwaMin Lee

    2014-01-01

    Since improvement of wireless communication, IP based mobility management protocols have been studied to provide seamless communication and mobility management. The vehicular ad hoc network (VANET) is one of mobility management protocols, especially providing seamless connection with inter/intra/inner vehicle communication. However, each vehicle moves fast that causes short-lived connections with Access Router (AR). Based on vehicles’ characteristic, it is hard to provide the availability of ...

  13. COMPUTER REALIZATION OF SEARCH TASK OF THE SHORTEST ROUTE WITH THE HELP OF EXCEL AND VBA

    Dorohov, А.

    2008-01-01

    The necessity of the development of simple and accessible to the final users of the applied software for the decision of local optimization tasks of transport technologies has been grounded with the help of the Excel and VBA facilities. The computer task decision and search of the shortest route has been described.

  14. DYNAMIC K-MEANS ALGORITHM FOR OPTIMIZED ROUTING IN MOBILE AD HOC NETWORKS

    Zahra Zandieh Shirazi

    2016-04-01

    Full Text Available In this paper, a dynamic K-means algorithm to improve the routing process in Mobile Ad-Hoc networks (MANETs is presented. Mobile ad-hoc networks are a collocation of mobile wireless nodes that can operate without using focal access points, pre-existing infrastructures, or a centralized management point. In MANETs, the quick motion of nodes modifies the topology of network. This feature of MANETS is lead to various problems in the routing process such as increase of the overhead massages and inefficient routing between nodes of network. A large variety of clustering methods have been developed for establishing an efficient routing process in MANETs. Routing is one of the crucial topics which are having significant impact on MANETs performance. The K-means algorithm is one of the effective clustering methods aimed to reduce routing difficulties related to bandwidth, throughput and power consumption. This paper proposed a new K-means clustering algorithm to find out optimal path from source node to destinations node in MANETs. The main goal of proposed approach which is called the dynamic K-means clustering methods is to solve the limitation of basic K-means method like permanent cluster head and fixed cluster members. The experimental results demonstrate that using dynamic K-means scheme enhance the performance of routing process in Mobile ad-hoc networks.

  15. Closure of the Route de Meyrin as of 11 February 2008

    In the framework of the work on the new Cornavin-Meyrin-CERN tramline, an underpass is to be cut into the hill of Meyrin village where the Route de Meyrin meets the Avenue de Vaudagne and the Avenue Virginio-Malnati. As a result, the Route de Meyrin will be closed to through traffic for a period of two years, starting on Monday 11 February 2008. The following traffic diversions will be in operation: - Traffic travelling in the Geneva-France direction will be diverted along the Avenue de Mategnin and the Avenue Louis-Rendu or the Route du Nant-d'Avril and the Route du Mandement, - Traffic travelling in the France-Geneva direction will be diverted along the Route du Mandement and the Route du Nant-d'Avril. There will also be special diversion routes in the centre of Meyrin reserved for access to shops, houses and flats and the La Tour hospital. The map is available at the following link. Relations with the Host States Service Tel. 72848

  16. Closure of the Route de Meyrin as of 11 February 2008

    DSU Department

    2008-01-01

    In the framework of the work on the new Cornavin-Meyrin-CERN tramline, an underpass is to be cut into the hill of Meyrin village where the Route de Meyrin meets the Avenue de Vaudagne and the Avenue Virginio-Malnati. As a result, the Route de Meyrin will be closed to through traffic for a period of two years, starting on Monday 11 February 2008. The following traffic diversions will be in operation: Traffic travelling in the Geneva-France direction will be diverted along the Avenue de Mategnin and the Avenue Louis-Rendu or the Route du Nant-d’Avril and the Route du Mandement, Traffic travelling in the France-Geneva direction will be diverted along the Route du Mandement and the Route du Nant-d’Avril. There will also be special diversion routes in the centre of Meyrin reserved for access to shops, houses and flats and the La Tour hospital. Full details of the project (in French) can be consulted on the following website: http://w...

  17. CluLoR: Clustered Localized Routing for FiWi Networks

    Yousef Dashti

    2014-04-01

    Full Text Available The integration of passive optical networks (PONs and wireless mesh networks (WMNs into Fiber- Wireless (FiWi networks can lead to effective access networks. Existing routing schemes for FiWi networks consider mainly hop-count and delay metrics over a flat WMN node topology and do not specifically prioritize the local network structure, i.e., the local wireless-optical network gateway. In this study, we explore a simple, yet effective routing algorithm for FiWi networks with a WMN organized into zones operating on different radio channels. We examine the effects of routing the traffic into and out of a zone through one or more cluster heads. We investigate the effectiveness of localized routing that prioritizes transmissions over the local gateway to the optical network and avoids wireless packet transmissions in zones that do not contain the packet source or destination. We find that this combination of clustered and localized routing (CluLoR gives good throughput-delay performance compared to routing schemes that transmit packets wirelessly through “transit zones” (that do not contain the packet source or destination following minimum hop-count routing.

  18. Comparative Analysis of Ad hoc Routing Unicast Protocols-Using WiMax Enviorment

    Preeti Arora

    2011-03-01

    Full Text Available Worldwide Interoperability for Microwave Access (WiMAX is a technology that bridges the gap between fixed and mobile access and offer the same subscriber experience for fixed and mobile user. Demand for such type of mobile broadband servicesaccess, which is further extended to support portability and mobility based on IEEE 802.16e, also known as Mobile WiMAX. However, frequent topology changes caused by node mobility make routing in Mobile WiMAX networks a challenging problem. In this paper, we focus upon those routing protocols especially designed for wireless networks. Here, we study and compare the performance of four ad hoc routing protocols (AODV, DSR, and ZRP for Mobile WiMAX environment under the assumption that each of the subscriber station has routing capabilities within its own network. From our simulation, we found that ZRP and AODV protocols outperform DSR and applications are growing rapidly as it provides freedom to the subscribers to be online wherever they are at a competitive price and other significant facilities such as increasing amounts of bandwidth, using a variety of mobile and nomadic devices etc. [1][2]. The earliest version of WiMAX is based on IEEE 802.16 and is optimized for fixed and nomadic which is further extended to support portability and mobility based on IEEE 802.16e, also known as Mobile WiMAX. However, frequent topology changes caused by node mobility make routing in Mobile WiMAX networks a challenging problem. In this paper, we focus upon those routing protocols especially designed for wireless networks. Here, we study and compare the performance of four ad hoc routing protocols (AODV, DSR, and ZRP for Mobile WiMAX environment under the assumption that each of the subscriber station has routing capabilities within its own network. From our simulation, we found that ZRP and AODV protocols outperform DSR.

  19. Using Crowdsourced Indoor Geodata for the Creation of a Three-Dimensional Indoor Routing Web Application

    Marcus Goetz

    2012-06-01

    Full Text Available Routing services for outdoor areas are omnipresent and also three-dimensional (3D visualization is quite common within this area. Recent research efforts are now trying to adapt well known outdoor routing services to complex indoor environments. However, most of the current indoor routing systems only focus on two-dimensional visualization, thus only one level can be depicted. Especially multi-level routes therefore lack visualization. Also, most of the (few existing 3D indoor routing services utilize proprietary software or plugins, thus a widespread accessibility for those services by using common computers or mobile devices is not feasible. Therefore this paper describes the development of a web-based 3D routing system based on a new HTML extension. The visualization of rooms as well as the computed routes is realized with XML3D. Since this emerging technology is based on WebGL and will likely be integrated into the HTML5 standard, the developed system is already compatible with most common browsers such as Google Chrome or Firefox. Another key difference of the approach presented in this paper is that all utilized data is actually crowdsourced geodata from OpenStreetMap (OSM. Such data is collaboratively collected by both amateurs and professionals and can be used at no charge under the Open Data Commons Open Database License (ODbL. Our research combines user-generated geo content of the Web 2.0 with future Internet technology for the provision of a ubiquitously accessible 3D indoor routing application.

  20. Using Fast Food Nutrition Facts to Make Healthier Menu Selections

    Turley, Jennifer

    2009-01-01

    Objectives: This teaching idea enables students to (1) access and analyze fast food nutrition facts information (Calorie, total fat, saturated fat, trans fat, cholesterol, sugar, and sodium content); (2) decipher unhealthy and healthier food choices from fast food restaurant menus for better meal and diet planning to reduce obesity and minimize…

  1. Vehicle routing problem in investment fund allocation

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

    2013-04-01

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

  2. Dynamic information routing in complex networks

    Kirst, Christoph; Battaglia, Demian

    2015-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 generic mechanism specifically for oscillatory dynamics and analyze how individual unit properties, the network topology and external inputs coact 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 non-local network-wide communication. These results help...

  3. Zone routing in a torus network

    Chen, Dong; Heidelberger, Philip; Kumar, Sameer

    2013-01-29

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

  4. Predicting transportation routes for radioactive wastes

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

  5. Choosing offshore pipeline routes: problems and solutions. Final report

    Gowen, A.M.; Goetz, M.J.; Waitsman, I.M.

    1980-05-01

    The report discusses the environmental and fisheries problems associated with offshore pipelines. The report focuses on how these problems can be addressed during the pipeline planning and route selection process. Geologic hazards are highlighted as the major factors related to pipeline failure which can be addressed through the pipeline routing process. Habitats and ecosystems are particularly susceptible to installation-related disturbances. These areas as well as those where geologic hazards are most likely to be encountered are described. Fishing problems highlighted include loss of access to fishing areas due to pipelines both from platform to shore and between platforms. The effects of obstructions on bottom fishing gear are also considered. The concept of pipeline trenching for safety and stability is discussed. Finally, criteria to use in analyzing a proposed pipeline route are presented. Topics discussed include general industry siting criteria, geologic and environmental areas to avoid in pipeline siting and methods for minimizing unavoidable impacts. The report is designed to be used by scientists or engineers involved in offshore petroleum pipeline planning.

  6. Civil engineering work to raise the level of Route Goward

    2013-01-01

    Civil engineering work to raise the level of Route Goward will take place during Long Shutdown 1. The work will begin on 18 March 2013 and is expected to last around 5 months.   Route Goward runs over the top of the PS tunnel and is the only access route to the inside of the ring. The layer of shielding backfill beneath this road is the thinnest anywhere on the PS ring. As the purpose of this shielding is to protect against the ionising radiation emitted by the accelerator when in operation, this road has been classified as a “supervised radiation area” according to radiation protection regulations. This classification was merely a temporary solution and, on the recommendation of the PS Radiation Working Group (PSRWG), the decision has been taken to raise the surface level permanently by around 2 m in order to increase the thickness of the shielding and thus lower the dose rate to that of a non-designated area. As the PS tunnel itself is unable to withstand the weight of t...

  7. Modified Rumor Routing for Wireless Sensor Networks

    Chiranjib Patra; Parama Bhaumik; Debina Chakroborty

    2010-01-01

    Due to the limited processing power, and finite power available to each sensor node, regular ad-hoc routing techniques cannot be directly applied to sensor networks domain. Thus, energy-efficient routing algorithms suitable to the inherent characteristics of these types of networks are needed. However highly efficient data centric model of routing will improve the longevity of the network. This paper describes a mechanism of improvisation through simulation of existing feature of Rumor routin...

  8. Routing in Wireless Networks with Position Trees

    Chavez, Edgar; Mitton, Nathalie; Tejeda, Hector

    2007-01-01

    Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing protocols are preferred because sensor networks have limited battery life. Location aware routing protocols are good candidates for sensor network applications, nevertheless they need either an external location service like GPS or Galileo (which are bulky, energy consuming devices) or internal location services prov...

  9. Learning multiple routes in homing pigeons

    Flack, Andrea; Guilford, Tim; Biro, Dora

    2014-01-01

    The aerial lifestyle of central-place foraging birds allows wide-ranging movements, raising fundamental questions about their remarkable navigation and memory systems. For example, we know that pigeons (Columba livia), long-standing models for avian navigation, rely on individually distinct routes when homing from familiar sites. But it remains unknown how they cope with the task of learning several routes in parallel. Here, we examined how learning multiple routes influences homing in pigeon...

  10. Towards Building an Intelligent Call Routing System

    Thien Khai Tran; Dung Minh Pham; Binh Van Huynh

    2016-01-01

    This paper presents EduICR - an Intelligent Call Routing system. This system can route calls to the most appropriate agent using routing rules built by the text classifier. EduICR includes the following main components: telephone communication network; Vietnamese speech recognition; Text classifier/ Natural language processor and Vietnamese speech synthesis. To our best knowledge, this is one of the first systems in Vietnam to implement the integration mechanism of text processing and speech ...

  11. Martel's routes in Mammoth cave, Kentucky, 1912.

    Shaw Trevor R.

    2003-01-01

    Martel’s own copy of the Hovey 1912 guidebook to Mammoth Cave has his routes marked faintly in pencil on the printed cave plans. These plans are reproduced here, with his routes indicated on them. He generally followed the four standard tourist routes which now included Kaemper’s 1908 discoveries to Violet City, but instead of visiting the Maelstrom he went to Hovey’s Cathedral and Gerta’s Grotto.

  12. An Anonymous Secure Routing Using OLSR Protocol

    Osiers Gyamfuah Grace; Dr. John Rajan

    2013-01-01

    Security and privacy concerns are major issues to be considered in Mobile Ad hoc Networking (MANET). Several routing protocols have been proposed to achieve both routing and data packets security. In order to achieve privacy, the anonymous routing concept has been introduced and few protocols have been proposed for use in this area. In this paper, global position system (GPS) device is used to obtain the current location of nodes and with the help of a cryptographic algorithm incorporated int...

  13. Gender differences in virtual route learning

    Larios, Hector

    2011-01-01

    Past studies have found evidence of gender differences in route-learning strategies, indicating that men rely on configurational strategies (e.g., cardinal directions) and women rely on topographic strategies (e.g., landmarks). Whether and how these gender differences in route-learning strategies extend to virtual environments is not fully known. In this dissertation, I investigated gender differences in learning virtual routes from two frames of reference- egocentric and allocentric. One hun...

  14. Advances in optimal routing through computer networks

    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.

  15. Korean adolescents' perceptions of nutrition and health towards fast foods in Busan area

    Yoon, Ji-Young; Lyu, Eun-Soon; Lee, Kyung-A

    2008-01-01

    Adolescents in Busan area were asked in a survey about their perception and attitudes towards fast food. Most respondents answered that they consume fast food once a month because it is fast, easily accessible and tasty. Although they perceived fast food as unhealthy and less nutritious, they were less aware of its effect on their health and nutritional status. The more knowledgeable respondents were about nutrition and health the less likely they were to choose fast food over other meals. Ho...

  16. Flood Routing Technique for Data Networks

    Cho, Jaihyung; Breen, James

    1998-01-01

    In this paper, a new routing algorithm based on a flooding method is introduced. Flooding techniques have been used previously, e.g. for broadcasting the routing table in the ARPAnet [1] and other special purpose networks [3][4][5]. However, sending data using flooding can often saturate the network [2] and it is usually regarded as an inefficient broadcast mechanism. Our approach is to flood a very short packet to explore an optimal route without relying on a pre-established routing table, a...

  17. Security Attacks On MANET Routing Protocols

    Chiragkumar V. Patel

    2013-10-01

    Full Text Available The paper gives idea about various routing protocols for Mobile Ad-Hoc Network against security issues. MANET is vulnerable to various security attacks due to its dynamically changing topology, self configurable nature and lack of centralized control. Malicious node can significantly degrade the performance and reliability of Ad-hoc Network routing protocols. From the survey it has been made quite clear that basic MANET protocols are vulnerable to various routing attacks. While Secure AODV (SAODV routing protocol performs quite well to improve performance in presence of security attack in MANET.

  18. Bus Routes, Marta Bus Routes located in Transportation database, Published in unknown, City of Roswell, GA.

    NSGIC GIS Inventory (aka Ramona) — This Bus Routes dataset as of unknown. It is described as 'Marta Bus Routes located in Transportation database'. Data by this publisher are often provided in State...

  19. Transportation routing analysis geographic information system - tragis, progress on improving a routing tool

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

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

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

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

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

  2. A Privacy-Preserving Prediction Method for Human Travel Routes

    Wen-Chen Hu

    2014-12-01

    Full Text Available This paper proposes a kind of location-based research, human travel route prediction, which is to predict the track of a subject's future movements. The proposed method works as follows. The mobile user sends his/her current route along with several dummy routes to the server by using a 3D route matrix, which encodes a set of routes. The server restores the routes from the 3D matrix and matches the restored routes to the saved routes. The predicted route is found as the trunk of the tree, which is built by superimposing the matching results. The server then sends the predicted routes back to the user, who will apply the predicted route to a real-world problem such as traffic control and planning. Preliminary experimental results show the proposed method successfully predicts human travel routes based on current and previous routes. User privacy is also rigorously protected by using a simple method of dummy routes.

  3. The Rise and Fall of Third-party High-speed Access

    Rosston, Gregory L.

    2006-01-01

    While Internet usage blossomed during the entire 1995 – 2001 time period, there was a large change in the nature of the high-speed Internet access business. Initially, connection, routing and content were three separate parts of high-speed Internet service. Cable companies initially teamed with affiliated third-party providers to create their highspeed access combination of connection and routing whereas telephone companies resisted working with third-party providers for their high-speed acce...

  4. Access and closure of the left ventricular apex: state of play

    Ziegelmueller, Johannes Amadeus; Lange, Rüdiger; Bleiziffer, Sabine

    2015-01-01

    Calcific aortic stenosis is the most frequent manifestation of valvular heart disease. The preferred treatment for patients of all age groups is surgical aortic valve replacement. Recently, transcatheter aortic valve implantation (TAVI) has become the standard of care for patients that are deemed to be at high risk for open heart surgery. The most common access route for TAVI is the retrograde transfemoral (TF) approach, followed by the antegrade transapical (TA) approach. Both access routes ...

  5. Random Access to Grammar-Compressed Strings

    Bille, Philip; Landau, Gad M.; Raman, Rajeev; Sadakane, Kunihiko; Satti, Srinivasa Rao; Weimann, Oren

    (n) is the inverse of the kth row of Ackermann's function. Our representations also efficiently support decompression of any substring in S: we can decompress any substring of length m in the same complexity as a single random access query and ad- ditional O(m) time. Combining these results with fast...

  6. Random Access to Grammar-Compressed Strings

    Bille, Philip; Landau, Gad M.; Raman, Rajeev;

    2011-01-01

    (n) is the inverse of the kth row of Ackermann's function. Our representations also efficiently support decompression of any substring in S: we can decompress any substring of length m in the same complexity as a single random access query and ad- ditional O(m) time. Combining these results with fast...

  7. Fast food (image)

    Fast foods are quick, reasonably priced, and readily available alternatives to home cooking. While convenient and economical for a busy lifestyle, fast foods are typically high in calories, fat, saturated fat, ...

  8. Fast food tips (image)

    ... challenge to eat healthy when going to a fast food place. In general, avoiding items that are deep ... challenge to eat healthy when going to a fast food place. In general, avoiding items that are deep ...

  9. Evacuation route planning during nuclear emergency using genetic algorithm

    In nuclear industry the routing in case of any emergency is a cause of concern and of great importance. Even the smallest of time saved in the affected region saves a huge amount of otherwise received dose. Genetic algorithm an optimization technique has great ability to search for the optimal path from the affected region to a destination station in a spatially addressed problem. Usually heuristic algorithms are used to carry out these types of search strategy, but due to the lack of global sampling in the feasible solution space, these algorithms have considerable possibility of being trapped into local optima. Routing problems mainly are search problems for finding the shortest distance within a time limit to cover the required number of stations taking care of the traffics, road quality, population size etc. Lack of any formal mechanisms to help decision-makers explore the solution space of their problem and thereby challenges their assumptions about the number and range of options available. The Genetic Algorithm provides a way to optimize a multi-parameter constrained problem with an ease. Here use of Genetic Algorithm to generate a range of options available and to search a solution space and selectively focus on promising combinations of criteria makes them ideally suited to such complex spatial decision problems. The emergency response and routing can be made efficient, in accessing the closest facilities and determining the shortest route using genetic algorithm. The accuracy and care in creating database can be used to improve the result of the final output. The Genetic algorithm can be used to improve the accuracy of result on the basis of distance where other algorithm cannot be obtained. The search space can be utilized to its great extend

  10. Routes visualization: Automated placement of multiple route symbols along a physical network infrastructure

    Jules Teulade-Denantes; Adrien Maudet; Cécile Duchêne

    2015-01-01

    This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement of such route symbols while maximizing their legibility, especially at junctions. The problem is mod...

  11. Accessibility in the Smart City

    Giuseppe Trieste

    2014-07-01

    Full Text Available FIABA is a cultural route for all, its aim is to promote a Global Accessibility and a Universal Usability through the removal of architectural, cultural, psychological and sensory barriers. FIABA is carrying out a real change and a cultural renewal in the name of equal opportunities. Respect for the environment in which we live is also a duty towards the younger generations to whom we must deliver a world in which free movement and the normal use of spaces are goals already achieved. There are millions of citizens who, because of their physical conditions are prisoners in their homes because there isn’t any elevator or any elevator maintenance. FIABA project aims at implementing “a Space for all” or “a landscape for all” following the path of the ONU Convention on the Rights of People with disabilities with an emphasis on architectural, cultural, and psychological barriers, the last ones in particular, create barriers to equal opportunities and they are often carriers of discrimination. The principle of accessibility is invoked in Article 9 of the Convention which confirms the principle that people have a right to live independently and participate fully in all spheres of life and thus States are required to take all necessary measures to ensure accessibility to physical environment, transport, information and communications, including systems and technologies of information and communication and other facilities and services open to the public, both in urban and rural areas.

  12. Fasting and Urinary Stones

    Ali Shamsa

    2013-01-01

    Introduction: Fasting is considered as one of the most important practices of Islam, and according to Prophet Mohammad, fasting is obligatory upon Muslims. The aim of this study is to evaluate the effects of fasting on urinary stones. Materials and Methods: Very few studies have been carried out on urinary stones and the effect of Ramadan fasting. The sources of the present study are Medline and articles presented by local and Muslim researchers. Meanwhile, since we are acquainted ...

  13. Ramadan, fasting and pregnancy

    Ahmed, Urfan Zahoor; Lykke, Jacob Alexander

    2014-01-01

    In Islam, the month of Ramadan is a period of fasting lasting 29 or 30 days. Epidemiological studies among Muslims in Denmark have not been conducted, but studies show, that fasting among pregnant Muslim women is common. Fasting does not increase the risk of growth restriction or preterm delivery...... month of Ramadan to a later period....

  14. Ramadan, faste og graviditet

    Ahmed, Urfan Zahoor; Lykke, Jacob Alexander

    2014-01-01

    In Islam, the month of Ramadan is a period of fasting lasting 29 or 30 days. Epidemiological studies among Muslims in Denmark have not been conducted, but studies show, that fasting among pregnant Muslim women is common. Fasting does not increase the risk of growth restriction or preterm delivery...... month of Ramadan to a later period....

  15. Centrality measures highlight proton traps and access points to proton highways in kinetic Monte Carlo trajectories

    Krueger, Rachel A. [Department of Chemistry, California Institute of Technology, Pasadena, California 91125 (United States); Haibach, Frederick G. [Confluent Science, Wilbraham, Massachusetts 01095 (United States); Fry, Dana L.; Gomez, Maria A., E-mail: magomez@mtholyoke.edu [Department of Chemistry, Mount Holyoke College, South Hadley, Massachusetts 01075 (United States)

    2015-04-21

    A centrality measure based on the time of first returns rather than the number of steps is developed and applied to finding proton traps and access points to proton highways in the doped perovskite oxides: AZr{sub 0.875}D{sub 0.125}O{sub 3}, where A is Ba or Sr and the dopant D is Y or Al. The high centrality region near the dopant is wider in the SrZrO{sub 3} systems than the BaZrO{sub 3} systems. In the aluminum-doped systems, a region of intermediate centrality (secondary region) is found in a plane away from the dopant. Kinetic Monte Carlo (kMC) trajectories show that this secondary region is an entry to fast conduction planes in the aluminum-doped systems in contrast to the highest centrality area near the dopant trap. The yttrium-doped systems do not show this secondary region because the fast conduction routes are in the same plane as the dopant and hence already in the high centrality trapped area. This centrality measure complements kMC by highlighting key areas in trajectories. The limiting activation barriers found via kMC are in very good agreement with experiments and related to the barriers to escape dopant traps.

  16. The digital backend of FAST

    Yu, Xinying; Zhang, Xia; Duan, Ran; li, di; Hao, Jie

    2015-08-01

    The receiver system is an important part of FAST (Five-hundred-meter Aperture Spherical Radio Telescope) and plays a key role in determining the performance of the telescope.This research covers three major aspects: establishment of system synchronization and timestamps, field-programmable gate array (FPGA)-based data transmission and analysis, and the rear receiver monitoring system. We intend to combine the use of GPS and a frequency standard instrument with network access to Unix timestamps to form actual timestamps. The data are stored with timestamps that contain integer and fractional seconds to be precise and headers, which are primarily intended to distinguish the data from each other.The data analysis procedures includes converting the timestamp information to real-time information, and merging the 8 channels’ data conversion results into frequency and energy data using corresponding conversion formulae. We must develop tailored monitoring software for the FAST receiver to customize the data format and perform data transmission. Signals on the front-end and back-end of the receiver can be monitored and controlled by adjusting the parameters on the software to increase the flexibility of the receiver.Most operations are performed on FPGA board, which can be shown from the figure, including the analog-to-digital conversion (ADC), fast Fourier transform (FFT), and pulse per second (1PPS) and Unix timestamp access operations.When analog data arrive, we initialize two ADCs at a sampling rate of 3Gsps, following by 8-channel FFT parallel processing.In collaboration with the Institute of Automation, we have developed a custom FPGA board which we call "FDB"("FAST Digital Backend"). The board is integrated with two Virtex-6 and one Virtex-5 high-speed Xilinx chips. The main function of the two Virtex-6 devices is to run the FFT and PFB programs, whereas the main function of Virtex-5 is configuration of the board.This research is indispensable for realizing the

  17. Optimizing departure times in vehicle routes

    Kok, A.L.; Hans, E.W.; Schutten, J.M.J.

    2008-01-01

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

  18. Environmental factors along the Northern Sea Route

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

  19. Energy Efficient Routing in Nomadic Networks

    Kristensen, Mads Darø; Bouvin, Niels Olof

    2007-01-01

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

  20. Secure Geographic Routing Protocols: Issues and Approaches

    Mehdi sookhak; Ramin Karimi; NorafidaIthnin; Mahboobeh Haghparast; Ismail FauziISnin

    2011-01-01

    In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them.

  1. TBRF: Trust Based Routing Framework for WSNs

    Kushal Gulaskar

    2014-03-01

    Full Text Available The multi-hop routing in wireless sensor networks (WSNs offers little protection against identity deception through replaying routing information. An adversary can exploit this defect to launch various harmful or even devastating attacks against the routing protocols, including sinkhole attacks, wormhole attacks and Sybil attacks. The situation is further aggravated by mobile and harsh network conditions. Traditional cryptographic techniques or efforts at developing trust-aware routing protocols do not effectively address this severe problem. To secure the WSNs against adversaries misdirecting the multi-hop routing, we have designed and implemented TBRF, a robust trust-aware routing framework for dynamic WSNs. Without tight time synchronization or known geographic information, TBRF provides trustworthy and energy-efficient route. Most importantly, TBRF proves effective against those harmful attacks developed out of identity deception; the resilience of TBRF is verified through extensive evaluation with both simulation and empirical experiments on large-scale WSNs under various scenarios including mobile and RF-shielding network conditions. Further, we have implemented a low-overhead TBRF module in TinyOS; as demonstrated, this implementation can be incorporated into existing routing protocols with the least effort. Based on TBRF, we also demonstrated a proof-of-concept mobile target detection application that functions well against an anti-detection mechanism

  2. Secure Geographic Routing Protocols: Issues and Approaches

    sookhak, Mehdi; Haghparast, Mahboobeh; ISnin, Ismail Fauzi

    2011-01-01

    In the years, routing protocols in wireless sensor networks (WSN) have been substantially investigated by researches. Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN) and also provide a qualitative comparison of them.

  3. Parallel Genetic Algorithm for Channel Routing

    Rao, Prahlada BB; Patnaik, LM; Hansdah, RC

    1993-01-01

    In this paper, we propose a new channel routing algorithm based on genetic approach. This involves designing a new encoding scheme and an evaluation function used by the genetic algorithm (GA) for channel routing problem. The algorithm has been implemented as both sequential and distributed CA. The speedup achieved is positive and encouraging.

  4. ROUTE CHOICE MODELLING FOR BICYCLE TRIPS

    Ehsan Beheshtitabar

    2014-06-01

    Full Text Available This paper intends to find out which parameters have the highest influence on bicyclists’ route-choice-behaviour and how they contribute. There are many attributes considered throughout different studies that are favoured by cyclists. The attributes are the basis for generating a function which predicts the route choice of cyclists. The paper aims at making a comparison between distance-based routes and attribute-based routes. The model for creating the bicycle route choice program is based on the network model of Norrköping, Sweden. The preferred attributes of the model each assign a weight in the cost function of the model for each link of the urban network. The algorithm of the lowest cost function route searches the shortest path in terms of assigned link costs over the whole network. For comparing the results of the cost function and the shortest route (between an origin-destination, the model has a shortest path finding algorithm between different Origin and Destination pairs implemented. It has been viewed that around 25% of all cumulative routes do not show any distance differences between the shortest path distance and attributes based solution. With the used weights of the Standard scenario, it can be seen that the trade-off between shortest distance and safety respectively comfort can be optimized, fulfilling both criteria (distance and safety/comfort.

  5. Using Collective Intelligence to Route Internet Traffic

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

    1999-01-01

    A COllective INtelligence (COIN) is a set of interacting reinforcement learning (RL) algorithms designed in an automated fashion so that their collective behavior optimizes a global utility function. We summarize the theory of COINs, then present experiments using that theory to design COINs to control internet traffic routing. These experiments indicate that COINs outperform all previously investigated RL-based, shortest path routing algorithms.

  6. Secure Geographic Routing Protocols: Issues and Approaches

    Mehdi sookhak

    2011-09-01

    Full Text Available In the years, routing protocols in wireless sensor networks (WSN have been substantially investigated by researches Most state-of-the-art surveys have focused on reviewing of wireless sensor network .In this paper we review the existing secure geographic routing protocols for wireless sensor network (WSN and also provide a qualitative comparison of them.

  7. Caspian producers contemplate excess of export routes

    The fourth quarter of 2005 sees the commissioning of the latest oil export route from the Caspian: the Baku-Tbilisi-Ceyhan (BTC) pipeline from Azerbaijan to Turkey. BTC is one of a series of potential export routes from Central Asia and the Trans-Caucasus. The proposed capacity of all these routes, however, far exceeds the volume of oil likely to be available to fill it at any time in the foreseeable future. Turkey nevertheless continues to press for more export capacity in an attempt to reduce the number of tankers passing through the narrow waterways that connect the Black Sea with the Mediterranean. For their part, Caspian oil producers want their oil to be transported by the cheapest and most direct route, which appears to rule out pipelines designed to divert their exports away from the Black Sea-Mediterranean sea-route. (author)

  8. Highway and interline transportation routing models

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

  9. Individuality in bird migration: routes and timing.

    Vardanis, Yannis; Klaassen, Raymond H G; Strandberg, Roine; Alerstam, Thomas

    2011-08-23

    The exploration of animal migration has entered a new era with individual-based tracking during multiple years. Here, we investigated repeated migratory journeys of a long-distance migrating bird, the marsh harrier Circus aeruginosus, in order to analyse the variation within and between individuals with respect to routes and timing. We found that there was a stronger individual repeatability in time than in space. Thus, the annual timing of migration varied much less between repeated journeys of the same individual than between different individuals, while there was considerable variation in the routes of the same individual on repeated journeys. The overall contrast in repeatability between time and space was unexpected and may be owing to strong endogenous control of timing, while short-term variation in environmental conditions (weather and habitat) might promote route flexibility. The individual variation in migration routes indicates that the birds navigate mainly by other means than detailed route recapitulation based on landmark recognition. PMID:21307045

  10. Latent variables and route choice behavior

    Prato, Carlo Giacomo; Bekhor, Shlomo; Pronello, Cristina

    2012-01-01

    In the last decade, a broad array of disciplines has shown a general interest in enhancing discrete choice models by considering the incorporation of psychological factors affecting decision making. This paper provides insight into the comprehension of the determinants of route choice behavior by...... proposing and estimating a hybrid model that integrates latent variable and route choice models. Data contain information about latent variable indicators and chosen routes of travelers driving regularly from home to work in an urban network. Choice sets include alternative routes generated with a branch....... Estimation results illustrate that considering latent variables (i.e., memory, habit, familiarity, spatial ability, time saving skills) alongside traditional variables (e.g., travel time, distance, congestion level) enriches the comprehension of route choice behavior....

  11. [Ramadan, fasting and pregnancy].

    Ahmed, Urfan Zahoor; Lykke, Jacob Alexander

    2014-07-14

    In Islam, the month of Ramadan is a period of fasting lasting 29 or 30 days. Epidemiological studies among Muslims in Denmark have not been conducted, but studies show, that fasting among pregnant Muslim women is common. Fasting does not increase the risk of growth restriction or preterm delivery, but there are reports of decreased foetal movements. Furthermore, the fasting may have long-term health consequences for the offspring, especially when they reach their middle age. According to Islam and the interpretation, pregnant and breast-feeding women are allowed to postpone the fasting of the month of Ramadan to a later period. PMID:25292203

  12. Fast R-CNN

    Girshick, Ross

    2015-01-01

    This paper proposes a Fast Region-based Convolutional Network method (Fast R-CNN) for object detection. Fast R-CNN builds on previous work to efficiently classify object proposals using deep convolutional networks. Compared to previous work, Fast R-CNN employs several innovations to improve training and testing speed while also increasing detection accuracy. Fast R-CNN trains the very deep VGG16 network 9x faster than R-CNN, is 213x faster at test-time, and achieves a higher mAP on PASCAL VOC...

  13. An immune orthogonal learning particle swarm optimisation algorithm for routing recovery of wireless sensor networks with mobile sink

    Hu, Yifan; Ding, Yongsheng; Hao, Kuangrong; Ren, Lihong; Han, Hua

    2014-03-01

    The growth of mobile handheld devices promotes sink mobility in an increasing number of wireless sensor networks (WSNs) applications. The movement of the sink may lead to the breakage of existing routes of WSNs, thus the routing recovery problem is a critical challenge. In order to maintain the available route from each source node to the sink, we propose an immune orthogonal learning particle swarm optimisation algorithm (IOLPSOA) to provide fast routing recovery from path failure due to the sink movement, and construct the efficient alternative path to repair the route. Due to its efficient bio-heuristic routing recovery mechanism in the algorithm, the orthogonal learning strategy can guide particles to fly on better directions by constructing a much promising and efficient exemplar, and the immune mechanism can maintain the diversity of the particles. We discuss the implementation of the IOLPSOA-based routing protocol and present the performance evaluation through several simulation experiments. The results demonstrate that the IOLPSOA-based protocol outperforms the other three protocols, which can efficiently repair the routing topology changed by the sink movement, reduce the communication overhead and prolong the lifetime of WSNs with mobile sink.

  14. Probabilistic models for access strategies to dynamic information elements

    Hansen, Martin Bøgsted; Olsen, Rasmus L.; Schwefel, Hans-Peter

    2010-01-01

    In various network services (e.g., routing and instances of context-sensitive networking) remote access to dynamically changing information elements is a required functionality. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach initiated by the requesting entity, and two versions of proactive approaches in which the entity that contains the information element actively propagates its changes to potential requesters, either (2) per...

  15. Mathoid: Robust, Scalable, Fast and Accessible Math Rendering for Wikipedia

    Schubotz, Moritz; Wicke, Gabriel

    2014-01-01

    Wikipedia is the first address for scientists who want to recap basic mathematical and physical laws and concepts. Today, formulae in those pages are displayed as Portable Network Graphics images. Those images do not integrate well into the text, can not be edited after copying, are inaccessible to screen readers for people with special needs, do not support line breaks for small screens and do not scale for high resolution devices. Mathoid improves this situation and converts formulae specif...

  16. Fast Transit Access to the Outer Solar System

    Squire, Jared; Bering, Edgar; Giambusso, Matthew; Carter, Mark; Ilin, Andrew; Diaz, Franklin R. Chang

    2015-11-01

    We explore the capability of a VASIMR® reusable probe “catapult” concept to send a 4000-5000 kg spacecraft to Jupiter on a Hohmann-like transfer orbit, arriving in just 36 months elapsed time. The VASIMR® performs a slingshot pass close to the Sun and uses the high level of available solar energy to produce a sustained burst of high thrust. Enough kinetic energy is provided to the probe to reach Jupiter orbit within 0.7-1.4 AU. The Catapult release the probe with enough speed to reach Jupiter in three years, and returns to Earth for another mission. This study identifies the important parameters in the probe ejector operation (power level, propellant mass, payload release point, distance of closest approach to the Sun), and scan these parameters to understand and optimize the capabilities of the proposed system. We assume that the Catapult and its payload begin at the Earth’s sphere of influence (SOI), and are coasting in the Earth’s orbit about the Sun. The VASIMR® engine’s power rating must match the peak power available when the spacecraft is closest to the Sun. The solar array is assumed to be a planar array rather than a concentrator since it will have to operate near the Sun, where a concentrator would overheat photovoltaic cells. The feasibility of not releasing the payload and using the VASIMR® to provide thrust for the duration of the transfer orbit will also be examined. In this scenario, the VASIMR® RF generators could serve double duty as radar RF sources.

  17. New routes for allergen immunotherapy.

    Johansen, Pål; von Moos, Seraina; Mohanan, Deepa; Kündig, Thomas M; Senti, Gabriela

    2012-10-01

    IgE-mediated allergy is a highly prevalent disease in the industrialized world. Allergen-specific immunotherapy (SIT) should be the preferred treatment, as it has long lasting protective effects and can stop the progression of the disease. However, few allergic patients choose to undergo SIT, due to the long treatment time and potential allergic adverse events. Since the beneficial effects of SIT are mediated by antigen presenting cells inducing Th1, Treg and antibody responses, whereas the adverse events are caused by mast cells and basophils, the therapeutic window of SIT may be widened by targeting tissues rich in antigen presenting cells. Lymph nodes and the epidermis contain high density of dendritic cells and low numbers of mast cells and basophils. The epidermis has the added benefit of not being vascularised thereby reducing the chances of anaphylactic shock due to leakage of allergen. Hence, both these tissues represent highly promising routes for SIT and are the focus of discussion in this review. PMID:23095873

  18. Drug targeting through pilosebaceous route.

    Chourasia, Rashmi; Jain, Sanjay K

    2009-10-01

    Local skin targeting is of interest for the pharmaceutical and the cosmetic industry. A topically applied substance has basically three possibilities to penetrate into the skin: transcellular, intercellular, and follicular. The transfollicular path has been largely ignored because hair follicles constitute only 0.1% of the total skin. The hair follicle is a skin appendage with a complex structure containing many cell types that produce highly specialised proteins. The hair follicle is in a continuous cycle: anagen is the hair growth phase, catagen the involution phase and telogen is the resting phase. Nonetheless, the hair follicle has great potential for skin treatment, owing to its deep extension into the dermis and thus provides much deeper penetration and absorption of compounds beneath the skin than seen with the transdermal route. In the case of skin diseases and of cosmetic products, delivery to sweat glands or to the pilosebaceous unit is essential for the effectiveness of the drug. Increased accumulation in the pilosebaceous unit could treat alopecia, acne and skin cancer more efficiently and improve the effect of cosmetic substances and nutrients. Therefore, we review herein various drug delivery systems, including liposomes, niosomes, microspheres, nanoparticles, nanoemulsions, lipid nanocarriers, gene therapy and discuss the results of recent researches. We also review the drugs which have been investigated for pilosebaceous delivery. PMID:19663765

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

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

  20. INTERLINE 5.0 -- An expanded railroad routing model: Program description, methodology, and revised user's manual

    A rail routine model, INTERLINE, has been developed at the Oak Ridge National Laboratory to investigate potential routes for transporting radioactive materials. In Version 5.0, the INTERLINE routing algorithms have been enhanced to include the ability to predict alternative routes, barge routes, and population statistics for any route. The INTERLINE railroad network is essentially a computerized rail atlas describing the US railroad system. All rail lines, with the exception of industrial spurs, are included in the network. Inland waterways and deep water routes along with their interchange points with the US railroadsystem are also included. The network contains over 15,000 rail and barge segments (links) and over 13,000 stations, interchange points, ports, and other locations (nodes). The INTERLINE model has been converted to operate on an IBM-compatible personal computer. At least a 286 computer with a hard disk containing approximately 6 MB of free space is recommended. Enhanced program performance will be obtained by using arandom-access memory drive on a 386 or 486 computer

  1. Inter-Cluster Routing Authentication for Ad Hoc Networks by a Hierarchical Key Scheme

    Yueh-Min Huang; Hua-Yi Lin; Tzone-I Wang

    2006-01-01

    Dissimilar to traditional networks, the features of mobile wireless devices that can actively form a network without any infrastructure mean that mobile ad hoc networks frequently display partition due to node mobility or link failures. These indicate that an ad hoc network is difficult to provide on-line access to a trusted authority server. Therefore,applying traditional Public Key Infrastructure (PKI) security framework to mobile ad hoc networks will cause insecurities.This study proposes a scalable and elastic key management scheme integrated into Cluster Based Secure Routing Protocol (CBSRP) to enhance security and non-repudiation of routing authentication, and introduces an ID-Based internal routing authentication scheme to enhance the routing performance in an internal cluster. Additionally, a method of performing routing authentication between internal and external clusters, as well as inter-cluster routing authentication, is developed.The proposed cluster-based key management scheme distributes trust to an aggregation of cluster heads using a threshold scheme faculty, provides Certificate Authority (CA) with a fault tolerance mechanism to prevent a single point of compromise or failure, and saves CA large repositories from maintaining member certificates, making ad hoc networks robust to malicious behaviors and suitable for numerous mobile devices.

  2. Fast arithmetic in MacLISP

    Steele, G. L., Jr.

    1977-01-01

    MacLISP provides a compiler which produces numerical code competitive in speed with some FORTRAN implementations and yet compatible with the rest of the MacLISP system. All numerical programs can be run under the MacLISP interpreter. Additional declarations to the compiler specify type information which allows the generation of optimized numerical code which generally does not require the garbage collection of temporary numerical results. Array accesses are almost as fast as in FORTRAN, and permit the use of dynamically allocated arrays of varying dimensions. The implementation decisions regarding user interface, data representations, and interfacing conventions are discussed which allow the generation of fast numerical LISP code.

  3. Study of barytocalcite as a conditioning matrix for carbon 14: Comparison of several synthesis routes

    Massoni, Nicolas, E-mail: nicolas.massoni@cea.fr; Rosen, Jeremy; Chartier, Myriam; Cozzika, Théodore

    2013-10-15

    Carbon-14 arising from the spent nuclear fuel reprocessing can disseminate into natural cycles and then its sequestration could be advantageous. In this study, we focus on the ceramic phase barytocalcite BaCa(CO{sub 3}){sub 2} (8.08 wt.% C) obtained from different synthesis routes. We show that several elaboration routes are possible but only two emerge ensuring a high reaction yield for a fast process. The first is a room temperature aqueous precipitation with nitrated precursors and the other is a double salt high temperature reaction with carbonated starting compounds, both of these precursors being compatible with the usual carbon-14 trapping process. The sensibility to experimental conditions of reference synthesis route and the reaction mechanisms are investigated and discussed.

  4. Research on Routing Algorithm Based on Limitation Arrangement Principle in Mathematics

    Jianhui Lv

    2014-01-01

    Full Text Available Since the research on information consistency of the whole network under OSPF protocol has been insufficient in recent years, an algorithm based on limitation arrangement principle for routing decision is proposed and it is a permutation and combination problem in mathematical area. The most fundamental function of this algorithm is to accomplish the information consistency of the whole network at a relatively fast speed. Firstly, limitation arrangement principle algorithm is proposed and proved. Secondly, LAP routing algorithm in single link network and LAP routing algorithm in single link network with multiloops are designed. Finally, simulation experiments are worked by VC6.0 and NS2, which proves that LAPSN algorithm and LAPSNM algorithm can solve the problem of information consistency of the whole network under OSPF protocol and LAPSNM algorithm is superior to Dijkstra algorithm.

  5. A new perspective on the access process

    Bergenholtz, Henning; Gouws, Rufus

    2010-01-01

    Only 10 or 15 years ago, you had to spend hours, days or even weeks in libraries to find data of many kinds. Today, one has access to data at your desks at home. Therefore, the biggest problem for a real information society is not that you do not have access to the needed data, but that you cannot...... find it or that it takes so long to find it that you quit the search before finding the result. This is clearly shown by a Google search where you get so many results that can lead to a case of information stress or even worse information death. An easy search route and a short search time are...... important elements when trying to satisfy certain information needs. This topic is discussed based on two case studies: one concerning certain fixed expressions in seven Danish printed and electronic dictionaries and one concerning looking at different access attempts in six Afrikaans reference sources...

  6. 43 CFR 36.10 - Access to inholdings.

    2010-10-01

    ... public health and safety and adequate and feasible access otherwise exists; or (iii) The route or method... applicant on the applicant's nonfederal land or occupancy interest. (2) Area also includes public lands... lands or a valid mining claim or other valid occupancy that is within or is effectively surrounded...

  7. Proximity Aware Routing in Ad Hoc Networks

    Valerie Alandzi

    2007-01-01

    Full Text Available Most of the existing routing protocols for ad hoc networks are designed to scale in networks of a few hundred nodes. They rely on state concerning all links of the network or links on the route between a source and a destination. This may result in poor scaling properties in larger mobile networks or when node mobility is high. Using location information to guide the routing process is one of the most often proposed means to achieve scalability in large mobile networks. However, location-based routing is difficult when there are holes in the network topology. We propose a novel position-based routing protocol called Proximity Aware Routing for Ad-hoc networks (PARA to address these issues. PARA selects the next hop of a packet based on 2-hops neighborhood information. We introduce the concept of “proximity discovery”. The knowledge of a node’s 2-hops neighborhood enables the protocol to anticipate concave nodes and helps reduce the risks that the routing protocol will reach a concave node in the network. Our simulation results show that PARA’s performance is better in sparse networks with little congestion. Moreover, PARA significantly outperforms GPSR for delivery ratio, transmission delay and path length. Our results also indicate that PARA delivers more packets than AODV under the same conditions.

  8. Integrated Routing Protocol for Opportunistic Networks

    Anshul Verma

    2011-03-01

    Full Text Available In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context oblivious based schemes are only way to enable communication between users. As soon as users become more social, context data spreads in the network, and context based routing becomes an efficient solution. In this paper we design an integrated routing protocol that is able to use context data as soon as it becomes available and falls back to dissemination-based routing when context information is not available. Then, we provide a comparison between Epidemic and PROPHET, these are representative of context oblivious and context aware routing protocols. Our results show that integrated routing protocol is able to provide better result in term of message delivery probability and message delay in both cases when context information about users is available or not.

  9. JISC Open Access Briefing Paper

    Swan, Alma

    2005-01-01

    What Open Access is. What Open Access is not. How is Open Access provided? Open Access archives or repositories. Open Access journals. Why should authors provide Open Access to their work? Further information and resources

  10. An Immune Cooperative Particle Swarm Optimization Algorithm for Fault-Tolerant Routing Optimization in Heterogeneous Wireless Sensor Networks

    Yifan Hu

    2012-01-01

    Full Text Available The fault-tolerant routing problem is important consideration in the design of heterogeneous wireless sensor networks (H-WSNs applications, and has recently been attracting growing research interests. In order to maintain k disjoint communication paths from source sensors to the macronodes, we present a hybrid routing scheme and model, in which multiple paths are calculated and maintained in advance, and alternate paths are created once the previous routing is broken. Then, we propose an immune cooperative particle swarm optimization algorithm (ICPSOA in the model to provide the fast routing recovery and reconstruct the network topology for path failure in H-WSNs. In the ICPSOA, mutation direction of the particle is determined by multi-swarm evolution equation, and its diversity is improved by immune mechanism, which can enhance the capacity of global search and improve the converging rate of the algorithm. Then we validate this theoretical model with simulation results. The results indicate that the ICPSOA-based fault-tolerant routing protocol outperforms several other protocols due to its capability of fast routing recovery mechanism, reliable communications, and prolonging the lifetime of WSNs.

  11. Collisions between Whales and Fast Ferries around Korean Waters

    Kyung-Jun Song

    2013-01-01

    Full Text Available Although there is heavy maritime traffic around Korean waters, collisions between whales and fast ferries around Korean waters are nearly unknown. A ship strike that was associated with a minke whale occurred near the southeastern part of Tsushima Island along the sailing route of the fast ferry between Korea and Japan on December 16, 2004. It was associated with a fast ferry that runs at a speed of approximately 46.1 kn (83 km/h between Korea and Japan. This individual was certainly seriously injured or killed by this ship strike because large amounts of skin of this individual were attached to the surface of the fast ferry, and also large amounts of blood of this individual spread out in that area. However, fortunately, serious damage did not occur to the mariners and passengers of the ferry, although many passengers were knocked down to the floor of the fast ferry when the fast ferry collided with the minke whale. In addition, a total of 4 records of possible collisions between whales and fast ferries have occurred on the fast ferry route between Korea and Japan between 2004 and 2007. This study is the first formal report on collisions between whales and fast ferries around Korean waters. Although the effect of ship strikes on the survival of cetaceans distributed around Korean waters is not very high at present compared with that of other threats, such as entanglement in fishing gear, ship strikes can pose a significant potential threat to endangered cetaceans such as western gray whales. Therefore, it is necessary to prepare prevention measures for ship strikes for the conservation of cetaceans around Korean waters in the future.

  12. 78 FR 10110 - Accessibility Guidelines for Pedestrian Facilities in the Public Right-of-Way; Shared Use Paths

    2013-02-13

    ... site at: http://www.access-board.gov/prowac/ . There is no database available on the number of shared... recreational, or as a temporary generally planar within pedestrian measure to open a path before access routes... Transportation Barriers Compliance Board (Access Board), issued an advance notice of proposed rulemaking...

  13. Routing problems based on hils system platform

    Andrzej Adamski

    2015-03-01

    Full Text Available Background: The logistic systems are very complex socio-technical systems. In this paper the proposal of application of the hierarchical multi-layers system platform HILS approach for the solution of the complex vehicle routing problems is presented. The interactive system functional structure was proposed which by intelligent dedicated inter-layers interactions enables the professional solutions of these practical problems. To illustrate these capabilities the complex example of the real-time VRP-SPD-TW routing problem was presented in which upper layers offers the context-related real-time updating network specifications that stimulates the adequate routing parameters and specifications updating for problem solution in optimization layer. At the bottom dispatching control layer the DISCON (Dispatching CONtrol method from public transport was adopted to logistics applications in which the actual routing is treated as obligatory reference schedule to be stabilized. The intelligence aspects are related among others to HILS based decomposition, context-related trade-offs between routing modifications and corrective dispatching control capabilities e.g. priority or route guidance actions. Methods: Decomposition of the vehicle routing problem for the HILS layers tasks creating the ILS system hierarchical structure. Dedicated solution method for the VRP-SPD-TW routing problem. The recognition of the control preferences structure by AHP-Entropy methods. DISCON and PIACON multi-criteria interacting control methods. Results: Original formulation and solution of the vehicle routing problem by system-wide approach with essential practical advantages: consistency, lack of redundancy, essential reduction of dimension, dedicated formulation, multi-criteria approach, exploration of the integration and intelligence features supported by the intelligent PIACON-DISCON methods control activities Conclusions: The presented proposal creates the professional

  14. Wave Height Incidence on Mediterranean Short Sea Shipping Routes

    F. X. Martínez de Osés

    2006-01-01

    Full Text Available According to the recent mid term review of the EU white paper on transport, Short Sea Shipping in EU waters is expected to grow from 2000 to 2020 at a rate of 59% in volume (metric tonnes. If we consider that the overall expected growth in freight exchanges is of 50% (also in volume, sea transport is one of the most feasible ways to reduce traffic congestion on European roads. High speed vessels are a possible way to compete with road transport in certain traffics; however these ships are highly affected by heavy weather. This paper is going to analyse the weather influence on several short sea shipping Mediterranean routes to be served by fast ships.

  15. Influence of Microstructure and Sintering Routes on Transport Properties of Apatite Materials for Fuel Cells

    A.Chesnaud; C.Estournes; G.Dezannau

    2007-01-01

    1 Results Oxy-apatite materials are thought as zirconia-substitutes in Solid Oxide Fuel Cells due to their fast ionic conduction. However, the well known difficulties related to their densification prevent them from being used as such. This study presents strategies to obtain oxy-apatite dense materials and the influence of elaboration route on transport properties. Particular emphasis is put on the microstructure effect on ion conduction. By the combined use of freeze-drying and conventional or spark p...

  16. The IRUV Protocol: Intelligent Routing Protocol In Urban Environment For Vanet

    My Driss Laanaoui; Pr. Said RAGHAY

    2012-01-01

    Future Intelligent Transportation Systemsrequire fast and reliable communication between cars(vehicle-to-vehicle V2V) or between a car and a roadside unit (vehicle-to-infrastructure). The fundamentalcomponent for the success of Vehicular Ad-hocNetworks (VANET) applications is routing.In this paper we propose a VANET routingprotocol that is especially designed for cityenvironments. This protocol is based on thelocalization of the node, the cost assigned to thesection and score for each vehicle...

  17. An Investigation of Using Parallel Genetic Algorithm for Solving the Shortest Path Routing Problem

    Salman Yussof

    2011-01-01

    Full Text Available Problem statement: Shortest path routing is the type of routing widely used in computer network nowadays. Even though shortest path routing algorithms are well established, other alternative methods may have their own advantages. One such alternative is to use a GA-based routing algorithm. According to previous researches, GA-based routing algorithm has been found to be more scalable and insensitive to variations in network topologies. However, it is also known that GA-based routing algorithm is not fast enough for real-time computation. Approach: To improve the computation time of GA-based routing algorithm, this study proposes a coarse-grained parallel GA routing algorithm for solving the shortest path routing problem. The proposed algorithm is evaluated using simulation where the proposed algorithm is executed on networks with various topologies and sizes. The parallel computation is performed using an MPI cluster. Three different experiments were conducted to identify the best value for the migration rate, the accuracy and execution time with respect to the number of computing nodes and speedup achieved as compared to the serial version of the same algorithm. Results: The result of the simulation shows that the best result is achieved for a migration rate around 0.1 and 0.2. The experiments also show that with larger number of computing nodes, accuracy decreases linearly, but computation time decreases exponentially, which justifies the use parallel implementation of GA to improve the speed of GA-based routing algorithm. Finally, the experiments also show that the proposed algorithm is able to achieve a speedup of up to 818.11% on the MPI cluster used to run the simulation. Conclusion/Recommendations: We have successfully shown that the performance of GA-based shortest path routing algorithm can be improved by using a coarse-grained parallel GA implementation. Even though in this study the proposed algorithm is executed

  18. Agent routing algorithm in wireless sensor networks

    Zhang, Yuqing; Yang, Shuqun

    2013-03-01

    Wireless sensor networks are a new technology of information acquisition and processing, so they are widely used in all kinds of fields. In the paper we introduce Agent technology into the wireless sensor network, conduct a in-depth research on the four routing schemes, and propose a new improved routing scheme, which considers the energy consumption of both nodes and path. Furthermore, The scheme we proposed has efficient routing function, can balance the energy consumption of nodes and extends the lifetime of the network in a more efficient way.

  19. Dynamic telecast Routing with Security Intensification

    BeerthiSahadev

    2011-09-01

    Full Text Available Security has become one of the majorissues for data communication over wired and wireless networks. Different from the past work on the designs of network security algorithms and system infrastructures, we will propose a dynamic broadcast routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks , without introducing extra control messages. The simulation results have been verified from the proposed algorithm and it shows the capability of the proposed algorithm.

  20. Vehicle routing for the last mile of power system restoration

    Bent, Russell W [Los Alamos National Laboratory; Coffrin, Carleton [Los Alamos National Laboratory; Van Hentenryck, Pascal [BROWN UNIV.

    2010-11-23

    This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

  1. Strategic route map of sulphur dioxide reduction in China

    China's economy has risen to the second place since 2010, accompanied by the largest energy consumption in the world. As one of the major air pollutants from the fossil fuel, excessive SO2 emissions have severe negative impacts on eco-environments. In order to achieve the balance between economic growth and environmental protection, many efforts have been made on the reduction of SO2. The route map for the reduction of SO2 in China includes policy setting, economic and energy structure adjustment, and the construction of desulphurization facilities. These initiatives and efforts together had resulted in the significant reduction of SO2 emissions along with fast economic development. This study provides a useful reference for other developing countries in coping SO2 control. The findings also provide implications for reducing the other two air pollutants with binding control targets in the Twelfth Five-Year Plan period in China, i.e. NOx and CO2. - Highlights: • A critical review on the policies of sulphur dioxide control in China. • The successful route map for the reduction of sulphur dioxide. • A useful reference for other countries in coping air pollutants emissions

  2. Heuristics for Routing Heterogeneous Unmanned Vehicles with Fuel Constraints

    David Levy

    2014-01-01

    Full Text Available This paper addresses a multiple depot, multiple unmanned vehicle routing problem with fuel constraints. The objective of the problem is to find a tour for each vehicle such that all the specified targets are visited at least once by some vehicle, the tours satisfy the fuel constraints, and the total travel cost of the vehicles is a minimum. We consider a scenario where the vehicles are allowed to refuel by visiting any of the depots or fuel stations. This is a difficult optimization problem that involves partitioning the targets among the vehicles and finding a feasible tour for each vehicle. The focus of this paper is on developing fast variable neighborhood descent (VND and variable neighborhood search (VNS heuristics for finding good feasible solutions for large instances of the vehicle routing problem. Simulation results are presented to corroborate the performance of the proposed heuristics on a set of 23 large instances obtained from a standard library. These results show that the proposed VND heuristic, on an average, performed better than the proposed VNS heuristic for the tested instances.

  3. History-based route selection for reactive ad hoc routing protocols

    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.

  4. Performance Analysis of Route Discovery by Cross Layer Routing Protocol- RDCLRP

    Mehajabeen Fatima

    2013-06-01

    Full Text Available Wired and wireless network is based on the TCP / IP architecture but it is not sufficient to cope with the dynamics of the MANET. Cross layer design can be an alternative architecture for MANET. Frequent route break is one of the major problems of mobile adhoc network (MANET. Path breaks due to less available battery power and mobility of nodes. Most of the battery power is consumed in flooding of control packets. A key challenge in the design of efficient routing protocol is to reduce link breakage and flooding of control packets. Route breakage can be reduced if the possibility of route breakage is predicted and a handoff is done without drop of data packets. If route breakage is reduced, the more battery power will be available with nodes. In turn it reduces the possibility of route breakage and the possibility of flooding. This is a cumulative effect. So a novel preemptive route repair algorithm is proposed named as RDCLRP- Route discovery by cross layer routing protocol to reduce frequency of control packet flooding and route breakage. Three variants of RDCLRP and their results are illustrated. In this paper, the impact of the number of nodes on performance of RDCLRP are investigated and analyzed. The results show 55.6% reduction in link breakage, 14.7% improvement in residual battery power and an average of 6.7% increase in throughput compared to basic AODV.

  5. Fast food (image)

    ... quick, reasonably priced, and readily available alternatives to home cooking. While convenient and economical for a busy lifestyle, fast foods are typically high in calories, fat, saturated fat, ...

  6. Fast wave current drive

    Goree, J.; Ono, M.; Colestock, P.; Horton, R.; McNeill, D.; Park, H.

    1985-07-01

    Fast wave current drive is demonstrated in the Princeton ACT-I toroidal device. The fast Alfven wave, in the range of high ion-cyclotron harmonics, produced 40 A of current from 1 kW of rf power coupled into the plasma by fast wave loop antenna. This wave excites a steady current by damping on the energetic tail of the electron distribution function in the same way as lower-hybrid current drive, except that fast wave current drive is appropriate for higher plasma densities.

  7. CERN Access Cards and Access Authorisations

    2003-01-01

    From the 01/05/2003, all problems relating to access cards and refusal of access to any zone, building or experiment within CERN must be addressed to the Centrale de Surveillance des Accès (CSA building 120) on 78877 or send an e-mail to Access.Surveillance@cern.ch. The responsibles for CERN access control have put into place a procedure with the CSA, Service Enregistrement and the Technical Control Room, to make sure that all problems get resolved in a proper and timely manner.

  8. Advances in technology for integrated route analysis

    Carey, N.T.; George, P.J.; Khamhawi, K. [SAGE Engineering Ltd., Bath (United Kingdom)

    1998-12-31

    Pipeline and cable routes are becoming ever complex with routes being chosen in increasingly remote and technically demanding areas. Clients now demand greater information and analysis from the surveys and interpretations. By utilising a range of leading edge equipment, greater information can be obtained, visualised and analysed than ever before. Three case studies are presented, indicating how such technology has been employed to provide the client with a greater understanding of complex engineering projects, and what additional technology could have been utilised to further enhance the project. Examples of data, systems and project management used on two major pipe routes and one major cable route are presented. Swath Bathymetry (ISIS), 3D visualisation (Fledermaus), cone penetrometer testing (SAGE Miniature CPT), GIS databases (INfoXProfessional), and the use of pipeline stress analysis, upheaval buckling and rock dump optimisation software (SAFE Profile) are all examined. (author)

  9. Statistical Analysis to Select Evacuation Route

    Musyarof, Z.; Sutarto, D. Y.; Atika, D. R.; Fajriya Hakim, R. B.

    2015-06-01

    Each country should be responsible for the safety of people, especially responsible for the safety of people living in disaster-prone areas. One of those services is provides evacuation route for them. But all this time, the selection of evacuation route is seem does not well organized, it could be seen that when a disaster happen, there will be many accumulation of people on the steps of evacuation route. That condition is dangerous to people because hampers evacuation process. By some methods in Statistical analysis, author tries to give a suggestion how to prepare evacuation route which is organized and based on people habit. Those methods are association rules, sequential pattern mining, hierarchical cluster analysis and fuzzy logic.

  10. Quantum chemistry-assisted synthesis route development

    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 BF3 as an additive was ranked as the first choice for synthetic work. We were able to experimentally obtain the target compound even though its yield was as low as 21 %. The theoretical result was thus consistent with that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings

  11. On line routing per mobile phone

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

    2009-01-01

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

  12. Integrating routing decisions in public transportation problems

    Schmidt, Marie E

    2014-01-01

    This book treats three planning problems arising in public railway transportation planning: line planning, timetabling, and delay management, with the objective to minimize passengers’ travel time. While many optimization approaches simplify these problems by assuming that passengers’ route choice is independent of the solution, this book focuses on models which take into account that passengers will adapt their travel route to the implemented planning solution. That is, a planning solution and passengers’ routes are determined and evaluated simultaneously. This work is technically deep, with insightful findings regarding complexity and algorithmic approaches to public transportation problems with integrated passenger routing. It is intended for researchers in the fields of mathematics, computer science, or operations research, working in the field of public transportation from an optimization standpoint. It is also ideal for students who want to gain intuition and experience in doing complexity proofs ...

  13. Language and Spatial Cognition in Route Navigation

    宋娟

    2013-01-01

    The purpose of this study is to investigate the contrast between using street names or landmarks to process spatial in⁃structions. The study confirms the special cognitive status of landmarks in the mental representation of routes.

  14. Rich Vehicle Routing Problems and Applications

    Wen, Min

    given set of customers. The VRP is a computationally hard combinatorial problem and has been intensively studied by numerous researchers in the last fifty years. Due to the significant economic benefit that can be achieved by optimizing the routing problems in practice, more and more attention has been......The Vehicle Routing Problem (VRP) is one of the most important and challenging optimization problems in the field of Operations Research. It was introduced by Dantzig and Ramser (1959) and defined as the problem of designing the optimal set of routes for a fleet of vehicles in order to serve a...... problems in the sense that consolidation decisions have to be made at the depot and these decisions interact with the planning of pickup and delivery routes. We presented a mathematical model and proposed a Tabu Search based heuristic to solve it. It is shown that the approach can produce near-optimal...

  15. Quantum chemistry-assisted synthesis route development

    Hori, Kenji; Sumimoto, Michinori [Graduate School of Science and Engineering, Yamaguchi University, Tokiwadai, Ube, Yamaguchi 755-8611 (Japan); Murafuji, Toshihiro [Graduate School of Medicine, Yamaguchi University, Yamaguchi, Yamaguchi 753-8512 (Japan)

    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 that observed. The summary of transition state data base (TSDB) is also provided. TSDB is the key to reducing time of in silico screenings.

  16. An Anonymous Secure Routing Using OLSR Protocol

    Osiers Gyamfuah Grace

    2013-01-01

    Full Text Available Security and privacy concerns are major issues to be considered in Mobile Ad hoc Networking (MANET. Several routing protocols have been proposed to achieve both routing and data packets security. In order to achieve privacy, the anonymous routing concept has been introduced and few protocols have been proposed for use in this area. In this paper, global position system (GPS device is used to obtain the current location of nodes and with the help of a cryptographic algorithm incorporated into the existing Optimized Link State Routing protocol (OLSR, it is expected that security services such as authentication, data integrity, privacy and confidentiality will be provided. This work proposes to protect the network against active attacks such as impersonation and modification.

  17. Latent factors and route choice behaviour

    Prato, Carlo Giacomo

    A behaviourally realistic description of the route choice process should consider variables that are both observable, such as travel time and cost, and unobservable, such as attitudes, perceptions, spatial abilities and network knowledge. This manuscript focuses on automotive route choice behaviour....... A reliable dataset was prepared through measures of internal consistency and sampling adequacy, and data were analyzed with a proper application of factor analysis to the route choice context. For the dataset obtained from the survey, six latent constructs affecting driver behaviour were extracted and scores...... on each factor for each survey participant were calculated. Path generation algorithms were examined with respect to observed behaviour, through a measure of reproduction with deterministic techniques of the routes indicated in the answers to the survey. Results presented evidence that the majority...

  18. Multicriteria Evolutionary Weather Routing Algorithm in Practice

    Joanna Szlapczynska

    2013-03-01

    Full Text Available The Multicriteria Evolutionary Weather Routing Algorithm (MEWRA has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid-propulsion or motor-driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization in case of route finding are described. The paper describes the notion of Pareto-optimality of routes along with a simplified, easy to follow, example. It also discusses a choice of the most suitable ranking method for MEWRA (a comparison between Fuzzy TOPSIS and Zero Unitarization Method is presented. In addition to that the paper briefly outlines a commercial application of MEWRA.

  19. Dams and Obstructions along Iowa's Canoe Routes

    Iowa State University GIS Support and Research Facility — This dataset represents obstruction to canoe and boat users of the canoe routes of Iowa. This may represent actual dams, rock dams (natural or man made), large...

  20. Quantum chemistry-assisted synthesis route development

    Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

    2015-12-01

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

  1. A Multistage Method for Multiobjective Route Selection

    Wen, Feng; Gen, Mitsuo

    The multiobjective route selection problem (m-RSP) is a key research topic in the car navigation system (CNS) for ITS (Intelligent Transportation System). In this paper, we propose an interactive multistage weight-based Dijkstra genetic algorithm (mwD-GA) to solve it. The purpose of the proposed approach is to create enough Pareto-optimal routes with good distribution for the car driver depending on his/her preference. At the same time, the routes can be recalculated according to the driver's preferences by the multistage framework proposed. In the solution approach proposed, the accurate route searching ability of the Dijkstra algorithm and the exploration ability of the Genetic algorithm (GA) are effectively combined together for solving the m-RSP problems. Solutions provided by the proposed approach are compared with the current research to show the effectiveness and practicability of the solution approach proposed.

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

    Jani Sainio

    2015-09-01

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

  3. Open Access Publishing

    Morrison, Heather

    2007-01-01

    An overview of open access publishing, for college faculty. Presents a definition of open access, the two roads to open access (OA publishing and self-archiving), overview of business models for open access, and examples of open access journals, with a focus on journals developed in British Columbia, including one (Topics in Scholarly Communication) developed by graduate students as a class assignment, and another developed by high school students (The Pink Voice). Includes a handout of res...

  4. Advocacy for Open Access

    Das, Anup-Kumar

    2015-01-01

    In the scholarly communications world, the concept of open access publishing has proliferated at faster pace since the global open access declarations such as the Budapest Open Access Initiative (BOAI) in February 2002 and the Berlin Declaration on Open Access to Knowledge in the Sciences and Humanities in October 2003. After one decade of these two epoch-making declarations, we see growing instances of open access resources due to collective efforts put by the advocacy organizations, advocac...

  5. Open Access Policy Update

    Morrison, Heather

    2007-01-01

    This presentation explores the status of open access policy developments internationally, and particularly in Canada, as of April 2007. While open access resources are substantial, and growing rapidly, the primary issue for open access archives (institutional repositories) is content acquisition, and few researchers fully understand open access, illustrating an ongoing need for policy. Open access policy initiatives are happening around the world. Sherpa Juliet lists more than 20 funding a...

  6. Open accessibility data interlinking

    Ding, Chaohai; Wald, Mike; Wills, Gary

    2014-01-01

    This paper presents the research of using Linked Open Data to enhance accessibility data for accessible travelling. Open accessibility data is the data related to the accessibility issues associated with geographical data, which could benefit people with disabilities and their special needs. With the aim of addressing the gap between users’ special needs and data, this paper presents the results of a survey of open accessibility data retrieved from four different sources in the UK. An ontolog...

  7. A Review of Current Routing Attacks in Mobile Ad Hoc Networks

    Rashid Hafeez Khokhar

    2008-11-01

    Full Text Available A mobile ad hoc network (MANET is a dynamic wireless network that can be formed without any pre-existing infrastructure in which each node can act as a router. MANET has no clear line of defense, so, it is accessible to both legitimate network users and malicious attackers. In the presence of malicious nodes, one of the main challenges in MANET is to design the robust security solution that can protect MANET from various routing attacks. Different mechanisms have been proposed using various cryptographic techniques to countermeasure the routing attacks against MANET. However, these mechanisms are not suitable for MANET resource constraints, i.e., limited bandwidth and battery power, because they introduce heavy traffic load to exchange and verifying keys. In this paper, the current security issues in MANET are investigated. Particularly, we have examined different routing attacks, such as flooding, blackhole, link spoofing, wormhole, and colluding misrelay attacks, as well as existing solutions to protect MANET protocols.

  8. Stochastic vehicle routing: from theory to practice

    Weyland, Dennis; Gambardella, Luca Maria; Montemanni, Roberto

    2013-01-01

    In this thesis we discuss practical and theoretical aspects of various stochastic vehicle routing problems. These are combinatorial optimization problems related to the field of transportation and logistics in which input data is (partially) represented in a stochastic way. More in detail, we focus on two-stage stochastic vehicle routing problems and in particular on so-called a priori optimization problems. The results are divided into a theoretical part and a practical part. In fact, the ...

  9. Southern Bohemian route of industrial heritage

    Vladimír Dvořák; Blažena Gehinová; Dagmar Škodová Parmová; Eva Jaderná; Eduard Šitler

    2009-01-01

    This paper deals with the industrial heritage and its usage in the frame of tourism service supply. There were three so called Anchor Points selected based on the ERIH methodology in the southern Bohemia. And there were also other regional and important places and points named for the future tourist route. The Southern Bohemian Route of Industrial Heritage was invented around the Anchor Point of Schwarzenberg Channel because of its importance in European heritage and its location next to the ...

  10. ETOR-Efficient Token based Opportunistic Routing

    A. Saichand; Naseer, A. R.

    2013-01-01

    This paper proposes an Efficient Token based Opportunistic Routing called ETOR, which is animprovement to the token based coordination approach for opportunistic routing proposed by Economy[1].In Economy, method used for finding the connected candidate order chooses neighbor as the nextcandidate by considering ETX of that neighbor towards the source but it does not consider the linkprobability between the relay candidate and neighbor to be selected. ETOR proposes variant methods forfinding th...

  11. Hybrid Routing in Delay Tolerant Networks

    Mayer, Christoph P.

    2012-01-01

    This work addresses the integration of today\\'s infrastructure-based networks with infrastructure-less networks. The resulting Hybrid Routing System allows for communication over both network types and can help to overcome cost, communication, and overload problems. Mobility aspect resulting from infrastructure-less networks are analyzed and analytical models developed. For development and deployment of the Hybrid Routing System an overlay-based framework is presented.

  12. A CONTRIBUTION TO SECURE THE ROUTING PROTOCOL

    Mohammed ERRITALI

    2011-10-01

    Full Text Available This work presents a contribution to secure the routing protocol GPSR (Greedy Perimeter StatelessRouting for vehicular ad hoc networks, we examine the possible attacks against GPSR and securitysolutions proposed by different research teams working on ad hoc network security. Then, we propose asolution to secure GPSR packet by adding a digital signature based on symmetric cryptographygenerated using the AES algorithm and the MD5 hash function more suited to a mobile environment

  13. A CONTRIBUTION TO SECURE THE ROUTING PROTOCOL

    Mohammed ERRITALI; Oussama Mohamed Reda; Bouabid El Ouahidi

    2011-01-01

    This work presents a contribution to secure the routing protocol GPSR (Greedy Perimeter StatelessRouting) for vehicular ad hoc networks, we examine the possible attacks against GPSR and securitysolutions proposed by different research teams working on ad hoc network security. Then, we propose asolution to secure GPSR packet by adding a digital signature based on symmetric cryptographygenerated using the AES algorithm and the MD5 hash function more suited to a mobile environment

  14. Integrated Routing Protocol for Opportunistic Networks

    Anshul Verma; Dr. Anurag Srivastava

    2012-01-01

    In opportunistic networks the existence of a simultaneous path is not assumed to transmit a message between a sender and a receiver. Information about the context in which the users communicate is a key piece of knowledge to design efficient routing protocols in opportunistic networks. But this kind of information is not always available. When users are very isolated, context information cannot be distributed, and cannot be used for taking efficient routing decisions. In such cases, context o...

  15. Ising model for packet routing control

    For packet routing control in computer networks, we propose an Ising model which is defined in order to express competition among a queue length and a distance from a node with a packet to its destination node. By introducing a dynamics for a mean-field value of an Ising spin, we show by computer simulations that effective control of packet routing through priority links is possible

  16. Low Carbon Footprint Routes for Bird Watching

    Wei-Ta Fang; Chin-Wei Huang; Jui-Yu Chou; Bai-You Cheng; Shang-Shu Shih

    2015-01-01

    Bird watching is one of many recreational activities popular in ecotourism. Its popularity, therefore, prompts the need for studies on energy conservation. One such environmentally friendly approach toward minimizing bird watching’s ecological impact is ensuring a reduced carbon footprint by using an economic travel itinerary comprising a series of connected routes between tourist attractions that minimizes transit time. This study used a travel-route planning approach using geographic info...

  17. Security Conformance for the Dynamically Routed Data

    Suma Patra; Dr.V.Janaki; Priyanka suram; Nalubala Ranjeeth Kumar

    2011-01-01

    Secure transmission of data plays a crucial role in the networks. To improve the security many methodologies have been proposed till now, like cryptographic designs, intrusion detection, dynamic routing etc. In this paper we consider that the data transmission is done by using the concept of dynamic routing. Sometimes the sender may be neglecting the security due to the lack of personal interest, but the receiver has to take the utmost care. In such cases the receiver after forcing the sender...

  18. Receiver-Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad Hoc Networks

    Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

    2016-01-01

    Decreasing the route rediscovery time process in reactive routing protocols is challenging in mobile ad hoc networks. Links between nodes are continuously established and broken because of the characteristics of the network. Finding multiple routes to increase the reliability is also important but requires a fast update, especially in high traffic load and high mobility where paths can be broken as well. The sender node keeps re-establishing path discovery to find new paths, which makes for long time delay. In this paper we propose an improved multipath routing protocol, called Receiver-based ad hoc on demand multipath routing protocol (RB-AOMDV), which takes advantage of the reliability of the state of the art ad hoc on demand multipath distance vector (AOMDV) protocol with less re-established discovery time. The receiver node assumes the role of discovering paths when finding data packets that have not been received after a period of time. Simulation results show the delay and delivery ratio performances are improved compared with AOMDV. PMID:27258013

  19. PERFORMANCE EVALUATION OF MANET ROUTING PROTOCOLS GRP, DSR AND AODV BASED ON PACKET SIZE

    AMAR NATH MURAW

    2012-06-01

    Full Text Available Mobile Ad hoc Networks has become an essential part of interest of researchers in last couple of years. A Mobile Ad-Hoc Network is a collection of independent wireless mobile nodes having no any centralized accesspoint, infrastructure and any centralized administration. In order to communicate with other nodes inside thenetwork, a routing protocol is used to find out best possible routes among nodes. The most important goal of adhoc network routing protocol is to discover, validate and establish route between a couples of nodes, for appropriate, fast and reliable message delivery. In this research work authors have analyzed the performance of three most popular MANET routing protocols GRP, DSR and AODV under different parameters like throughput, Network delay and network load. Authors have performed entire analysis to study the behaviour ofthese protocols under different test measures based on packet size as a key parameter. Authors have also given their test results by using OPNET as a testing tool and demonstrated all the simulations in this work.

  20. Improved Multispanning Tree Routing Using Efficient and Reliable Routing Algorithm for Irregular Networks

    L. Keerthana

    2012-06-01

    Full Text Available A Strategy of Multispanning Tree Zone Ordered Label Based routing is improved with Efficient and Reliable (EAR routing for irregular networks is presented and analyzed in this work. Most existing deadlock free routing methods for irregular topologies impose several limitations on node and channel labeling in an irregular network is based on a pre-defined spanning tree.It is not possible to form a deadlock free zone of three or four channel labels for two spanning tree. So this existing Multispanning Tree Zone Ordered Label Based routing is modified with Efficient and Reliable (EAR routing. EAR is based on four parameters length of the path,distance traversed,transmission of link and energy levels to dynamically determine and maintain the best routes.. The simulation results have shown highest packet delivery ratio, minimum latency, and energy consumption.

  1. Multirate Anypath Routing in Wireless Mesh Networks

    Laufer, Rafael

    2008-01-01

    In this paper, we present a new routing paradigm that generalizes opportunistic routing in wireless mesh networks. In multirate anypath routing, each node uses both a set of next hops and a selected transmission rate to reach a destination. Using this rate, a packet is broadcast to the nodes in the set and one of them forwards the packet on to the destination. To date, there is no theory capable of jointly optimizing both the set of next hops and the transmission rate used by each node. We bridge this gap by introducing a polynomial-time algorithm to this problem and provide the proof of its optimality. The proposed algorithm runs in the same running time as regular shortest-path algorithms and is therefore suitable for deployment in link-state routing protocols. We conducted experiments in a 802.11b testbed network, and our results show that multirate anypath routing performs on average 80% and up to 6.4 times better than anypath routing with a fixed rate of 11 Mbps. If the rate is fixed at 1 Mbps instead, p...

  2. ACO Agent Based Routing in AOMDV Environment

    Kaur Amanpreet

    2016-01-01

    Full Text Available Mobile Ad-hoc Network (MANET is a group of moving nodes which can communicate with each other without the help of any central stationary node. All the nodes in the MANET act as router for forwarding data packets. The nodes in the network also move randomly and there exists no fixed infrastructure. So, path breaks are the frequent problem in MANET. The routing protocol faces a lot of problem due these path breaks. Therefore, the routing protocol which is multipath in nature is more reliable than a unipath routing protocol. Ant colony optimization is a relatively new technique which is suitable for the optimization problems. AOMDV is a multipath routing protocol. Thus, if there happens to be path break, the packets can start following the new path which has already been selected. In this paper, we are trying to add ant’s agents into AOMDV behavior. In this way, the new protocol will be benefited by the dual properties i.e. of ant’s nature and multipath nature of AOMDV. The modified concept is simulated and the outcomes are compared with AOMDV, AODV and DSR routing protocols for few performance parameters. Results obtained are encouraging; the new algorithm performs better than traditional unipath and multipath routing protocols.

  3. The Route Analysis Based On Flight Plan

    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.

  4. Grid data extraction algorithm for ship routing

    Li, Yuankui; Zhang, Yingjun; Yue, Xingwang; Gao, Zongjiang

    2015-05-01

    With the aim of extracting environmental data around routes, as the basis of ship routing optimization and other related studies, this paper, taking wind grid data as an example, proposes an algorithm that can effectively extract the grid data around rhumb lines. According to different ship courses, the algorithm calculates the wind grid index values in eight different situations, and a common computational formula is summarised. The wind grids around a ship route can be classified into `best-fitting' grids and `additional' grids, which are stored in such a way that, for example, when the data has a high-spacing resolution, only the `best-fitting' grids around ship routes are extracted. Finally, the algorithm was implemented and simulated with MATLAB programming. As the simulation results indicate, the algorithm designed in this paper achieved wind grid data extraction in different situations and further resolved the extraction problem of meteorological and hydrogeological field grids around ship routes efficiently. Thus, it can provide a great support for optimal ship routing related to meteorological factors.

  5. Route selection issues for NWPA shipments

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

  6. Manet Load Balancing Parallel Routing Protocol

    Hesham Arafat Ali

    2012-07-01

    Full Text Available In recent years, multi-path routing protocols have attained more attention in mobile ad hoc networks as compared to other routing schemes due to their abilities and efficiency in improving bandwidth of communication, increasing delivery reliability, responding to congestion and heavy traffic. Several protocols have been developed to address multi path routing, but it always has a problem that the discovered paths may be not 100% disjoint and sending data is done in only one path until it's broken; the discovery of multiple paths also generates more overhead on the network. Load Balancing Parallel Routing Protocol [LBPRP] tried to solve previous multi path problems, distributing traffic among multiple paths sending data in parallel form as it uses all paths in the same time. We employed a simple test scenario to be sure of proposed model efficiency and to validate the proposed Load Balancing Parallel Routing Protocol. [LBPRP] will achieve load balancing in sending data, decreasing the end-to-end delay and increasing the packet delivery ratio and throughput, thus the performance of multi-path routing protocols can be improved consequently.

  7. [Medical aspects of fasting].

    Gavrankapetanović, F

    1997-01-01

    Fasting (arabic-savm) was proclaimed through islam, and thus it is an obligation for Holly Prophet Muhammad s.a.v.s.-Peace be to Him-in the second year after Hijra (in 624 after Milad-born of Isa a.s.). There is a month of fasting-Ramadan-each lunar (hijra) year. So, it was 1415th fasting this year. Former Prophets have brought obligative messages on fasting to their people; so there are also certain forms of fasting with other religions i.e. with Catholics, Jews, Orthodox. These kinds of fasting above differ from muslim fasting, but they also appear obligative. All revelations have brought fasting as obligative. From medical point of view, fasting has two basical components: psychical and physical. Psychical sphere correlate closely with its fundamental ideological message. Allah dz.s. says in Quran: "... Fasting is obligative for you, as it was obligative to your precedents, as to avoid sins; during very few days (II, II, 183 & 184)." Will strength, control of passions, effort and self-discipline makes a pure faithfull person, who purify its mind and body through fasting. Thinking about The Creator is more intensive, character is more solid; and spirit and will get stronger. We will mention the hadith saying: "Essaihune humus saimun!" That means: "Travellers at the Earth are fasters (of my ummet)." The commentary of this hadith, in the Collection of 1001 hadiths (Bin bir hadis), number 485, says: "There are no travelling dervishs or monks in islam; thus there is no such a kind of relligousity in islam. In stead, it is changed by fasting and constant attending of mosque. That was proclaimed as obligation, although there were few cases of travelling in the name of relligousity, like travelling dervishs and sheichs." In this paper, the author discusses medical aspects of fasting and its positive characteristics in the respect of healthy life style and prevention of many sicks. The author mentions positive influence of fasting to certain system and organs of human

  8. Outward Accessibility in Urban Street Networks: Characterization and Improvements

    Travençolo, Bruno Augusto Nassif

    2008-01-01

    The dynamics of transportation through towns and cities is strongly affected by the topology of the connections and routes. The current work describes an approach combining complex networks and self-avoiding random walk dynamics in order to quantify in objective and accurate manner, along a range of spatial scales, the accessibility of places in towns and cities. The transition probabilities are estimated for several lengths of the walks and used to calculate the outward accessibility of each node. The potential of the methodology is illustrated with respect to the characterization and improvements of the accessibility of the town of Sao Carlos.

  9. Are GIS-modelled routes a useful proxy for the actual routes followed by commuters?

    Dalton, Alice M; Jones, Andrew P.; Panter, Jenna; Ogilvie, David

    2014-01-01

    Active commuting offers the potential to increase physical activity among adults by being built into daily routines. Characteristics of the route to work may influence propensity to walk or cycle. Geographic information system (GIS) software is often used to explore this by modelling routes between home and work. However, if the validity of modelled routes depends on the mode of travel used, studies of environmental determinants of travel may be biased. We aimed to understand how well mod...

  10. JNC viewpoint on fast reactor knowledge preservation

    JNC is undertaking a major program of research and development on liquid-metal cooled fast breeder reactors, which is fully supported by the government of Japan and the electrical utilities. Hence, the perspective of JNC on knowledge preservation is rather different from that of organizations where the fast reactor project has been scaled down or discontinued. Within JNC, there is a statutory obligation to preserve documentary records of the fast reactor project. Over time the method of archiving has changed from optical (microfilm, microfiche etc.) to digital storage. It is the long-term objective of JNC to convert all its records to digital format and make them available to staff over its intranet. JNC is also attempting to preserve 'human knowledge', that is, the expertise of staff who have been involved in the fast reactor project over a long period and who are now nearing retirement. Based on this information, two computerized systems are currently being constructed: one which records in,a readily accessible manner the background to key design decisions for the Monju plant; and a second which uses simple relationships between design parameters to aid designers understand the knock-on effects of design choices (joint project with Mitsubishi). To its partners in international cooperation - the US/DoE and the organizations of the Euro-Japan collaboration - JNC is proposing a joint approach to knowledge preservation and retrieval. The proposed concept, dubbed the International Super-Archive Network (ISAN), would make use of the standardized software the new technologies of the internet increase the mutual accessibility of fast reactor information. JNC considers it extremely important to reflect the lessons learnt from previous experience in the fast reactor field to the operation and maintenance of Monju and the design of future reactors. (author)

  11. Pricing strategy for products in the healthy fast food sector in Stockholm

    Hermann, Tim

    2015-01-01

    The demand of fast food is increasing in current food market worldwide. But fast food, as one of the unhealthy food types, cannot deny its impact as one of the causes of leading death in populations of most high income countries. Healthy fast food is called by governments, health organizations and societies, and desired by customers especially in Sweden because it is affordable, easy accessible, and most immortally, healthy. Companies are emerging based on the current fast food demand to prov...

  12. Focusing on fast food restaurants alone underestimates the relationship between neighborhood deprivation and exposure to fast food in a large rural area

    2011-01-01

    Background Individuals and families are relying more on food prepared outside the home as a source for at-home and away-from-home consumption. Restricting the estimation of fast-food access to fast-food restaurants alone may underestimate potential spatial access to fast food. Methods The study used data from the 2006 Brazos Valley Food Environment Project (BVFEP) and the 2000 U.S. Census Summary File 3 for six rural counties in the Texas Brazos Valley region. BVFEP ground-truthed data included identification and geocoding of all fast-food restaurants, convenience stores, supermarkets, and grocery stores in study area and on-site assessment of the availability and variety of fast-food lunch/dinner entrées and side dishes. Network distance was calculated from the population-weighted centroid of each census block group to all retail locations that marketed fast food (n = 205 fast-food opportunities). Results Spatial access to fast-food opportunities (FFO) was significantly better than to traditional fast-food restaurants (FFR). The median distance to the nearest FFO was 2.7 miles, compared with 4.5 miles to the nearest FFR. Residents of high deprivation neighborhoods had better spatial access to a variety of healthier fast-food entrée and side dish options than residents of low deprivation neighborhoods. Conclusions Our analyses revealed that identifying fast-food restaurants as the sole source of fast-food entrées and side dishes underestimated neighborhood exposure to fast food, in terms of both neighborhood proximity and coverage. Potential interventions must consider all retail opportunities for fast food, and not just traditional FFR. PMID:21266055

  13. Focusing on fast food restaurants alone underestimates the relationship between neighborhood deprivation and exposure to fast food in a large rural area

    Dean Wesley R

    2011-01-01

    Full Text Available Abstract Background Individuals and families are relying more on food prepared outside the home as a source for at-home and away-from-home consumption. Restricting the estimation of fast-food access to fast-food restaurants alone may underestimate potential spatial access to fast food. Methods The study used data from the 2006 Brazos Valley Food Environment Project (BVFEP and the 2000 U.S. Census Summary File 3 for six rural counties in the Texas Brazos Valley region. BVFEP ground-truthed data included identification and geocoding of all fast-food restaurants, convenience stores, supermarkets, and grocery stores in study area and on-site assessment of the availability and variety of fast-food lunch/dinner entrées and side dishes. Network distance was calculated from the population-weighted centroid of each census block group to all retail locations that marketed fast food (n = 205 fast-food opportunities. Results Spatial access to fast-food opportunities (FFO was significantly better than to traditional fast-food restaurants (FFR. The median distance to the nearest FFO was 2.7 miles, compared with 4.5 miles to the nearest FFR. Residents of high deprivation neighborhoods had better spatial access to a variety of healthier fast-food entrée and side dish options than residents of low deprivation neighborhoods. Conclusions Our analyses revealed that identifying fast-food restaurants as the sole source of fast-food entrées and side dishes underestimated neighborhood exposure to fast food, in terms of both neighborhood proximity and coverage. Potential interventions must consider all retail opportunities for fast food, and not just traditional FFR.

  14. Field target allocation and routing algorithms for Starbugs

    Goodwin, Michael; Lorente, Nuria P. F.; Satorre, Christophe; Hong, Sungwook E.; Kuehn, Kyler; Lawrence, Jon S.

    2014-07-01

    Starbugs are miniaturised robotic devices that position optical fibres over a telescope's focal plane in parallel operation for high multiplex spectroscopic surveys. The key advantage of the Starbug positioning system is its potential to configure fields of hundreds of targets in a few minutes, consistent with typical detector readout times. Starbugs have been selected as the positioning technology for the TAIPAN (Transforming Astronomical Imaging surveys through Polychromatic Analysis of Nebulae) instrument, a prototype for MANIFEST (Many Instrument Fiber System) on the GMT (Giant Magellan Telescope). TAIPAN consists of a 150-fibre Starbug positioner accessing the 6 degree field-ofview of the AAO's UK Schmidt Telescope at Siding Spring Observatory. For TAIPAN, it is important to optimise the target allocation and routing algorithms to provide the fastest configurations times. We present details of the algorithms and results of the simulated performance.

  15. Field Target Allocation and Routing Algorithms for Starbugs

    Goodwin, Michael; Satorre, Christophe; Hong, Sungwook E; Kuehn, Kyler; Lawrence, Jon S

    2014-01-01

    Starbugs are miniaturised robotic devices that position optical fibres over a telescope's focal plane in parallel operation for high multiplex spectroscopic surveys. The key advantage of the Starbug positioning system is its potential to configure fields of hundreds of targets in a few minutes, consistent with typical detector readout times. Starbugs have been selected as the positioning technology for the TAIPAN (Transforming Astronomical Imaging surveys through Polychromatic Analysis of Nebulae) instrument, a prototype for MANIFEST (Many Instrument Fiber System) on the GMT (Giant Magellan Telescope). TAIPAN consists of a 150-fibre Starbug positioner accessing the 6 degree field-of-view of the AAO's UK Schmidt Telescope at Siding Spring Observatory. For TAIPAN, it is important to optimise the target allocation and routing algorithms to provide the fastest configurations times. We present details of the algorithms and results of the simulated performance.

  16. A Routing Mechanism for Cloud Outsourcing of Medical Imaging Repositories.

    Godinho, Tiago Marques; Viana-Ferreira, Carlos; Bastião Silva, Luís A; Costa, Carlos

    2016-01-01

    Web-based technologies have been increasingly used in picture archive and communication systems (PACS), in services related to storage, distribution, and visualization of medical images. Nowadays, many healthcare institutions are outsourcing their repositories to the cloud. However, managing communications between multiple geo-distributed locations is still challenging due to the complexity of dealing with huge volumes of data and bandwidth requirements. Moreover, standard methodologies still do not take full advantage of outsourced archives, namely because their integration with other in-house solutions is troublesome. In order to improve the performance of distributed medical imaging networks, a smart routing mechanism was developed. This includes an innovative cache system based on splitting and dynamic management of digital imaging and communications in medicine objects. The proposed solution was successfully deployed in a regional PACS archive. The results obtained proved that it is better than conventional approaches, as it reduces remote access latency and also the required cache storage space. PMID:25343773

  17. The 'green' and 'gold' roads to open access : the case for mixing and matching

    Guédon, Jean-Claude

    2004-01-01

    Recent discussions on Open Access (OA) have tended to treat OA journals and self-archiving as two distinct routes. Some supporters of self-archiving even suggest that it alone can bring about full Open Access to the world's scientific literature. In this paper, it is argued that each route actually corresponds to a phase in the movement toward Open Access; that the mere fact of self-archiving is not enough; that providing some branding ability to the repositories is needed. However, doing so...

  18. Accessibility and sensory experiences

    Ryhl, Camilla

    2010-01-01

    This article introduces a new design concept; sensory accessibility. While acknowledging the importance of sensory experiences in architectural quality, as well as the importance of accommodating user needs the concept combines three equally important factors; architecture, the senses and...... accessibility. Sensory accessibility accommodates aspects of a sensory disability and describes architectural design requirements needed to ensure access to architectural experiences. In the context of architecture accessibility has become a design concept of its own. It is generally described as ensuring...... physical access to the built environment by accommodating physical disabilities. While the existing concept of accessibility ensures the physical access of everyone to a given space, sensory accessibility ensures the choice of everyone to stay and be able to participate and experience....

  19. Do Adolescents Who Live or Go to School Near Fast Food Restaurants Eat More Frequently From Fast Food Restaurants?

    Forsyth, Ann; Wall, Melanie; Larson, Nicole; Story, Mary; Neumark-Sztainer, Dianne

    2012-01-01

    This population-based study examined whether residential or school neighborhood access to fast food restaurants is related to adolescents’ eating frequency of fast food. A classroom-based survey of racially/ethnically diverse adolescents (n=2,724) in 20 secondary schools in Minneapolis/St. Paul, Minnesota was used to assess eating frequency at five types of fast food restaurants. Black, Hispanic, and Native American adolescents lived near more fast food restaurants than white and Asian adolescents and also ate at fast food restaurants more often. After controlling for individual-level socio-demographics, adolescent males living near high numbers fast food restaurants ate more frequently from these venues compared to their peers. PMID:23064515

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

    K.G. Santhiya

    2012-12-01

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

  1. Islamic Fasting and Diabetes

    Fereidoun Azizi

    2013-07-01

    Full Text Available The aim of this article is to review health-related aspects of Ramadan fasting in normal individuals and diabetics. During fasting days of Ramadan, glucose homeostasis is maintained by meal taken bepore dawn and by liver glycogen stores. Changes in serum lipids are variable and defend on the quality and quantity of food consumption and changes in weight. Compliant, well controlled type 2 diabetics may observe Ramadan fasting; but fasting is not recommended for type 1, non complaint, poorly controlled and pregnant diabetics. Although Ramadan fasting is safe for all healthy individuals and well controlled diabetics, those with uncontrolled diabetics and diabetics with complications should consult physicians and follow scientific recommendations.

  2. Fast fission phenomena

    Experimental studies of fast fission phenomena are presented. The paper is divided into three parts. In the first part, problems associated with fast fission processes are examined in terms of interaction potentials and a dynamic model is presented in which highly elastic collisions, the formation of compound nuclei and fast fission appear naturally. In the second part, a description is given of the experimental methods employed, the observations made and the preliminary interpretation of measurements suggesting the occurence of fast fission processes. In the third part, our dynamic model is incorporated in a general theory of the dissipative processes studied. This theory enables fluctuations associated with collective variables to be calculated. It is applied to highly inelastic collisions, to fast fission and to the fission dynamics of compound nuclei (for which a schematic representation is given). It is with these calculations that the main results of the second part can be interpreted

  3. Islamic fasting and diabetes

    Fereidoun Azizi

    2013-03-01

    Full Text Available The aim of this article is to review health-related aspects of Ramadan fasting in normal individuals and diabetics. During fasting days of Ramadan, glucose homeostasis is maintained by meal taken bepore dawn and by liver glycogen stores. Changes in serum lipids are variable and defend on the quality and quantity of food consumption and changes in weight. Compliant, well controlled type 2 diabetics may observe Ramadan fasting; but fasting is not recommended for type 1, non complaint, poorly controlled and pregnant diabetics. Although Ramadan fasting is safe for all healthy individuals and well controlled diabetics, those with uncontrolled diabetics and diabetics with complications should consult physicians and follow scientific recommendations.

  4. RFI Mitigation for FAST

    Zhang, Haiyan; Nan, Rendong; Gan, Hengqian; Yue, Youling; Wu, Mingchang; Zhang, Zhiwei; Jin, Chengjin; Peng, Bo

    2015-08-01

    Five-hundred-meter Aperture Spherical radio Telescope (FAST) is a Chinese mega-science project to build the largest single dish radio telescope in the world. The construction was officially commenced in March 2011. The first light of FAST is expected in 2016. Due to the high sensitivity of FAST, Radio Frequency Interference (RFI) mitigation for the telescope is required to assure the realization of the scientific goals. In order to protect the radio environment of FAST site, the local government has established a radio quiet zone with 30 km radius. Moreover, Electromagnetic Compatibility (EMC) designs and measurements for FAST have also been carried out, and some examples, such as EMC designs for actuator and focus cabin, have been introduced briefly.

  5. Fast Spectrum Reactors

    Todd, Donald; Tsvetkov, Pavel

    2012-01-01

    Fast Spectrum Reactors presents a detailed overview of world-wide technology contributing to the development of fast spectrum reactors. With a unique focus on the capabilities of fast spectrum reactors to address nuclear waste transmutation issues, in addition to the well-known capabilities of breeding new fuel, this volume describes how fast spectrum reactors contribute to the wide application of nuclear power systems to serve the global nuclear renaissance while minimizing nuclear proliferation concerns. Readers will find an introduction to the sustainable development of nuclear energy and the role of fast reactors, in addition to an economic analysis of nuclear reactors. A section devoted to neutronics offers the current trends in nuclear design, such as performance parameters and the optimization of advanced power systems. The latest findings on fuel management, partitioning and transmutation include the physics, efficiency and strategies of transmutation, homogeneous and heterogeneous recycling, in addit...

  6. Fast Selective Detection of Pyocyanin Using Cyclic Voltammetry

    Fatima AlZahra’a Alatraktchi; Sandra Breum Andersen; Helle Krogh Johansen; Søren Molin; Svendsen, Winnie E.

    2016-01-01

    Pyocyanin is a virulence factor uniquely produced by the pathogen Pseudomonas aeruginosa. The fast and selective detection of pyocyanin in clinical samples can reveal important information about the presence of this microorganism in patients. Electrochemical sensing of the redox-active pyocyanin is a route to directly quantify pyocyanin in real time and in situ in hospitals and clinics. The selective quantification of pyocyanin is, however, limited by other redox-active compounds existing in ...

  7. Leveraging MPLS Fast Reroute Paths for Distributed Green Traffic Engineering

    Francois, F; Wang, N.; Moessner, K; Georgoulas, S

    2013-01-01

    This paper introduces a new scheme called Green MPLS Fast ReRoute (GMFRR) for enabling energy aware traffic engineering. The scheme intelligently exploits bac kup label switched paths, originally used for failure protection, in order to achieve energy saving during the normal failure-free operation period. GMFRR works in an online and distributed fashion whe re each router periodically monitors its local traffic condition and cooperatively determines how to efficiently reroute traffic onto th...

  8. Professional Access 2013 programming

    Hennig, Teresa; Hepworth, George; Yudovich, Dagi (Doug)

    2013-01-01

    Authoritative and comprehensive coverage for building Access 2013 Solutions Access, the most popular database system in the world, just opened a new frontier in the Cloud. Access 2013 provides significant new features for building robust line-of-business solutions for web, client and integrated environments.  This book was written by a team of Microsoft Access MVPs, with consulting and editing by Access experts, MVPs and members of the Microsoft Access team. It gives you the information and examples to expand your areas of expertise and immediately start to develop and upgrade projects. Exp

  9. Access 2010 Programmer's Reference

    Hennig, Teresa; Griffith, Geoffrey L

    2010-01-01

    A comprehensive guide to programming for Access 2010 and 2007. Millions of people use the Access database applications, and hundreds of thousands of developers work with Access daily. Access 2010 brings better integration with SQL Server and enhanced XML support; this Wrox guide shows developers how to take advantage of these and other improvements. With in-depth coverage of VBA, macros, and other programming methods for building Access applications, this book also provides real-world code examples to demonstrate each topic.: Access is the leading database that is used worldwide; While VBA rem

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

    Salvador Climent

    2014-01-01

    Full Text Available This survey aims to provide a comprehensive overview of the current researchon underwater wireless sensor networks, focusing on the lower layers of the communicationstack, and envisions future trends and challenges. It analyzes the current state-of-the-art onthe physical, medium access control and routing layers. It summarizes their security threadsand surveys the currently proposed studies. Current envisioned niches for further advances inunderwater networks research range from efficient, low-power algorithms and

  11. A Survey of QOS Routing Protocols For Mobile Ad Hoc Networks

    G. Santhi

    2010-09-01

    Full Text Available A Mobile Ad-hoc Network (MANET is composed of mobile nodes without any infrastructure.MANET applications such as audio/video conferencing, webcasting requires very stringent and inflexibleQuality of Service (QoS. The provision of QoS guarantees is much more challenging in MANETs thanwired networks due to node mobility, limited power supply and a lack of centralized control. Manyresearches have been done so as to provide QoS assurances by designing various MANET protocols. Inrecent years a number of QoS routing protocols with distinguishing features have been newly proposed.However, systematic performance evaluations and comparative analysis of these protocols in a commonrealistic environment have been performed only in a limited manner. This paper presents a thoroughoverview of QoS routing metrics, resources and factors affecting performance of QoS routing protocols. Therelative strength, weakness, and applicability of existing QoS routing protocols are also studied andcompared. QoS routing protocols are classified according to the QoS metrics used, type of QoS guaranteeassured and their interaction with the medium access control (MAC protocol.

  12. FDA-Approved Natural Polymers for Fast Dissolving Tablets

    Md Tausif Alam

    2014-01-01

    Full Text Available Oral route is the most preferred route for administration of different drugs because it is regarded as safest, most convenient, and economical route. Fast disintegrating tablets are very popular nowadays as they get dissolved or facilely disintegrated in mouth within few seconds of administration without the need of water. The disadvantages of conventional dosage form, especially dysphagia (arduousness in swallowing, in pediatric and geriatric patients have been overcome by fast dissolving tablets. Natural materials have advantages over synthetic ones since they are chemically inert, non-toxic, less expensive, biodegradable and widely available. Natural polymers like locust bean gum, banana powder, mango peel pectin, Mangifera indica gum, and Hibiscus rosa-sinenses mucilage ameliorate the properties of tablet and utilized as binder, diluent, and superdisintegrants increase the solubility of poorly water soluble drug, decrease the disintegration time, and provide nutritional supplement. Natural polymers are obtained from the natural origin and they are cost efficacious, nontoxic, biodegradable, eco-friendly, devoid of any side effect, renewable, and provide nutritional supplement. It is proved from the studies that natural polymers are more safe and efficacious than the synthetic polymers. The aim of the present article is to study the FDA-approved natural polymers utilized in fast dissolving tablets.

  13. Youth tobacco access: trends and policy implications

    Gendall, Philip; Hoek, Janet; Marsh, Louise; Edwards, Richard; Healey, Benjamin

    2014-01-01

    Objective We examined whether the supply routes via which New Zealand adolescents aged 14–15 years accessed tobacco had changed during a period of dynamic policy activity. Setting We analysed data from seven consecutive years (2006–2012) of the New Zealand Action on Smoking and Health (ASH) Year 10 survey, a nationwide cross-sectional annual survey. Participants All New Zealand schools teaching Year 10 students are invited to participate in the survey; school-level participation rates have ra...

  14. Optimal Relay Selection using Efficient Beaconless Geographic Contention-Based Routing Protocol in Wireless Adhoc Networks

    G. Srimathy

    2012-04-01

    Full Text Available In Wireless Ad hoc network, cooperation of nodes can be achieved by more interactions at higher protocol layers, particularly the MAC (Medium Access Control and network layers play vital role. MAC facilitates a routing protocol based on position location of nodes at network layer specially known as Beacon-less geographic routing (BLGR using Contention-based selection process. This paper proposes two levels of cross-layer framework -a MAC network cross-layer design for forwarder selection (or routing and a MAC-PHY for relay selection. CoopGeo; the proposed cross-layer protocol provides an efficient, distributed approach to select next hops and optimal relays to form a communication path. Wireless networks suffers huge number of communication at the same time leads to increase in collision and energy consumption; hence focused on new Contention access method that uses a dynamical change of channel access probability which can reduce the number of contention times and collisions. Simulation result demonstrates the best Relay selection and the comparative of direct mode with the cooperative networks. And Performance evaluation of contention probability with Collision avoidance.

  15. Dual-route processing of complex words: new fMRI evidence from derivational suffixation.

    Vannest, Jennifer; Polk, Thad A; Lewis, Richard L

    2005-03-01

    Many behavioral models of the comprehension of suffixed words assume a dual-route mechanism in which these words are accessed sometimes from the mental lexicon as whole units and sometimes in terms of their component morphemes (such as happi+ness). In related neuropsychological work, Ullman et al. (1997) proposed a dual-route model for past tense processing, in which the lexicon (used for access to irregularly inflected forms) corresponds to declarative memory and a medial temporal/ parietal circuit, and the rule system (used for computation of regularly inflected forms) corresponds to procedural memory and a frontal (including Broca's area)/basal ganglia circuit. We used functional MRI and a memory encoding task to test this model for derivationally suffixed words, comparing those words that show evidence of decompositional processing in behavioral studies (-ness, -less, and -able words) with derived words that do not show decomposition effects (-ity and -ation words). By examining Broca's area and the basal ganglia as regions of interest, we found that "decomposable" derived and inflected words showed increases in activity relative to nondecomposable suffixed words. Results support a dual-route model of lexical access of complex words that is consistent with the Ullman et al. proposal. PMID:15913009

  16. Physical Access Control Database

    Department of Transportation — This data set contains the personnel access card data (photo, name, activation/expiration dates, card number, and access level) as well as data about turnstiles and...

  17. Hemodialysis access - self care

    ... an infection. To prevent infection: Avoid bumping or cutting your access. DO NOT lift anything heavy with ... Check the pulse in your access arm. You should feel blood rushing through that feels like a vibration. This vibration is ...

  18. Design for Accessibility

    Herriott, Richard

    2012-01-01

    A report on how nine rail builder, operators and transport designers deal with design for accessibility......A report on how nine rail builder, operators and transport designers deal with design for accessibility...

  19. PERFORMANCE EVALUATION OF VANETS ROUTING PROTOCOLS

    Abduladhim Ashtaiwi

    2014-11-01

    Full Text Available Lately, the concept of VANETs (Vehicular Ad hoc Networks has gotten a huge attention as more wireless communication technologies becoming available. Such networkis expected to be one of the most valuable technology for improving efficiency and safety of the future transportation. Vehicular networks are characterized by high mobility nodes which pose many communication challenging problems. In vehicular networks, routing Collision Avoidance Messages (CAMs among vehicles is a key communication problem.Failure in routing CAMs to their intended destination within the time constraint can render these messages useless. Many routing protocols have been adapted for VANETs, such as DSDV (Destination Sequenced Distance Vector, AODV (Ad-hoc On demand Distance Vector, and DSR (Dynamic Source Routing. This work compares the performance of those routing protocols at different driving environments and scenarios created by using the mobility generator (VanetMobiSim and network simulator(NS2. The obtained results at different vehicular densities, speeds, road obstacles, lanes, traffic lights, and transmission ranges showed that on average AODV protocol outperforms DSR and DSDV protocols in packet delivery ratio and end-toend delay. However, at certain circumstances (e.g., at shorter transmission ranges DSR tends to have better performance than AODV and DSDV protocols.

  20. Service discovery with routing protocols for MANETs

    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.

  1. An Indirect Route for Ethanol Production

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

    2005-04-29

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

  2. Fuzzy Optimized Metric for Adaptive Network Routing

    Ahmad Khader Haboush

    2012-04-01

    Full Text Available Network routing algorithms used today calculate least cost (shortest paths between nodes. The cost of a path is the sum of the cost of all links on that path. The use of a single metric for adaptive routing is insufficient to reflect the actual state of the link. In general, there is a limitation on the accuracy of the link state information obtained by the routing protocol. Hence it becomes useful if two or more metrics can be associated to produce a single metric that can describe the state of the link more accurately. In this paper, a fuzzy inference rule base is implemented to generate the fuzzy cost of each candidate path to be used in routing the incoming calls. This fuzzy cost is based on the crisp values of the different metrics; a fuzzy membership function is defined. The parameters of these membership functions reflect dynamically the requirement of the incoming traffic service as well as the current state of the links in the path. And this paper investigates how three metrics, the mean link bandwidth, queue utilization and the mean link delay, can be related using a simple fuzzy logic algorithm to produce a optimized cost of the link for a certain interval that is more „precise‟ than either of the single metric, to solve routing problem .

  3. Eccentricity in Zone Routing Protocol for MANET

    Mrs Komal Nair

    2012-06-01

    Full Text Available A Mobile Ad-Hoc Network (MANET is a decentralized network of autonomous mobile nodes, able to communicate with each other over wireless links. Due to the mobility of the nodes, the topology ofthe network changes spontaneously, therefore use of conventional routing tables maintained at fixed points (routers is not suggested. Such a network may operate in a standalone fashion. There are variousrouting protocols available for MANETs. The most popular ones are DSR, DSDV and ZRP .The zone routing protocol (ZRP is a hybrid routing protocol that proactively maintains routes within a localregion of the network. ZRP can be configured for a particular network through adjustment of a single parameter, the routing zone radius. In this paper, we address the issue of configuring the ZRP to providethe best performance for a particular network at any time with the concept of eccentricity. The results illustrate the important characteristics of different protocols based on their performance and thus suggest some improvements in the respective protocol. The tools used for the simulation are NS2 which is the main simulator, NAM (Network Animator and Tracegraph which is used for preparing the graphs from the trace files.

  4. Low Carbon Footprint Routes for Bird Watching

    Wei-Ta Fang

    2015-03-01

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

  5. Alternative routes to olefins. Chances and challenges

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

    2013-11-01

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

  6. A fast track to IAIMS: the Vanderbilt University strategy.

    Stead, W. W.; Baker, W.; Harris, T. R.; Hodges, T. M.; Sittig, D. F.

    1992-01-01

    In July 1991, Vanderbilt University Medical Center (VUMC) initiated a fast track approach to the implementation of an Integrated Academic Information Management System (IAIMS). The fast track approach has four elements: 1) an integrated organizational structure combining various operational information management units and the academic informatics program into a single entity to enhance efficiency; 2) technology transfer and network access to remote resources in preference to de novo developm...

  7. Fast Breeder Reactor studies

    This report is a compilation of Fast Breeder Reactor (FBR) resource documents prepared to provide the technical basis for the US contribution to the International Nuclear Fuel Cycle Evaluation. The eight separate parts deal with the alternative fast breeder reactor fuel cycles in terms of energy demand, resource base, technical potential and current status, safety, proliferation resistance, deployment, and nuclear safeguards. An Annex compares the cost of decommissioning light-water and fast breeder reactors. Separate abstracts are included for each of the parts

  8. Fasting and cognitive function.

    Pollitt, E; Lewis, N L; Garza, C; Shulman, R J

    The effects of short-term fasting (skipping breakfast) on the problem-solving performance of 9 to 11 yr old children were studied under the controlled conditions of a metabolic ward. The behavioral test battery included an assessment of IQ, the Matching Familiar Figure Test and Hagen Central Incidental Test. Glucose and insulin levels were measured in blood. All assessments were made under fasting and non-fasting conditions. Skipping breakfast was found to have adverse effects on the children's late morning problem-solving performance. These findings support observations that the timing and nutrient composition of meals have acute and demonstrable effects on behavior. PMID:6764933

  9. Fast Breeder Reactor studies

    Till, C.E.; Chang, Y.I.; Kittel, J.H.; Fauske, H.K.; Lineberry, M.J.; Stevenson, M.G.; Amundson, P.I.; Dance, K.D.

    1980-07-01

    This report is a compilation of Fast Breeder Reactor (FBR) resource documents prepared to provide the technical basis for the US contribution to the International Nuclear Fuel Cycle Evaluation. The eight separate parts deal with the alternative fast breeder reactor fuel cycles in terms of energy demand, resource base, technical potential and current status, safety, proliferation resistance, deployment, and nuclear safeguards. An Annex compares the cost of decommissioning light-water and fast breeder reactors. Separate abstracts are included for each of the parts.

  10. Access Customized Forms

    Cosma Emil; Jeflea Victor

    2010-01-01

    By using Word, Excel or PowerPoint one can automate routine operations using the VBA language (Visual Basic for Applications). This language is also used in Access, allowing access to data stored in tables or queries. Thus, Access and VBA resources can be used together. Access is designed for programming forms and reports (among other things), so there won’t be found any of the VBA editor’s specific forms.

  11. Open Access : Three Perspectives

    Owen, G.W. Brian; Waller, Andrew; Perkins, Lesley

    2006-01-01

    Open Access has the potential to transform scholarly communications and access to academic research, especially for libraries in smaller institutions or in economically disadvantaged areas around the world. This important and timely panel discussion will focus on three aspects of open access: 1) the library as publisher, 2) the librarian as archivist, and 3) the role of open access in the careers of upcoming professionals.

  12. Impact of adaptive intra cluster routing on energy efficiency

    Speed, size and cost are the basic driving forces that cause research thirst for researchers. These forces have given birth to Wireless Sensor Network (WSN) that is composed of small, cheap and power efficient sensor nodes. These sensor nodes are battery operated that causes need of energy efficient/aware routing for such type of networks. Traditionally there are two routing techniques used for routing Direct Routing and MultiHop Routing, but Energy Efficient Adaptive Cluster Routing (EEACR) technique is proposed in this research work that has increased the energy efficiency, network lifetime and packet delivery ratio when compared with MultiHop routing a traditional routing technique. EEACR is an improved version of Adaptive Intra Cluster Routing (AICR). Results show that EEACR is much better than MultiHop routing techniques. For simulation and verification of results TOSSIM simulator is used. (author)

  13. URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks

    Luo, Haiyun; Kong, Jiejun; Zerfos, Petros; Lu, Songwu; Zhang, Lixia

    2004-01-01

    Restricting network access of routing and packet forwarding to well-behaving nodes and denying access from misbehaving nodes are critical for the proper functioning of a mobile ad-hoc network where cooperation among all networking nodes is usually assumed. However, the lack of a network infrastructure, the dynamics of the network topology and node membership, and the potential attacks from inside the network by malicious and/or noncooperative selfish nodes make the conventional network access...

  14. A Hybrid Routing Algorithm Based on Ant Colony and ZHLS Routing Protocol for MANET

    Rafsanjani, Marjan Kuchaki; Asadinia, Sanaz; Pakzad, Farzaneh

    Mobile Ad hoc networks (MANETs) require dynamic routing schemes for adequate performance. This paper, presents a new routing algorithm for MANETs, which combines the idea of ant colony optimization with Zone-based Hierarchical Link State (ZHLS) protocol. Ant colony optimization (ACO) is a class of Swarm Intelligence (SI) algorithms. SI is the local interaction of many simple agents to achieve a global goal. SI is based on social insect for solving different types of problems. ACO algorithm uses mobile agents called ants to explore network. Ants help to find paths between two nodes in the network. Our algorithm is based on ants jump from one zone to the next zones which contains of the proactive routing within a zone and reactive routing between the zones. Our proposed algorithm improves the performance of the network such as delay, packet delivery ratio and overhead than traditional routing algorithms.

  15. ACRR: Ad Hoc On-Demand Distance Vector Routing with Controlled Route Requests

    Kataria, Jayesh; Sanyal, Sugata

    2010-01-01

    Reactive routing protocols like Ad Hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR)in Ad-Hoc Wireless Networks which are used in Mobile and Ad Hoc Networks (MANETs) work by flooding the network with control packets. There is generally a limit on the number of these packets that can be generated or forwarded. But a malicious node can disregard this limit and flood the network with fake control packets. These packets hog the limited bandwidth and processing power of genuine nodes in the network while being forwarded. Due to this, genuine route requests suffer and many routes either do not get a chance to materialize or they end up being longer than otherwise. In this paper we propose a non cryptographic solution to the above problem and prove its efficiency by means of simulation.

  16. A Review Paper on Route Maintenance in Stability Based Energy Aware Routing Protocol In MANET

    Gaurav J. Bhatt*,

    2014-05-01

    Full Text Available Mobile Ad hoc Networks (MANETs are temporary formed, infrastructure-less networks. Due to the mobility in nature of mobile nodes, limited battery, congestion, as well as noise, the problem of link failure causes. The performance metrics degrades due to the unstable channel conditions, network connectivity, and mobility and resource limitations. The goal of this paper is to review papers that finds most reliable and energy aware route that is impervious to failures by topological changes by mobile node mobility or lack of energy and various route maintenance approaches in order to establish stable, long lasting route and reduce link failure and packet drops. Make before break mechanism used to achieve route maintenance that predicts link failure before it actually breaks and find alternate route towards destination to avoid unpredictable link failure. Performance increases by considering various parameters like signal strength, energy of node, congestion, noise instead of the minimum hop count approach of the default distance vector algorithm. Keywords -

  17. Routes visualization: Automated placement of multiple route symbols along a physical network infrastructure

    Jules Teulade-Denantes

    2015-12-01

    Full Text Available This paper tackles the representation of routes carried by a physical network infrastructure on a map. In particular, the paper examines the case where each route is represented by a separate colored linear symbol offset from the physical network segments and from other routes—as on public transit maps with bus routes offset from roads. In this study, the objective is to automate the placement of such route symbols while maximizing their legibility, especially at junctions. The problem is modeled as a constraint optimization problem. Legibility criteria are identified and formalized as constraints to optimize, while focusing on the case of hiking routes in a physical network composed of roads and pedestrian paths. Two solving methods are tested, based on backtracking and simulated annealing meta-heuristics respectively. Encouraging results obtained on real data are presented and discussed.

  18. MRS: a fast and compact retrieval system for biological data

    Hekkelman, M. L.; Vriend, G.

    2005-01-01

    The biological data explosion of the ‘omics’ era requires fast access to many data types in rapidly growing data banks. The MRS server allows for very rapid queries in a large number of flat-file data banks, such as EMBL, UniProt, OMIM, dbEST, PDB, KEGG, etc. This server combines a fast and reliable backend with a very user-friendly implementation of all the commonly used information retrieval facilities. The MRS server is freely accessible at . Moreover, the MRS software is freely available ...

  19. Open Access Alternatives

    Tenopir, Carol

    2004-01-01

    Open access publishing is a hot topic today. But open access publishing can have many different definitions, and pros and cons vary with the definitions. Open access publishing is especially attractive to companies and small colleges or universities that are likely to have many more readers than authors. A downside is that a membership fee sounds…

  20. Research on secure routing algorithm in wireless sensor network

    Zhang, Bo

    2013-03-01

    Through the research on the existing wireless sensor network (WSN) and its security technologies, this paper presents a design of the WSN-based secure routing algorithm. This design uses the existing routing algorithm as chief source, adding the security guidance strategy, introducing the location key information, to enhance the security performance of WSN routing. The improved routing algorithm makes the WSN routing achieve better anti-attack in the case of little overhead increase, therefore has high practical value.

  1. The commercial viability of the arctic shipping routes

    Nilsen, Alexander

    2013-01-01

    It is commonly held that the Arctic Ocean and Arctic routes, presents an alternative to the traditional shipping routes through the Suez- and Panama- Channel, which is less time and cost consuming. This thesis strives to uncover weather or not this is the case by assessing the environmental developments, the distance and time characteristics of each defined route, as well as the individual costs associated with each route. The results from the alternative Arctic routes are then compared with ...

  2. The properties of route catchments in orbital - radial cities

    Geoffrey Hyman; Les Mayhew

    2000-01-01

    In this paper we consider the analytical and geometric properties of route catchments in urban areas in which the transport network consists of a combination of radial routes converging on the city centre and one or more major orbital routes around the city. After defining the basic concepts, we examine in detail the analytical and geometric determination of quickest routes through the city centre versus orbital routing and how these vary with location, speed, and urban transport provision. T...

  3. Dynamics of hot-potato routing in IP networks

    Teixeira, Renata; Shaikh, Aman; Griffin, Tim; Rexford, Jennifer

    2004-01-01

    Despite the architectural separation between intradomain and inter-domain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, a router selects the one with the closest egress point, based on the intrado-main path cost. Under such hot-potato routing, an intradomain event can trigger BGP routing changes. To characterize the influ-ence of hot-potato routing, we conduct...

  4. MAP: Medial axis based geometric routing in sensor networks

    Bruck, Jehoshua; Gao, Jie; Jiang, Anxiao

    2007-01-01

    One of the challenging tasks in the deployment of dense wireless networks (like sensor networks) is in devising a routing scheme for node to node communication. Important consideration includes scalability, routing complexity, quality of communication paths and the load sharing of the routes. In this paper, we show that a compact and expressive abstraction of network connectivity by the medial axis enables efficient and localized routing. We propose MAP, a Medial Axis based naming and routing...

  5. Evolution Strategies in the Multipoint Connections Routing

    L. Krulikovska

    2010-09-01

    Full Text Available Routing of multipoint connections plays an important role in final cost and quality of a found connection. New algorithms with better results are still searched. In this paper, a possibility of using the evolution strategies (ES for routing is presented. Quality of found connection is evaluated from the view of final cost and time spent on a searching procedure. First, parametrical analysis of results of the ES are discussed and compared with the Prim’s algorithm, which was chosen as a representative of the deterministic routing algorithms. Second, ways for improving the ES are suggested and implemented. The obtained results are reviewed. The main improvements are specified and discussed in conclusion.

  6. Predication-Based Intelligence Routing on Telecommunications

    DONGJun; HEJifeng; PANYunhe

    2004-01-01

    The routingtelecommunication networksbeing one of key issues of management influences the switch rate and load balance directly, and becomes more and more important as the telecommunication traffic increases at full speed. It was said that raising one percent of switch rate of current Chinese telecommunication networks would result in revenue about one billion Yuan RMB. On the basis of demerit-analysis of routing scheme being used, a new intelligent routing strategy based on multi-agent systems and recurrent neural network predication is presented, including routing strategy, Calls generating and agent~ recurrent neural network computation, simulation software design, results and discussion. The results show that the new one is better by virtue of its upstanding distribution and intelligence characters, and provides excellent solution to increase network switch rate and balance network load. Meanwhile, its applications will go beyond the scope of telecommunication networks. But whether the strategy will be perfect depends on the cooperation among operator, manufacturer and researchers.

  7. Effective Privacy-Preserving Online Route Planning

    Ruiz Vicente, Carmen; Assent, Ira; Jensen, Christian Søndergaard

    An online Route Planning Service (RPS) computes a route from one location to another. Current RPSs such as Google Maps require the use of precise locations. However, some users may not want to disclose their source and destination locations due to privacy concerns. An approach that supplies fake...... locations to an existing service incurs a substantial loss of quality of service, and the service may well return a result that may be not helpful to the user. We propose a solution that is able to return accurate route planning results when source and destination regions are used in order to achieve...... privacy. The solution re-uses a standard online RPS rather than replicate this functionality, and it needs no trusted third party. The solution is able to compute the exact results without leaking of the exact locations to the RPS or un-trusted parties. In addition, we provide heuristics that reduce the...

  8. Towards Building an Intelligent Call Routing System

    Thien Khai Tran

    2016-01-01

    Full Text Available This paper presents EduICR - an Intelligent Call Routing system. This system can route calls to the most appropriate agent using routing rules built by the text classifier. EduICR includes the following main components: telephone communication network; Vietnamese speech recognition; Text classifier/ Natural language processor and Vietnamese speech synthesis. To our best knowledge, this is one of the first systems in Vietnam to implement the integration mechanism of text processing and speech processing. This allows voice applications to be more intelligent, able to communicate with humans in natural language with high accuracy and reasonable speed. Having been built and tested in real environment, our system proves its accuracy attaining more than 95%.

  9. Generalized routing protocols for multihop relay networks

    Khan, Fahd Ahmed

    2011-07-01

    Performance of multihop cooperative networks depends on the routing protocols employed. In this paper we propose the last-n-hop selection protocol, the dual path protocol, the forward-backward last-n-hop selection protocol and the forward-backward dual path protocol for the routing of data through multihop relay networks. The average symbol error probability performance of the schemes is analysed by simulations. It is shown that close to optimal performance can be achieved by using the last-n-hop selection protocol and its forward-backward variant. Furthermore we also compute the complexity of the protocols in terms of number of channel state information required and the number of comparisons required for routing the signal through the network. © 2011 IEEE.

  10. FastStats: Diabetes

    ... State and Territorial Data Reproductive Health Contraceptive Use Infertility Reproductive Health FastStats Mobile Application Get Email Updates ... Links Ambulatory Health Care Data National Health and Nutrition Examination Survey National Health Interview Survey National Home ...

  11. FastStats: Osteoporosis

    ... State and Territorial Data Reproductive Health Contraceptive Use Infertility Reproductive Health FastStats Mobile Application Get Email Updates ... PDF - 241 KB] Related Links National Health and Nutrition Examination Survey Centers for Disease Control and Prevention: ...

  12. CMS Fast Facts

    U.S. Department of Health & Human Services — CMS has developed a new quick reference statistical summary on annual CMS program and financial data. CMS Fast Facts includes summary information on total program...

  13. Brug af faste vendinger

    Bergenholtz, Henning; Bjærge, Esben

    Ordbogen indelholder tekstproduktionsangivelser til ca. 17.000 idiomer, ordsprog, bevingede ord og andre faste vendinger. Det drejer sig bl.a. om angivelser til betydningen, grammatik, kollokationer, eksempler, synonymer og antonymer....

  14. Fast neutrons dosimetry

    A proton recoil technique has been developed for inducing thermoluminescence with incident fast neutrons. CaF2 was used as the TL phosphor, and cane sugar and polyethylene were used as proton radiators. The phosphor and the hydrogeneous material powders were well mixed, encapsulated in glass tubes and exposed to Am-Be sources, resulting in recoils from incident fast neutrons of energy between 0,25 and 11,25 MeV. The intrinsic response of pure CaF2 to fast neutrons without a hydrogeneous radiator was checked by using LiF (TLD-700). Glow curves were recorded from room temperature up to 3500C after different doses of neutrons and gamma rays of 60Co. First collision dose due to fast neutrons in tissue like materials such as cane sugar and polyethylene was also calculated

  15. FAST Maser Surveys

    J. S. Zhang

    2014-09-01

    FAST, the Five-hundred meter Aperture Spherical radio Telescope, will become the largest operating single-dish telescope in the coming years. It has many advantages: much better sensitivity for its largest collecting area; large sky coverage due to its innovative design of the active primary surface; extremely radio quiet from its unique location, etc. In this work, I will highlight the future capabilities of FAST to discover and observe both galactic and extragalactic masers.

  16. Discovery with FAST

    Wilkinson, P.

    2016-02-01

    FAST offers "transformational" performance well-suited to finding new phenomena - one of which might be polarised spectral transients. But discoveries will only be made if "the system" provides its users with the necessary opportunities. In addition to designing in as much observational flexibility as possible, FAST should be operated with a philosophy which maximises its "human bandwidth". This band includes the astronomers of tomorrow - many of whom not have yet started school or even been born.

  17. Fast parametrized biorthogonal transforms

    Puchala, Dariusz; Yatsymirsyy, Mykhaylo

    2011-01-01

    W pracy zaproponowano schemat syntezy szybkich parametryzowanych przekształceń biortogonalnych oparty o diagramy przepływowe dla szybkich przekształceń ortonormalnych i dwupunktowe biortogonalne operatory motylkowe. In this paper the authors propose the technique ot synthesis of fast parametrised biorthogonal transforms that takes advantage of data-flow graphs for calculation of fast orthonormal transforms and two-point biorthogonal butterfly operators.

  18. Fast Statistical Alignment

    Bradley, Robert K.; Adam Roberts; Michael Smoot; Sudeep Juvekar; Jaeyoung Do; Colin Dewey; Ian Holmes; Lior Pachter

    2009-01-01

    We describe a new program for the alignment of multiple biological sequences that is both statistically motivated and fast enough for problem sizes that arise in practice. Our Fast Statistical Alignment program is based on pair hidden Markov models which approximate an insertion/deletion process on a tree and uses a sequence annealing algorithm to combine the posterior probabilities estimated from these models into a multiple alignment. FSA uses its explicit statistical model to produce multi...

  19. Ambient noise near the sea-route

    HE Li; LI ZhengLin; PENG ZhaoHui

    2009-01-01

    Ambient noise data measured in an experiment conducted in shallow water near a sea-route were analyzed. It was observed that, at low frequency, the horizontal correlation has an obvious difference from that predicted by the classical ambient noise model. The theoretical analyses show that this phenomenon is caused by wind noise together with the discrete shipping noise nearby. An ambient noise model was proposed to include the effects caused by both the noise sources. Data measured at different times verify that the proposed model can be used to forecast the ambient noise field in shal-low water near the sea-route.

  20. Ambient noise near the sea-route

    2009-01-01

    Ambient noise data measured in an experiment conducted in shallow water near a sea-route were analyzed. It was observed that, at low frequency, the horizontal correlation has an obvious difference from that predicted by the classical ambient noise model. The theoretical analyses show that this phenomenon is caused by wind noise together with the discrete shipping noise nearby. An ambient noise model was proposed to include the effects caused by both the noise sources. Data measured at different times verify that the proposed model can be used to forecast the ambient noise field in shallow water near the sea-route.

  1. An Improved Wireless Sensor Network Routing Algorithm

    Shengmei Luo; Xue Li; Yiai Jin; Zhixin Sun

    2015-01-01

    High performance with low power consumption is an essential factor in wireless sensor networks (WSN). In order to address the issue on the lifetime and the consumption of nodes in WSNs, an improved ad hoc on⁃demand distance vector rout⁃ing (IAODV) algorithm is proposed based on AODV and LAR protocols. This algorithm is a modified on⁃demand routing al⁃gorithm that limits data forwarding in the searching domain, and then chooses the route on basis of hop count and power consumption. The simulation results show that the algorithm can effectively reduce power consumption as well as prolong the network lifetime.

  2. Pro Access 2010 Development

    Collins, Mark

    2011-01-01

    Pro Access 2010 Development is a fundamental resource for developing business applications that take advantage of the features of Access 2010 and the many sources of data available to your business. In this book, you'll learn how to build database applications, create Web-based databases, develop macros and Visual Basic for Applications (VBA) tools for Access applications, integrate Access with SharePoint and other business systems, and much more. Using a practical, hands-on approach, this book will take you through all the facets of developing Access-based solutions, such as data modeling, co

  3. Android Access Control Extension

    Anton Baláž

    2015-12-01

    Full Text Available The main objective of this work is to analyze and extend security model of mobile devices running on Android OS. Provided security extension is a Linux kernel security module that allows the system administrator to restrict program's capabilities with per-program profiles. Profiles can allow capabilities like network access, raw socket access, and the permission to read, write, or execute files on matching paths. Module supplements the traditional Android capability access control model by providing mandatory access control (MAC based on path. This extension increases security of access to system objects in a device and allows creating security sandboxes per application.

  4. Access 2013 for dummies

    Ulrich Fuller, Laurie

    2013-01-01

    The easy guide to Microsoft Access returns with updates on the latest version! Microsoft Access allows you to store, organize, view, analyze, and share data; the new Access 2013 release enables you to build even more powerful, custom database solutions that integrate with the web and enterprise data sources. Access 2013 For Dummies covers all the new features of the latest version of Accessand serves as an ideal reference, combining the latest Access features with the basics of building usable databases. You'll learn how to create an app from the Welcome screen, get support

  5. Fasting and Urinary Stones

    Ali Shamsa

    2013-11-01

    Full Text Available Introduction: Fasting is considered as one of the most important practices of Islam, and according to Prophet Mohammad, fasting is obligatory upon Muslims. The aim of this study is to evaluate the effects of fasting on urinary stones. Materials and Methods: Very few studies have been carried out on urinary stones and the effect of Ramadan fasting. The sources of the present study are Medline and articles presented by local and Muslim researchers. Meanwhile, since we are acquainted with three well-known researchers in the field of urology, we contacted them via email and asked for their professional opinions. Results: The results of studies about the relationship of urinary stones and their incidence in Ramadan are not alike, and are even sometimes contradictory. Some believe that increased incidence of urinary stones in Ramadan is related not to fasting, but to the rise of weather temperature in hot months, and an increase in humidity. Conclusion: Numerous biological and behavioral changes occur in people who fast in Ramadan and some researchers believe that urinary stone increases during this month.

  6. Fasting and urinary stones

    Ali Shamsa

    2013-12-01

    Full Text Available Introduction: Fasting is considered as one of the most important practices of Islam, and according to Prophet Mohammad, fasting is obligatory upon Muslims. The aim of this study is to evaluate the effects of fasting on urinary stones. Materials and Methods:Very few studies have been carried out on urinary stones and the effect of Ramadan fasting. The sources of the present study are Medline and articles presented by local and Muslim researchers. Meanwhile, since we are acquainted with three well-known researchers in the field  of urology, we contacted them via email and asked for their professional opinions. Results:The results of studies about the relationship of urinary stones and their incidence in Ramadan are not alike, and are even sometimes contradictory. Some believe that increased incidence of urinary stones in Ramadan is related not to fasting, but to the rise of weather temperature in hot months, and an increase in humidity. Conclusion: Numerous biological and behavioral changes occur in people who fast in Ramadan and some researchers believe that urinary stone increases during this month.

  7. Fast electron heating of shock compressed solids at high intensities relevant to fast ignition

    This report describes the experiment entitled 'Fast electron heating of shock compressed solids at high intensities relevant to fast ignition'; carried out at the Central Laser Facility (CLF) from the 5th January to the 15th February 1997. The experiment, funded by the Framework IV Large-Scale Facilities Access Scheme, was proposed by Dr. D. Batani, University of Milan, Italy and carried out by visiting researchers from the University and Ecole Polytechnique, Palaiseau, France. They were supported by UK researchers from the University of Essex, the University of Bristol and the Central Laser Facility, Rutherford Appleton Laboratory. Experimental results: (i) The experiment demonstrated the first results for fast electron deposition in compressed matter. The irradiances used in these experiments are lower than would be used in the fast ignitor scheme but the significance of the results is, nevertheless very relevant to this scheme. (ii) It is shown that in the experiments presented here that ionised, compressed plastic is less effective at stopping the fast electrons than uncompressed, unionised plastic. The stopping power of the compressed material is reduced by a factor of two (in areal density units) over the uncompressed materials. (iii) These experiments are the first measurements of electron stopping power in compressed plasmas but further experiments with more highly compressed plasmas are necessary before the results may be safely extrapolated to fast ignitor conditions. (author)

  8. Open Access @ DTU

    Ekstrøm, Jeannette

    Open Access is high on the agenda in Denmark and internationally. Denmark has announced a national strategy for Open Access that aims to achieve Open Access to 80% in 2017 and 100% in 2022 to peer review research articles. All public Danish funders as well as H2020 requires that all peer review...... articles that is an outcome of their funding will be Open Access. Uploading your full texts (your final author manuscript after review ) to DTU Orbit is a fundamental part of providing Open Access to your research. We are here to answer all your questions with regards to Open Access and related topics such...... as copyright, DTU Orbit, Open Access journals, APCs, Vouchers etc....

  9. Urban Railway Accessibility

    GUAN Hongzhi; YIN Yuanfei; YAN Hai; HAN Yan; QIN Huanmei

    2007-01-01

    Effective use of urban rapid railway systems requires that the railway systems be effectively connected with other transportation modes so that they are accessible. This paper uses the logit model and data to analyze the factors influencing railway access choices in a railway choice access model. The results indicate that access time, access cost, and access distance are factors significantly affecting railway access choices. The user's income significantly affects the probability of choosing to walk rather than to take a taxi,but is not related to choosing buses or bicycles. Vehicle ownership significantly affects the probability of choosing a taxi, but is not significantly related to the other modes. The conclusions provide an analysis tool for urban railway planning and construction.

  10. A SURVEY ON SPECTRUM-MAP BASED ON NORMAL OPPORTUNISTIC ROUTING METHODS FOR COGNITIVE RADIO AD HOC NETWORKS

    Hesham Mohammed Ali Abdullah

    2015-11-01

    Full Text Available Cognitive Radio (CR technology has significant impacts on upper layer performance in Ad Hoc Networks (AHNs. In recent times, several number of investigation are conducted in CR are mostly focusing on the opportunistic spectrum admission and physical layer transmission throughput. However, CR technology determination also have considerable impacts in mobile Ad Hoc networks (AHNs, which enables wireless devices to dynamically create networks without essentially use of a fixed infrastructure . Nowadays, establishing a cognitive network is such a difficult task. The most important issues is routing in CRAHNs. In this paper, it majorly focuses on the survey of routing and opportunistic routing schema in CRAHN. The most significant scheme behind this concept is to make use of a suitable routing protocol designed for establishing Cognitive Radio Network (CRN. Due to licensing, the accessibility of radio frequency for wireless communication gets reduced day by day. Thus, there is a necessitate to have some other way to use these frequencies in an efficient manner. Routing is efficient method to solve these issues, but the use of geographical concept is also a challenging task in CRN. Since, there is a lack in detailed understanding of these extremely dynamic opportunistic links and a consistent end-to-end transportation mechanism over the network. Here, it focuses on the study of possible routing approaches with the purpose of be able to be employed in CRAHNs. There is a comparison on performance evaluation of various potential routing approaches in terms of table significant reduction and what solution can be found from the routing protocol are also discussed. The routing protocol attains reliable communications for CRAHNs, without usually getting feedback information from nodes in a CRAHN to considerably accumulate the communication overhead.

  11. Literary Routes: Contributions to Natural/Cultural Heritage Tourism. How landscape transforms literature and tourism

    Rosalinda Ruiz Scarfuto

    2013-12-01

    ;  Don Quijote of La Mancha (1603 was first made tangible as a literary route in 1780 with a detailed topographical surveyor map inspiring visitors like Washington Irving (1829, Alexander Dumas (1861, and Hans Christian Andersen (1880 to the Spanish plains. This eventually galvanized into an innovative move to pass the Don Quijote Route Law (2007, complete with GPS coordinates. In Japan, Basho’s literary route (1700 with its natural elements changed the style of Japanese Haiku, encouraging writers around the world to follow in his footsteps, and Humboldt’s account of his Andes’ route in South America inspired Lewis & Clark, Darwin, and Muir to follow a similar path that spurred events, websites, and even a NASA astrobiology project to conserve and access the accumulated heritage of these literary routes.  Economic investments in literary routes in natural settings have been initiated by worldwide government ministries of culture, recreation/tourism, environment, economy, and/or education, demonstrating commitments to the conservation of landscapes which have inspired literature. Hence, literary routes can highly contribute to cultural itineraries in natural settings.

  12. Mobile IPv6 Route Optimization Protocol

    Aumdevi K. Barbudhe

    2013-07-01

    Full Text Available Mobile IPv6 (MIPv6 allows a Mobile Node to talk directly to its peers while retaining the ability to move around and change the currently used IP address. This mode of operation is called Route Optimization (RO, as it allows the packets to traverse a shorter route than the default one through the Home Agent. In Route Optimization, the peer node learns a binding between the Mobile Node’s permanent Home Address and its current temporary Care-ofAddress. Once such a binding is in place, the peer node will send all packets whose destination is the Home Address to the Care-ofAddress. This is potentially dangerous, since a malicious host might be able to establish false bindings, thereby preventing some packets from reaching their intended destination, diverting some traffic to the attacker, or flooding third parties with unwanted traffic. In this paper we discuss the design rationale behind the MIPv6 Route Optimization Security Design

  13. Traffic disruption route Einstein near building 170

    A Lopez - TS/CE

    2005-01-01

    The TS/CE Group informs you that, for the duration of the work at Building 170, there may be some disruption to traffic on route Einstein in the vicinity of Building 170. The work is due to take place from the 14th to 18th February. For more information, please contact 165029. A. Lopez TS/CE

  14. Wales energy route map consultation : SDC response

    Sustainable Development Commission Wales

    2005-01-01

    Sustainable Development Commission submission to the Welsh Assembly Government’s consultation on 'Energy Wales : route map to a clean, low-carbon and more competitive energy future for Wales'. Topics covered include Raising awareness, energy efficiency, renewable energy, coal/carbon capture storage, energy infrastructure and reducing carbon dioxide emissions. Publisher PDF

  15. Automated Flight Routing Using Stochastic Dynamic Programming

    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.

  16. Mingling Multipath Routing With Quality Of Service

    Dr. Shuchita Upadhyaya

    2011-09-01

    Full Text Available The QoS issue in the Internet have become essential for the successful transmission of multimedia applications . The basic problem of QoS routing is to find a path satisfying multiple constraints. It is concerned with identifying the path that will consider multiple parameters like bandwidth, delay, cost, hopcount etc. instead of one .To provide user- or application-level Quality of Service (QoS guarantee Multipath routing strategy can be used for the transmission of QoS sensitive traffic over the network. Multipath routing means using multiple paths instead of using single path to forward the traffic.If multiple paths are being used for the transmission of the traffic then the traffic will be redirected to the back up path if active path fails. In this way robustness can be achieved. On the other hand load balancing for communication network to avoid network congestion optimize network throughput also requires multi paths to distribute flows . Robustness load balancing are aspects of QoS routing . So multipath can be proved very valuable for Quality of service. This paper investigates the approaches of mingling Multipath Quality of service. The approaches considered are based on Dijkstra algorithm, Bellman ford algorithm, Resource reservation MPLS.

  17. Network Routing Optimization Using Swarm Intelligence

    Galil, Mohamed A. El

    2012-01-01

    The aim of this paper is to highlight and explore a traditional problem, which is the minimum spanning tree, and finding the shortest-path in network routing, by using Swarm Intelligence. This work to be considered as an investigation topic with combination between operations research, discrete mathematics, and evolutionary computing aiming to solve one of networking problems.

  18. Routing Algorithms for Wireless Sensor Networks

    Raicu, Ioan

    2004-01-01

    Our contribution in this paper is e3D, a diffusion based routing protocol that prolongs the system lifetime, evenly distributes the power dissipation throughout the network, and incurs minimal overhead for synchronizing communication. We compare e3D with other algorithms in terms of system lifetime, power dissipation distribution, cost of synchronization, and simplicity of the algorithm.

  19. ROUTE PLAN DESIGNER FOR TRACTOR GUIDANCE SYSTEMS

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

    2010-01-01

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

  20. Real Time Route for Dynamic Road Congestions

    A. M. Riad

    2012-05-01

    Full Text Available Minimizing service delivery and travel time during rush hours downtown is strategic target for several organizations, especially the emergency organizations. This paper presents an On-line and Real-time Dynamic Route System (ORDRS which benefits from the advantages and integration between information system and communications technology. It utilizes Global Positioning System (GPS, Geographical Information Systems (GIS, and Global System for Mobile communications (GSM; for producing the real time routes for vehicles. GPS-Tracker is the main input device for ORDRS. It is fixated in a vehicle, sends vehicle's movement data (Geo-info to the control center wirelessly through either Short Message Service (SMS or General Packet Radio Service (GPRS. Geo-info includes time, date, longitude, latitude, speed, and etc., these data is classified over time during weekdays into interval time slices, each slice is 30 minutes. Speeds are treated by GIS tools to determine historical and real time speeds for each street segment in the road network which is being used for calculating time impedance (cost matrix for each street segment dynamically. ORDRS uses a cost matrix of the current time slice for determining the best route to each vehicle in duty attached. Several algorithms was used to calculate the shortest route, a comparison between Dijekstra and Yen algorithms was studied.