WorldWideScience

Sample records for access route fast

  1. Fast 3D route-planning approach for air vehicle

    Tu, Jilin; Ding, Mingyue; Zhou, Chengping; Ai, Haojun

    1997-06-01

    A fast 3-D route planning method for unmanned air vehicle is proposed which can generate physically realizable 3-D route within a reasonable time. Our method includes two steps: First, 2-D route planning generates a route which satisfies turning radius constraint(abbreviated as R-constrained below); second, 3-D route planning generates 3-D route in vertical profile of the 2-D route. To make 2-D route R-constrained, a method is proposed by supposing 2-D route of air vehicle is composed of a sequence of arc route segments and tangential points between neighboring arcs are searching nodes. 3 -D route planning is considered as optimal control problem, and its route can be determined by applying motion equations of air vehicle. The experiments show that our method can produce feasible 3-D routes within a reasonable time, and ensure the planned 3-D routes satisfy aerodynamics constraints of air vehicle.

  2. FastRoute: An Efficient and High-Quality Global Router

    Min Pan

    2012-01-01

    Full Text Available Modern large-scale circuit designs have created great demand for fast and high-quality global routing algorithms to resolve the routing congestion at the global level. Rip-up and reroute scheme has been employed by the majority of academic and industrial global routers today, which iteratively resolve the congestion by recreating the routing path based on current congestion. This method is proved to be the most practical routing framework. However, the traditional iterative maze routing technique converges very slowly and easily gets stuck at local optimal solutions. In this work, we propose a very efficient and high-quality global router—FastRoute. FastRoute integrates several novel techniques: fast congestion-driven via-aware Steiner tree construction, 3-bend routing, virtual capacity adjustment, multisource multi-sink maze routing, and spiral layer assignment. These techniques not only address the routing congestion measured at the edges of global routing grids but also minimize the total wirelength and via usage, which is critical for subsequent detailed routing, yield, and manufacturability. Experimental results show that FastRoute is highly effective and efficient to solve ISPD07 and ISPD08 global routing benchmark suites. The results outperform recently published academic global routers in both routability and runtime. In particular, for ISPD07 and ISPD08 global routing benchmarks, FastRoute generates 12 congestion-free solutions out of 16 benchmarks with a speed significantly faster than other routers.

  3. FAST UPDATE ALGORITHM FOR TCAM-BASED ROUTING LOOKUPS

    王志恒; 叶强; 白英彩

    2002-01-01

    Routing technology has been forced to evolve towards higher capacity and per-port packet processing speed. The ability to achieve high forwarding speed is due to either software or hardware technology. TCAM (Ternary Content Addressable Memory) provides a performance advantage over other software or hardware search algorithms, often resulting in an order-of-magnitude reduction of search time. But slow updates may affect the performance of TCAM-based routing lookup. So the key is to design a table management algorithm, which supports high-speed updates in TCAMs. This paper presented three table management algorithms, and then compared their performance. Finally, the optimal one after comparing was given.

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

  5. Fast-earth: A global image caching architecture for fast access to remote-sensing data

    Talbot, B. G.; Talbot, L. M.

    We introduce Fast-Earth, a novel server architecture that enables rapid access to remote sensing data. Fast-Earth subdivides a WGS-84 model of the earth into small 400 × 400 meter regions with fixed locations, called plats. The resulting 3,187,932,913 indexed plats are accessed with a rapid look-up algorithm. Whereas many traditional databases store large original images as a series by collection time, requiring long searches and slow access times for user queries, the Fast-Earth architecture enables rapid access. We have prototyped a system in conjunction with a Fast-Responder mobile app to demonstrate and evaluate the concepts. We found that new data could be indexed rapidly in about 10 minutes/terabyte, high-resolution images could be chipped in less than a second, and 250 kB image chips could be delivered over a 3G network in about 3 seconds. The prototype server implemented on a very small computer could handle 100 users, but the concept is scalable. Fast-Earth enables dramatic advances in rapid dissemination of remote sensing data for mobile platforms as well as desktop enterprises.

  6. WIRELESS ADHOC MULTI ACCESS NETWORKS OPTIMIZATION USING OSPF ROUTING PROTOCOL BASED ON CISCO DEVICES

    Mohamed E. Khedr

    2015-03-01

    Full Text Available One of the most attractive field for research for researchers and authors so the Wireless adhoc networks. So, this paper will describe the background and basic features of Open Short Path First (OSPF routing protocol due to multi-access networks. Explaining and practice on the OSPF configuration commands. Describe, modify and calculate the metric (Cost used by OSPF due to adhoc networks. Illustrating the Election parameters made by DR/BDR (Designated and Back Designated Routers used in multi-access wireless networks. This paper will use OSPF routing protocol because of its average administrative distance with all routing protocols.

  7. Fast emergency paths schema to overcome transient link failures in ospf routing

    Barreto, Fernando; Nacamura, Luiz; 10.5121/ijcnc.2012.4202

    2012-01-01

    A reliable network infrastructure must be able to sustain traffic flows, even when a failure occurs and changes the network topology. During the occurrence of a failure, routing protocols, like OSPF, take from hundreds of milliseconds to various seconds in order to converge. During this convergence period, packets might traverse a longer path or even a loop. An even worse transient behaviour is that packets are dropped even though destinations are reachable. In this context, this paper describes a proactive fast rerouting approach, named Fast Emergency Paths Schema (FEP-S), to overcome problems originating from transient link failures in OSPF routing. Extensive experiments were done using several network topologies with different dimensionality degrees. Results show that the recovery paths, obtained by FEPS, are shorter than those from other rerouting approaches and can improve the network reliability by reducing the packet loss rate during the routing protocols convergence caused by a failure.

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

  9. A routing-based solution to simulating an access point

    Collins, Wayne E.

    1999-01-01

    Military environments require flexible network configurations that must adapt under dynamic and mobile operating conditions. Wireless data networks offer some solutions. A wireless network typically requires an access point to bridge network traffic between wireless and wired media. These devices though are often too inflexible for use in such dynamic conditions. One major problem is that they are dedicated to a single type of wired network, usually Ethernet, which prevents them from being us...

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

    Sobek, Adam D.; Miller, Harvey J.

    2006-09-01

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

  11. Vascular access in resuscitation: is there a role for the intraosseous route?

    Anson, Jonathan A

    2014-04-01

    Intraosseous vascular access is a time-tested procedure which has been incorporated into the 2010 American Heart Association Guidelines for Cardiopulmonary Resuscitation. Intravenous access is often difficult to achieve in shock patients, and central line placement can be time consuming. Intraosseous vascular access, however, can be achieved quickly with minimal disruption of chest compressions. Newer insertion devices are easy to use, making the intraosseous route an attractive alternative for venous access during a resuscitation event. It is critical that anesthesiologists, who are often at the forefront of patient resuscitation, understand how to properly use this potentially life-saving procedure.

  12. DataBus-based hybrid routing approach for orbit access networks in lunar exploration

    Zeng, Hui; Meng, Ke; Deng, Julia

    2012-06-01

    One of the major challenges for lunar exploration missions is how to achieve dynamic and robust routing. To reduce the development cost, it is desirable to leverage existing technologies, such as routing in mobile ad hoc networks (MANETs) and delay tolerant networks (DTN). However, these technologies are developed for the Earth environment and hence need further investigation for the lunar environment. To support robust access and dynamic mission operations, we propose a DataBus-based Hybrid Routing (DBHR) approach that combines MANET reactive routing protocol (such as AODV) and DTN-based bundle delivery. Our DBHR approach is designed for a tiered architecture where remote nodes communicate with upper-tier gateways through data carriers (DataBus) using short-range radio interfaces. Our scheme explores the (non)availability of the end-to-end path between two peers using MANET routing and provides diverse route options based upon different parameters. This interaction between hop-by-hop DTN technologies and end-to-end MANET protocol will result in a reliable and robust routing protocol for orbit access and improve the overall communication capabilities. To evaluate its performance, we implemented our proposed scheme on commercial-off-theshelf (COTS) routers with the custom OpenWRT and tailored IBR-DTN bundle protocol distribution. The on-demand service request and grant mechanisms are also developed in our implementation to allow certain DTN nodes to reserve the future access opportunities. Finally, we demonstrate the achieved capabilities and performance gains through experiments on a hardware test bed that consists of several COTS routers with our implementation.

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

  14. Energy equalizing routing for fast data gathering in wireless sensor networks

    ZHENG Jie; GUO Shu-jie; QU Yu-gui; ZHAO Bao-hua

    2007-01-01

    Energy saving and fast responding of data gathering are two crucial factors for the performance of wireless sensor networks. A dynamic tree based energy equalizing routing scheme (DTEER) was proposed to make an effort to gather data along with low energy consumption and low time delay. DTEER introduces a dynamic multi-hop route selecting scheme based on weight-value and height-value to form a dynamic tree and a mechanism similar to token passing to elect the root of the tree. DTEER can simply and rapidly organize all the nodes with low overhead and is robust enough to the topology changes. When compared with power-efficient gathering in sensor information systems (PEGASIS) and the hybrid, energy- efficient, distributed clustering approach (HEED), the simulation results show that DTEER achieves its intention of consuming less energy, equalizing the energy consumption of all the nodes, alleviating the data gathering delay, as well as extending the network lifetime perfectly.

  15. IMS接入网关智能路由%IMS Access Gateway Intelligent Routing

    马跃; 宋超

    2015-01-01

    在数字电话交换系统中设计IMS接入网关以解决目前将语音应用接入到CM-IMS网络中等问题,其中设计接入网关的智能路由支持在IP或TDM中继故障后自动重选,根据实际需求配置中继选路的策略以达到局间通信的可靠性和费用最低的要求。介绍了IMS接入网关的应用及研究现状,阐述Asterisk的具体情况,描述了IMS接入网关智能路由的功能,并给出智能路由的详细设计,路由的属性及数据结构的定义,最后结合 Asterisk 开源项目,实现了智能路由的功能,通过实验成功验证了智能路由按费率、优先级、轮转策略选择中继及号码变换的功能,达到了通信的可靠性及低费用的要求。%In the digital telephone switching system, designing an IMS access gateway is to solve the applications of voice access to the CM-IMS network. When IP or the TDM relay failed, the IMS access gateway intelligent routing can reconnect automatically. According to the actual configuration, the routing strategy can meet the reliability of communication and lowest cost. This paper introduces the application and research of IMS access gateway and expounds the situation of Asterisk. It describes the function of IMS access gateway intelligent routing and analyzes the design in detail, including the attributes of the routing and the definition of data structure. Finally, I realize the function of intelligent routing in combination with the Asterisk open source project. Choosing relay and number transform are verified by experiments. And the intelligent routing has reached the requirement of reliability and low cost.

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

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

  18. A Reinforcement Routing Algorithm with Access Selection in the Multi-Hop Multi-Interface Networks

    Jafari, Amir Hosein; Shahhoseini, Hadi Shahriar

    2015-03-01

    In this paper, a routing algorithm is proposed for access selection in a network to find the optimal paths among intermediate nodes with multiple interfaces. Markov Decision Process is applied in each node to find optimal policy and select proper paths to the best access point in a dynamic environment. A reward function is defined as environment feedback to optimize and adapt routing behavior of nodes based on the local information. Selection metrics in each node are interface load, link quality and destination condition. It is shown, by using the proposed algorithm, there are better management in the node which decreases interference and collision and selects links with better quality toward the best possible destination. The performance of the method is exemplified and it is shown how the throughput and average delay of the network with more interface in its nodes, improved while packet loss degrades. As an example a two-interface and a one-interface network are studied. It is shown when network load is increased, interface management will improve the throughput, in the network with two-interface nodes. Also, by considering the link quality factor in the reward function, packet dropping becomes less but average delay increases.

  19. A fast processing route of aspheric polydimethylsiloxane lenses array (APLA) and optical characterization for smartphone microscopy

    Fuh, Yiin-Kuen; Lai, Zheng-Hong

    2017-02-01

    A fast processing route of aspheric polydimethylsiloxane (PDMS) lenses array (APLA) is proposed via the combined effect of inverted gravitational and heat-assisted forces. The fabrication time can be dramatically reduced to 30 s, compared favorably to the traditional duration of 2 hours of repeated cycles of addition-curing processes. In this paper, a low-cost flexible lens can be fabricated by repeatedly depositing, inverting, curing a hanging transparent PDMS elastomer droplet on a previously deposited curved structure. Complex structures with aspheric curve features and various focal lengths can be successfully produced and the fabricated 4 types of APLA have various focal lengths in the range of 7.03 mm, 6.00 mm, 5.33 mm, and 4.43 mm, respectively. Empirically, a direct relationship between the PDMS volume and focal lengths of the lenses can be experimentally deducted. Using these fabricated APLA, an ordinary commercial smartphone camera can be easily transformed to a low-cost, portable digital microscopy (50×magnification) such that point of care diagnostic can be implemented pervasively.

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

  1. Sleeping Cluster based Medium Access Control Layer Routing Protocol for Wireless Sensor Networks

    T. R. Rangaswamy

    2012-01-01

    Full Text Available Wireless sensor networks play a vital role in remote area applications, where human intervention is not possible. In a Wireless Sensor Network (WSN each and every node is strictly an energy as well as bandwidth constrained one. Problem statement: In a standard WSN, most of the routing techniques, move data from multiple sources to a single fixed base station. Because of the greater number of computational tasks, the existing routing protocol did not address the energy efficient problem properly. In order to overcome the problem of energy consumption due to more number of computational tasks, a new method is developed. Approach: The proposed algorithm divides the sensing field into three active clusters and one sleeping cluster. The cluster head selection is based on the distance between the base station and the normal nodes. The Time Division Multiple Access (TDMA mechanism is used to make the cluster remain in the active state as well as the sleeping state. In an active cluster 50% of nodes will be made active and the remaining 50% be in sleep state. A sleeping cluster will be made active after a period of time and periodically changes its functionality. Results: Due to this periodic change of state, energy consumption is minimized. The performance of the Low Energy Adaptive and Clustering Hierarchy (LEACH algorithm is also analyzed, using a network simulator NS2 based on the number of Cluster Heads (CH, Energy consumption, Lifetime and the number of nodes alive. Conclusion: The simulation studies were carried out using a network simulation tool NS2, for the proposed method and this is compared with the performance of the existing protocol. The superiority of the proposed method is highlighted.

  2. 快速移动环境中上下文感知优化链路状态路由协议%Context-aware Optimized Link State Routing Protocol for Fast Movement Scene

    张可; 张伟; 李炜; 曾家智

    2011-01-01

    提出了一种应用于快速移动环境的上下文感知优化链路状态协议CAOLSR(Context-aware Optimized Link State Routing Protocol).CAOLSR采用了一种上下文信息机制,将节点间相对移动预测、前后访问时间以及节点连接度情况引入MPR(Multi Point Relays)选择,并设计了CAOLSR-MPR算法.此外,CAOLSR通过引入Fisheye减少了移动性对路由精度的影响.模拟实验表明,在节点快速移动与拓扑快速变化环境下与HOLSR(Hierarchical Optimized Link State Routing Protocol),OLSR(Optimized Link State Routing Protocol),DSDV(Destination Sequenced Distance Vector)相比,CAOLSR具有更为良好的性能.%An Context-aware optimized link state routing protocol for networks with fast-moving nodes was proposed CAOLSR (Context-aware Optimized Link State Routing Protocol) adopts a context-aware mechanism,and selects MPR (Multi Point Relays) based on relative movement of nodes, recent access-time and connection number of nodes, and adopts a special flow of MPR selection. In addition, by the introduction of Fisheye, reduces the influence from mobility on the routing accuracy. Experimental results show that CAOLSR can achieve good performance and outperform HOLSR (Hierarchical Optimized Link State Routing Protocol), OLSR (Optimized Link State Routing Protocol) and DSDV (Destination Sequenced Distance Vector) in networks with fast-moving nodes.

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

  4. Fast and Efficient XML Data Access for Next-Generation Mass Spectrometry.

    Hannes L Röst

    Full Text Available In mass spectrometry-based proteomics, XML formats such as mzML and mzXML provide an open and standardized way to store and exchange the raw data (spectra and chromatograms of mass spectrometric experiments. These file formats are being used by a multitude of open-source and cross-platform tools which allow the proteomics community to access algorithms in a vendor-independent fashion and perform transparent and reproducible data analysis. Recent improvements in mass spectrometry instrumentation have increased the data size produced in a single LC-MS/MS measurement and put substantial strain on open-source tools, particularly those that are not equipped to deal with XML data files that reach dozens of gigabytes in size.Here we present a fast and versatile parsing library for mass spectrometric XML formats available in C++ and Python, based on the mature OpenMS software framework. Our library implements an API for obtaining spectra and chromatograms under memory constraints using random access or sequential access functions, allowing users to process datasets that are much larger than system memory. For fast access to the raw data structures, small XML files can also be completely loaded into memory. In addition, we have improved the parsing speed of the core mzML module by over 4-fold (compared to OpenMS 1.11, making our library suitable for a wide variety of algorithms that need fast access to dozens of gigabytes of raw mass spectrometric data.Our C++ and Python implementations are available for the Linux, Mac, and Windows operating systems. All proposed modifications to the OpenMS code have been merged into the OpenMS mainline codebase and are available to the community at https://github.com/OpenMS/OpenMS.

  5. Do young readers have fast access to abstract lexical representations? Evidence from masked priming.

    Perea, Manuel; Jiménez, María; Gomez, Pablo

    2015-01-01

    Although there is consensus that adult readers have fast access to abstract letter/word representations, the developmental trajectory of such access has not been mapped out yet. To examine whether developmental readers have rapid access to abstract representations during the early stages of word processing, we conducted a masked priming lexical decision experiment with two groups of young readers (third and fifth graders) and a group of young adults. We selected two types of words: (a) words composed of cross-case letters that are visually dissimilar (DIS words; e.g., arte/ARTE [Spanish for art]) and (b) words composed of cross-case letters that are visually similar (SIM words; e.g., vivo/VIVO [Spanish for alive]). For young adults and fifth graders, response times for DIS and SIM words were very similar in the matched- and mismatched-case identity priming conditions, which in turn produced shorter responses than the unrelated condition (i.e., ARTE-ARTE=arte-ARTEARTE). This is consistent with the idea that there is fast access to abstract representations. In contrast, this process does not seem to be fully operative in third graders, as revealed by the pattern of data with DIS words (ARTE-ARTEarte-ARTE=edad-ARTE). These findings have relevant implications for developmental models of visual word recognition and for the use of masked priming experiments with developmental readers.

  6. Fast-responder: Rapid mobile-phone access to recent remote sensing imagery for first responders

    Talbot, L. M.; Talbot, B. G.

    We introduce Fast-Responder, a novel prototype data-dissemination application and architecture concept to rapidly deliver remote sensing imagery to smartphones to enable situational awareness. The architecture implements a Fast-Earth image caching system on the phone and interacts with a Fast-Earth server. Prototype evaluation successfully demonstrated that National Guard users could select a location, download multiple remote sensing images, and flicker between images, all in less than a minute on a 3G mobile commercial link. The Fast-Responder architecture is a significant advance that is designed to meet the needs of mobile users, such as National Guard response units, to rapidly access information during a crisis, such as a natural or man-made disaster. This paper focuses on the architecture design and advanced user interface concepts for small-screens for highly active mobile users. Novel Fast-Responder concepts can also enable rapid dissemination and evaluation of imagery on the desktop, opening new technology horizons for both desktop and mobile users.

  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. Does access to fast food lead to super-sized pregnant women and whopper babies?

    Lhila, Aparna

    2011-12-01

    Rise in the availability of fast-food restaurants has been blamed, at least partly, for the increasing obesity in the U.S. The existing studies of obesity have focused primarily on children, adolescents, and adults, and this paper extends the literature by raising a little-studied question and using nationally representative data to answer it. It examines the relationship between the supply of fast-food restaurants and weight gain of pregnant women and their newborns. I study prenatal weight gain because excessive weight gain has been linked to postpartum overweight/obesity and I study both tails of the birthweight distribution because the origin of obesity may be traced to the prenatal period and both tail outcomes have been associated with obesity later in life. I merge the 1998 and 2004 Natality Detail Files with the Area Resource File, and County Business Patterns, which provide data on the number of fast-food restaurants in the metropolitan area where the mother resides. The empirical model includes an extensive list of MSA characteristics and MSA fixed effects to control for factors that may be correlated with both health outcomes and restaurants' location decision. Results reveal that the fast-food and weight gain relationship is robust to the inclusion of these controls but these controls greatly mitigate the fast food-infant health relationship. Greater access to fast-food restaurants is positively related to mothers' probability of excessive weight gain but it does not share a statistically significant relationship with birthweight. These relationships hold in all the socioeconomic and demographic subgroups studied.

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

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

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

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

  14. Fast and Accurate Accessible Surface Area Prediction Without a Sequence Profile.

    Faraggi, Eshel; Kouza, Maksim; Zhou, Yaoqi; Kloczkowski, Andrzej

    2017-01-01

    A fast accessible surface area (ASA) predictor is presented. In this new approach no residue mutation profiles generated by multiple sequence alignments are used as inputs. Instead, we use only single sequence information and global features such as single-residue and two-residue compositions of the chain. The resulting predictor is both highly more efficient than sequence alignment based predictors and of comparable accuracy to them. Introduction of the global inputs significantly helps achieve this comparable accuracy. The predictor, termed ASAquick, is found to perform similarly well for so-called easy and hard cases indicating generalizability and possible usability for de-novo protein structure prediction. The source code and a Linux executables for ASAquick are available from Research and Information Systems at http://mamiris.com and from the Battelle Center for Mathematical Medicine at http://mathmed.org .

  15. The internal mammary vein: an alternate route for central venous access with an implantable port.

    Jaime-Solis, E; Anaya-Ortega, M; Moctezuma-Espinosa, J

    1994-10-01

    Central venous catheterization in pediatric patients has, among other risks, flebitis and thrombosis, and finally occlusion of the superior and inferior venae cavae, making long-term catheterization and multiple venous cutdown more difficult. Use of the internal mammary vein might be an alternative procedure to provide sure and easy access to the central venous circulation. The authors report on a patient with multiple venous cutdown and thrombosis of the inferior vena cava, in whom the internal mammary vein was used for placement of a vascular device. The procedure is technically easy, and no special positioning of the patient is required.

  16. Greater access to fast food outlets is associated with poorer bone health in young children

    Vogel, Christina; Parsons, Camille; Godfrey, Keith; Robinson, Sian; Harvey, Nicholas C; Inskip, Hazel; Cooper, Cyrus; Baird, Janis

    2016-01-01

    Purpose Identifying factors that contribute to optimal childhood bone development could help pinpoint strategies to improve long term bone health. A healthy diet positively influences bone health from before birth and during childhood. This study addressed a gap in the literature by examining the relationship between residential neighbourhood food environment and bone mass in infants and children. Methods 1107 children participating in the Southampton Women’s Survey, United Kingdom, underwent measurement of bone mineral density (BMD) and bone mineral content (BMC) at birth and four and/or six years by Dual-energy X-ray Absorptiometry (DXA). Cross-sectional observational data describing food outlets within the boundary of each participant’s neighbourhood were used to derive three measures of the food environment: the counts of fast food outlets, healthy speciality stores and supermarkets. Results Neighbourhood exposure to fast food outlets was associated with lower BMD in infancy (β=−0.23(z-score): 95% CI −0.38, −0.08), and lower BMC after adjustment for bone area and confounding variables (β=−0.17(z-score): 95% CI −0.32, −0.02). Increasing neighbourhood exposure to healthy speciality stores was associated with higher BMD at four and six years (β=0.16(z-score): 95% CI 0.00, 0.32 and β=0.13(z-score): 95% CI −0.01, 0.26 respectively). The relationship with BMC after adjustment for bone area and confounding variables was statistically significant at four years but not at six years. Conclusions The neighbourhood food environment pregnant mothers and young children are exposed to may effect bone development during early childhood. If confirmed in future studies, action to reduce access to fast food outlets could have benefits for childhood development and long term bone health. PMID:26458387

  17. SPSmart: adapting population based SNP genotype databases for fast and comprehensive web access

    Carracedo Ángel

    2008-10-01

    Full Text Available Abstract Background In the last five years large online resources of human variability have appeared, notably HapMap, Perlegen and the CEPH foundation. These databases of genotypes with population information act as catalogues of human diversity, and are widely used as reference sources for population genetics studies. Although many useful conclusions may be extracted by querying databases individually, the lack of flexibility for combining data from within and between each database does not allow the calculation of key population variability statistics. Results We have developed a novel tool for accessing and combining large-scale genomic databases of single nucleotide polymorphisms (SNPs in widespread use in human population genetics: SPSmart (SNPs for Population Studies. A fast pipeline creates and maintains a data mart from the most commonly accessed databases of genotypes containing population information: data is mined, summarized into the standard statistical reference indices, and stored into a relational database that currently handles as many as 4 × 109 genotypes and that can be easily extended to new database initiatives. We have also built a web interface to the data mart that allows the browsing of underlying data indexed by population and the combining of populations, allowing intuitive and straightforward comparison of population groups. All the information served is optimized for web display, and most of the computations are already pre-processed in the data mart to speed up the data browsing and any computational treatment requested. Conclusion In practice, SPSmart allows populations to be combined into user-defined groups, while multiple databases can be accessed and compared in a few simple steps from a single query. It performs the queries rapidly and gives straightforward graphical summaries of SNP population variability through visual inspection of allele frequencies outlined in standard pie-chart format. In addition, full

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

  19. Fertility tourism: circumventive routes that enable access to reproductive technologies and substances.

    Bergmann, Sven

    2011-01-01

    “Fertility tourism” is a journalistic eye‐catcher focusing on the phenomenon of patients who search for a reproductive treatment in another country in order to circumvent laws, access restrictions, or waiting lists in their home country. In Europe, the reasons why people seek reproductive treatments outside their national boundaries are quite diverse, in part because regulations differ so much among countries. Beginning with four examples of people who crossed borders for an in vitro fertilization (IVF) treatment with gamete donation, this article provides some insight into these transnational circumvention practices based on material from ethnographic fieldwork and interviews in Spain, Denmark, and the Czech Republic. In all three countries, gamete donation is made strictly anonymous. Clinical practices such as egg donor recruitment and phenotypical matching between donors and recipients serve to naturalize the substitution of gametes and to install social legitimacy through resemblance markers with the prospective child. In comparison to other areas of medical tourism, which are subjects of debate as a consequence of neoliberal health politics and international medical competition, mobility in the area of reproductive technologies is deeply intertwined with new forms of doing kinship. For prospective parents, it holds a promise of generating offspring who could pass as biogenetically conceived children. Therefore, IVF with gamete donation is mostly modeled after conceptions of nature. Through anonymity and concealment it creates forms of nonrelatedness that leave space for future imaginings and traces of transnational genetic creators.

  20. Useful access to enantiomerically pure protected inositols from carbohydrates: the aldohexos-5-uloses route

    Felicia D’Andrea

    2016-11-01

    Full Text Available The intramolecular aldol condensation of aldohexos-5-ulose derivatives of the D-xylo and L-ribo stereoseries has been studied. Only one of the four possible inososes was isolated from both stereoseries in reasonable yields (30–38%. The results obtained, together with the previous findings for the L-arabino and L-lyxo stereoseries, allowed for the rationalisation of a mechanism of the reaction based on open-transition-state models and electron-withdrawing inductive effects. Complementary reductions of the intermediate inososes were possible by changing the reaction conditions, and two isomeric inositol derivatives were obtained with complete stereoselection from each inosose. The presented approach permits us to control the configuration of three out of the six stereocentres of the inositol frame and gives access to seven of the nine inositols. Noteworthy, for the D-xylo derivative, the two-step sequence (condensation followed by reduction with NaBH(OAc3 represents the biomimetic synthesis of myo-inositol. Furthermore, the sugar-based pathway leads directly to enantiomerically pure selectively protected inositols and does not require any desymmetrisation procedure which is needed when myo-inositol and other achiral precursors are employed as starting materials. As an example of application of the method, the indirect selective protection of secondary inositols’ hydroxy functions, by placing specific protecting groups on the aldohexos-5-ulose precursor has been presented.

  1. Design of Intelligent Cross-Layer Routing Protocols for Airborne Wireless Networks Under Dynamic Spectrum Access Paradigm

    2011-05-01

    routing protocols require link layer detection and hello message to maintain multiple routes . Various single and multipath protocols , like AODV ... protocols (e.g., AODV , DSR, Optimized Link State Routing (OLSR) etc.) with and without link layer detection. The protocols with link layer detection...Reactive protocols like AODV tend to reduce the control traffic messages overhead at the cost of increased latency in finding new routes . AODV has a

  2. Lossless compression of very large volume data with fast dynamic access

    Zhao, Rongkai; Tao, Tao; Gabriel, Michael; Belford, Geneva

    2002-09-01

    The volumetric data set is important in many scientific and biomedical fields. Since such sets may be extremely large, a compression method is critical to store and transmit them. To achieve a high compression rate, most of the existing volume compression methods are lossy, which is usually unacceptable in biomedical applications. We developed a new context-based non-linear prediction method to preprocess the volume data set in order to effectively lower the prediction entropy. The prediction error is further encoded using Huffman code. Unlike the conventional methods, the volume is divided into cubical blocks to take advantage of the data's spatial locality. Instead of building one Huffman tree for each block, we developed a novel binning algorithm that build a Huffman tree for each group (bin) of blocks. Combining all the effects above, we achieved an excellent compression rate compared to other lossless volume compression methods. In addition, an auxiliary data structure, Scalable Hyperspace File (SHSF) is used to index the huge volume so that we can obtain many other benefits including parallel construction, on-the-fly accessing of compressed data without global decompression, fast previewing, efficient background compressing, and scalability etc.

  3. Fast adaptive backup routing for mobile Ad Hoc network%移动Ad Hoc网快速自适应后备路由协议

    周鹏

    2012-01-01

    移动Ad Hoc网拓扑结构经常变化.自适应后备路由局部修复AODV协议AODV-ABL通过监听RREP包和数据包来产生后备路由,并存于后备路由表中.仅当链路错误时,AODV-ABL才试图利用后备路由表进行局部修复.为提高对网络拓扑变化的自适应性,在AODV-ABL基础上,提出了一种快速自适应后备AODV路由协议AODV-FABL.AODV-FABL合并主路由表和后备路由表,在监听包时同步更新路由,路由能尽快地得到优化.实验结果表明,AODV-FABL取得了比AODV-LR、AODV-ABL更好的包投递率、端对端时延、控制开销和对流量负载变化的适应性.%The network topology changes frequently in mobile Ad Hoc networks. In AODV-Adaptive Backup with Local repair routing (AODV-ABL) protocol, the backup route can be created by overhearing RREP packets and data packets and can be stored in alternate route table. Only when the link error occurs, AODV-ABL tries to start a local repair process by using alternate route table. In order to improve the adaptability to the network topology changing, a Fast AODV-ABL routing (AODV-FABL) protocol, which based on AODV-ABL, is proposed. AODV-FABL merges the primary route table with the alternate route table, and updates routes when overhearing packets, thus the routes can be optimized as soon as possible. Experimental results show that AODV-FABL has better packet delivery ratio, end-to-end delay, control overhead and adaptability to the variational traffic load than AODV-LR and AODV-ABL.

  4. Studies on Routing Optimization of Fast and Hierarchical Mobile Multicast%快速分层移动组播的路径优化研究

    李彬; 冯祖洪

    2015-01-01

    随着科学技术的飞速发展,多媒体通信的需求导致了组播技术的快速进步。如何节约网络资源,为移动设备提供更好的支持也引起了人们的普遍关注。由于组播具有可扩展性强、高效的特点,因此移动组播的应用已经得到了越来越多的关注。本文根据快速分层移动组播现有算法中的传输路径问题,介绍一种新的路由路径选择方法。该算法依据移动节点在新接入点停留的时间长短,选择不同的数据传输路径加入组播。可以优化组播分组的传输路径,有效减少网络资源的浪费。%With the rapid progress of science and technology, the requirement of multimedia communication let to the rapid advancement of the multicast technology. How to save network resources and determine the best way to provide services to mobile devices is the most important issue need to solve. As multicast naturally has the merit of high scalability and efficiency, more and more people pay attention to mobile multicast. Based on the transmission path problem of the fast and hierarchical mobile multicast, this paper introduces a new method. which is an improved algorithm based on the staying time of mobile devices under new access router, through prediction staying time mobile devices, it chooses a better path to join multicast. This new method can optimization routing path and save network resources.

  5. 考虑设计规则的引脚分配算法%DRC-aware Pin Access Planning for Detailed Routing

    王雨田; 贾小涛; 蔡懿慈; 周强

    2016-01-01

    详细布线是集成电路物理设计的关键步骤之一,引脚分配是影响详细布线质量和减少设计规则违反的关键因素,为此提出一种基于最小费用最大流的考虑设计规则的引脚分配算法。首先构建详细布线图和相应的网格图;然后在网格图上搜索布线区域内总费用最小的最大流,为所有线网的引脚同时分配pin点;在引脚分配的基础上提出一种拆线重布算法,针对引脚分配中不合理的pin点位置进行拆线重布,为其分配新的pin点,同时对设计规则违反从代价函数定义、拆线重布顺序、布线方式3个方面进行优化。实验结果表明,应用文中的引脚分配算法后,详细布线结果中的设计规则违反数平均减少了24%。%Detailed routing is one of the key steps in integrated circuit physical design. Pin access planning is a key factor affecting the quality of detailed routing result and reducing design rule check (DRC) violations. A pin access planning algorithm based on minimum cost maximum flow (MCMF) and taking DRC violations into ac-count is proposed. Firstly, it constructed detailed routing graph and corresponding grid graph. Then, all the pin access positions were assigned by searching MCMF of the routing area on the grid graph. On the basis of the above pin access planning algorithm, a rip-up and rerouting algorithm is proposed. New pin access positions were reassigned for the unreasonable ones when ripping-up and rerouting. DRC violation was taken into account as well. Algorithm was optimized with three aspects: the definition of cost function, the order of ripping-up and re-routing and the routing method. Experimental results show that DRC violations are decreased by 24% in average after using the algorithm.

  6. 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 aqu......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...... in depth serological and cellular immune analyses will be performed, allowing identification of novel biomarkers for monitoring treatment efficacy. FAST aims at improving the quality of life of food allergic patients by providing a safe and effective treatment that will significantly lower their threshold...

  7. Focus on Chapter 1. Focused Access to Selected Topics (FAST) Bib No. 64.

    Johns, Jerry; VanLeirsburg, Peggy

    Presenting information for the improvement of instruction and services to at-risk students from elementary through beginning college levels, this ERIC "FAST Bib" focuses on recent research and strategies for Chapter 1, a federally funded program serving at-risk students since 1965. The FAST Bib presents 25 annotations of ERIC documents…

  8. Writing To Learn. Focused Access to Selected Topics (FAST) Bib No. 66.

    Denner, Michael

    Suggesting that writing can play an integral part in the learning process, this ERIC "FAST Bib" provides annotations of 31 ERIC documents and journal articles published between 1987 and 1992 concerning the Writing to Learn movement. The citations in the first section of the FAST Bib present an overview of the theories and criticisms of…

  9. Television Viewing. Focused Access to Selected Topics (FAST) Bib No. 68.

    Johns, Jerry; And Others

    Reflecting the concern which has been generated over the influence of television viewing on society at large, this "FAST Bib" presents annotations of 31 ERIC documents and journal articles published between 1989 and 1992. Annotations in the FAST Bib are divided into five sections: (1) Overview; (2) The Connection between Television and…

  10. Gender Issues in Language and Writing. Focused Access to Selected Topics (FAST) Bib No. 63.

    Dickinson, Patricia

    This ERIC "FAST Bib," which focuses on gender issues in language and writing, presents annotations of 23 ERIC documents and journal articles published between 1987 and 1991. The first section of the FAST Bib is an overview; the second section is divided between issues that are relevant to the elementary and secondary levels and issues that emerge…

  11. 76 FR 47529 - Port Access Route Study: In the Waters of Montauk Channel and Block Island Sound

    2011-08-05

    ..., Long Island Sound, New York. This recommended route was subsequently incorporated on nautical charts by.... A navigation chart with the proposed recommendations plotted is included in the docket at...

  12. Performance assessment of flexible time-wavelength routing for a self-aggregating transparent Metro-access interface

    Wieckowski, M.; Osadchiy, Alexey Vladimirovich; Turkiewicz, J. P.;

    2009-01-01

    A time-WDM architecture with on-the-fly wavelength routing and traffic self-aggregation is proposed. Metro-accesss ligthpaths are established using ONUs with reflective modulators. Simulations results show the advantages of the proposed architecture......A time-WDM architecture with on-the-fly wavelength routing and traffic self-aggregation is proposed. Metro-accesss ligthpaths are established using ONUs with reflective modulators. Simulations results show the advantages of the proposed architecture...

  13. Fast-track access to urologic care for patients with macroscopic haematuria is efficient and cost-effective

    Liedberg, Fredrik; Gerdtham, Ulf; Gralén, Katarina

    2016-01-01

    BACKGROUND: The delay between onset of macroscopic haematuria and diagnosis of bladder cancer is often long. METHODS: We evaluated timely diagnosis and health-care costs for patients with macroscopic haematuria given fast-track access to diagnostics. During a 15-month period, a telephone hotline......: In all 275 patients who called 'the Red Phone' hotline were investigated, and 47 of them (17%) were diagnosed with cancer and 36 of those had bladder cancer. Median time from patient-reported haematuria to diagnosis was 29 (interquartile range (IQR) 14-104) days and 50 (IQR 27-165) days...

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

  15. Workplace Literacy: An Update. Focused Access to Selected Topics: FAST Bib No. 69.

    Johns, Jerry; Abromitis, Barbara S.

    This ERIC FAST Bib presents annotations concerning four major areas related to workplace literacy: (1) the definition and design of curriculum; (2) trends, issues, and challenges in workplace literacy; (3) model programs and projects; and (4) reference materials for practitioners. Contents include annotations of 45 journal articles, conference…

  16. Curriculum Development in the Language Arts. Focused Access to Selected Topics (FAST) Bib No. 65.

    Warren, John

    This ERIC "FAST Bib" provides annotations of ERIC documents and journal articles that address the question of how to balance two opposing forces operating in today's schools, i.e., the forces of change and complacency, to establish an exemplary language arts curriculum that is a reality and not just a theoretical mirage. The 18…

  17. Whole Language in the Elementary School. Focused Access to Selected Topics (FAST) Bib No. 67.

    Johns, Jerry; And Others

    After defining whole language as a philosophy of literacy instruction based on the concept that students need to experience language as an integrated whole, this ERIC "FAST Bib" presents an annotated list of 35 ERIC documents and journal articles consisting of critiques of and responses to the whole language approach in the elementary school. The…

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

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

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

  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

    -Process & Other Non-Indexed Citations, Ovid MEDLINE(R) Daily, Ovid MEDLINE(R) and Ovid OLDMEDLINE(R), Embase Classic + Embase (OvidSP), CINAHL (EBSCOhost), clinicaltrials.gov and screened reference lists. SELECTION CRITERIA: Randomised controlled trials comparing different parenteral routes for the infusion...

  20. Fast access and early ligation of the renal pedicle significantly facilitates retroperitoneal laparoscopic radical nephrectomy procedures: modified laparoscopic radical nephrectomy

    Yang Qing

    2013-01-01

    Full Text Available Abstract Background The objective of this study was to develop a modified retroperitoneal laparoscopic nephrectomy and compare its results with the previous technique. Methods One hundred retroperitoneal laparoscopic nephrectomies were performed from February 2007 to October 2011. The previous technique was performed in 60 cases (Group 1. The modified technique (n = 40 included fast access to the renal pedicle according to several anatomic landmarks and early ligation of renal vessels (Group 2. The mean operation time, mean blood loss, duration of hospital stay conversion rate and complication rate were compared between the groups. Results No significant differences were detected regarding mean patient age, mean body mass index, and tumor size between the two groups (P >0.05. The mean operation time was 59.5 ± 20.0 and 39.5 ± 17.5 minutes, respectively, in Groups 1 and 2 (P P P >0.05. Conclusions Early ligature using fast access to the renal vessels during retroperitoneal laparoscopic radical nephrectomy contributed to less operation time and intraoperative blood loss compared with the previous technique. In addition, the modified technique permits the procedure to be performed following the principles of open radical nephrectomy.

  1. 基于业务的光接入网路由选择算法%Algorithm of optical access network routing selection based on transmission business

    孙立炜; 林峰

    2012-01-01

    Unlike optical backbone network, optical access network has its own characteristics and routing algorithms. An optical access network routing algorithm based on transmission business is proposed. Weighted graph model and sub-algorithm are made according to the style and importance of transmission business, by which the network resources is deployed appropriately. The results of engineering application demonstrate that the algorithm can enhance transmission quality.%光接入网有着不同于光骨干网的特点和问题,不能直接套用光骨干网的路由选择算法.提出了一种基于业务的光接入网的路由选择算法.其思想是根据业务类型和重要性构建不同的带权图模型,每一种模型采用相应的子算法,使整体资源得到合理配置.实践证明,该算法能够改善网络的传输质量.

  2. Fast synthesis of nanocrystalline Mg2Si by microwave heating: a new route to nano-structured thermoelectric materials.

    Savary, Etienne; Gascoin, Franck; Marinel, Sylvain

    2010-12-07

    The ultra fast synthesis of nanocrystalline Mg(2)Si was carried out using microwave radiation. The elemental precursors were first milled together under dry conditions to get fine particles. The resulting mixture of powders of Mg and Si was cold pressed before being heated by microwave irradiation. Precursors and products were analyzed by X-ray diffraction and scanning electron microscopy. The high energy ball milling parameters utilized to prepare the reactive powders have quite an influence on the behavior of the mixture under irradiation. Moreover, SEM imaging demonstrates that the power and time of irradiation are crucial for the grain growth of the Mg(2)Si and must be adequately controlled in order to avoid the decomposition of the phase. Our results show that we successfully managed to easily and quickly synthesize homogeneous nanocrystalline Mg(2)Si with particle size smaller than 100 nm using a microwave power of only 175 W for two minutes on powders ball milled for two hours.

  3. Architecture for a large, high-density, fast-access data repository

    Schlak, Gerard A.

    1993-01-01

    The ability to access very large data sets in seconds rather than hours or days is key to an efficient analysis procedure. We have developed a high performance robotic storage and retrieval system plus an innovative data management technique which provides this capability and is now in operation at user sites. Our EMASSTM (E-systems modular automated storage system) achieves this high performance with a combination of state-of-the-art technology. helical-scan digital recorders, each having a sustained transfer rate of 15 megabytes/second and a burst transfer rate of 20 megabytes/second are used to store data, and many recorders can be accessed concurrently to achieve the desired transfer rate. Commercially available, out-of-box D2 high density magnetic tape is used for archiving data, and this 19 mm tape is available in three cassette sizes having capacities of 25, 75, or 165 gigabytes, respectively. Cassettes are stored in modular robotic systems whose capacities can be expanded from a few terabytes to thousands of terabytes. EMASS software controls all aspects of data management including commanding the robots to move cassettes between their storage locations and the recorders. Performance is matched to each user's needs by tailoring the number of recorders, the size and configuration of the robotic archive, and the number of robots for the user's environment.

  4. [Long-term development of Permacath Quinton catheters used as a vascular access route for extra-renal detoxification].

    Dupont, D; Morinière, P; Pourchez, T; el Esper, N; Fournier, A

    1994-01-01

    Between July 1984 and July 1991, we have inserted surgically 147 Permcath Quinton catheters in 126 uremic patients for the following reasons: group I: necessity of hemodialysis without vascular access for acute (group Ia: 44 patients) or chronic renal failure (group Ib: 11 patients); group II: difficulty of creation or loss of vascular access (group II: 45 patients); group III: hemodialysis for patients with short life expectation or contraindications for vascular access on their limbs (group III: 26 patients). The duration of use (+/- SD and range) were respectively for each group: 1.6 +/- 2 (0-10); 3.4 +/- 2.8 (1-11); 7.4 +/- 11 (0-50); 6.7 +/- 8.7 (0.1-34.5) months. Seventeen patients (group IV) coming from groups Ib and II preferred to go on with the use of their catheter for 10.5 +/- 13.5 (0.1-50) months rather than to use their arteriovenous fistula. The complications observed on whole population were: 11 septicemia responsible of 2 deaths, 9 cutaneous local infections, 28 total obstructions of the catheter, 17 partial obstructions with insufficient flow; 10 destructions of the catheter. In conclusion the Permcath Quinton catheter is an adequate long term vascular access for hemodialysis. It is well tolerated since it is preferred to the usual arteriovenous fistula by many patients who have both. The incidence of infection is low. However, obstruction (partial ou total) is frequent (29%), necessitating local fibrinolytic treatment.

  5. Multiple user access and testing for PreNotiS: a fast mobile event reporting solution

    Chan, Michael; Kumar, Abhinav; Akopian, David; Agaian, Sos S.

    2011-06-01

    The PreNotiS (preventive notification system) was proposed to address the current lack in consumer prevention and disaster informatics systems. The underscore of this letter is to propose PreNotiS as a provision of trusted proxies of information sourcing to be integral to the disaster informatics framework. To promote loose coupling among subsystems, PreNotiS has evolved into a model-view-controller (MVC) architecture via object-oriented incremental prototyping. The MVC specifies how all subsystems and how they interact with each other. A testing framework is also proposed for the PreNotiS to verify multiple concurrent user access which might be observable during disasters. The framework relies on conceptually similar self-test modules to help with serviceability.

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

  8. Effect of secondary prehospital risk factors on outcome in severe traumatic brain injury in the context of fast access to trauma care

    Franschman, G.; Peerdeman, S.M.; Andriessen, T.M.J.C.; Greuters, S.; Toor, A.E.; Vos, P.E.; Bakker, F.C.; Loer, S.A.; Boer, C.

    2011-01-01

    BACKGROUND: Prevention of secondary prehospital risk factors such as hypoxia and hypotension is likely to improve patient prognosis in severe traumatic brain injury (TBI). Because the Dutch trauma care organization is characterized by fast access to specialized trauma care due to the geographical si

  9. A fast and accessible methodology for micro-patterning cells on standard culture substrates using Parafilm™ inserts.

    Javaherian, Sahar; O'Donnell, Kylie A; McGuigan, Alison P

    2011-01-01

    Micropatterning techniques provide direct control over the spatial organization of cells at the sub-mm scale. Regulation of these spatial parameters is important for controlling cell fate and cell function. While micropatterning has proved a powerful technique for understanding the impact of cell organization on cell behaviour, current methods for micropatterning cells require complex, specialized equipment that is not readily accessible in most biological and bioengineering laboratories. In addition, currently available methods require significant protocol optimization to ensure reliable and reproducible patterning. The inaccessibility of current methods has severely limited the widespread use of micropatterning as a tool in both biology and tissue engineering laboratories. Here we present a simple, cheap, and fast method to micropattern mammalian cells into stripes and circular patterns using Parafilm™, a common material found in most biology and bioengineering laboratories. Our method does not require any specialized equipment and does not require significant method optimization to ensure reproducible patterning. Although our method is limited to simple patterns, these geometries are sufficient for addressing a wide range of biological problems. Specifically, we demonstrate i) that using our Parafilm™ insert method we can pattern and co-pattern ARPE-19 and MDCK epithelial cells into circular and stripe micropatterns in tissue culture polystyrene (TCPS) wells and on glass slides, ii) that we can contain cells in the desired patterns for more than one month and iii) that upon removal of the Parafilm™ insert we can release the cells from the containment pattern and allow cell migration outward from the original pattern. We also demonstrate that we can exploit this confinement release feature to conduct an epithelial cell wound healing assay. This novel micropatterning method provides a reliable and accessible tool with the flexibility to address a wide range

  10. A fast and accessible methodology for micro-patterning cells on standard culture substrates using Parafilm™ inserts.

    Sahar Javaherian

    Full Text Available Micropatterning techniques provide direct control over the spatial organization of cells at the sub-mm scale. Regulation of these spatial parameters is important for controlling cell fate and cell function. While micropatterning has proved a powerful technique for understanding the impact of cell organization on cell behaviour, current methods for micropatterning cells require complex, specialized equipment that is not readily accessible in most biological and bioengineering laboratories. In addition, currently available methods require significant protocol optimization to ensure reliable and reproducible patterning. The inaccessibility of current methods has severely limited the widespread use of micropatterning as a tool in both biology and tissue engineering laboratories. Here we present a simple, cheap, and fast method to micropattern mammalian cells into stripes and circular patterns using Parafilm™, a common material found in most biology and bioengineering laboratories. Our method does not require any specialized equipment and does not require significant method optimization to ensure reproducible patterning. Although our method is limited to simple patterns, these geometries are sufficient for addressing a wide range of biological problems. Specifically, we demonstrate i that using our Parafilm™ insert method we can pattern and co-pattern ARPE-19 and MDCK epithelial cells into circular and stripe micropatterns in tissue culture polystyrene (TCPS wells and on glass slides, ii that we can contain cells in the desired patterns for more than one month and iii that upon removal of the Parafilm™ insert we can release the cells from the containment pattern and allow cell migration outward from the original pattern. We also demonstrate that we can exploit this confinement release feature to conduct an epithelial cell wound healing assay. This novel micropatterning method provides a reliable and accessible tool with the flexibility to

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

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

  13. Microwave-assisted 1T to 2H phase reversion of MoS2 in solution: a fast route to processable dispersions of 2H-MoS2 nanosheets and nanocomposites

    Xu, Danyun; Zhu, Yuanzhi; Liu, Jiapeng; Li, Yang; Peng, Wenchao; Zhang, Guoliang; Zhang, Fengbao; Fan, Xiaobin

    2016-09-01

    Exfoliated molybdenum disulfide (MoS2) has unique 2H phase and semiconductor properties and potential applications across a wide range of fields. However, the chemically exfoliated MoS2 nanosheets from Li x MoS2 have a 1T phase, and searching for a fast route to get processable 2H-MoS2 nanosheets and its nanocomposites is still an urgent task. This study reports on a simple, fast and efficient microwave strategy to achieve the 1T to 2H phase conversion of MoS2 and the successful preparation of processable 2H-MoS2 nanosheets and their nanocomposites. The method here may be easily changed to achieve the phase change of other exfoliated TMDs.

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

  15. Hardware Routing Lookup with SDRAMT

    2001-01-01

    The authors present a routing lookup architecture, SDIR(SDRAM based Direct Index Routing). With pipeline and interleaving access technique, SDIR can provide scalable lookup speed from 16.7 MPPS(megapacket per second) to 133 MPPS with SDRAM running at 133MHz frequency.

  16. 车辆路径问题的快速多邻域迭代局部搜索算法%A fast multi-neighborhood iterated local search algorithm for vehicle routing problem

    刘万峰; 李霞

    2015-01-01

    对于容量约束的车辆路径问题( capacitated vehicle routing problem, CVRP)以及容量和最大行驶距离约束的车辆问题( capacitated and distance constrained vehicle routing problem, CDVRP),邻域解的评估包含了适应值计算及合法性评估.设计一种可变长编码的可行解表示,提出用于CVRP/CDVRP问题的邻域解合法性快速评估策略.该策略针对交换、插入、2-opt和2-opt∗四种常用的局部搜索算子,通过引入前载重、后载重、前向距离和后向距离的概念,实现了邻域解合法性的快速评估.将改进后的局部搜索算子与迭代局部搜索( iterated local search, ILS)算法相结合,提出用于车辆路径问题的快速多邻域迭代局部搜索( fast multi-neighborhood ILS, FMNILS)算法.该快速评估策略将评估一个邻域解的时间复杂度由O( N)降至O(1),算法仿真结果表明, FMNILS算法运算能力的提高大致与配送路线所服务的客户数成正比;对客户数介于200~500的容量/最大距离约束VRP问题,该算法能在短时间内获得较满意解,平均求解精度1.2%以内,平均耗时约96 s,仅为对比算法的6%或更少.%For capacitated vehicle routing problems without/with maximum traveling distance constraint ( CVRP/CDVRP) , the evaluation of neighborhood solutions involves fitness calculation and feasibility assessment. This paper proposes a fast feasibility assessment strategy in which variable length coding is used to represent feasible solutions of vehicle routing problem. We introduce the concepts of pre-load, post-load, pre-distance and post-distance to obtain fast feasibility assessments for neighborhood solutions achieved by four widely used local search operations ( insert, exchange, 2-opt, and 2-opt∗). By combining the improved local search operations and iterated local search (ILS), we propose a fast multi-neighborhood iterated local search ( FMNILS) for CVRP. The feasibility assessment strategy can reduce

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

  18. 76 FR 67395 - Port Access Route Study: In the Approaches to Los Angeles-Long Beach and in the Santa Barbara...

    2011-11-01

    ... Pacific Ocean, particularly the area south of San Miguel, Santa Rosa, Santa Cruz, and Anacapa Islands; and north of San Nicolas, Santa Barbara, and Santa Catalina Islands where an increase in vessel traffic has..., precautionary areas, and deep-water routes. SUPPLEMENTARY INFORMATION: Background and Purpose The Coast...

  19. 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结构能有效避免转发中断和域间扰动。

  20. A cost-effective and fast synthesis of nanoporous SiO 2 aerogel powders using water-glass via ambient pressure drying route

    Bhagat, Sharad D.; Kim, Yong-Ha; Moon, Myung-Jun; Ahn, Young-Soo; Yeo, Jeong-Gu

    2007-07-01

    Considering the need for large-scale production of silica aerogel powders, the present research was aimed to develop a simple, cost-effective and rapid process based on water-glass precursor via ambient pressure drying (APD) route. It has been shown that the surface chemical modification of hydrogels can rapidly be carried out with extremely low doses (e.g. 5 g of hexamethyldisilazane ( HMDS) for 100 g of hydrogel) of HMDS by a co-precursor method which makes this process quite cost-effective. The surface modification in the aqueous phase essentially resulted in the displacement of the pore water and the simultaneous one-step solvent exchange using n-hexane converted the hydrogel into an organo-gel in 3 h and thus the total processing time of the aerogel powder production via APD could drastically be reduced to 5 h. The solvent n-hexane could be recollected during the drying stage and it does not add much to the material cost. The aerogel powders with tapping densities and specific surface areas in the range of 0.100-0.309 g/cm 3 and 473-776 m 2/g, respectively, could be synthesized using this novel route. The surface modification of the aerogel powders was explored by means of X-ray photoelectron spectroscopy (XPS) in conjunction with the Fourier transform infrared (FT-IR) spectroscopy. The textural investigations revealed that the aerogel powders with a wide variation in their pore size distributions and average pore diameters can easily be synthesized by varying the silica content in the sol.

  1. HCUP Fast Stats

    U.S. Department of Health & Human Services — HCUP Fast Stats provides easy access to the latest HCUP-based statistics for health information topics. HCUP Fast Stats uses visual statistical displays in...

  2. Efficient Processing of a Rainfall Simulation Watershed on an FPGA-Based Architecture with Fast Access to Neighbourhood Pixels

    Yeong LeeSeng

    2009-01-01

    Full Text Available This paper describes a hardware architecture to implement the watershed algorithm using rainfall simulation. The speed of the architecture is increased by utilizing a multiple memory bank approach to allow parallel access to the neighbourhood pixel values. In a single read cycle, the architecture is able to obtain all five values of the centre and four neighbours for a 4-connectivity watershed transform. The storage requirement of the multiple bank implementation is the same as a single bank implementation by using a graph-based memory bank addressing scheme. The proposed rainfall watershed architecture consists of two parts. The first part performs the arrowing operation and the second part assigns each pixel to its associated catchment basin. The paper describes the architecture datapath and control logic in detail and concludes with an implementation on a Xilinx Spartan-3 FPGA.

  3. 基于MPLS的快速重路由故障恢复综合模型%Fast Re-routing Fault-recovery Synthetic Model Based on MPLS

    任韬松; 余江; 常俊; 施继红; 罗忠成

    2012-01-01

    The problems of packet delay, disorder and long recover time are widespread in traditional Multi-protocol Label Switching(MPLS) fast re-routing fault-recovery model. In order to solve the problems, a fast re-router fault-recovery synthetic mode! based on MPLS through expanding the MPLS message is presented. In this model, the LDP message is expanded, combined with global strategy and local strategy, and a new method to establish temporary path is put forward. The conclusion that this multiple model shows better performance on reducing fault-recover time is proved by OPNET network simulation.%传统的多协议标签交换(MPLS)快速重路由故障恢复算法存在报文延迟、失序、故障修复时间过长等问题.为此,提出一种基于MPLS的快速重路由故障恢复综合模型,对LDP消息进行扩展、使用全局恢复机制和局部恢复机制相结合的综合策略,采用新型临时路径计算方法.仿真结果证明,该故障恢复综合模型可以降低丢包率,缩短故障恢复时间.

  4. Location-routing problems

    Laporte, G.

    1987-01-01

    Location-routing problems involve simultaneously locating a number of facilities among candidate sites and establishing delivery routes to a set of users in such a way that the total system cost is minimized. This paper presents a survey of such problems. It includes some applications and examples of location-routing problems, a description of the main heuristics that have been developed for such problems, and reviews of various formulations and algorithms used in solving these problems. A more detailed review is given of exact algorithms for the vehicle routing problem, three-index vehicle flow formulations, and two-index vehicle flow formulations and algorithms for symmetrical and non-symmetrical problems. It is concluded that location-routing problem research is a fast-growing area, with most developments occurring over the past few years; however, research is relatively fragmented, often addresses problems which are too specific and contains several voids which have yet to be filled. A number of promising research areas are identified. 137 refs., 3 figs.

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

  6. Fast and simultaneous detection of heavy metals using a simple and reliable microchip-electrochemistry route: An alternative approach to food analysis.

    Chailapakul, Orawon; Korsrisakul, Sarawadee; Siangproh, Weena; Grudpan, Kate

    2008-01-15

    This paper reports, for the first, the fast and simultaneous detection of prominent heavy metals, including: lead, cadmium and copper using microchip CE with electrochemical detection. The direct amperometric detection mode for microchip CE was successfully applied to these heavy metal ions. The influences of separation voltage, detection potential, as well as the concentration and pH value of the running buffer on the response of the detector were carefully assayed and optimized. The results clearly show that reliable analysis for lead, cadmium, and copper by the degree of electrophoretic separation occurs in less than 3min using a MES buffer (pH 7.0, 25mM) and l-histidine, with 1.2kV separation voltage and -0.8V detection potential. The detection limits for Pb(2+), Cd(2+), and Cu(2+) were 1.74, 0.73 and 0.13microM (S/N=3). The %R.S.D. of each peak current was foods.

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

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

  9. Defining and Computing Alternative Routes in Road Networks

    Dees, Jonathan; Sanders, Peter; Bader, Roland

    2010-01-01

    Every human likes choices. But today's fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative routes, but this topic has not been studied thoroughly. Often, the aspect of meaningful alternative routes is neglected from a human point of view. We fill in this gap by suggesting mathematical definitions for such routes. As a second contribution we propose heuristics to compute them, as this is NP-hard in general.

  10. 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-03-17

    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.

  11. Preferential use of unobstructed lateral portals as the access route to the pore of human ATP-gated ion channels (P2X receptors).

    Samways, Damien S K; Khakh, Baljit S; Dutertre, Sébastien; Egan, Terrance M

    2011-08-16

    P2X receptors are trimeric cation channels with widespread roles in health and disease. The recent crystal structure of a P2X4 receptor provides a 3D view of their topology and architecture. A key unresolved issue is how ions gain access to the pore, because the structure reveals two different pathways within the extracellular domain. One of these is the central pathway spanning the entire length of the extracellular domain and covering a distance of ≈70 Å. The second consists of three lateral portals, adjacent to the membrane and connected to the transmembrane pore by short tunnels. Here, we demonstrate the preferential use of the lateral portals. Owing to their favorable diameters and equivalent spacing, the lateral portals split the task of ion supply threefold and minimize an ion's diffusive path before it succumbs to transmembrane electrochemical gradients.

  12. 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 benefits the private sector by decreasing the time horizon for feasible space tourism. In addition to the use of existing state technology, such collaboration may help overcome the legal and policy obstacles to space tourism presented by most western space agencies. Finally, the project promotes international cooperation between the private companies of advanced industrial states, and Russia. Also, because the module can be utilized for other commercial purposes, in addition to space tourism (i.e. broadcasting, advertisement, etc.) revenues will be gained in other activities. Even though the initial costs of space tourism are high, investment returns can be measured in many ways. Throughout Eastern Europe, companies such as Coca-Cola and Volkswagen are currently investing despite diminished initial returns because they want to open new markets, which will be profitable in the long run and build their image worldwide. This project, which does foresee profitable returns, follows a similar strategy by starting in Russia.

  13. A dual-route approach to orthographic processing

    Jonathan eGrainger

    2011-04-01

    Full Text Available In the present theoretical note we examine how different learning constraints, thought to be involved in optimizing the mapping of print to meaning during reading acquisition, might shape the nature of the orthographic code involved in skilled reading. On the one hand, optimization is hypothesized to involve selecting combinations of letters that are the most informative with respect to word identity (diagnosticity constraint, and on the other hand to involve the detection of letter combinations that correspond to pre-existing sublexical phonological and morphological representations (chunking constraint. These two constraints give rise to two different kinds of prelexical orthographic code, a coarse-grained and a fine-grained code, associated with the two routes of a dual-route architecture. Processing along the coarse-grained route optimizes fast access to semantics by using minimal subsets of letters that maximize information with respect to word identity, while coding for approximate within-word letter position independently of letter contiguity. Processing along the fined-grained route, on the other hand, is sensitive to the precise ordering of letters, as well as to position with respect to word beginnings and endings. This enables the chunking of frequently co-occurring contiguous letter combinations that form relevant units for morpho-orthographic processing (prefixes and suffixes and for the sublexical translation of print to sound (multi-letter graphemes.

  14. The Fast Route to Modified Gravitational Growth

    Baker, Tessa; Skordis, Constantinos

    2013-01-01

    The growth rate of the large-scale structure of the universe has been advocated as the observable par excellence for testing gravity on cosmological scales. By considering linear-order deviations from General Relativity, we show that corrections to the growth rate, f, can be expressed as an integral over a `source' term, weighted by a theory-independent `response kernel'. This leads to an efficient and accurate `plug-and-play' expression for generating growth rates in alternative gravity theories, bypassing lengthy theory-specific computations. We use this approach to explicitly show that f is sensitive to a degenerate combination of modified expansion and modified clustering effects. Hence the growth rate, when used in isolation, is not a straightforward diagnostic of modified gravity.

  15. A new automatic SAR-based flood mapping application hosted on the European Space Agency's grid processing on demand fast access to imagery environment

    Hostache, Renaud; Chini, Marco; Matgen, Patrick; Giustarini, Laura

    2013-04-01

    There is a clear need for developing innovative processing chains based on earth observation (EO) data to generate products supporting emergency response and flood management at a global scale. Here an automatic flood mapping application is introduced. The latter is currently hosted on the Grid Processing on Demand (G-POD) Fast Access to Imagery (Faire) environment of the European Space Agency. The main objective of the online application is to deliver flooded areas using both recent and historical acquisitions of SAR data in an operational framework. It is worth mentioning that the method can be applied to both medium and high resolution SAR images. The flood mapping application consists of two main blocks: 1) A set of query tools for selecting the "crisis image" and the optimal corresponding pre-flood "reference image" from the G-POD archive. 2) An algorithm for extracting flooded areas using the previously selected "crisis image" and "reference image". The proposed method is a hybrid methodology, which combines histogram thresholding, region growing and change detection as an approach enabling the automatic, objective and reliable flood extent extraction from SAR images. The method is based on the calibration of a statistical distribution of "open water" backscatter values inferred from SAR images of floods. Change detection with respect to a pre-flood reference image helps reducing over-detection of inundated areas. The algorithms are computationally efficient and operate with minimum data requirements, considering as input data a flood image and a reference image. Stakeholders in flood management and service providers are able to log onto the flood mapping application to get support for the retrieval, from the rolling archive, of the most appropriate pre-flood reference image. Potential users will also be able to apply the implemented flood delineation algorithm. Case studies of several recent high magnitude flooding events (e.g. July 2007 Severn River flood

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

  17. FAST: FAST Analysis of Sequences Toolbox.

    Lawrence, Travis J; Kauffman, Kyle T; Amrine, Katherine C H; Carper, Dana L; Lee, Raymond S; Becich, Peter J; Canales, Claudia J; Ardell, David H

    2015-01-01

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

  18. 复杂光学表面的快刀伺服加工特性与路径规划%Machining Characteristics and Route Planning of Complex Optical Surface by Using Fast Tool Servo

    王贵林; 朱登超; 戴一帆

    2011-01-01

    Optical components with complex surfaces or microstructure array are more and more widely applied, but it is very difficult to satisfy the requirements of surface accuracy and machining efficiency by using traditional mechanical fabricating methods. Ultraprecision fast tool servo (FTS) system can manufacture these complex surfaces efficiently and accurately. The relative position between the tool and workpiece surface will vary continuously in the FTS machining process, owing to the height change of workpiece profile, and this will worsen the cutting conditions, debase the machining accuracy, and even produce the phenomenon of tool interference and over-cut. In view of the situation, the varying rules of cutting angle are studied in the FTS machining process of complex workpieces, as well as the influences on rake angle and back angle of the tool. The algorithms for identifying tool interference and the selection basis of machining parameters are given. In order to realize rational route planning, the analysis and algorithm design of tool compensation are accomplished in the machining process of typical complex optical surface. On the basis of the above work, a kind of representative complex workpiece, radial sinusoidal workpiece, is manufactured by using the FTS system. The measuring results indicate that accuracy of machined surface can reach PV 0.17 urn, and the over-cut and tool interference do not occur.%复杂面形和微结构阵列等类型的光学元件应用范围越来越广,传统的机械加工方法难以满足面形精度和加工效率要求,超精密快刀伺服(Fast tool servo,FTS)是实现这类零件优质高效加工的有效手段.但是在复杂光学表面的快刀伺服加工中,面形的高低起伏将会使刀具和工件的相对位置实时变化,导致加工状态恶化、面形精度下降,甚至会产生刀具干涉和过切现象.针对这种情况,通过研究复杂面形快刀伺服加工中切削角的变化规律及其对刀

  19. Hurricane Evacuation Routes

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

  20. Lateralization of route continuation and route order

    Van Der Ham, Ineke J M; Van Den Hoven, Jacco

    2014-01-01

    Navigation is a complex cognitive ability and its structure is still poorly understood. Memory for route continuation and route order are hypothesized to be at least partially separate components of navigation ability. In the current experiment, participants studied a route in virtual reality. The d

  1. Wireless Mesh Network Routing Under Uncertain Demands

    Wellons, Jonathan; Dai, Liang; Chang, Bin; Xue, Yuan

    Traffic routing plays a critical role in determining the performance of a wireless mesh network. Recent research results usually fall into two ends of the spectrum. On one end are the heuristic routing algorithms, which are highly adaptive to the dynamic environments of wireless networks yet lack the analytical properties of how well the network performs globally. On the other end are the optimal routing algorithms that are derived from the optimization problem formulation of mesh network routing. They can usually claim analytical properties such as resource use optimality and throughput fairness. However, traffic demand is usually implicitly assumed as static and known a priori in these problem formulations. In contrast, recent studies of wireless network traces show that the traffic demand, even being aggregated at access points, is highly dynamic and hard to estimate. Thus, to apply the optimization-based routing solution in practice, one must take into account the dynamic and uncertain nature of wireless traffic demand. There are two basic approaches to address the traffic uncertainty in optimal mesh network routing (1) predictive routing that infers the traffic demand with maximum possibility based in its history and optimizes the routing strategy based on the predicted traffic demand and (2) oblivious routing that considers all the possible traffic demands and selects the routing strategy where the worst-case network performance could be optimized. This chapter provides an overview of the optimal routing strategies for wireless mesh networks with a focus on the above two strategies that explicitly consider the traffic uncertainty. It also identifies the key factors that affect the performance of each routing strategy and provides guidelines towards the strategy selection in mesh network routing under uncertain traffic demands.

  2. Expanding Support for Education in Fragile States: What Role for the Education for All-Fast Track Initiative? CREATE Pathways to Access. Research Monograph No. 30

    Turrent, Victoria

    2009-01-01

    The new international aid architecture was established to improve the efficiency and effectiveness of development aid by emphasising country ownership, alignment with national priorities and the harmonisation of donor processes. These features are evident in the Education for All-Fast Track Initiative [EFA-FTI], a global partnership between donor…

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

  4. Routing and scheduling problems

    Reinhardt, Line Blander

    be that the objects routed have an availability time window and a delivery time window or that locations on the path have a service time window. When routing moving transportation objects such as vehicles and vessels schedules are made in connection with the routing. Such schedules represent the time for the presence...... 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...... of a connection between two locations. This could be an urban bus schedule where busses are routed and this routing creates a bus schedule which the passengers between locations use. In this thesis various routing and scheduling problems will be presented. The topics covered will be routing from an origin...

  5. A SURVEY ON THE ALGORITHMIC APPROACH USED IN ROUTING FOR PLACEMENT AND ROUTING FLOW

    KOMAL

    2014-06-01

    Full Text Available Routing is one of the long-drawn-out processes after placement in VLSI design. The routing provides the path for nets on chip to interconnect the pins on the pads or blocks at the chip boundary. This paper provides a systematic insight of interconnect of nets in ‘Placement and Routing Flow’ based on various methods (global routing and detailed routing. Further, the work reported so far has been compared with a multiple techniques for multiple factors such as reduction in wire-length, short execution time, fast and accurate congestion, improvement in complexity, signal integrity and crosstalk. Here the methodologies adopts are the Routing congestion estimator algorithm, Ant Colony Optimization. Firefly Algorithm, Monotonic Staircase Routing and so on. It is also observed that Pattern Based Routing is much faster than the Maze Routing, and the improved parameters are there is no over-congestion and 100% routablity with Monotonic Staircase Channels. zero overflow by Simulated-Evolution(Sim-E, and Complexity improved by a Fuzzified Approach Towards Global Routing.

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

  7. Visualizing Internet routing changes.

    Lad, Mohit; Massey, Dan; Zhang, Lixia

    2006-01-01

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

  8. Hazmat Routes (National)

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

  9. Routing on Metacyclic Graphs

    Wenjun Xiao

    2002-01-01

    Wu, Lakshmivarahan and Dhall[5] recently described a deterministic, distributed routing scheme for some special classes of metacyclic graphs. However they have no proof of correctness that the scheme is a shortest path routing algorithm. In the note we give a suboptimal, deterministic routing algorithm.

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

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

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

  13. Comparing the efficiency of transport routes and corridors

    Liviu Gabriel GHIŢULEASA

    2011-03-01

    Full Text Available In the broader context of the importance granted to accessibility by the European spatial planning policies, comparing the efficiency of European and national transportation routes and corridors constitutes an issue of particular relevance for Romania. In order to resolve it, this paper proposes a methodology based on potential accessibility, determined by the total population served, and the efficiency of the path, by analogy with the least squares method. Both approaches were applied to internal and European routes.

  14. Routing and scheduling problems

    Reinhardt, Line Blander

    In today’s globalized society, transport contributes to our daily life in many different ways. The production of the parts for a shelf ready product may take place on several continents and our travel between home and work, vacation travel and business trips has increased in distance the last......, the effectiveness of the network is of importance aiming at satisfying as many costumer demands as possible at a low cost. Routing represent a path between locations such as an origin and destination for the object routed. Sometimes routing has a time dimension as well as the physical paths. This may...... 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...

  15. Route Availabililty Planning Tool -

    Department of Transportation — The Route Availability Planning Tool (RAPT) is a weather-assimilated decision support tool (DST) that supports the development and execution of departure management...

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

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

  18. 23 CFR 658.19 - Reasonable access.

    2010-04-01

    ... 23 Highways 1 2010-04-01 2010-04-01 false Reasonable access. 658.19 Section 658.19 Highways... AND WEIGHT, ROUTE DESIGNATIONS-LENGTH, WIDTH AND WEIGHT LIMITATIONS § 658.19 Reasonable access. (a) No State may enact or enforce any law denying reasonable access to vehicles with dimensions authorized...

  19. A New Route Maintenance in Dynamic Source Routing Protocol

    Shukla, Ashish

    2010-01-01

    Mobile ad-hoc network (MANET) is infrastructureless, self-organizable, multi hop packet switched network. A number of routing protocols for MANETs have been proposed in recent years. Dynamic Source Routing (DSR) protocol is one of the most popular routing protocol for ad hoc networks. This paper presents a novel method to enhance route maintenance part of DSR protocol. Our proposed route maintenance significantly increases the efficiency of the protocol at the time of route failures.

  20. Improving Reactive Ad Hoc Routing Performance by Geographic Route Length

    CAO Yuan-da; YU Yan-bing; LU Di

    2005-01-01

    In order to help reactive ad hoc routing protocols select better-performance routes, a novel metric named geographic route length (GRL) is proposed. The relationship between GRL metric and routing performance is analyzed in detail. Combined with hop metric, GRL is applied into the original ad hoc on-demand distance vector (AODV) to demonstrate its effectiveness. Simulation experiments have shown that GRL can effectively reduce packet delay and route discovery frequency, thus can improve reactive ad hoc routing performance.

  1. Cumulative Vehicle Routing Problems

    Kara, &#;mdat; Kara, Bahar Yeti&#;; Yeti&#;, M. Kadri

    2008-01-01

    This paper proposes a new objective function and corresponding formulations for the vehicle routing problem. The new cost function defined as the product of the distance of the arc and the flow on that arc. We call a vehicle routing problem with this new objective function as the Cumulative Vehicle Routing Problem (CumVRP). Integer programming formulations with O(n2) binary variables and O(n2) constraints are developed for both collection and delivery cases. We show that the CumVRP is a gener...

  2. IP Routing Protocols

    Nolasco Pinto, Armando

    2002-03-01

    Uyless Black is a widely known expert in computer networks and data communications. He is author of more than ten books in the communication technologies field, which puts him in a good position to address this topic. In IP Routing Protocols he starts by providing the background and concepts required for understanding TCP/IP technology. This is done clearly and assumes little prior knowledge of the area. As might be expected, he emphasizes the IP route discovery problem. Later he details several routing protocols.

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

  4. Routed planar networks

    David J. Aldous

    2016-04-01

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

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

  6. Routing Service Quality—Local Driver Behavior Versus Routing Services

    Ceikute, Vaida; Jensen, Christian S.

    2013-01-01

    experiments with real vehicle trajectory data and an existing online navigation service. It is found that the availability of information about previous trips enables better prediction of route travel time and makes it possible to provide the users with more popular routes than does a conventional navigation...... of the quality of one kind of location-based service, namely routing services. Specifically, the paper presents a framework that enables the comparison of the routes provided by routing services with the actual driving behaviors of local drivers. Comparisons include route length, travel time, and also route...

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

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

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

  10. Efficient Load Balancing Routing Technique for Mobile Ad Hoc Networks

    Mahdi Abdulkader Salem

    2016-05-01

    Full Text Available The mobile ad hoc network (MANET is nothing but the wireless connection of mobile nodes which provides the communication and mobility among wireless nodes without the need of any physical infrastructure or centralized devices such as access point or base station. The communication in MANET is done by routing protocols. There are different categories of routing protocols introduced with different goals and objectives for MANETs such as proactive routing protocols (e.g. DSDV, reactive routing protocols (e.g. ADOV, geographic routing protocols (e.g. GRP, hybrid routing protocols etc. There are two important research problems with such routing protocols to address such as efficient load balancing and energy efficiency. In this paper, we are focusing on evaluation and analysis of efficient load balancing protocol design for MANET. Inefficient load balancing technique results in increasing routing overhead, poor packet delivery ratio, and other Quality of Service (QoS parameters. In literature, there are a number of different methods proposed for improving the performance of routing protocols by efficient load balancing among mobile nodes communication. However, most of the methods suffer from various limitations. In this paper, we propose a novel technique for improved the QoS performance of load balancing approach as well as increasing the network lifetime. Evaluation of Network lifetime is out of scope of this paper.

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

  12. Optimizing well intervention routes

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

    2000-07-01

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

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

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

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

  16. Vehicle Routing Problem Models

    Tonči Carić

    2004-01-01

    Full Text Available The Vehicle Routing Problem cannot always be solved exactly,so that in actual application this problem is solved heuristically.The work describes the concept of several concrete VRPmodels with simplified initial conditions (all vehicles are ofequal capacity and start from a single warehouse, suitable tosolve problems in cases with up to 50 users.

  17. Fast Packet forwarding Engine Based on Software Circuits

    Makkes, M.X.; Varabanescu, A.; Laat, C. de; Meijer, R.J.

    2015-01-01

    Forwarding packets is part of the performance critical path of routing devices, and affects the network performance at any scale. This operation is typically performed by dedicated routing boxes, which are fast, but expensive and inflexible. Recent work has shown that in many cases commodity hardwar

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

  19. A Model-independent Fast Localization Algorithm of WiFi Access Point%一种传播模型无关的快速WiFi访问点定位算法

    白云; 喻莉; 谢长生; 张东华

    2013-01-01

    在一个未知环境中定位无线WiFi访问点(AP),由于传播介质的衰减参数是时变的,导致传统三点定位方法会产生较大的定位误差.但定位AP与常见的终端定位相比具有其特殊性,即信号源是单一的,因此信号源的功率变化在多个终端处可以通过差分计算消除.基于信号源定位的特殊性,研究实现了一种与传播模型参数无关的定位算法,对多个观测点的测量数据,定义了一个与无线信号传播模型无关的评价函数,从而将定位问题转换为对该评价函数的最小化问题,因此可利用已有的数值计算方法优化计算效率,最终实现基于信号强度的快速WiFi AP定位.%Localizing WiFi Access Point (AP) in an anonymous and time-varying environment, the parameters of attenuation model cannot be easily obtainable. Even though successfully obtained, these parameters may also be rapidly changed, thus fails the traditional method of triangulation based on range estimation. We use a model-independent way of localization algorithm, which is especially adapted in the situation of emitting source localization. By measuring radio signal strength (RSS) at various points, constructing an e-valuation function and minimizing it by common effective numerical approach, it is finally achieved a fast location estimation. Substantial experiments and simulations have verified the error range of this method to be highly acceptable.

  20. Route Repetition and Route Retracing: Effects of Cognitive Aging

    Jan Malte Wiener

    2012-05-01

    Full Text Available Retracing a recently traveled route is a frequent navigation task when learning novel routes or exploring unfamiliar environments. In the present study we utilized virtual environments technology to investigate age-related differences in repeating and retracing a learned route. In the training phase of the experiment participants were guided along a route consisting of multiple intersections each featuring one unique landmark. In the subsequent test phase, they were guided along short sections of the route and asked to indicate overall travel direction (repetition or retracing, the direction required to continue along the route, and the next landmark they would encounter. Results demonstrate age-related deficits in all three tasks. More specifically, in contrast to younger participants, the older participants had greater problems during route retracing than during route repetition. While route repetition can be solved with egocentric response or route strategies, successfully retracing a route requires allocentric processing. The age-related deficits in route retracing are discussed in the context of impaired allocentric processing and shifts from allocentric to egocentric navigation strategies as a consequence of age-related hippocampal degeneration.

  1. A Survey of Unipath Routing Protocols for Mobile Ad Hoc Networks

    M.Barveen Banu

    2013-12-01

    Full Text Available A MANET (Mobile Ad hoc NETwork is an interconnection of mobile devices by wireless links forming a dynamic topology without much physical network infrastructure such as routers, servers, access points/cables or centralized administration. Routing is a mechanism of exchanging data between the source node and the destination node. Several protocols are used to perform routing the information from the source node to the destination node. The main aim of this paper is to explore the working principles of each unipath routing protocol. The unipath routing protocols are divided into Table-Driven (Proactive, On-demand (Reactive, Hybrid routing protocols.

  2. FAST scan

    Müller, Anna

    FAST-skanning er en metode, der har til formål at hurtigt diagnosticere fri væske i bughulen hos traumapatienter og andre akutte patienter. Denne skanningsteknik blev først introduceret til hunde i 2004, og omfatter ultralydsskanning af specifikke punkter i bughulen, hvor der er stor chance....../sorte) områder. I dag bruges FAST-skanning meget hyppigt indenfor human og veterinær akutmedicin. Det kan ses som et værktøj for dyrlæger som ikke arbejder med ultralyd til daglig. FAST-skanning har mange fordele; proceduren er effektiv og kan tage under 3 minutter, men har alligevel høj diagnostisk værdi. Det...... nødvendigt. Det skal dog understreges, at de abdominale organer ikke undersøges specifikt. Det kan være svært at skelne mellem væske i peritonealhulen og i det retroperitoneale rum. Man kan heller ikke karakterisere væsken og derved skelne mellem f.eks. blod, pus eller urin. Siden FAST-skanning blev...

  3. Safe Trust Alert Routing in MANET

    Srikanth Meda

    2015-10-01

    Full Text Available  The main characteristic of the ad-hoc network is dynamic topology. In this, nodes modifications its position usually and these nodes have to be compelled to be compelled to adapt for the topology amendment. Nodes can amendment position quite frequently that mean the standard of the network. For quick info transmission, we'd sort of a routing protocol that adapts to topology changes. For our convenience, we've projected a fast and secure protocol that's proactive and reactive in nature. Proactive nature used for adding the node into list, as a results of it taking a short while to line the selection relating to node. And reactive nature used for locating the path for providing fast transmission.

  4. Increasingly minimal bias routing

    Bataineh, Abdulla; Court, Thomas; Roweth, Duncan

    2017-02-21

    A system and algorithm configured to generate diversity at the traffic source so that packets are uniformly distributed over all of the available paths, but to increase the likelihood of taking a minimal path with each hop the packet takes. This is achieved by configuring routing biases so as to prefer non-minimal paths at the injection point, but increasingly prefer minimal paths as the packet proceeds, referred to herein as Increasing Minimal Bias (IMB).

  5. Electronic route information panels (DRIPs).

    2008-01-01

    Also in the Netherlands, the term Dynamic Route Information Panel (DRIP) is used for an electronic route information panel. A DRIP usually indicates whether there are queues on the various routes to a particular destination and how long they are. On certain locations DRIPS also give the estimated tr

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

  7. Aerial surveys of ringed seals (Phoca hispida) on fast and pack ice in the central Beaufort Sea of Alaska, 1985-1987 and 1996-1999 (NODC Accession 0000931)

    National Oceanic and Atmospheric Administration, Department of Commerce — These datasets include counts of ringed seals (Phoca hispida) and other marine mammals made during aerial surveys of ringed seals on fast and pack ice of the...

  8. Stochastic vehicle routing with recourse

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

    2012-01-01

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

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

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

  11. Acesso venoso trans-hepático percutâneo para hemodiálise: uma alternativa para pacientes portadores de insuficiência renal crônica Percutaneous transhepatic venous access for hemodialysis: an alternative route for patients with end-stage renal failure

    Joaquim Maurício da Motta-Leal-Filho

    2010-09-01

    . OBJECTIVES: To present a small sample regarding the possibility and the functionality of transhepatic implantation of long-term catheters for hemodialysis in patients with no other possible access routes. METHODS: Retrospective observational analysis was made of the charts of six patients in which nine tunneled dialysis catheters were implanted by the percutaneous transhepatic route. Transhepatic catheters were placed in the absence of an available peripheral venous site. Patients were monitored to evaluate technical success, the complication rate, the infection rate and the duration of catheter patency. RESULTS: Four men and two women aged 31 to 85 years (mean age: 55 years. Technical success was 100%. The mean duration of catheter function was 300.5 days (range: 2 to 814 days. Means of primary and secondary patency were 179.60 and 328.33 days, respectively. The catheter thrombosis rate was 0.05 per 100 catheter-days as the infection rate. There were three early complications (within the first 30 days of catheter implantation: two catheter displacement and one infection. Two late complications were observed: one thrombosis and one migration. Three patients (50% needed to have their catheters changed. The 30-day mortality rate was 33% but with no relation to the procedure. CONCLUSION: It may be suggested that this technique is safe, however transhepatic hemodialysis catheters may be used in patients with no other options for deep venous access for hemodialysis, albeit as a last resort access route.

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

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

  14. Instability Free Routing: Beyond One Protocol Instance

    2008-12-01

    assigned a Rout- ing Information Base (RIB) [13]. This database is used to store the routing information related to the routing process (e.g., routes...presents routing anomalies that can derive from route selection by itself, i.e., without any route redis - tribution configured between the routing... redis - tributed into the RIP protocol, all RIP messages received from the neighbors are in fact discarded independently of the AD values. This

  15. New Routing Metrics for ADHOC Network Routing Protocols

    Reddy, P. C.

    2014-12-01

    The performance and reliability of Internet is measured using different quantities. When the quantities measured are essential and have wide range of acceptance then they are called metrics. Performance metrics enable comparison and selection among the alternatives. In computer networks, metrics are used to evaluate an application, protocol etc. Routing in adhoc networks is nontrivial. Routing protocols for adhoc networks are still evolving and there is need for continuous evaluation of them. In the literature existing, several routing protocols are evaluated using standard metrics under different conditions. This paper proposes new metrics for evaluation of routing protocols and uses them to evaluate the adhoc network routing protocols AODV, DSR, DSDV and TORA. Simulation environment is created using NS-2 simulator. Typical range of speeds, pause times and data rates are used. The results provide new insights in to the working of the routing protocols.

  16. A Study on Selecting the Shortest Routes by Voronoi Diagram in Route Networks of GIS

    2000-01-01

    The problems of fast determining shortest paths through a polygonal subdivisionplanar with n vertices are considered in GIS. Distances are measured according to an Euclideanmetric. A geographical information system (GIS)has a collection of nearest neighborhoodoperations and this collection serves as a useful toolbox for spatial analysis. These operationsare undertaken through the Voronoi diagrams. This paper presents a novel algorithm thatconstructs a “shortest route set” with respect to a given source point and a target point byVoronoi diagrams. It will help to improve the efficiency of traditional algorithms, e. g. , Djkstraalgorithm, on selecting the shortest routes. Moreover, the novel algorithm can check theconnectivity in a complex network between the source point and target one.

  17. Evaluation of Integrated Routing/MAC Solutions for the Diffusion of Warning Messages in VANETs

    Luca Campelli

    2007-12-01

    Full Text Available The efficiency of routing protocols in general mobile ad hoc networks may be highly affected by the specific Medium Access Control scheme the routing relies upon and by the mobility of the wireless nodes. In this work, we address the design of position based routing solutions for the support of safety oriented applications in Vehicular Ad hoc NETworks (VANETs by focusing on the impact of the MAC layer on the performances of the routing strategies. Namely, we propose a simulation analysis in highway scenarios to assess the routing performance in the two cases where standard IEEE 802.11 technology and a dynamic TDMA scheme are adopted at layer 2 respectively. We discuss on the dimensioning of the routing parameters in both cases and we provide a comparative analysis of the two MAC/routing integrated solutions.

  18. Degree 3 Networks Topological Routing

    Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Pedersen, Jens Myrup;

    2009-01-01

    Topological routing is a table free alternative to traditional routing methods. It is specially well suited for organized network interconnection schemes. Topological routing algorithms correspond to the type O(1), constant complexity, being very attractive for large scale networks. It has been...... proposed for many topologies and this work compares the algorithms for three degree three topologies using a more analytical approach than previous studies....

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

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

  1. Alternative routes of insulin delivery.

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

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

  3. QoS-aware multicast routing protocol for Ad hoc networks

    Sun Baolin; Li Layuan

    2006-01-01

    Ad hoc wireless networks consist of mobile nodes interconnected by multihop communication paths. Unlike conventional wireless networks, ad hoc networks have no fixed network infrastructure or administrative support. Due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service (QoS) is an inherently complex, difficult issue and very important research issue. MAODV (Multicast Ad hoc Ondemand Distance Vector) routing protocol provides fast and efficient route establishment between mobile nodes that need to communicate with each other. MAODV has minimal control overhead and route acquisition latency. In addition to unicast routing, MAODV supports multicast and broadcast as well.The multicast routing problem with multiple QoS constraints, which may deal with the delay, bandwidth and packet loss measurements is discussed, and a network model for researching the ad hoc network QoS multicast routing problem is described. It presents a complete solution for QoS multicast routing based on an extension of the MAODV routing protocol that deals with delay, bandwidth and packet loss measurements. The solution is based on lower layer specifics. Simulation results show that, with the proposed QoS multicast routing protocol, end-to-end delay, bandwidth and packet loss on a route can be improved in most of cases. It is an available approach to multicast routing decision with multiple QoS constraints.

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

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

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

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

  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…

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

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

  11. An enzymatic route to selenazolines.

    Koehnke, Jesko; Morawitz, Falk; Bent, Andrew F; Houssen, Wael E; Shirran, Sally L; Fuszard, Matthew A; Smellie, Iain A; Botting, Catherine H; Smith, Margaret C M; Jaspars, Marcel; Naismith, James H

    2013-03-18

    Ringing the changes: Selenazolines have applications in medicinal chemistry, but their synthesis is challenging. We report a new convenient and less toxic route to these heterocycles that starts from commercially available selenocysteine. The new route depends on a heterocyclase enzyme that creates oxazolines and thiazolines from serines/threonines and cysteines.

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

    Westerbeek, Hans; Maes, Alfons

    2013-01-01

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

  13. QUANTIFIED COST-BALANCED ROUTING SCHEME FOR OVERLAY MULTICAST

    Lu Jun; Ruan Qiuqi

    2006-01-01

    This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme (QCost-Balanced) to the metric tradeoff problem between overlay path delay and access bandwidth at Multicast Server Nodes (MSN) for real-time applications over Internet. Besides implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, QCost-Balanced tradeoffs these two metrics by a unified tradeoff metric based on quantitative analysis. Simulation experiments demonstrate that the scheme achieves a better tradeoff gain in both two metrics, and effective performance in metric quantitative control.

  14. Stochastic Vehicle Routing with Recourse

    Goertz, Inge Li; Saket, Rishi

    2012-01-01

    We study the classic Vehicle Routing Problem in the setting of stochastic optimization with recourse. StochVRP is a two-stage optimization 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 lambda. We present an O(log^2 n log(n lambda))-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 orienteering, called knapsack rank-function orienteering. We also give a better approximation ratio for knapsack rank-function orienteering than what follows from prior work. Finally, we provide a Unique Games Conjecture based omega(1) hardness of approximation for StochVRP, even on star-like metrics on which our algorithm achieves a logarithmic approximation.

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

  16. Social dilemma structure hidden behind traffic flow with route selection

    Tanimoto, Jun; Nakamura, Kousuke

    2016-10-01

    Several traffic flows contain social dilemma structures. Herein, we explored a route-selection problem using a cellular automaton simulation dovetailed with evolutionary game theory. In our model, two classes of driver-agents coexist: D agents (defective strategy), which refer to traffic information for route selection to move fast, and C agents (cooperative strategy), which are insensitive to information and less inclined to move fast. Although no evidence suggests that the social dilemma structure in low density causes vehicles to move freely and that in high density causes traffic jams, we found a structure that corresponds to an n-person (multiplayer) Chicken (n-Chicken) game if the provided traffic information is inappropriate. If appropriate traffic information is given to the agents, the n-Chicken game can be solved. The information delivered to vehicles is crucial for easing the social dilemma due to urban traffic congestion when developing technologies to support the intelligent transportation system (ITS).

  17. Fast-Food Environments and Family Fast-Food Intake in Nonmetropolitan Areas

    Longacre, Meghan R.; Drake, Keith M.; MacKenzie, Todd A.; Gibson, Lucinda; Owens, Peter; Titus, Linda J.; Beach, Michael L.; Dalton, Madeline A.

    2012-01-01

    Background Little is known about the influence of in-town fast-food availability on family-level fast-food intake in nonmetropolitan areas. Purpose The purpose of the current study was to determine whether the presence of chain fast-food outlets was associated with fast-food intake among adolescents and parents, and to assess whether this relationship was moderated by family access to motor vehicles. Methods Telephone surveys were conducted with 1547 adolescent–parent dyads in 32 New Hampshire and Vermont communities between 2007 and 2008. Fast-food intake in the past week was measured through self-report. In-town fast-food outlets were located and enumerated using an onsite audit. Family motor vehicle access was categorized based on the number of vehicles per licensed drivers in the household. Poisson regression was used to determine unadjusted and adjusted risk ratios (RRs). Analyses were conducted in 2011. Results About half (52.1%) of adolescents and 34.7% of parents consumed fast food at least once in the past week. Adolescents and parents who lived in towns with five or more fast-food outlets were about 30% more likely to eat fast food compared to those in towns with no fast-food outlets, even after adjusting for individual, family, and town characteristics (RR=1.29, 95% CI= 1.10, 1.51; RR=1.32, 95% CI=1.07,1.62, respectively). Interaction models demonstrated that the influence of in-town fast-food outlets on fast-food intake was strongest among families with low motor vehicle access. Conclusions In nonmetropolitan areas, household transportation should be considered as an important moderator of the relationship between in-town fast-food outlets and family intake. PMID:22608373

  18. Dynamic Routing of Short Transfer Baggage

    Clausen, Tommy; Pisinger, David

    of dispatch. Computational results are presented for real-life passenger data with stochastic bag arrival times and travel times. The results indicate that the algorithm is able to dispatch the baggage considerably better than the manual delivery plans reported in the case study, and due to its fast running...... times, the algorithm is suitable for dynamic dispatching. Investigations on the impact of uncertainty and fleet size make it possible to support a trade-off between fleet size and expected service level.......We consider a variant of the Vehicle Routing Problem that arises in airports when transporting baggage for passengers with connecting flights. Each bag can be delivered in two locations with disjunctive time windows. The task is to define multiple trips for the vehicles in order to deliver bags...

  19. [Preliminary study on identification of heroin from different route with clustering analysis by fourier transform infrared spectroscopy].

    Cai, Xi-lan; Wu, Guo-ping

    2007-12-01

    In the present paper, using Fourier transform infrared (FTIR) absorption spectrometry, the characteristic peaks of fingerprint infrared spectra of heroin samples from different routes were identified with clustering analysis successfully. It is a very fast, simple and reliable method. That is to say, a new method for the discrimination of heroin seizured from different routes is provided.

  20. A Study on Spatial Reconstruction Routes and Patterns of Rural Residential Areas in Fast Urbanization Regions--- An Empirical Study of Changshou District,Chongqing City%城镇化快速发展区域农村居民点空间重构路径及模式研究--重庆市长寿区实证

    杨庆媛; 潘菲; 李元庆

    2015-01-01

    Population mobility and accelerating reorganization of key economic elements in rapid urbaniza‐tion regions lead to fast transformation of rural spaces ,and this situation results in the problems of the hollowing of rural residential areas and the weakening of their core functions ,which needs to be solved by innovative ideas .Based on an analysis of the current rural residential areas in the process of rapid urbaniza‐tion ,plus the surveying data on agricultural households in Changshou District ,Chongqing ,this paper dis‐cusses the routes of spatial reconstruction of rural residential areas from three aspects :the systemic struc‐ture of rural residential areas ,land‐use structure and industrial structure .The research shows that a hier‐archical system called “central town‐ordinary town‐central village‐basic village” can be shaped according to the rank‐size of villages and small towns in Changshou District ;that according to the migration patterns and the demand for land development in rural residential areas ,clustering settlements are to be constructed for the sake of land‐use intensity ;that as the reconstruction of industrial structure has a significant influ‐ence on the reconstruction of rural residential areas ,a reasonable industrial layout should be shaped based mainly on four industrial types :integrated type ,industry‐and‐trade type ,agriculture‐and‐trade type ,and tourism type ;and that there are four patterns of spatial reconstruction in rural residential areas ,i.e. “ur‐baniz ation‐guided” promoted by urbanization and industralization development ,“internal‐transformation‐al” and “central‐village integrating” promoted by industrial development ,as well as “ecological‐migrating”promoted by government guidance.%在对重庆市长寿区农村居民点现状特点进行分析基础上,从农村居民点体系结构、用地结构和产业结构3个方面的重组入手,探讨农村居民

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

  2. Port Authority of Allegheny County Transit Routes

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

  3. Pheromone based alternative route planning

    Liangbing Feng

    2016-08-01

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

  4. Millimeter Wave Alternate Route Study.

    1981-04-01

    A0-AI02 303 HARRIS CORP MELBOURNE FL GOVERNMENT COMMUNICATION ST--ETC FIG 17/2.1 MILLIMETER WAVE ALENT ROUTE STUDT.(U) APR W C ADAMS J J PAN, W C...481-487. 4-7 abm ADAOO0 303 HARRIS CORP MELBOURNE FL GOVERNMENT COMMUNICATION S -ETC F/G 17/2.1 MILLIMETER WAVE ALTERNATE ROUTE STUDY.(U) APR 81 W C...7-21L’j r AD-A102 303 HARRIS CORP MELBOURNE FL GOVERNMENT COMMUNICATION ST--ETC F/A 17/2.1 MILLIMETER WAVE ALTERNATE ROUTE STUDY(U) APR 81 W C ADAMS

  5. Electric Vehicle Green Routing with Possible En-Route Recharging

    BAOUCHE, Fouad; BILLOT, Romain; Trigui, Rochdi; EL FAOUZI, Nour Eddin

    2014-01-01

    The deployment of Electric Vehicles (EVs) is constrained mainly by the restricted autonomy, the lack of charging stations, the battery recharge time and recuperation capability (e.g. braking phases or downhill). In this study we aim to develop a green routing tool to encourage the use of EV. To overcome the autonomy limitation we propose a methodology for the EV that includes a charging stations location model, an energy graph construction for EV routing and a resolution scheme for the routin...

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

  7. Reverse flood routing with the inverted Muskingum storage routing scheme

    A. D. Koussis

    2012-01-01

    Full Text Available This work treats reverse flood routing aiming at signal identification: inflows are inferred from observed outflows by orienting the Muskingum scheme against the wave propagation direction. Routing against the wave propagation is an ill-posed, inverse problem (small errors amplify, leading to large spurious responses; therefore, the reverse solution must be smoothness-constrained towards stability and uniqueness (regularised. Theoretical constrains on the coefficients of the reverse routing scheme assist in error control, but optimal grids are derived by numerical experimentation. Exact solutions of the convection-diffusion equation, for a single and a composite wave, are reverse-routed and in both instances the wave is backtracked well for a range of grid parameters. In the arduous test of a square pulse, the result is comparable to those of more complex methods. Seeding outflow data with random errors enhances instability; to cope with the spurious oscillations, the reversed solution is conditioned by smoothing via low-pass filtering or optimisation. Good-quality inflow hydrographs are recovered with either smoothing treatment, yet the computationally demanding optimisation is superior. Finally, the reverse Muskingum routing method is compared to a reverse-solution method of the St. Venant equations of flood wave motion and is found to perform equally well, at a fraction of the computing effort. This study leads us to conclude that the efficiently attained good inflow identification rests on the simplicity of the Muskingum reverse routing scheme that endows it with numerical robustness.

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

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

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

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

  12. Topological Routing in Large-Scale Networks

    Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

    2004-01-01

    A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues in applying...... Topological Routing to large-scale networks are discussed. Hierarchical extensions are presented along with schemes for shortest path routing, fault handling and path restoration. Further reserach in the area is discussed and perspectives on the prerequisites for practical deployment of Topological Routing...

  13. Topological Routing in Large-Scale Networks

    Pedersen, Jens Myrup; Knudsen, Thomas Phillip; Madsen, Ole Brun

    A new routing scheme, Topological Routing, for large-scale networks is proposed. It allows for efficient routing without large routing tables as known from traditional routing schemes. It presupposes a certain level of order in the networks, known from Structural QoS. The main issues in applying...... Topological Routing to large-scale networks are discussed. Hierarchical extensions are presented along with schemes for shortest path routing, fault handling and path restoration. Further reserach in the area is discussed and perspectives on the prerequisites for practical deployment of Topological Routing...

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

  15. Route Optimization in Network Mobility

    Md. Hasan Tareque

    2013-01-01

    Full Text Available NEtwork MObility (NEMO controls mobility of a number of mobile nodes in a comprehensive way using one or more mobile routers. To choose a route optimization scheme, it is very important to have a quantitative comparison of the available route optimization schemes. The focus of this paper is to analyze the degree of Route Optimization (RO, deploy-ability and type of RO supported by each class in general. The comparison shows the differences among the schemes in terms of issues, such as additional header, signaling and memory requirement. We classify the schemes established on the basic method for route optimization, and equal the schemes based on protocol overhead, such as header overhead, amount of signaling, and memory requirements. Lastly the performance of the classes of different schemes has to be estimated under norms such as available bandwidth, topology of the mobile network and mobility type.

  16. Local Routing in Convex Subdivisions

    Bose, Prosenjit; Durocher, Stephane; Mondal, Debajyoti;

    2015-01-01

    In various wireless networking settings, node locations determine a network’s topology, allowing the network to be modelled by a geometric graph drawn in the plane. Without any additional information, local geometric routing algorithms can guarantee delivery to the target node only in restricted...... classes of geometric graphs, such as triangulations. In order to guarantee delivery on more general classes of geometric graphs (e.g., convex subdivisions or planar subdivisions), previous local geometric routing algorithms required Θ(logn) state bits to be stored and passed with the message. We present...... the first local geometric routing algorithm using only one state bit to guarantee delivery on convex subdivisions and the first local geometric memoryless routing algorithm that guarantees delivery on edge-augmented monotone subdivisions (including all convex subdivisions) when the algorithm has knowledge...

  17. An Effect of Route Caching Scheme in DSR for Vehicular Adhoc Networks

    Poonam kori

    2012-01-01

    Full Text Available Routing is one of the most significant challenges in Vehicular ad hoc networks and is critical for the basic network operations. Nodes (vehicles in a Vehicular ad hoc network are allowed to move in anuncontrolled manner. Such node mobility results in a highly dynamic network with rapid topological changes. Caching the routing information can significantly improve the efficiency of routing mechanism in a wireless ad hoc network by reducing the access latency and bandwidth usage. Our work presents an analysis of the effects of route cache for this caching in on-demand routing protocols in Vehicular ad hoc networks. Our analysis is based on the Dynamic Source Routing protocol (DSR, which operates entirely on-demand. Using detailed simulations of Vehicular ad hoc networks, we studied a caching algorithm that utilize cache size as a design choice, and simulated each cache primarily over different movement scenarios drawn from various mobility models. We also evaluated a set of mobility metrics that allow accurate characterization of the relative difficulty that a given movement scenario presents to a Vehicularad hoc network routing protocol, and we analyze each mobility metric’s ability to predict the actual difficulty in terms of routing overhead and packet delivery ratio experienced by the routing protocolacross the highway and city traffic scenarios in our study. Finally we have shown that caching the routing data is beneficial.

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

  19. Evaluation of Crosstalk Attacks in Access Networks

    Wagner, Christoph; Eiselt, Michael; Grobe, Klaus

    2016-01-01

    WDM-PON systems regained interest as low-cost solution for metro and access networks. We present a comparative analysis of resilience of wavelength-selective and wavelength-routed architectures against crosstalk attackers. We compare the vulnerability of these architectures against attacks...

  20. Reverse flood routing with the inverted Muskingum storage routing scheme

    Koussis, A. D.; Mazi, K.; Lykoudis, S.; Argyriou, A.

    2010-09-01

    Motivation On occasion, flood related questions are posed in the reverse from the conventional sense, e.g.: Which inflow created the flow observed at cross-section X, or the flood profile observed along reach Y? This is a signal identification type problem (hydrologic forensics). A related question concerns the operation of a reservoir, via optimal outflow control, so as to minimise downstream flood damage. Solution of the aforementioned problems requires routing of floods in the upstream direction. This is an inverse problem, and as such it is not well posed. In routing against the wave propagation, small errors in the flow measurements, or rounding errors, are amplified leading to instability, i.e., to spurious, large changes in the response (inflow hydrograph). Therefore, for the reverse solution to be stable it must be constrained by a smoothness condition; this however does not ensure its uniqueness. Storage routing models as approximate diffusion wave models By appropriate choice of their parameter values, storage routing models approximate closely diffusion-wave (DW) behaviour, if dominant flood propagation mode is that of kinematic waves (KW), which is very often true. We solve the flood signal identification problem by reversing the Muskingum routing scheme. The Muskingum routing scheme derives from a first-order accurate FD discretisation of the KW equation yet yields second-order accurate DW solutions by matching the numerical diffusion coefficient of that KW equation solution scheme to the DW equation’s hydraulic diffusion coefficient. Formulation and testing of a reverse routing scheme based on Muskingum routing Theoretical analysis of the reversed Muskingum routing scheme yields nominal grid design rules; however, we study optimal grid design mainly by numerical experimentation. First, we reverse an exact outflow hydrograph (a single-wave solution of the convection-diffusion equation), and then demonstrate the scheme’s ability to reverse

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

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

  3. Hemodialysis access - self care

    Kidney failure - chronic-hemodialysis access; Renal failure - chronic-hemodialysis access; Chronic renal insufficiency - hemodialysis access; Chronic kidney failure - hemodialysis access; Chronic renal failure - ...

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

  5. A SURVEY ON PROTOCOLS & ATTACKS IN MANET ROUTING

    Meenakshi; Rishabh Jain; Charul Deewan

    2012-01-01

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

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

  7. Using Correspondent Information for Route Optimization Scheme on Proxy Mobile IPv6

    Young-Hyun Choi

    2010-08-01

    Full Text Available Proxy Mobile IPv6 outperforms previous mobilityprotocols have been standardized by the InternetEngineering Task Force. However, Proxy Mobile IPv6 stillinvolves the triangle routing problem in where data packetsfor the mobile node are delivered throughout inefficientrouting paths. To address the triangle routing problem, twodifferent Route Optimization schemes proposed that excludethe inefficient routing paths by creating the shortest routingpath. In this paper, we proposed Correspondent InformationRoute Optimization scheme solves the problem by inefficientsignaling cost of Dutta’s route optimization. Using CorrespondentInformation for Correspondent binding updatesprocess between the mobile access gateways which arecaused by bi-path data communication of the mobile entitiesof different the mobile access gateway on the same localmobility anchor. The results of signaling cost performanceevaluation show that performance of our proposed usingcorrespondent information route optimization scheme isbetter than Liebsch’s route optimization scheme as 45%for mobility of the data packets sender and Dutta’s routeoptimization scheme as 20% for mobility of the data packetssender.

  8. Dynamic Routing in Translucent WDM Optical Networks: The Intradomain Case

    Yang, Xi; Ramamurthy, Byrav

    2005-03-01

    Translucent wavelength-division multiplexing optical networks use sparse placement of regenerators to overcome physical impairments and wavelength contention introduced by fully transparent networks, and achieve a performance close to fully opaque networks at a much less cost. In previous studies, we addressed the placement of regenerators based on static schemes,allowing for only a limited number of regenerators at fixed locations. This paper furthers those studies by proposing a dynamic resource allocation and dynamic routing scheme to operate translucent networks. This scheme is realized through dynamically sharing regeneration resources, including transmitters,receivers, and electronic interfaces, between regeneration and access functions under a multidomain hierarchical translucent network model. An intradomain routing algorithm, which takes into consideration optical-layer constraints as well as dynamic allocation of regeneration resources, is developed to address the problem of translucent dynamic routing in a single routing domain. Network performance in terms of blocking probability, resource utilization, and running times under different resource allocation and routing schemes is measured through simulation experiments.

  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. Adaptive search techniques for problems in vehicle routing, part II: A numerical comparison

    Kritzinger Stefanie

    2015-01-01

    Full Text Available Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems. In this first part of the survey, we present an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing.

  11. Adaptive search techniques for problems in vehicle routing, part I: A survey

    Kritzinger Stefanie

    2015-01-01

    Full Text Available Research in the field of vehicle routing often focused on finding new ideas and concepts in the development of fast and efficient algorithms for an improved solution process. Early studies introduce static tailor-made strategies, but trends show that algorithms with generic adaptive policies - which emerged in the past years - are more efficient to solve complex vehicle routing problems. In this first part of the survey, we present an overview of recent literature dealing with adaptive or guided search techniques for problems in vehicle routing.

  12. Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP)

    2005-01-01

    This research studies a new class of dynamic problem MTVRP where n vehicles are routed in real time in a fast varying environment to pickup and deliver m passengers when both n and m are big. The problem is very relevant to future transportation options involving large scale real-time routing of shared-ride fleet transit vehicles. Traditionally, dynamic routing solutions were found as static approximations for smaller-scale problems or using local heuristics for the larger-scale ones. General...

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

  14. Vehicle Routing With User Generated Trajectory Data

    Ceikute, Vaida; Jensen, Christian S.

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

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

    2011-01-01

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

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

  17. The Consistent Vehicle Routing Problem

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2009-01-01

    In the small package shipping industry (as in other industries), companies try to differentiate themselves by providing high levels of customer service. This can be accomplished in several ways, including online tracking of packages, ensuring on-time delivery, and offering residential pickups. Some companies want their drivers to develop relationships with customers on a route and have the same drivers visit the same customers at roughly the same time on each day that the customers need service. These service requirements, together with traditional constraints on vehicle capacity and route length, define a variant of the classical capacitated vehicle routing problem, which we call the consistent VRP (ConVRP). In this paper, we formulate the problem as a mixed-integer program and develop an algorithm to solve the ConVRP that is based on the record-to-record travel algorithm. We compare the performance of our algorithm to the optimal mixed-integer program solutions for a set of small problems and then apply our algorithm to five simulated data sets with 1,000 customers and a real-world data set with more than 3,700 customers. We provide a technique for generating ConVRP benchmark problems from vehicle routing problem instances given in the literature and provide our solutions to these instances. The solutions produced by our algorithm on all problems do a very good job of meeting customer service objectives with routes that have a low total travel time.

  18. Qos Failover Routing In Tethernet

    Ankita Goswami

    2015-07-01

    Full Text Available Abstarct Tethering is a concept of sharing of internet of a device with other devices. Its a low-cost short-distance wireless technology which employs the frequency hopping practice in the globally available ISM band to keep away from interference. In the tethering to form a network there is a concept of piconet containing master and slaves. These piconets are connected together to establish a big network called scatternet. There are several aspects on which scatternet working depends like the piconets numbers and bridges the bridge role etc. Already established routes consume much more energy for the maintenance hence instead of this routes can be created on-demand. Thus consumption can be altered and routes flexibility will inclined. Failover is an another concept that I have included. Its about transferring ones control to the other device whenever first device is failed. In this thesis I have proposed a QoS failover routing that will proficiently form the routes with the QoS desires and will prevent the stoppage of transmission if the transmitting node fails. It will pass its control to another node and allow it to transmit instead of it.

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

  20. Optimization of OSPF Routing in IP Networks

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

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

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

  2. Enhanced Model for Fast Ignition

    Mason, Rodney J. [Research Applications Corporation, Los Alamos, NM (United States)

    2010-10-12

    Laser Fusion is a prime candidate for alternate energy production, capable of serving a major portion of the nation's energy needs, once fusion fuel can be readily ignited. Fast Ignition may well speed achievement of this goal, by reducing net demands on laser pulse energy and timing precision. However, Fast Ignition has presented a major challenge to modeling. This project has enhanced the computer code ePLAS for the simulation of the many specialized phenomena, which arise with Fast Ignition. The improved code has helped researchers to understand better the consequences of laser absorption, energy transport, and laser target hydrodynamics. ePLAS uses efficient implicit methods to acquire solutions for the electromagnetic fields that govern the accelerations of electrons and ions in targets. In many cases, the code implements fluid modeling for these components. These combined features, "implicitness and fluid modeling," can greatly facilitate calculations, permitting the rapid scoping and evaluation of experiments. ePLAS can be used on PCs, Macs and Linux machines, providing researchers and students with rapid results. This project has improved the treatment of electromagnetics, hydrodynamics, and atomic physics in the code. It has simplified output graphics, and provided new input that avoids the need for source code access by users. The improved code can now aid university, business and national laboratory users in pursuit of an early path to success with Fast Ignition.

  3. ATLAS FTK: The Fast Tracker

    T, Iizawa; The ATLAS collaboration

    2014-01-01

    The Fast TracKer (FTK) will perform global track reconstruction after each Level-1 trigger accept to enable the software-based High Level Trigger to have early access to tracking information. FTK is a dedicated processor based on a mixture of advanced technologies. Modern, powerful Field Programmable Gate Arrays (FPGAs) form an important part of the system architecture, and the large level of computing power required for pattern recognition is provided by incorporating standard-cell ASICs named Associative Memory (AM). FTK provides global track reconstruction in the full inner silicon detector in approximately 100 microseconds with resolution comparable to the offline algorithms. It allows a fast and precise detection of the primary and secondary vertex information. The track and vertex information is then used by the High Level Trigger algorithms, allowing highly improved trigger performance for the important signatures such as b-jets. In this paper, the architecture and the hardware development status of FT...

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

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

  6. Routing Algorithm Exploits Spatial Relations

    Okino, Clayton; Jennings, Esther

    2004-01-01

    A recently developed routing algorithm for broadcasting in an ad hoc wireless communication network takes account of, and exploits, the spatial relationships among the locations of nodes, in addition to transmission power levels and distances between the nodes. In contrast, most prior algorithms for discovering routes through ad hoc networks rely heavily on transmission power levels and utilize limited graph-topology techniques that do not involve consideration of the aforesaid spatial relationships. The present algorithm extracts the relevant spatial-relationship information by use of a construct denoted the relative-neighborhood graph (RNG).

  7. le programme SET-Routes

    CERN Audiovisual Service

    2009-01-01

    Les routes de la science sont plus escarpées pour les femmes Le programme SET-Routes, qui visait à sensibiliser les jeunes filles à l’intérêt des carrières scientifiques, a pris fin en avril. Porté par l’EMBL, l’EMBO et le CERN, il a mis en place un réseau de femmes scientifiques, des ambassadrices qui se sont rendues dans les établissements scolaires européens pour parler de leur parcours scientifique.

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

  9. Performance Evaluation of Unicast and Broadcast Mobile Ad hoc Network Routing Protocols

    Debnath, Sumon Kumar; Islam, Nayeema

    2010-01-01

    Efficient routing mechanism is a challenging issue for group oriented computing in Mobile Ad Hoc Networks (MANETs). The ability of MANETs to support adequate Quality of Service (QoS) for group communication is limited by the ability of the underlying ad-hoc routing protocols to provide consistent behavior despite the dynamic properties of mobile computing devices. In MANET QoS requirements can be quantified in terms of Packet Delivery Ratio (PDR), Data Latency, Packet Loss Probability, Routing Overhead, Medium Access Control (MAC) Overhead and Data Throughput etc. This paper presents an in depth study of one to many and many to many communications in MANETs and provides a comparative performance evaluation of unicast and broadcast routing protocols. Dynamic Source Routing protocol (DSR) is used as unicast protocol and BCAST is used to represent broadcast protocol. The performance differentials are analyzed using ns2 network simulator varying multicast group size (number of data senders and data receivers). Bo...

  10. ATLAS FTK Fast Track Trigger

    Iizawa, T; The ATLAS collaboration

    2014-01-01

    The Fast TracKer (FTK) will perform global track reconstruction after each Level-1 trigger accept signal to enable the software-based higher level trigger to have early access to tracking information. FTK is a dedicated processor based on a mixture of advanced technologies. Modern, powerful Field Programmable Gate Arrays (FPGAs) form an important part of the system architecture, and the large level of computing power required for pattern recognition is provided by incorporating standard-cell ASICs named Associative Memory (AM). Motivation and the architecture of the FTK system will be presented, and the status of hardware and simulation will be following.

  11. Quantitative analysis of access strategies to remoteinformation in network services

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

    2006-01-01

    Remote access to dynamically changing information elements is a required functionality for various network services, including routing and instances of context-sensitive networking. Three fundamentally different strategies for such access are investigated in this paper: (1) a reactive approach......, network delay characterization) and specific requirements on mismatch probability, traffic overhead, and access delay. Finally, the analysis is applied to the use-case of context-sensitive service discovery....

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

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

  14. Fast setup time characterization of static random access memory based on search-delay%基于时延搜索的SRAM建立时间快速提取方法

    黄雪维; 张培勇; 吕冬明; 郑丹丹; 严晓浪

    2011-01-01

    The amount of embedded memory in system-on-chip designs has been increasing rapidly, which demands faster and more accurate characterization of static random access memory (SRAM) setup time.Traditional approach (search based for setup time, sbSetup) affects the time to market since the simulation consumes too much time.A novel methodology was proposed to characterize setup time for SRAM-sdbSetup(search-delay-based-setup-time).The methodology analyzes and extractes partial circuits that have great impact on setup time for simulation instead of the traditional entire circuit topology simulation approach, thereby determines more precise timing window for dichotomizing characterization of setup time based on the path delay calculation methodology.Moreover, this work characterized the setup time for SRAM, aside from an accurate setup time, sdbSetup also improves run-time 60 times comparing with the traditional approach.%片上系统包含的嵌入式存储器数量在迅速增加,这需要高速的提取静态随机存储器(SRAM)时序的方法.传统的SRAM建立时间提取方法(search based for setup time,sbSetup)耗时过大,严重影响了定制电路SRAM的设计周期.针对该问题提出一种基于时延搜索的SRAM建立时间快速提取方法(search delay based for setup time,sdbSetup)+该方法通过仿真影响建立时间的局部电路,并利用基于路径延时方法(delay based for setup time,dbSetup)来确定比较精确的时间窗,再运用二分迭代法来提取建立时间.该方法从减少仿真电路的规模和确定精确的时间窗两个方面来优化提取时间.仿真实验表明:与sbSetup方法相比,sdbSetup方法不仅能提供准确的建立时间,而且提取速度平均提高了60倍.

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

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

  17. Genetic algorithms for route discovery.

    Gelenbe, Erol; Liu, Peixiang; Lainé, Jeremy

    2006-12-01

    Packet routing in networks requires knowledge about available paths, which can be either acquired dynamically while the traffic is being forwarded, or statically (in advance) based on prior information of a network's topology. This paper describes an experimental investigation of path discovery using genetic algorithms (GAs). We start with the quality-of-service (QoS)-driven routing protocol called "cognitive packet network" (CPN), which uses smart packets (SPs) to dynamically select routes in a distributed autonomic manner based on a user's QoS requirements. We extend it by introducing a GA at the source routers, which modifies and filters the paths discovered by the CPN. The GA can combine the paths that were previously discovered to create new untested but valid source-to-destination paths, which are then selected on the basis of their "fitness." We present an implementation of this approach, where the GA runs in background mode so as not to overload the ingress routers. Measurements conducted on a network test bed indicate that when the background-traffic load of the network is light to medium, the GA can result in improved QoS. When the background-traffic load is high, it appears that the use of the GA may be detrimental to the QoS experienced by users as compared to CPN routing because the GA uses less timely state information in its decision making.

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

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

  20. Arctic Routes to Fabled Lands

    Spies, Marijke

    1997-01-01

    Four hundred years ago Willem Barents set sail with two ships for the north via the Pole. Apart from this expedition, numerous other attempts were made by Dutch and Flemish mariners to find a northern trade route to China and Cathay. In this book, Marijke Spies relates the story of Olivier Brunel, t

  1. Naval Battleforce Networks Composite Routing

    2007-11-02

    fashion by DHCP), restarts or recontigures the OSPi" daemon, starts advertising the attached subnet in its new wireless subnet, and data transfer starts...Policy Manager. studying extcnsions to PlM or source specific multicast pro,i,,.:als to enable dynamic policy based routing based on DS(’P or other

  2. How to choose the route.

    Grecu, Irina

    2013-01-01

    Choosing the route for nutrition support delivery is one of the main steps in the algorithm of providing successful nutrition to the critically ill, but it is certainly not an easy process. The rationale should be guided not only by principles like physiology and benefit versus harm, but also by individual patient factors like feasibility, contraindications, predicted versus actual tolerance, and (most important) the timing for starting food delivery. Although oral nutrition is the more physiological route for feeding, it is seldom possible or sufficient in critically ill patients. Enteral nutrition, in the form of tube feeding, remains the best option in the absence of absolute contraindications, but many other factors should be taken into account. These include the importance of starting early and trying to achieve target nutrients delivery early, especially in previously undernourished or in most severely ill patients, as well as the gastrointestinal intolerance present in the majority of critically ill patients. Parenteral nutrition is an alternative route for nutrition delivery when the enteral one is impossible or insufficient. The most common complication when choosing this route is overfeeding, which has been associated with increased complications rate. On the other hand, the most common complication of enteral nutrition is underfeeding, which has also been associated with worse outcome and even increased mortality. Combining enteral with supplemental parenteral nutrition is therefore a rational approach for providing early and adequate nutritional support in the most severely ill patients.

  3. Vehicle Routing with Uncertain Demand

    R. Spliet (Remy)

    2013-01-01

    textabstractIn distribution networks a supplier transports goods from a distribution center to customers by means of vehicles with limited capacity. Drivers will drive routes on which they visit multiple customers to make deliveries. Typically, deliveries are made regularly and a fixed schedule is m

  4. Routing Protocols to Minimize the Number of Route Disconnections for Communication in Mobile Ad Hoc Networks

    2009-09-01

    Routing Protocol MAODV [5] is the multicast extension of the well-known Ad hoc On-demand Distance Vector ( AODV ...extensions of the Dynamic Source Routing (DSR) protocol [4] or the Ad hoc On-demand Distance Vector ( AODV ) routing protocol [5]. The multi-path routing ...Multi-path Distance Vector (AOMDV) routing protocol [7], an extension of AODV to compute multiple loop-free link- disjoint routes ; (iii) AODV

  5. 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...... developmental stages. This article maps the development in Denmark, Finland, Germany and England using a case study approach deploying data triangulation from a national and institutional perspective. It explores the extent/commonality of structural factors for easing access for students engaging in lifelong...... 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...

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

  7. Optimum Route Selection for Vehicle Navigation

    Dalip

    2016-02-01

    Full Text Available The objective of Optimum Route Selection for Vehicle Navigation System (ORSVNS article is to develop a system, which provides information about real time alternate routes to the drivers and also helps in selecting the optimal route among all the alternate routes from an origin to destination. Two types of query systems, special and general, are designed for drivers. Here, the criterion for route selection is introduced using primary and secondary road attributes. The presented methodology helps the drivers in better decision making to choose optimal route using fuzzy logic. For experimental results ORSVNS is tested over 220 km portion of Haryana state in India.

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

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

  10. Route activity tracking and management using available technology

    Sam Yousef Khoury

    2012-01-01

    Full Text Available Small organizations that maintain their own fleet and make their own deliveries are responsible for ensuring their drivers are utilizing the most efficient routes while delivering products to their customers. Furthermore, efficient delivery requires that drivers spend as little time as possible dropping off and picking up products, since these activities are referred to as “non-value added activities,” although they are necessary tasks in the order cycle process. To aid in reducing order cycle times, large organizations that can afford it have employed transportation management systems. Unfortunately, small organizations with limited resources are less likely to adopt transportation management systems, despite the need for such automation. One solution is to use available productivity software to track and manage driver route activity in an effort to improve and maintain driver productivity by reducing non-value time and identifying optimal routes. This paper will outline how office productivity software such as Microsoft® Access can meet the needs of small organizations with limited resources by describing the development and use of a route activity database that employs an easy-to-use multi-user interface. This paper also includes the details of the underlying infrastructure and the user interface.

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

  12. Implementation of an On-Demand Routing Protocol for Wireless Sensor Networks

    Zhang, Yang; Wu, Jian; Havinga, P.J.M.

    2006-01-01

    We present our experiences in implementing and validating the on-demand EYES Source Routing protocol (ESR) in a real wireless sensor network (WSN) environment. ESR has a fast recovery mechanism relying on MAC layer feedback to overcome frequent network topology changes resulting from node mobility a

  13. Analytical Analysis of Vehicle Routing and Inventory Routing Problems

    2007-11-02

    The objective of the project is to perform analytical analyses of heuristics for the Vehicle Routing Problem ( VRP ) and apply the results in models...asymptotic optimal solution value of the VRP with capacity and time window constraints and used it to develop a new and efficient algorithm. (2) Obtained a...characterization of the effectiveness of set partitioning formulations for VRPs . (3) Characterized the worst case behavior of the linear programming

  14. Technical Report: 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 ...

  15. Capacity Constrained Routing Algorithms for Evacuation Route Planning

    2006-05-04

    April 30, 2006 DRAFT 9 D. Scope and Outline of the Paper The main focus of the paper is on the analysis of a heuristic algorithm which effectively...CCRP Algorithms In this section, we present a generic description of the Capacity Constrained Route Planner (CCRP). CCRP is a heuristic algorithm which...qualifies to be a candidate algorithm. E. Solution Quality of CCRP Since CCRP is a heuristic algorithm , it does not produce optimal solutions for all

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

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

  18. Implementation of direct routing mobile IP for solving triangular routing

    Jang, Jongwook; Jang, SeongHo; Park, Miri; Lee, Dae-bong

    2001-10-01

    Mobility support on the network layer is of special importance, as the network layer holds together the huge Internet with common protocol IP. Although based on possibility different wireless or wired technologies, all nodes of the network should be able to communicate. Therefore, mobile IP(an extension of the classical IP) has been designed which enablemobility in the Internet without changing existing wired systems. However, mobile IP leaves some points unsolved. Especially, if it comes to security, efficiency of the packet flow that is called triangular routing. Especially triangular routing can cause unnecessary overhead for the network. Furthermore latency can increase dramatically. This is particularly unfortunate if two communicating hosts are separated by transatlantic links. In order to this problem, many methods like IPv6 and ROMIP are proposed. But these methods have limitation. In other words, they have not compatibility because of needing modification of original IP scheme. Especially ROMIP is very complex and the overhead of control message and processing are serious. The problem of inconsistency of Binding caches may occur too. We therefore propose and analyze the performance of the DRMIP (Direct Routing Mobile IP) which do not modify IP source needed in the sender, is compatible with IP and Mobile IP.

  19. Scripted Mobile Network Routing in a Contested Environment

    2008-03-01

    Protocol Comparisons Iwata measures on-demand routing , such as AODV , Fisheye State Routing (FSR...comparison between DSDV, CGSR, The Wireless Routing Protocol (WRP), AODV , DSR, TORA, Associativity-Based Routing (ABR) and Signal Stability Routing (SSR...with AODV . The modified routing does not change AODV , and can be used with any routing protocol . AODV is tested with and without the plan

  20. Multipath Routing Protocol for Effective Local Route Recovery in Mobile Ad hoc Network

    S. K. Srivatsa

    2012-01-01

    Full Text Available Problem statement: In mobile ad hoc networks, frequent mobility during the transmission of data causes route failure which results in route rediscovery. In this, we propose multipath routing protocol for effective local route recovery in Mobile Ad hoc Networks (MANET. In this protocol, each source and destination pair establishes multiple paths in the single route discovery and they are cached in their route caches. Approach: The cached routes are sorted on the basis of their bandwidth availability. In case of route failure in the primary route, a recovery node which is an overhearing neighbor, detects it and establishes a local recovery path with maximum bandwidth from its route cache. Results: By simulation results, we show that the proposed approach improves network performance. Conclusion: The proposed route recovery management technique prevents the frequent collision and degradation in the network performance.

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

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

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

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

  5. Is fast food addictive?

    Garber, Andrea K; Lustig, Robert H

    2011-09-01

    Studies of food addiction have focused on highly palatable foods. While fast food falls squarely into that category, it has several other attributes that may increase its salience. This review examines whether the nutrients present in fast food, the characteristics of fast food consumers or the presentation and packaging of fast food may encourage substance dependence, as defined by the American Psychiatric Association. The majority of fast food meals are accompanied by a soda, which increases the sugar content 10-fold. Sugar addiction, including tolerance and withdrawal, has been demonstrated in rodents but not humans. Caffeine is a "model" substance of dependence; coffee drinks are driving the recent increase in fast food sales. Limited evidence suggests that the high fat and salt content of fast food may increase addictive potential. Fast food restaurants cluster in poorer neighborhoods and obese adults eat more fast food than those who are normal weight. Obesity is characterized by resistance to insulin, leptin and other hormonal signals that would normally control appetite and limit reward. Neuroimaging studies in obese subjects provide evidence of altered reward and tolerance. Once obese, many individuals meet criteria for psychological dependence. Stress and dieting may sensitize an individual to reward. Finally, fast food advertisements, restaurants and menus all provide environmental cues that may trigger addictive overeating. While the concept of fast food addiction remains to be proven, these findings support the role of fast food as a potentially addictive substance that is most likely to create dependence in vulnerable populations.

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

  7. Efficiency-optimized low-cost TDPAC spectrometer using a versatile routing/coincidence unit

    Renteria, M., E-mail: renteria@fisica.unlp.edu.ar; Bibiloni, A. G.; Darriba, G. N.; Errico, L. A.; Munoz, E. L.; Richard, D.; Runco, J. [Universidad Nacional de La Plata, Departamento de Fisica, Facultad de Ciencias Exactas (Argentina)

    2008-01-15

    A highly efficient, reliable, and low-cost {gamma}-{gamma} TDPAC spectrometer, PACAr, optimized for {sup 181}Hf-implanted low-activity samples, is presented. A versatile EPROM-based routing/coincidence unit was developed and implemented to be use with the memory-card-based multichannel analyzer hosted in a personal computer. The excellent energy resolution and very good overall resolution and efficiency of PACAr are analyzed and compare with advanced and already tested fast-fast and slow-fast PAC spectrometers.

  8. Model multivehicle routing dengan persaingan pasar

    2011-01-01

    Multiple vehicle routing problem has potential real-word applications as it enables the study of strategic competition among private trucking companies in such ar- eas as the transportation of aggregates to construction sites. The multiple vehicle routing problem with profits and competition (MVRPPC) represents an extension of the vehicle routing problem in that it: incorporates competition into the routing process, maximizes profits rather than minimizes costs, and assumes that truc...

  9. QAODV: Improved Security Routing Protocol of AODV

    Ruihui Mu; Wuqiang Zhang

    2013-01-01

    Network control system (NCS) has higher requirements on QoS index of the network, but MANET can hardly meet the demands of control systems because of its own characteristics. The paper improves AODV and proposes AODV routing protocol QAODV with certain QoS security in combination with NCS and MANET, and expounds routing detection, routing register and routing maintenance. Simulation results show that end-to-end delay and packet loss of QAODV reduces evidently compared with AODV, and the proto...

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

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

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

  13. ATLAS Fast Physics Monitoring: TADA

    Sabato, Gabriele; The ATLAS collaboration

    2017-01-01

    The ATLAS experiment at the LHC is recording data from proton-proton collisions with 13 TeV center-of-mass energy since spring 2015. The collaboration is using a fast physics monitoring framework (TADA) to automatically perform a broad range of fast searches for early signs of new physics and to monitor the data quality across the year with the full analysis level calibrations applied to the rapidly growing data.TADA is designed to provide fast feedback directly after the collected data has been fully calibrated and processed at the Tier-0, the CERN Data Center. The system can monitor a large range of physics channels, offline data quality and physics performance quantities nearly final analysis level object calibrations. TADA output is available on a website accessible by the whole collaboration that gets updated twice a day with the data from newly processed runs. Hints of potentially interesting physics signals or performance issues identified in this way are reported to be followed up by physics or combin...

  14. ATLAS Fast Physics Monitoring: TADA

    Elsing, Markus; The ATLAS collaboration; Sabato, Gabriele; Kamioka, Shusei; Nairz, Armin Michael; Moyse, Edward; Gumpert, Christian

    2016-01-01

    The ATLAS Experiment at the LHC is recording data from proton-proton collisions with 13 TeV center-of-mass energy since spring 2015. The collaboration is using a fast physics monitoring framework (TADA) to automatically perform a broad range of fast searches for early signs of new physics and to monitor the data quality across the year with the full analysis level calibrations applied to the rapidly growing data. TADA is designed to provide fast feedback directly after the collected data has been fully calibrated and processed at the Tier-0. The system can monitor a large range of physics channels, offline data quality and physics performance quantities nearly final analysis level object calibrations. TADA output is available on a website accessible by the whole collaboration that gets updated twice a day with the data from newly processed runs. Hints of potentially interesting physics signals or performance issues identified in this way are reported to be followed up by physics or combined performance groups...

  15. A New Distributed Routing Protocol.

    1984-01-01

    Kindm ’[t., BMnclh CntMU Consider a attuatJion in %, Adhd them am n n es0 ndh lidkd to at least ne &her node sudh that all moe a wwmwted. either...distributed Itn r that is cpable, of failsafe distributed routing. 37 ~L MANHATAN %SQ.ARE GP :,!: NETWORK, - CONNECTTVY S . .. . I ip p- t 0 4 Figure 4-3

  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. Multi-constraint quality of service routing algorithm for dynamic topology networks

    2008-01-01

    An adaptive multi-QoS routing algorithm called AMQRA is proposed for dynamic topology networks,such as satellite networks and Ad-hoc networks.The AMQRA is a distributed and mobile-agents-based routing algorithm,which combines ant quantity system (AQS) with ant colony optimization (ACO) that is used in AntNet routing algorithm.In dynamic topology networks,the AMQRA achieves timely optimization for concave metric QoS constraint and fast convergence.The proposed routing algorithm is simulated in Iridium satellite constellation on OPNET.The results show that AMQRA not only outperforms the AntNet in convergence rate in dynamic topology networks but also can optimize concave metric QoS constraint and reasonably allot bandwidth to the load to avoid networks congestion.

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

  19. Locating Depots for Capacitated Vehicle Routing

    Gørtz, Inge Li; Nagarajan, Viswanath

    2011-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input to k-LocVRP is a set of demand locations in a metric space and a fleet of k vehicles each of capacity Q. The objective is to locate k depots, one for each vehicle, and compute routes for the vehicles so...

  20. Verkeersveiligheidseffecten van Dynamische Route Informatie Panelen (DRIP's).

    2008-01-01

    The term Dynamic Route Information Panel (DRIP) is, also in the Netherlands, used for an electronic route information panel. A DRIP usually indicates if there are queues on the various routes to a particular destination, how long they are, and sometimes what the estimated journey time is. This is in

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

  2. Locating Depots for Capacitated Vehicle Routing

    Gørtz, Inge Li; Nagarajan, Viswanath

    2016-01-01

    We study a location-routing problem in the context of capacitated vehicle routing. The input to the k-location capacitated vehicle routing problem (k-LocVRP) consists of a set of demand locations in a metric space and a fleet of k identical vehicles, each of capacity Q. The objective is to locate k...

  3. A Survey on Distance Vector Routing Protocols

    Tang, Linpeng

    2011-01-01

    In this paper we give a brief introduction to five different distance vector routing protocols (RIP, AODV, EIGRP, RIP-MTI and Babel) and give some of our thoughts on how to solve the count to infinity problem. Our focus is how distance vector routing protocols, based on limited information, can prevent routing loops and the count to infinity problem.

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

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

  6. Integrative Physiology of Fasting.

    Secor, Stephen M; Carey, Hannah V

    2016-03-15

    Extended bouts of fasting are ingrained in the ecology of many organisms, characterizing aspects of reproduction, development, hibernation, estivation, migration, and infrequent feeding habits. The challenge of long fasting episodes is the need to maintain physiological homeostasis while relying solely on endogenous resources. To meet that challenge, animals utilize an integrated repertoire of behavioral, physiological, and biochemical responses that reduce metabolic rates, maintain tissue structure and function, and thus enhance survival. We have synthesized in this review the integrative physiological, morphological, and biochemical responses, and their stages, that characterize natural fasting bouts. Underlying the capacity to survive extended fasts are behaviors and mechanisms that reduce metabolic expenditure and shift the dependency to lipid utilization. Hormonal regulation and immune capacity are altered by fasting; hormones that trigger digestion, elevate metabolism, and support immune performance become depressed, whereas hormones that enhance the utilization of endogenous substrates are elevated. The negative energy budget that accompanies fasting leads to the loss of body mass as fat stores are depleted and tissues undergo atrophy (i.e., loss of mass). Absolute rates of body mass loss scale allometrically among vertebrates. Tissues and organs vary in the degree of atrophy and downregulation of function, depending on the degree to which they are used during the fast. Fasting affects the population dynamics and activities of the gut microbiota, an interplay that impacts the host's fasting biology. Fasting-induced gene expression programs underlie the broad spectrum of integrated physiological mechanisms responsible for an animal's ability to survive long episodes of natural fasting.

  7. Towards Service Sontinuity in IMS Heterogeneous Access Networks

    Mohammed BOUTABIA

    2011-05-01

    Full Text Available In this paper we tackle the mobility issue in IP Multimedia Subsystem (IMS. Although IMS was designedto integrate different access networks, mobility management among these networks is still unresolved. We propose a novel hybrid mobility management scheme, based on tight cooperation between fast handovers for mobile IPv6 (FMIPv6 and session initiation protocol (SIP to ensure an uninterrupted real-time service. Moreover, the new Media Independent Handover (MIH service is integrated into IMS architecture in order to perform intelligent and accurate horizontal and vertical handovers. We investigate two handover cases: selected handover and forced handover. Selected handover takes place when user equipment (UE is connected to the network via two interfaces at the same time and decides to upgrade the quality of its connection following a given criterion (i.e. cost, bandwidth…etc without having any difficulty in the previous link. As far as forced handover is concerned, it occurs when thesignal reaches a critical level and UE is forced to make a handover in order to maintain the ongoing communication. This case is managed in two phases. The first one or the fast phase is handled by FMIPv6 protocol to preserve as soon as possible packets of the ongoing communication. The second one or the slow phase is handled by SIP protocol to optimize packet delivery route. By doing so, we exploit the benefits of both network layer and application mobility protocols to ensure a continuous session over the two networks without imposing new elements to the network. Through a comparison with other mobility mechanisms, we show in the analytic analysis that our hybrid scheme presents better results in terms of handover latency and packet loss.

  8. Optimized AODV routing protocol based on reverse route search in leisure time and route learning%基于闲时逆寻和路由学习机制的优化AODV路由协议

    杜青松; 朱江; 张尔扬

    2011-01-01

    对AODV协议在不同MANET网络环境中的性能缺陷进行了研究,提出了节点闲时反向路由搜索机制和邻居节点路由监听学习机制,并进一步提出了优化的AODV路由协议O-AODV.利用O-AODV协议在MANET网络中产生多个局部路由,从而增加网络中的路由冗余度,提高路由发现的效率,加快故障路由的本地修复.仿真实验结果表明,O-AODV协议提高了分组投递率,降低了端到端延时,有效地减少了网络中的重路由开销,在大规模和拓扑变化快的网络环境中优于AODV协议.%An optimized AODV routing protocol (0-AODV) which integrated RRSL mechanism (reverse route search in leisure time) and route learning mechanism was proposed. According to O-AODV, many local routes were produced in MANET and route redundancy was increased, therefore improved the efficiency of routing discovery, speeded up the local repair procedure of break routes, and decreased the overhead of route rediscovery. Simulation results indicate that O-AODV can improve packet delivery ratio and decrease the end-to-end packet delay, its performance is superior to AODV in large scale and fast changing MANET.

  9. FAST User Guide

    Walatka, Pamela P.; Clucas, Jean; McCabe, R. Kevin; Plessel, Todd; Potter, R.; Cooper, D. M. (Technical Monitor)

    1994-01-01

    The Flow Analysis Software Toolkit, FAST, is a software environment for visualizing data. FAST is a collection of separate programs (modules) that run simultaneously and allow the user to examine the results of numerical and experimental simulations. The user can load data files, perform calculations on the data, visualize the results of these calculations, construct scenes of 3D graphical objects, and plot, animate and record the scenes. Computational Fluid Dynamics (CFD) visualization is the primary intended use of FAST, but FAST can also assist in the analysis of other types of data. FAST combines the capabilities of such programs as PLOT3D, RIP, SURF, and GAS into one environment with modules that share data. Sharing data between modules eliminates the drudgery of transferring data between programs. All the modules in the FAST environment have a consistent, highly interactive graphical user interface. Most commands are entered by pointing and'clicking. The modular construction of FAST makes it flexible and extensible. The environment can be custom configured and new modules can be developed and added as needed. The following modules have been developed for FAST: VIEWER, FILE IO, CALCULATOR, SURFER, TOPOLOGY, PLOTTER, TITLER, TRACER, ARCGRAPH, GQ, SURFERU, SHOTET, and ISOLEVU. A utility is also included to make the inclusion of user defined modules in the FAST environment easy. The VIEWER module is the central control for the FAST environment. From VIEWER, the user can-change object attributes, interactively position objects in three-dimensional space, define and save scenes, create animations, spawn new FAST modules, add additional view windows, and save and execute command scripts. The FAST User Guide uses text and FAST MAPS (graphical representations of the entire user interface) to guide the user through the use of FAST. Chapters include: Maps, Overview, Tips, Getting Started Tutorial, a separate chapter for each module, file formats, and system

  10. A robust cross-layer metric for routing protocol in mobile wireless ad hoc networks

    Mucchi, Lorenzo; Chisci, Luigi; Fabbrini, Luca; Giovannetti, Giulio

    2012-12-01

    In a mobile ad-hoc network (MANET) where Mobile Nodes (MNs) self-organize to ensure the communication over radio links, routing protocols clearly play a significant role. In future MANETs, protocols should provide routing under full mobility, power constraints, fast time-varying channels, and nodes subject to high loading. In this article, a novel robust routing protocol, named distributed X-layer fastest path (DXFP), is proposed. The protocol is based on a cross-layer metric which is robust against the time-variations of the network as far as topology (mobility), congestion of the nodes and channel quality (fading, power constraints) are concerned. All these features are integrated in a single physical cost, i.e., the network crossing time, which has to be minimized. Furthermore, several routes from source to destination are stored for a given data flow to efficiently face the disconnections which frequently occur in MANETs. It is shown that the DXFP protocol, though locally operating in a fully distributed way within the MNs, provides, for each data flow, the optimum routes according to the considered metric. The DXFP protocol has been compared with two of the most commonly used routing protocols for MANETs, i.e., dynamic source routing and ad hoc on-demand distance vector, showing significant improvements in performance and robustness.

  11. Research on multihop wireless ad hoc network and its routing protocols

    Li, Dan; Zhu, Qiuping

    2004-04-01

    An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without using any existing network infrastructure or centralized administration. Because of its acentric, self-organized, fast deployable and mobile property, people are paying more attention to the using of ad hoc network in the emergency. In such an environment, multiple networks "hops" may be needed for one node to exchange data with another across the network, due to the limited range of each mobile node"s wireless transmissions. So for an ad hoc network, a rational routing protocol is especially important. The paper will analyze the character of ad hoc network and the special requirement for communication protocols. Toward the routing protocols, this paper presents four multi-hop wireless ad hoc network routing protocols that cover a range of design choices: DSDV (Destination Sequenced Distance Vector), TORA (Temporally Ordered Routing Algorithm), DSR (Dynamic Source Routing), and AODV (Ad hoc On-demand Distance Vector). After thoroughly analyzed the network structure and routing protocols, the paper gives the proposal of a new hybrid routing protocol and the view for future work.

  12. Real-time routing control design for traffic networks with multi-route choices

    罗莉华; 葛颖恩; 陈继红; 张方伟

    2016-01-01

    This work considers those road networks in which there are multi-route choices for bifurcation-destination (or origin-destination) pairs, and designs a real-time variable message sign (VMS)-based routing control strategy in the model predictive control (MPC) framework. The VMS route recommendation provided by the traffic management authority is directly considered as the control variable, and the routing control model is established, in which a multi-dimensional control vector is introduced to describe the influence of route recommendations on flow distribution. In the MPC framework, a system optimum routing strategy with the constraints regarding drivers’ acceptability with recommended routes is designed, which can not only meet the traffic management authority’s control requirement but also improve drivers’ satisfaction with the route guidance system. The simulation carried out shows that the proposed routing control can effectively mitigate traffic congestion, reduces followers’ time delay, and improves drivers’ satisfaction with routing control in road networks.

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

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

  15. Route selection for vehicle navigation and control

    G. Pang; Chu, MH

    2007-01-01

    This paper presents an application of neural-fuzzy methodology for the problem of route selection in a typical vehicle navigation and control system. The idea of the primary attributes of a route is discussed, and a neural-fuzzy system is developed to help a user to select a route out of the many possible routes from an origin to the destination. The user may not adopt the recommendation provided by the system and choose an alternate route. One novel feature of the system is that the neural-f...

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

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

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

  19. A Genetic Algorithm on Inventory Routing Problem

    Nevin Aydın

    2014-03-01

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

  20. MILITARY MULTI-HOP ROUTING PROTOCOL

    2006-01-01

    Military tactical network is one of the most important applications of ad hoc network. Currently the existing routing protocols are put forward based on the simple and universal network model which has the ability of multi-hop routing but cannot work efficiently in the special military applications. The narrow bandwidth and limited energy of the wireless network make general routing protocols seem to be more redundant.In order to satisfy military needs properly, this letter makes a detailed analysis of physical nodes and traffic distribution in military network, uses cross-layer design concept for reference, combines traffic characteristic of application layer with routing protocol design. It categorized routing problem as crucial routes and non-crucial routes which adopted separate maintenance methods. It not only realizes basic transmission function but also works efficiently. It is quite fit for military application.

  1. Endoscopic approach-routes in the posterior fossa cisterns through the retrosigmoid keyhole craniotomy: an anatomical study.

    Kurucz, Peter; Baksa, Gabor; Patonay, Lajos; Thaher, Firas; Buchfelder, Michael; Ganslandt, Oliver

    2016-11-10

    Endoscopy in cerebellopontine angle surgery is an increasingly used technique. Despite of its advantages, the shortcomings arising from the complex anatomy of the posterior fossa are still preventing its widespread use. To overcome these drawbacks, the goal of this study was to define the anatomy of different endoscopic approaches through the retrosigmoid craniotomy and their limitations by surgical windows. Anatomical dissections were performed on 25 fresh human cadavers to describe the main approach-routes. Surgical windows are spaces surrounded by neurovascular structures acting as a natural frame and providing access to deeper structures. The approach-routes are trajectories starting at the craniotomy and pointing to the lesion, passing through certain windows. Twelve different windows could be identified along four endoscopic approach-routes. The superior route provides access to the structures of the upper pons, lower mesencephalon, and the upper neurovascular complex through the suprameatal, superior cerebellar, and infratrigeminal windows. The supratentorial route leads to the basilar tip and some of the suprasellar structures via the ipsi- and contralateral oculomotor and dorsum sellae windows. The central endoscopic route provides access to the middle pons and the middle neurovascular complex through the inframeatal, AICA, and basilar windows. The inferior endoscopic route is the pathway to the medulla oblongata and the lower neurovascular complex through the accessory, hypoglossal, and foramen magnum windows. The anatomy and limitations of each surgical windows were described in detail. These informations are essential for safe application of endoscopy in posterior fossa surgery through the retrosigmoid approach.

  2. Research on Routing Protocol of Mobile Ad Hoc Network

    Tuo Ming Fu; Che Min

    2016-01-01

    Routing protocol is an important content of mobile Ad Hoc. The typical mobile Ad Hoc network routing protocols is introduced. The advantages and disadvantages of these routing protocols are analyzed. A hybrid routing protocol is put forward based on this.

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

    Alanazi, Adwan; Elleithy, Khaled

    2015-09-02

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

  4. The Edge Set Cost of the Vehicle Routing Problem with Time Windows

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

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

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

    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.

  6. A simulation based QoS review of multipath routing protocols for MANET

    P.Periyasamy

    2012-11-01

    Full Text Available A MANET is an interconnection of mobile devices by wireless links forming a dynamic topology without much physical network infrastructure such as routers, servers, access points/cables or centralized administration. The multipath routing protocols establish efficient communication within the network by discovering multiple routes between a pair of source and destination in order to have load balancing to satisfy Quality of Service (QoS requirements. In this paper, the QoS comparison of three multipath routing protocols are carried out in terms of five scenario patterns such as RWM, RPGM, MGM, GMM, and PMM in two different traffic patterns such as CBR and TCP using NS2 and Bonn Motion. The multipath routing protocols AOMDV, OLSR and ZRP have been selected for simulation due to their edges over other protocols in various aspects.

  7. Smart Order Routing Technology in the New European Equity Trading Landscape

    Ende, Bartholomäus; Gomber, Peter; Lutat, Marco

    In Europe, fragmentation of execution venues has been triggered by increasing competition among markets and a new regulatory environment set up by MiFID. Against this background, IT-based sophisticated order routing systems (Smart Order Routing systems) promise to assure efficiency despite fragmented markets. This raises the question on the relevance and economic value of this technology in European equity trading. Based on order book data for EURO STOXX 50 securities of ten European electronic execution venues, this paper assesses the potential of Smart Order Routing technology by measuring the performance of actual executions in European order book trading relative to a Smart Order Router implementation that detects and accesses best European prices. We identify 6.71% full trade troughs and 6.45% partial trade-throughs in our dataset enabling for significant absolute and relative savings. This indicates that Smart Order Routing technology can provide business value by improving order executions in European cross-tradable equities.

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

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

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

    2016-01-01

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

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

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

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

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

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

  15. Enhancing Route Maintenance in RS-AODV

    Gaurav J. Bhatt*,

    2014-05-01

    Full Text Available Mobile Ad hoc Networks (MANETs are temporary formed, infrastructure-less networks. The performance metrics degrades due to the unstable channel conditions, network connectivity, and mobility and resource limitations. To improve different performance metrics, various cross-layering techniques are used where different layers from protocol stack communications with each other via exchange of information. Ad hoc on demand Routing Protocol (AODV is a well reactive ad hoc routing protocol. We proposed RS-AODV (Route Stability based AODV, a modified version of AODV routing protocol, based on route discovery by utilizing Physical Layer information instead of the minimum hop count approach of the default distance vector algorithm. Our research will also elaborate how the proposed model uses the received Signal Strength (RSSI to find its route. We will focus on parameters like traffic throughput, response, time, packet loss, delay, link stability, optimal usage of battery resource to increase overall lifetime of a network. And also use novel approach "make before break" that starts finding alternate route when it seems link failure due to mobility of node. Simulation results show that RS-AODV has performance better that AODV routing protocol in terms of the metrics: End-to-End delay, Packet Delivery Ratio, Network Routing Load and number of route repairs.

  16. A Study Issues Related To Improve Route Stability In AODY Routing Protocol In VANET

    Annu Mor

    2013-01-01

    Full Text Available 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, according to IEEE 802.11 p standard for end to end communication between vehicles . For end to end communication between vehicles a routing protocols is used to find a route based on link properties. One of the most important routing protocols used in ad hoc networks is AODV. This protocol is connectivity based reactive protocol that searches routes only when they are needed. It always exchanges control packets between neighbor nodes for routing. In this article author present cross layer technique that find channel security at link layer to AODV routing protocol to improve the communication in vehicles for safety purpose. To eliminate route discovery routers, propose PAODV as routing protocol. It improves AODV control overhead and makes routes more stable.

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

  18. A Fast Prediction Algorithm of Satellite Passes

    Palmer, P. L.; Mai, Yan

    2000-01-01

    Low cost, fast access and multi-functional small satellites are being increasingly used to provide and exchange information for a wide variety of professions. They are particularly useful, for example, as a resource in very remote areas where they can provide useful information such as to rescue teams for changing conditions in a disaster zone and monitoring the sea state to warn approaching shipping. Unlike terrestrial communication systems, the receiver/transmitter in these di_erent applica...

  19. Optical label-controlled transparent metro-access network interface

    Osadchiy, Alexey Vladimirovich

    This thesis presents results obtained during the course of my PhD research on optical signal routing and interfacing between the metropolitan and access segments of optical networks. Due to both increasing capacity demands and variety of emerging services types, new technological challenges...... are arising for seamlessly interfacing metropolitan and access networks. Therefore, in this PhD project, I have analyzed those technological challenges and identified the key aspects to be addressed. I have also proposed and experimentally verified a number of solutions to metropolitan and access networks...... interfacing and signal routing. Equipment and infrastructure simplification was recognized as the path towards more efficient metropolitan and access networks providing a spectrum of high-bandwidth services to large number of users. Several approaches have been proposed and developed in order to enable...

  20. Administrator and Fidelity Based Secure Routing (AFSR Protocol in MANET

    Rohit Singh

    2016-03-01

    Full Text Available The proliferation of mobile computing and communication devices are driving a revolutionary change in our information society. Among all the applications and services run by mobile devices, network connections and corresponding data services are without doubt the most demanded services by mobile users. A MANET is a continuously self-configuring, infrastructure-less network of mobile devices connected without wires, which makes it ideal for the present scenario. But, due to lack of any centralized infrastructure and access to trusted authorities, the security in MANET poses a huge threat. The prominent routing protocols we know are generally designed for environments where the nodes within a network are non-malicious. Due to the vulnerable nature of the mobile ad hoc network, there are numerous security threats that disturb its development. We propose a protocol for MANETs named “Administrator and Fidelity Based Secure Routing Protocol” (AFSR, which ensures secure routing through the network: by electing an Administrator node on the basis of Willingness and Fidelity, after which a node only communicates to that secure Admin node. This selection of secured admin nodes results in mitigation of various threats. We have evaluated our proposed protocol by simulating and comparing in GloMoSim.

  1. ANALYSIS OF ROUTING IN MOBILE AD-HOC NETWORKS

    Shweta

    2012-09-01

    Full Text Available An ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any standalone infrastructure or centralized administration. Routing in Ad hoc networks is a challenging problem because nodes are mobile and links are continuously being created and broken.In this model we not only improves the reputation of the network but also provide a routing approach for reliable data transmission and also avoid the loop occurs in the communication. The mobile network is the dynamicnetwork that provides the solution for the inclusion and exclusion of dynamic nodes in the network. AODV and DSR are the two most popular routing protocols for ad-hoc network that we discussed here. In this paper we describe the way to find the node having packet loss and to perform the elimination of node from the network withoutperforming the rerouting and provide the reliable data transfer over the network. In this paper, we design and evaluate cooperative caching techniques to efficiently support data access in the ad-hoc network.

  2. Synthetic Routes to Methylerythritol Phosphate Pathway Intermediates and Downstream Isoprenoids

    Jarchow-Choy, Sarah K; Koppisch, Andrew T; Fox, David T

    2014-01-01

    Isoprenoids constitute the largest class of natural products with greater than 55,000 identified members. They play essential roles in maintaining proper cellular function leading to maintenance of human health, plant defense mechanisms against predators, and are often exploited for their beneficial properties in the pharmaceutical and nutraceutical industries. Most impressively, all known isoprenoids are derived from one of two C5-precursors, isopentenyl diphosphate (IPP) or dimethylallyl diphosphate (DMAPP). In order to study the enzyme transformations leading to the extensive structural diversity found within this class of compounds there must be access to the substrates. Sometimes, intermediates within a biological pathway can be isolated and used directly to study enzyme/pathway function. However, the primary route to most of the isoprenoid intermediates is through chemical catalysis. As such, this review provides the first exhaustive examination of synthetic routes to isoprenoid and isoprenoid precursors with particular emphasis on the syntheses of intermediates found as part of the 2C-methylerythritol 4-phosphate (MEP) pathway. In addition, representative syntheses are presented for the monoterpenes (C10), sesquiterpenes (C15), diterpenes (C20), triterpenes (C30) and tetraterpenes (C40). Finally, in some instances, the synthetic routes to substrate analogs found both within the MEP pathway and downstream isoprenoids are examined. PMID:25009443

  3. Assessing Routing Strategies for Cognitive Radio Sensor Networks

    Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S.; Saleem, Kashif

    2013-01-01

    Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area. PMID:24077319

  4. An Analysis of ASRP Secure Routing Protocol for MANET

    Tarun Dalal

    2012-04-01

    Full Text Available Mobile ad hoc networks (MANET can be defined as a collection of large number of mobile nodes that form temporary network without aid of any existing network infrastructure or central access point. Each node participating in the network, acts both as host and a router and must therefore is willing to forward packets for other nodes. The characteristics of MANET provides large amount of degree of freedom and self-organizing capability that make it completely different from other network. Due to this nature of MANET, design and development of secure routing is challenging task for researcher in an open and distributed communication environments. The main work of this paper is to address the security issue, because MANET is generally more vulnerable to various attacks, so we proposed a secure routing protocol for MANET, named ASRP (Authenticate Secure Routing Protocol based on DSDV (Destination- sequence distance vector. This protocol is designed to protect the network from malicious and selfish nodes. We are implementing Extended Public key Cryptography mechanism in ASRP in order to achieve security goals.

  5. Assessing Routing Strategies for Cognitive Radio Sensor Networks

    Kashif Saleem

    2013-09-01

    Full Text Available Interest in the cognitive radio sensor network (CRSN paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs, cognitive radio ad-hoc networks (CRAHNs and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

  6. Assessing routing strategies for cognitive radio sensor networks.

    Zubair, Suleiman; Fisal, Norsheila; Baguda, Yakubu S; Saleem, Kashif

    2013-09-26

    Interest in the cognitive radio sensor network (CRSN) paradigm has gradually grown among researchers. This concept seeks to fuse the benefits of dynamic spectrum access into the sensor network, making it a potential player in the next generation (NextGen) network, which is characterized by ubiquity. Notwithstanding its massive potential, little research activity has been dedicated to the network layer. By contrast, we find recent research trends focusing on the physical layer, the link layer and the transport layers. The fact that the cross-layer approach is imperative, due to the resource-constrained nature of CRSNs, can make the design of unique solutions non-trivial in this respect. This paper seeks to explore possible design opportunities with wireless sensor networks (WSNs), cognitive radio ad-hoc networks (CRAHNs) and cross-layer considerations for implementing viable CRSN routing solutions. Additionally, a detailed performance evaluation of WSN routing strategies in a cognitive radio environment is performed to expose research gaps. With this work, we intend to lay a foundation for developing CRSN routing solutions and to establish a basis for future work in this area.

  7. Local Routing in Graphs Embedded on Surfaces of Arbitrary Genus

    Fraser, Maia

    2012-01-01

    We present a local routing algorithm which guarantees delivery in all connected graphs embedded on a known surface of genus $g$. The algorithm transports $O(g\\log n)$ memory and finishes in time $O(g^2n^2)$, where $n$ is the size of the graph. It requires access to a homology basis for the surface. This algorithm, GFR, may be viewed as a suitable generalization of Face Routing (FR), the well-known algorithm for plane graphs, which we previously showed does {\\it not} guarantee delivery in graphs embedded on positive genus surfaces. The problem for such surfaces is the potential presence of homologically non-trivial closed walks which may be traversed by the right-hand rule. We use an interesting mathematical property of homology bases (proven in Lemma \\ref{lem:connectFaceBdr}) to show that such walks will not impede GFR. FR is at the base of most routing algorithms used in modern (2D) ad hoc networks: these algorithms all involve additional local techniques to deal with edge-crossings so FR may be applied. GFR...

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

  9. 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...... found in many optimal solutions to CVRP instances. An optimal solution to the PCVRP may therefore be useful in itself as a heuristic solution to the CVRP. Further, an attempt can be made to find an even better CVRP solution by solving a TSP, possibly leading to a non-pyramidal route, for each...... of the routes in the PCVRP solution. This paper develops an exact branch-and-cut-and-price (BCP) algorithm for the PCVRP. At the pricing stage, elementary routes can be computed in pseudo-polynomial time in the PCVRP, unlike in the CVRP. We have therefore implemented pricing algorithms that generate only...

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

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

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

  13. Fast growth in control

    Z. Rico (Zulay)

    2009-01-01

    textabstractThe focus of this paper is on the influence of the fast growth of organizations on the design process of management control systems. What are the management accounting and control problems that a fast growth organization encounters that can be ascribed to this growth. What are the circum

  14. Two Improved Access Methods on Compact Binary (CB) Trees.

    Shishibori, Masami; Koyama, Masafumi; Okada, Makoto; Aoe, Jun-ichi

    2000-01-01

    Discusses information retrieval and the use of binary trees as a fast access method for search strategies such as hashing. Proposes new methods based on compact binary trees that provide faster access and more compact storage, explains the theoretical basis, and confirms the validity of the methods through empirical observations. (LRW)

  15. A Generalized Assignment Heuristic for Vehicle Routing

    1979-08-01

    problem by ( VRP ). L. . . . .. i -3- Formulation of the Vehicle Routing Problem ( VRP ) min Z c X. (1)ijk 1) i jk S.t. Z aiYik < bk , k ,...,K (2) 1...Fisher and Ramchandran Jaikumar University of Pennsylvania August, 1979 ABSTR_2T We consider a common variant of the vehicle routing problem in which a...minimum size fleet that can feasibly service the specified demand. 1. Intrcduction Vehicle routing is a challenging logistics management

  16. Distributed algorithms for resource allocation and routing

    Hu, Zengjian

    2007-01-01

    In this thesis, we study distributed algorithms in the context of two fundamental problems in distributed systems, resource allocation and routing. Resource allocation studies how to distribute workload evenly to resources. We consider two different resource allocation models, the diffusive load balancing and the weighted balls-into-bins games. Routing studies how to deliver messages from source to estination efficiently. We design routing algorithms for broadcasting and gossiping in ad hoc n...

  17. Gossip Based Ad-Hoc Routing

    Haas, Zygmunt; Halpern, Joseph Y.; Li, Erran L.

    2002-01-01

    Many ad hoc routing protocols are based on some variant of flooding. Despite various optimizations, many routing messages are propagated unnecessarily. We propose a gossiping-based approach, where each node forwards a message with some probability, to reduce the overhead of the routing protocols. Gossiping exhibits bimodal behavior in sufficiently large networks: in some executions, the gossip dies out quickly and hardly any node gets the message; in the remaining executions, a substantial fr...

  18. Scheduling and routing Tactical Aerial Reconnaissance Vehicles

    1990-01-01

    Approved for public release; distribution unlimited. In this thesis we study the Marine Corps Tactical Aerial Reconnaissance Vehicle routing and scheduling problem. the present method of routing and scheduling is presented, along with possible implications for routing and scheduling when future expansion of vehicle assets becomes available. A review of current literature is given and comparisons are drawn between our problem and recent work. A model for the problem, which we call the Multi...

  19. Security Verification of Secure MANET Routing Protocols

    2012-03-22

    the destination. The route discovery phase is complete upon receipt of the RREP at the requesting node. The DYMO protocol is a simpler version of AODV ...described in this appendix. The protocols are Secure AODV (SAODV), Secure Efficient Distance Vector (SEAD), and Secure Link State Routing Protocol (SLSP...SECURITY VERIFICATION OF SECURE MANET ROUTING PROTOCOLS THESIS Matthew F. Steele, Captain, USAF AFIT/GCS/ENG/12-03 DEPARTMENT OF THE AIR FORCE AIR

  20. Hemodialysis access procedures

    ... this page: //medlineplus.gov/ency/article/007641.htm Hemodialysis access procedures To use the sharing features on ... An access is needed for you to get hemodialysis. The access is where you receive hemodialysis . Using ...

  1. Fast ejendom III

    Munk-Hansen, Carsten

    Bogen er det tredje bind af tre planlagte bind om fast ejendom: I Overdragelsen, II Bolighandlen og III Ejerbeføjelsen. Fremstillingens giver et grundigt overblik over centrale områder af en omfattende regulering af fast ejendom, med angivelse af litteratur, hvor læseren kan søge yderligere...... oplysning. En ejer af fast ejendom er på særdeles mange områder begrænset i sin råden sammenlignet med ejeren af et formuegode i almindelighed. Fremstillingen tager udgangspunkt i ejerens perspektiv (fremfor samfundets eller myndighedernes). Både den privatretlige og offentligretlige regulering behandles......, eksempelvis ejendomsdannelsen, servitutter, naboretten, hævd, zoneinddelingen, den fysiske planlægning, beskyttelse af natur, beskyttelse af kultur, forurening fra fast ejendom, erstatning for forurening, jordforurening, ekspropriation, byggeri og adgang til fast ejendom....

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

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

  4. Shortest Paths and Vehicle Routing

    Petersen, Bjørn

    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 R...... Routing Problem based on partial paths is presented. Finally, a practical application of finding shortest paths in the telecommunication industry is shown.......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...

  5. Routing Issues in Opportunistic Networks

    Conti, Marco; Crowcroft, Jon; Giordano, Silvia; Hui, Pan; Nguyen, Hoang Anh; Passarella, Andrea

    The opportunistic networking idea stems from the critical review of the research field on Mobile Ad hoc Networks (MANET). After more than ten years of research in the MANET field, this promising technology still has not massively entered the mass market. One of the main reasons of this is nowadays seen in the lack of a practical approach to the design of infrastructure-less multi-hop ad hoc networks [186, 185]. One of the main approaches of conventional MANET research is to design protocols that mask the features of mobile networks via the routing (and transport) layer, so as to expose to higher layers an Internet-like network abstraction. Wireless networks’ peculiarities, such as mobility of users, disconnection of nodes, network partitions, links’ instability, are seen—as in the legacy Internet—as exceptions. This often results in the design of MANET network stacks that are significantly complex and unstable [107].

  6. Fishing Access Areas

    Vermont Center for Geographic Information — The Vermont Fish & Wildlife Department maintains developed fishing access areas. These sites provide public access to waters in Vermont for shore fishing...

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

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

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

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

  11. Dynamic Route Shortening and Route Repairing Mechanism for Mobile Ad Hoc Networks

    T. R. Rangaswamy

    2012-01-01

    Full Text Available Problem statement: Ad hoc Networks are wireless networks without any fixed infrastructure. The network topology changes frequently and unpredictably due to the random movement of the nodes. The ad hoc on Demand Distant Vector Routing (AODV protocol works in a dynamic fashion, by establishing a route on demand and continues that route until it breaks. Due to the changing network topology of ad hoc networks, if other routes with less hop count become available, the network topology is not able to adapt until the route break occurs. Hence in the route shortening scheme is some redundant nodes in the active route is replaced with a node that is not on the active route. When there is any link failure between any two nodes, the alternative route with optimum route to be constructed and not sending RRER message to the source node to initiate the route discovery process again. Approach: This study proposes a new routing protocol called, Dynamic Route Shortening and Repairing mechanism (DRSR. The route shortening is incorporated with route repairing mechanism, to improve the performance of the AODV. The route shortening scheme works by replacing some redundant nodes in the active route, with a node that is not on the active route. If there is a link failure between the two nodes, the route repairing mechanism repairs the route, by using the nodes that are close enough to the route to overhear the message. Whenever the links go down, the DRSR replaces the failed links with the optimum route that is adjacent to the main route and not sending and RRER message to the source node to initiate the route discovery process again. The alternative route construction process could be initiated at any time, not just when a route has failed. The dynamically constructed alternative route’s information is passed on to the upstream nodes, which then determine by themselves when to direct their packets to the Normal 0 false false false EN-US X

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

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

  14. 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......, including linguistic text books, books presenting the formal spelling and orthographic rules of Afrikaans as well as a monolingual dictionary. The paper argues that the applicability of the access process, as developed in lexicography, goes beyond dictionaries, illustrating the importance of a process...

  15. Access to the tracheal pulmonary pathway in small rodents

    Roberto S. A. Ribeiro

    2015-06-01

    Full Text Available ABSTRACT The tracheal pulmonary route is used in diverse experimental models for the study of drugs, infectious agents, and diseases. In view of its importance and associated difficulties, the present article proposes to give research groups up-to-date information on techniques to access the tracheal pulmonary pathway of small rodents.

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

  17. Gas cooled fast reactor

    NONE

    1972-06-01

    Although most of the development work on fast breeder reactors has been devoted to the use of liquid metal cooling, interest has been expressed for a number of years in alternative breeder concepts using other coolants. One of a number of concepts in which interest has been retained is the Gas-Cooled Fast Reactor (GCFR). As presently envisioned, it would operate on the uranium-plutonium mixed oxide fuel cycle, similar to that used in the Liquid Metal Fast Breeder Reactor (LMFBR), and would use helium gas as the coolant.

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

  19. FAST Construction Progress

    Nan, R. D.; Zhang, H. Y.; Zhang, Y.; Yang, L.; Cai, W. J.; Liu, N.; Xie, J. T.; Zhang, S. X.

    2016-11-01

    The 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. A unique karst depression in Guizhou province has been selected as the site to build an active reflector radio telescope with a diameter of 500 m and three outstanding aspects, which enables FAST to have a large sky coverage and the ability of observing astronomical targets with a high precision. Chinese Academy of Sciences and Guizhou province are in charge of FAST construction. The first light of the telescope was expected on September 25, 2016.

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

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

    2016-01-01

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

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

    Wigglesivorth, John C.

    2003-01-01

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

  2. mapFAST: A FAST Geographic Authorities Mashup with Google Maps

    Rick Bennett

    2011-07-01

    Full Text Available When looking for information about a particular place, it is often useful to check surrounding locations as well. FAST geographic subjects provide clean access points to this material, and a Google Maps mashup allows users to see surrounding locations that are also FAST subjects. Moreover, the Web Service to the underlying data is also open and available for use. The map interface allows for simple selection of a location, with links to enter it directly as a search into either WorldCat.org or Google Books.

  3. Layout and Routing Methods for Warehouses

    K.J. Roodbergen (Kees-Jan)

    2001-01-01

    textabstractLayout and Routing Methods for Warehouses discusses aspects of order picking in warehouses. Order picking is the process by which products are retrieved from storage to meet customer demand. Various new routing methods are introduced to determine efficient sequences in which products hav

  4. Routing in Optical and Stochastic Networks

    Yang, S.

    2015-01-01

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

  5. Classification of Dynamic Vehicle Routing Systems

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

    2007-01-01

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

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

  7. Joint Route Planning under Varying Market Conditions

    Cruijssen, F.C.A.M.; Braysy, O.; Dullaert, W.; Fleuren, H.A.; Salomon, M.

    2006-01-01

    Purpose - To provide empirical evidence on the level of savings that can be attained by joint route planning and how these savings depend on specific market characteristics.Design/methodology/approach - Joint route planning is a measure that companies can take to decrease the costs of their distribu

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

  9. Performance Evaluation of Routing Protocols in MANET

    Smitha Sunny

    2015-01-01

    Full Text Available Mobile Ad-Hoc Network (MANET is an autonomous system that is composed of the mobile nodes which communicates through wireless links without any preexisting infrastructure. MANET is a collection of mobile nodes which can self-organize freely and dynamically into arbitrary and temporary network topologies. Mobile nodes in ad-hoc networks function as a router and can dynamically establish routes among themselves by means of a routing protocol. Routing protocols in mobile ad-hoc network helps node to send and receive packets. Therefore, selection of an appropriate routing protocol is an integral part of establishing a MANET. A suitable and effective routing mechanism helps to extend the successful deployment of mobile ad-hoc networks. An attempt has been made to compare the performance between on-demand reactive routing protocols namely AODV, DSR and proactive routing protocol namely DSDV for Constant Bit Rate (CBR traffic by varying network scope i.e. number of participating nodes as well as by varying the speed. The parameters used for evaluation are Packet delivery ratio (PDR, Normalized routing overhead, Average end to end delay (Delay, Throughput and Average Energy consumption. The simulations are carried out using Network Simulator NS2:34.

  10. Optimizing departure times in vehicle routes

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

    2011-01-01

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

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

  12. On green routing and scheduling problem

    Touati, Nora

    2012-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

  13. On green routing and scheduling problem

    Touati, Nora; Jost, Vincent

    2011-01-01

    The vehicle routing and scheduling problem has been studied with much interest within the last four decades. In this paper, some of the existing literature dealing with routing and scheduling problems with environmental issues is reviewed, and a description is provided of the problems that have been investigated and how they are treated using combinatorial optimization tools.

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

  15. Calorie count - Fast food

    ... your diet. Yet sometimes you may need the convenience of fast food. You do not have to ... ADAM Health Solutions. About MedlinePlus Site Map FAQs Customer Support Get email updates Subscribe to RSS Follow ...

  16. FAST joins Breakthrough programme

    Banks, Michael

    2016-11-01

    The 180m Five-hundred-meter Aperture Spherical radio Telescope (FAST) - the world's largest single-aperture radio receiver - has become part of the Breakthrough Listen programme, which launched in July 2015 to look for intelligent life beyond Earth.

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

  18. Integrated Routing Protocol for Opportunistic Networks

    Verma, Anshul

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

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

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

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

  2. FDA-Approved Natural Polymers for Fast Dissolving Tablets.

    Alam, Md Tausif; Parvez, Nayyar; Sharma, Pramod Kumar

    2014-01-01

    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.

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

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

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

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

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

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

  9. Location and Routing of the Defense Courier Service Aerial Network

    1991-03-01

    The Vehicle Routing Problem ................ 8 Vehicle Routing Problem Modifications ...... .0 Multiple Depot Problems...several specific formulations are applicable to the DCS aerial network. Those addressed in this review include: 1) the Vehicle Routing Problem (VRP); 2...methodologies show great promise for adaptation to the DCS network. The Vehicle Routing Problem The Travelling Salesman Problem seeks the shortest route which

  10. Clustering in ICT: From Route 128 to Silicon Valley, from DEC to Google, from Hardware to Content

    W. Hulsink (Wim); D. Manuel; H. Bouwman (Harry)

    2007-01-01

    textabstractOne of the pioneers in academic entrepreneurship and high-tech clustering is MIT and the Route 128/Boston region. Silicon Valley centered around Stanford University was originally a fast follower and only later emerged as a scientific and industrial hotspot. Several technology and innova

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

  12. Guard Sets for Onion Routing

    Hayes Jamie

    2015-06-01

    Full Text Available “Entry” guards protect the Tor onion routing system from variants of the “predecessor” attack, that would allow an adversary with control of a fraction of routers to eventually de-anonymize some users. Research has however shown the three guard scheme has drawbacks and Dingledine et al. proposed in 2014 for each user to have a single long-term guard. We first show that such a guard selection strategy would be optimal if the Tor network was failure-free and static. However under realistic failure conditions the one guard proposal still suffers from the classic fingerprinting attacks, uniquely identifying users. Furthermore, under dynamic network conditions using single guards offer smaller anonymity sets to users of fresh guards. We propose and analyze an alternative guard selection scheme by way of grouping guards together to form shared guard sets. We compare the security and performance of guard sets with the three guard scheme and the one guard proposal. We show guard sets do provide increased resistance to a number of attacks, while foreseeing no significant degradation in performance or bandwidth utilization.

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

  14. Chain Routing: A new routing framework for the Internet based on complete orders

    Arjona-Villicaña, P David; Stepanenko, Alexander S

    2009-01-01

    A new framework to perform routing at the Autonomous System level is proposed in this paper. This mechanism, called Chain Routing, uses complete orders as its main topological unit, which enables a group of Autonomous Systems to define an acyclic structure to route packets to a destination. The employment of complete orders also allows easy identification and avoidance of persistent route oscillations, eliminates the possibility of developing transient loops in paths, and provides a structure that facilitates the implementation of traffic engineering. Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we surmise it is possible to design a new routing protocol which could be more reliable and stable than BGP. Although Chain Routing will require an increase of the message overhead and greater coordination between network administrators, the rewards in stability and resilience should more than compensate for this effort.

  15. Update on Instrumentations for Cholecystectomies Performed via Transvaginal Route: State of the Art and Future Prospectives

    Elia Pulvirenti

    2010-01-01

    Full Text Available Natural Orifice Transluminal Endoscopic Surgery (NOTES is an innovative approach in which a flexible endoscope enters the abdominal cavity via the transesophageal, transgastric, transcolonic, transvaginal or transvescical route, combining the technique of minimally invasive surgery with flexible endoscopy. Several groups have described different modifications by using flexible endoscopes with different levels of laparoscopic assistance. Transvaginal cholecystectomy (TVC consists in accessing the abdominal cavity through a posterior colpotomy and using the vaginal incision as a visual or operative port. An increasing interest has arisen around the TVC; nevertheless, the most common and highlighted concern is about the lack of specific instruments dedicated to the vaginal access route. TVC should be distinguished between “pure”, in which the entire operation is performed through the transvaginal route, and “hybrid”, in which the colpotomy represents only a support to introduce instruments and the operation is performed mainly by the classic transabdominal-introduced instruments. Although this new technique seems very appealing for patients, on the other hand it is very challenging for the surgeon because of the difficulties related to the mode of access, the limited technology currently available and the risk of complications related to the organ utilized for access. In this brief review all the most recent advancements in the field of TVC's techniques and instrumentations are listed and discussed.

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

  17. Route Optimization for the Distribution Network of a Confectionary Chain

    Anıl İnanlı

    2015-12-01

    Full Text Available This study considers the distribution network of a well-known perishable food manufacturer and its franchises in Turkey. As the countrywide number of stores is increasing fast, the company is facing problems due to its central distribution of products from a single factory. The objective is to decrease the cost of transportation while maintaining a high level of customer satisfaction. Hence, the focus is on the vehicle routing problem (VRP of this large franchise chain within each city. The problem is defined as a rich VRP with heterogeneous fleet, site-dependent and compartmentalized vehicles, and soft/hard time windows. This NP-hard problem is modelled and tried with real data on a commercial solver. A basic heuristic procedure which can be used easily by the decision makers is also employed for obtaining quick and high-quality solutions for large instances.

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

  19. World Wide Access: Accessible Web Design.

    Washington Univ., Seattle.

    This brief paper considers the application of "universal design" principles to Web page design in order to increase accessibility for people with disabilities. Suggestions are based on the World Wide Web Consortium's accessibility initiative, which has proposed guidelines for all Web authors and federal government standards. Seven guidelines for…

  20. Access Nets: Modeling Access to Physical Spaces

    Frohardt, Robert; Chang, Bor-Yuh Evan; Sankaranarayanan, Sriram

    Electronic, software-managed mechanisms using, for example, radio-frequency identification (RFID) cards, enable great flexibility in specifying access control policies to physical spaces. For example, access rights may vary based on time of day or could differ in normal versus emergency situations. With such fine-grained control, understanding and reasoning about what a policy permits becomes surprisingly difficult requiring knowledge of permission levels, spatial layout, and time. In this paper, we present a formal modeling framework, called AccessNets, suitable for describing a combination of access permissions, physical spaces, and temporal constraints. Furthermore, we provide evidence that model checking techniques are effective in reasoning about physical access control policies. We describe our results from a tool that uses reachability analysis to validate security policies.

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

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

  3. Vascular Access Procedures

    ... benefits vs. risks? Benefits A central catheter permits infusion of solutions containing medication or nutritional substances without ... products may be given by this route, including antibiotics and blood products. The catheter also may be ...

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

  5. Steganographic Routing in Multi Agent System Environment

    Szczypiorski, Krzysztof; Mazurczyk, Wojciech

    2008-01-01

    In this paper we present an idea of trusted communication platform for Multi-Agent Systems (MAS) called TrustMAS. Based on analysis of routing protocols suitable for MAS we have designed a new proactive hidden routing. Proposed steg-agents discovery procedure, as well as further routes updates and hidden communication, are cryptographically independent. Steganographic exchange can cover heterogeneous and geographically outlying environments using available cross-layer covert channels. Finally we have specified rules that agents have to follow to benefit the TrustMAS distributed router platform.

  6. Traffic Performance Analysis of Manet Routing Protocol

    Rajeswari, S; 10.5121/ijdps.2011.2306

    2011-01-01

    The primary objective of this research work is to study and investigate the performance measures of Gossip Routing protocol and Energy Efficient and Reliable Adaptive Gossip routing protocols. We use TCP and CBR based traffic models to analyze the performance of above mentioned protocols based on the parameters of Packet Delivery Ratio, Average End-to-End Delay and Throughput. We will investigate the effect of change in the simulation time and Number of nodes for the MANET routing protocols. For Simulation, we have used ns-2 simulator.

  7. On line routing per mobile phone

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

    2009-01-01

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

  8. Analysis of Enhanced Associativity Based Routing Protocol

    Said A. Shaar

    2006-01-01

    Full Text Available This study introduces an analysis to the performance of the Enhanced Associativity Based Routing protocol (EABR based on two factors; Operation complexity (OC and Communication Complexity (CC. OC can be defined as the number of steps required in performing a protocol operation, while CC can be defined as the number of messages exchanged in performing a protocol operation[1]. The values represent the worst-case analysis. The EABR has been analyzed based on CC and OC and the results have been compared with another routing technique called ABR. The results have shown that EABR can perform better than ABR in many circumstances during the route reconstruction.

  9. Pheromone Static Routing Strategy for Complex Networks

    Ling, Xiang; Jiang, Rui; Hu, Mao-Bin

    2011-01-01

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

  10. Multimedia Traffic Routing in Multilayer WDM Networks

    Amphawan, Angela; Hasan, Hassanuddin

    2012-01-01

    The advent of real-time multimedia services over the Internet has stimulated new technologies for expanding the information carrying capacity of optical network backbones. Multilayer wavelength division multiplexing (WDM) packet switching is an emerging technology for increasing the bandwidth of optical networks. Two algorithms for the routing of the multimedia traffic flows were applied: (i) Capacitated Shortest Path First (CSPF) routing, which minimizes the distance of each flow linking the given source and destination nodes and satisfying capacity constraints; and (ii) Flow Deviation Algorithm (FDA) routing, which minimizes the network?wide average packet delay.

  11. Stability Analysis of Path-vector Routing

    Dimitri, Papadimitriou

    2012-01-01

    Most studies on path-vector routing stability have been conducted empirically by means of ad-hoc analysis of BGP data traces. None of them consider prior specification of an analytic method including the use of stability measurement metrics for the systematic analysis of BGP traces and associated meta-processing for determining the local state of the routing system. In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing such as BGP (Border Gateway Protocol). By means of these stability metrics, we propose a method to analyze the effects of BGP policy- and protocol-induced instability on local routers.

  12. Analysis of Path-vector Routing Stability

    Dimitri, Papadimitriou

    2012-01-01

    Most studies on path-vector routing stability have been conducted empirically by means of ad-hoc analysis of BGP data traces. None of them consider prior specification of an analytic method including the use of stability measurement metrics for the systematic analysis of BGP traces and associated meta-processing for determining the local state of the routing system. In this paper, we define a set of metrics that characterize the local stability properties of path-vector routing such as BGP (Border Gateway Protocol). By means of these stability metrics, we propose a method to analyze the effects of BGP policy- and protocol-induced instability on local routers.

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

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

  15. Novel Routing Protocol Based on Periodic Route Discovery for Mobile Adhoc Networks

    V.Jai KumarAssociate

    2016-12-01

    Full Text Available A group of mobile devices called as nodes, without any centralized network, communicates with each other over multi-hop links is called as an Ad-hoc Network (MANET. The military battle-field scenarios, Post-disaster rescue efforts, sensor networks, and entrepreneurs in a conference are some of the examples of mobile ad-hoc networks. Since there is no infrastructure in the network, the routing should be handled at every node. To improve the life time of network different routing protocols are consider. In present routing protocols of ad hoc networks, routing is an act of moving information from a source to destination in an internetwork. Route is selected in the route discovery phase until all the packets are sent out. Due to the continuous flow of packets in a selected route leads to the route failure. In order to reduce this problem we consider PRD-based MMBCR and considering the percentage of the optimum value for periodic route discovery. In our research we are going to analyze the performance of different routing protocols like DSR, MMBCR to get maximum optimum value using Network Simulator Software.

  16. VANET Routing Replay Attack Detection Research Based on SVM

    Fan Qing Gang; Wang Li; Cai Yan Ning; Li Yong Qiang; Chen Jing

    2016-01-01

    In the process of establishing routing in VANET, because of the interference of routing request (RREQ) and routing response (RREP), the nodes in the network are busy with looking for routing or establishing routing. The impact on the network performance is extremely serious, such as increasing a lot of network overhead, consuming valuable bandwidth resources. In this paper, the influence of routing replay attack in VANET is studied. Four typical characteristic are extracted by “cross layer” s...

  17. An Enhanced Route Recovery Protocol for Mobile Ad Hoc Networks

    Kim, Sangkyung; Park, Noyeul; Kim, Changhwa; Choi, Seung-Sik

    In case of link failures, many ad hoc routing protocols recover a route by employing source-initiated route re-discovery, but this approach can degrade system performance. Some use localized route recovery, which may yield non-optimal paths. Our proposal provides a mechanism that can enhance the overall routing performance by initiating route recovery at the destination node. We elucidate the effects through simulations including comparisons with AODV and AODV with local repair.

  18. Modify AODV Routing Protocol to Improve Motorway Surveillance System Performance

    Layth Abdulkareem Hassnawi; R. Badlishah Ahmad; Abid Yahya

    2012-01-01

    This paper presents an algorithm to modify the Ad Hoc On-Demand Distance Vector (AODV) routing protocol in order to improve the routing performance in motorway surveillance systems. The proposed protocol has all the characteristics of the original AODV routing protocol since it follows all the steps of the route discovery and route maintenance mechanism of the original AODV routing protocol. The Modified AODV (MAODV) is different from the original AODV protocol in that it modifies the origina...

  19. FastStats: Diabetes

    ... Whooping Cough or Pertussis Family Life Marriage and Divorce Health Care and Insurance Access to Health Care ... Inflicted Injury Life Stages and Populations Age Groups Adolescent Health Child Health Infant Health Older Persons' Health ...

  20. FastStats: Immunization

    ... Whooping Cough or Pertussis Family Life Marriage and Divorce Health Care and Insurance Access to Health Care ... Inflicted Injury Life Stages and Populations Age Groups Adolescent Health Child Health Infant Health Older Persons' Health ...

  1. An Efficient Quality of Service Based Routing Protocol for Mobile Ad Hoc Networks

    Tapan Kumar Godder

    2011-05-01

    Full Text Available Ad-hoc network is set up with multiple wireless devices without any infrastructure. Its employment is favored in many environments. Quality of Service (QoS is one of the main issues for any network and due to bandwidth constraint and dynamic topology of mobile ad hoc networks, supporting Quality of Service (QoS is extremely a challenging task. It is modeled as a multi-layer problem and is considered in both Medium Access Control (MAC and routing layers for ad hoc networks. Ad-hoc On-demand Distance Vector (AODV routing protocol is one of the most used and popular reactive routing protocols in ad-hoc networks. This paper proposed a new protocol QoS based AODV (QAODV which is a modified version of AODV.

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

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

    Abdulaziz Al-Nahari

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

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

  5. A fast friend

    高怡

    2010-01-01

    我们都知道fast food的意思是“快餐”。那fast friend能解释为“快速或速成的朋友”吗?也许你会说:“什么是速成朋友呀?It doesn’t make sense.”没错,交朋友怎么会有速成的呢?原来;fast还有一个意思是“忠实的、牢固的”,所以a fast friend的真正意思是“可靠、忠实的朋友”。

  6. The fast code

    Freeman, L.N.; Wilson, R.E. [Oregon State Univ., Dept. of Mechanical Engineering, Corvallis, OR (United States)

    1996-09-01

    The FAST Code which is capable of determining structural loads on a flexible, teetering, horizontal axis wind turbine is described and comparisons of calculated loads with test data are given at two wind speeds for the ESI-80. The FAST Code models a two-bladed HAWT with degrees of freedom for blade bending, teeter, drive train flexibility, yaw, and windwise and crosswind tower motion. The code allows blade dimensions, stiffnesses, and weights to differ and models tower shadow, wind shear, and turbulence. Additionally, dynamic stall is included as are delta-3 and an underslung rotor. Load comparisons are made with ESI-80 test data in the form of power spectral density, rainflow counting, occurrence histograms, and azimuth averaged bin plots. It is concluded that agreement between the FAST Code and test results is good. (au)

  7. Metagenomics: an inexhaustible access to nature's diversity.

    Langer, Martin; Gabor, Esther M; Liebeton, Klaus; Meurer, Guido; Niehaus, Frank; Schulze, Renate; Eck, Jürgen; Lorenz, Patrick

    2006-01-01

    The chemical industry has an enormous need for innovation. To save resources, energy and time, currently more and more established chemical processes are being switched to biotechnological routes. This requires white biotechnology to discover and develop novel enzymes, biocatalysts and applications. Due to a limitation in the cultivability of microbes living in certain habitats, technologies have to be established which give access to the enormous resource of uncultivated microbial diversity. Metagenomics promises to provide new and diverse enzymes and biocatalysts as well as bioactive molecules and has the potential to make industrial biotechnology an economic, sustainable success.

  8. Fast ejendom II

    Munk-Hansen, Carsten

    Fremstillingen påviser, at lov om forbrugerbeskyttelse ved erhvervelse af fast ejendom mv. lider af en række svagheder og at ankenævnspraksis bevæger sig væk fra retspraksis på en række områder.......Fremstillingen påviser, at lov om forbrugerbeskyttelse ved erhvervelse af fast ejendom mv. lider af en række svagheder og at ankenævnspraksis bevæger sig væk fra retspraksis på en række områder....

  9. Moms og fast ejendom

    Edlund, Hans Henrik

    1999-01-01

    I artiklen gives et overblik over, hvorledes fast ejendom behandles momsmæssigt. Derfor findes en kort skitsering af reglerne for moms på byggearbejder, afgrænsningen mellem momspligtig og momsfri udlejning, muligheden for frivillig registrering af udlejning samt opgørelse af reguleringsforpligte......I artiklen gives et overblik over, hvorledes fast ejendom behandles momsmæssigt. Derfor findes en kort skitsering af reglerne for moms på byggearbejder, afgrænsningen mellem momspligtig og momsfri udlejning, muligheden for frivillig registrering af udlejning samt opgørelse af...

  10. Fast Josephson vortex

    Malishevskii, A.S.; Silin, V.P.; Uryupin, S.A

    2002-12-30

    For the magnetically coupled waveguide and long Josephson junction we gave the analytic description of two separate velocity domains where the free motion of traveling vortex (2{pi}-kink) exists. The role of the mutual influence of waveguide and long Josephson junction is discussed. It is shown the possibility of the fast vortex motion with the velocity much larger than Swihart velocity of Josephson junction and close to the speed of light in the waveguide. The excitation of motion of such fast Josephson vortex is described.

  11. ATLAS fast physics monitoring

    Karsten Köneke; on behalf of the ATLAS Collaboration

    2012-11-01

    The ATLAS experiment at the Large Hadron Collider is recording data from proton–proton collisions at a centre-of-mass energy of 7 TeV since the spring of 2010. The integrated luminosity has grown nearly exponentially since then and continues to rise fast. The ATLAS Collaboration has set up a framework to automatically process the rapidly growing dataset and produce performance and physics plots for the most interesting analyses. The system is designed to give fast feedback. The histograms are produced within hours of data reconstruction (2–3 days after data taking). Hints of potentially interesting physics signals obtained this way are followed up by physics groups.

  12. Ad Hoc Access Gateway Selection Algorithm

    Jie, Liu

    With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

  13. Performance Evaluation of MANET Routing Protocols

    Hrituparna Paul

    2012-07-01

    Full Text Available The task of finding and sustaining routes in Mobile Ad-hoc Networks (MANETS is an important factor in determining the efficiency of any MANET protocol. MANET characteristically is an autonomous system of mobile nodes connected by wireless links without any centralised infrastructure. Absence of fixed infrastructures and host mobility thus network may experience rapid and unpredictable topology changes. Hence, routing is required in order to perform communication among the entire network. There are several routing protocols namely proactive, reactive and hybrid etc. In this paper we will discuss the active research work on these routing protocols and its performance evaluation. To this end, we adopt a simulation approach, which is more suitable to this kind of analysis

  14. Pharmacokinetics of Alternative Administration Routes of Melatonin

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

    2016-01-01

    BACKGROUND: Melatonin is traditionally administered orally but has a poor and variable bioavailability. This study aims to present an overview of studies investigating the pharmacokinetics of alternative administration routes of melatonin. METHODS: A systematic literature search was performed...... and included experimental or clinical studies, investigating pharmacokinetics of alternative administration routes of melatonin in vivo. Alternative administration routes were defined as all administration routes except oral and intravenous. RESULTS: 10 studies were included in the review. Intranasal...... administration exhibited a quick absorption rate and high bioavailability. Transdermal administration displayed a variable absorption rate and possible deposition of melatonin in the skin. Oral transmucosal administration of melatonin exhibited a high plasma concentration compared to oral administration...

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

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

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

  18. Recommended Cross-Desert Driving Route

    2004-01-01

    Beijing - Duolun - Dalai Nur- Hexigten Banner -Saihanba - Weichang - Luanping - Miyun - Beijing. Along this 1,600-kilometer route is a 150-kin section(between Duolun and Darhan) of desert with no surfaced road - a paradise for desert drivers.

  19. A new routing assignment model for Internet

    2001-01-01

    This paper builds a new traffic assignment model for Internet. The routing policy based on this model can realize load splitting in a network automatically, which overcomes the shortcoming of OSPF and satisfies the load balancing requirement of IETF.

  20. Latent factors and route choice behaviour

    Prato, Carlo Giacomo

    . 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...... by proposing a methodology for collecting and analyzing behavioural indicators and modelling route choices of individuals driving habitually from home to their workplace. A web-based survey was designed to collect attitudinal data and observed route choices among faculty and staff members of Turin Polytechnic...... 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...

  1. Rich Vehicle Routing Problems and Applications

    Wen, Min

    the company’s solution in terms of all the objectives, including the travel time, customer waiting and daily workload balances, under the given constraints considered in the work. Finally, we address an integrated vehicle routing and driver scheduling problem, in which a large number of practical constraints......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...... given to various extensions of the VRP that arise in real life. These extensions are often called Rich Vehicle Routing Problems (RVRPs). In contrast to the research of classical VRP that focuses on the idealized models with unrealistic assumptions, the research of RVRPs considers those complicated...

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

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

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

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

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

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

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

  9. 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 have a steady power supply. Protocol optimizations for the nomadic scenario are presented and validated through simulations...

  10. Light olefins - challenges from new production routes?

    Zimmermann, H. [Linde Engineering, Pullach (Germany)

    2007-07-01

    Light Olefins are the building blocks for many modern plastic products and are produced in large quantities. Driven by high crude oil prices, production is shifted to regions with low cost raw materials. Alternatives to the traditional production from Naphta, AGO and other crude products are becoming attractive. This paper evaluates several methods Ethylene and Pro-pylene production economically and also the regional advantageous routes. The analysis includes Steamcracking, dehydrogenation, dehydration of Ethanol, Methanol based routes and olefin conversion by Metathesis. (orig.)

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

  12. Genetic algorithm to solve constrained routing problem with applications for cruise missile routing

    Latourell, James L.; Wallet, Bradley C.; Copeland, Bruce

    1998-03-01

    In this paper the use of a Genetic Algorithm to solve a constrained vehicle routing problem is explored. The problem is two-dimensional with obstacles represented as ellipses of uncertainty surrounding each obstacle point. A route is defined as a series of points through which the vehicle sequentially travels from the starting point to the ending point. The physical constraints of total route length and maximum turn angle are included and appear in the fitness function. In order to be valid, a route must go from start to finish without violating any constraint. The effects that different mutation rates and population sizes have on the algorithm's computation speed and ability to find a high quality route are also explored. Finally, possible applications of this algorithm to the problem of route planning for cruise missiles are discussed.

  13. FRBCAT: The Fast Radio Burst Catalogue

    Petroff, E.; Barr, E. D.; Jameson, A.; Keane, E. F.; Bailes, M.; Kramer, M.; Morello, V.; Tabbara, D.; van Straten, W.

    2016-09-01

    Here, we present a catalogue of known Fast Radio Burst sources in the form of an online catalogue, FRBCAT. The catalogue includes information about the instrumentation used for the observations for each detected burst, the measured quantities from each observation, and model-dependent quantities derived from observed quantities. To aid in consistent comparisons of burst properties such as width and signal-to-noise ratios, we have re-processed all the bursts for which we have access to the raw data, with software which we make available. The originally derived properties are also listed for comparison. The catalogue is hosted online as a Mysql database which can also be downloaded in tabular or plain text format for off-line use. This database will be maintained for use by the community for studies of the Fast Radio Burst population as it grows.

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

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

  16. Challenges and Future Prospects for the Delivery of Biologics: Oral Mucosal, Pulmonary, and Transdermal Routes.

    Morales, Javier O; Fathe, Kristin R; Brunaugh, Ashlee; Ferrati, Silvia; Li, Song; Montenegro-Nicolini, Miguel; Mousavikhamene, Zeynab; McConville, Jason T; Prausnitz, Mark R; Smyth, Hugh D C

    2017-02-13

    Biologic products are large molecules such as proteins, peptides, nucleic acids, etc., which have already produced many new drugs for clinical use in the last decades. Due to the inherent challenges faced by biologics after oral administration (e.g., acidic stomach pH, digestive enzymes, and limited permeation through the gastrointestinal tract), several alternative routes of administration have been investigated to enable sufficient drug absorption into systemic circulation. This review describes the buccal, sublingual, pulmonary, and transdermal routes of administration for biologics with relevant details of the respective barriers. While all these routes avoid transit through the gastrointestinal tract, each has its own strengths and weaknesses that may be optimal for specific classes of compounds. Buccal and sublingual delivery enable rapid drug uptake through a relatively permeable barrier but are limited by small epithelial surface area, stratified epithelia, and the practical complexities of maintaining a drug delivery system in the mouth. Pulmonary delivery accesses the highly permeable and large surface area of the alveolar epithelium but must overcome the complexities of safe and effective delivery to the alveoli deep in the lung. Transdermal delivery offers convenient access to the body for extended-release delivery via the skin surface but requires the use of novel devices and formulations to overcome the skin's formidable stratum corneum barrier. New technologies and strategies advanced to overcome these challenges are reviewed, and critical views in future developments of each route are given.

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

  18. Survivable Lightpath Routing in WDM Optical Networks

    LIUFengqing; ZENGQingji; ZHUXu; YANGXudong; XIAOShilin

    2004-01-01

    In IP over WDM networks, when a failure(such as a fiber cut) occurs, the service restoration can be implemented by dynamic routing in IP layer. But it needs that the logical topology remains connected after any physical link failure. Otherwise, IP layer cannot find an alternate path to restore the service. The problem of routing logical links (lightpaths) on a physical network topology in a way that the logical topology remains connected in the event of single physical link failure is called survivabl erouting. In this paper~ we address the survivable routing problem by proposing a new ILP algorithm that works well with sparse-connected logical topologies. The necessary and sufficient conditions for survivable routing are simplified, which greatly reduces the number of survivable constraints. Based-on the simplified conditions, a new ILP formulation with K-shortest paths as alternate paths for a logical link is presented, which mainly reduces the number of ILP variables. Finally, numerical results are given and discussed to show that most survivable routing solutions can be found with our algorithms, and the time needed to find such a survivable routing solution is much smaller than other similar methods.

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

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

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

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

    2003-01-01

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

  2. Deflection routing in slotted self-routing networks with arbitrary topology

    2002-01-01

    A deflection routing algorithm that can be applied to a novel self-routing address scheme for networks with arbitrary topology is proposed. The proposed deflection routing algorithm can be implemented all-optically using bitwise optical logic gates. Besides the primary output link selection, alternate output link choices by a packet at each node in case of deflection are also encoded in the address header. Priority classes can also be defined in the proposed address scheme. The performance of...

  3. Parallel Fast Legendre Transform

    Alves de Inda, M.; Bisseling, R.H.; Maslen, D.K.

    2001-01-01

    We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were implemente

  4. Handel med fast ejendom

    Edlund, Hans Henrik

    Bogen tilstræber at give et overblik over nogle af de vigtigste generelle problemområder på markedet for ejendomshandel, der jo bliver mere og mere kompliceret. Værket er opdelt i følgende hovedafsnit: Ejendomsbegrebet. Indgåelse af aftale om salg af fast ejendom. Begrænsninger i adgangen til...

  5. Not so fast

    Marras, Stefano; Noda, Takuji; Steffensen, John Fleng

    2015-01-01

    , it is an open question whether such supposedly very fast swimmers do use high-speed bursts when feeding on evasive prey, in addition to using their bill for slashing prey. Here, we measured the swimming behavior of sailfish by using high-frequency accelerometry and high-speed video observations during predator...

  6. Fast Passenger Tracks Network

    2008-01-01

    China’s fast passenger tracks network consists of four parts:express rail- way with speeds between 300km/h and 350 kin/h,passenger rail lines with speeds between 200 km/h and 250 km/h,intercity high-speed railways that run

  7. Tachycardia | Fast Heart Rate

    ... SA) node --- the heart's natural pacemaker - sends out electrical signals faster than usual. The heart rate is fast, but the heart beats properly. Causes of sinus tachycardia A rapid heartbeat may be your body's response to common conditions such as: Fever Anxiety ...

  8. Fast food tips

    ... Order smaller servings when you can. Split some fast-food items to reduce calories and fat. Ask for a "doggy bag." You can also leave the extra food on your plate. Your food choices can teach your children how to eat healthy, too. Choosing a variety ...

  9. Fast Fourier Orthogonalization

    Ducas, L.; Prest, T.; Abramov, S.A.; Zima, E.V.; Gao, X-S.

    2016-01-01

    The classical fast Fourier transform (FFT) allows to compute in quasi-linear time the product of two polynomials, in the {\\em circular convolution ring} R[x]/(x^d−1) --- a task that naively requires quadratic time. Equivalently, it allows to accelerate matrix-vector products when the matrix is *circ

  10. Performance of Fast AMC in E-UTRAN Uplink

    Rosa, Claudio; López Villa, Dimas; Úbeda Castellanos, Carlos

    2008-01-01

    Evolved (E-) UTRA is currently being standardized as a long term evolution (LTE) of the 3GPP radio access technology. One of the goals of E-UTRA is to achieve 2-4 times the spectral efficiency and user throughputs compared to HSUPA/HSDPA [1]. Support for fast link adaptation based on adaptive mod...

  11. Region Based Route Planning: Multi-Abstraction Route Planning Based On Intermediate Level Vision Processing

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

    1989-01-01

    The Region Based Route Planner performs intermediate-level and high-level processing on vision data to organize the image into more meaningful higher-level topological representations. A variety of representations are employed at appropriate stages in the route plan-ning process. A variety of abstractions are used for the purposes of problem reduction and application of multiple criteria at different phases during the navigation planning process. The Region Based Route Planner operates in terrain scenarios where some or most of the terrain is occluded. The Region Based Route Planner operates without any priori maps. The route planner uses two dimensional representations and utilizes gradient and roughness information. The implementation described here is being tested on the JPL Robotic Vehicle. The Region Based Route Planner operates in two phases. In the first phase, the terrain map is segmented to derive global information about various features in it. The next phase is the actual route planning phase. The route is planned with increasing amounts of detail by successive refinement. This phase has three abstrac-tions. In the first abstraction, the planner analyses high level information and so a coarse, region-to-region plan is produced. The second abstraction produces a list of pairs of entry and exit waypoints for only these selected regions. In the last abstraction, for every pair of these waypoints, a local route planner is invoked. This planner finds a detailed point-to-point path by searching only within the boundaries of these relatively small regions.

  12. The Edge Set Cost of the Vehicle Routing Problem with Time Windows

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

    2016-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...... results show that instances with up to 40 customers can be solved in a reasonable time, and that the branch-cut-and-price algorithm generally outperforms CPLEX....

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

  14. A novel synthetic route for 2-[2-(2,2,2-trifluoroethoxy)phenoxy] ethanamine

    Xiao Chuan Luo; Guo Hua Chen; Hui Bin Zhang; Wen Long Huang

    2008-01-01

    2-[2-(2,2,2-Trifluoroethoxy)phenoxy]ethanamine is the key intermediate of Silodosin, the α1-adrenoceptor antagonist for thetreatment of benign prostatic hyperplasia. In order to obtain this intermediate, we developed a novel synthetic route by utilizing 2-nitrochlorobenzene as the starting material via O-alkylation, reduction, diazotization, acidolysis, etherification, condensation andhydrazinolysis. The highlight of this method lies on its convenience and economy in accessing this intermediate.

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

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

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

  18. Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks

    Jacquet, Philippe; Naimi, Amina Meraihi; Rodolakis, Georgios

    2005-01-01

    International audience; In this paper we show that the CSMA IEEE 802.11 protocol (Wifi) provides packet access delays asymptotics in power law. This very feature allows us to specify optimal routing via polynomial algorithm while the general case is NP-hard.

  19. An efficient geo-routing aware MAC protocol for underwater acoustic networks

    Yibo Zhu

    2011-09-01

    Full Text Available In this paper, we propose an efficient geo-routing aware MAC protocol (GOAL for underwater acoustic networks. It smoothly integrates self-adaptation based REQ/REP handshake, geographic cyber carrier sensing, and implicit ACK to perform combined channel reservation and next-hop selection. As a result, it incorporates the advantages of both a geo-routing protocol and a reservation-based medium access control (MAC protocol. Specifically, with its self-adaptation based REQ/REP, nodes can dynamically detect the best next-hop with low route discovery cost. In addition, through geographic cyber carrier sensing, a node can map its neighbors’ time slots for sending/receiving DATA packets to its own time line, which allows the collision among data packets to be greatly reduced. With these features, GOAL outperforms geo-routing protocols coupling with broadcast MAC. Simulation results show that GOAL provides much higher end-to-end reliability with lower energy consumptions than existing Vector-Based Forwarding (VBF routing with use of a broadcast MAC protocol. Moreover, we develop a theoretical model for the probability of a successful handshake, which coincides well with the simulation results.

  20. Isochoric Implosions for Fast Ignition

    Clark, D S; Tabak, M

    2007-04-04

    Various gain models have shown the potentially great advantages of Fast Ignition (FI) Inertial Confinement Fusion (ICF) over its conventional hot spot ignition counterpart [e.g., S. Atzeni, Phys. Plasmas 6, 3316 (1999); M. Tabak et al., Fusion Sci. & Technology 49, 254 (2006)]. These gain models, however, all assume nearly uniform-density fuel assemblies. In contrast, conventional ICF implosions yield hollowed fuel assemblies with a high-density shell of fuel surrounding a low-density, high-pressure hot spot. Hence, to realize fully the advantages of FI, an alternative implosion design must be found which yields nearly isochoric fuel assemblies without substantial hot spots. Here, it is shown that a self-similar spherical implosion of the type originally studied by Guderley [Luftfahrtforschung 19, 302 (1942)] may be employed to yield precisely such quasi-isochoric imploded states. The difficulty remains, however, of accessing these self-similarly imploding configurations from initial conditions representing an actual ICF target, namely a uniform, solid-density shell at rest. Furthermore, these specialized implosions must be realized for practicable drive parameters and at the scales and energies of interest in ICF. A direct-drive implosion scheme is presented which meets all of these requirements and reaches a nearly isochoric assembled density of 300 g=cm{sup 3} and areal density of 2.4 g=cm{sup 2} using 485 kJ of laser energy.

  1. Direct cervical arterial access for intracranial endovascular treatment

    Blanc, R. [Fondation Rothschild, Department of Interventional Neuroradiology, Paris (France); APHP, Hopital Henri Mondor, Service de Neuroradiologie Diagnostique et Therapeutique, Creteil Cedex (France); Piotin, M.; Mounayer, C.; Spelle, L. [Fondation Rothschild, Department of Interventional Neuroradiology, Paris (France); Moret, J. [Fondation Rothschild, Department of Interventional Neuroradiology, Paris (France); Hopital de la Fondation Ophtalmologique Adolphe de Rothschild, Service de Neuroradiologie Interventionnelle, Paris Cedex 19 (France)

    2006-12-15

    Tortuous vasculature is a cause of failure of endovascular treatment of intracranial vascular lesions. We report our experience of direct cervical accesses in patients in whom the arterial femoral route was not attainable. In this retrospective study, 42 direct punctures of the carotid or the vertebral arteries at the neck were performed in 38 patients. The vessel harboring the intracranial lesion was punctured at the neck above the main tortuosity, a sheath was then positioned under fluoroscopic control to allow a stable access to the intracranial circulation. After the procedure, the sheath was removed and hemostasis was gained either by manual compression or by an arterial closure device (4 of 42, 9%). The cervical route allowed access to all intracranial lesions in all 42 procedures. A complication was encountered in six procedures (14%) related to the direct puncture. In 2 of the 42 procedures (4%), a transient vasospasm was encountered. A cervical hematoma formed in 3 of the 42 procedures (7%) after sheath withdrawal (one patient in whom an 8F sheath had been used, required surgical evacuation of a hematoma compressing the upper airways; the other patients did well without surgical evacuation). In the remaining patient (1 of 42 procedures, 2%), a small asymptomatic aneurysm at the puncture site was seen on the follow-up angiogram. Direct cervical arterial approaches to accessing the intracranial circulation is effective in patients in whom the femoral route does not allow the navigation and stabilization of guiding catheters. (orig.)

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

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

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

  5. On increasing network lifetime in body area networks using global routing with energy consumption balancing.

    Tsouri, Gill R; Prieto, Alvaro; Argade, Nikhil

    2012-09-26

    Global routing protocols in wireless body area networks are considered. Global routing is augmented with a novel link cost function designed to balance energy consumption across the network. The result is a substantial increase in network lifetime at the expense of a marginal increase in energy per bit. Network maintenance requirements are reduced as well, since balancing energy consumption means all batteries need to be serviced at the same time and less frequently. The proposed routing protocol is evaluated using a hardware experimental setup comprising multiple nodes and an access point. The setup is used to assess network architectures, including an on-body access point and an off-body access point with varying number of antennas. Real-time experiments are conducted in indoor environments to assess performance gains. In addition, the setup is used to record channel attenuation data which are then processed in extensive computer simulations providing insight on the effect of protocol parameters on performance. Results demonstrate efficient balancing of energy consumption across all nodes, an average increase of up to 40% in network lifetime corresponding to a modest average increase of 0.4 dB in energy per bit, and a cutoff effect on required transmission power to achieve reliable connectivity.

  6. Allocation and Routing of CRAF MD80 Aircraft

    1990-03-01

    5 II. Literature Review...................7 Formal Statement of the Vehicle Routing Problem ............ .. . .. .. ....... Vehicle...83 Appendix H: Example Vehicle Routing Problem Input 84 Appendix I: Example Vehicle Routing Problem Output 85 Appendix J: Spacefilling Curve...this problem is a stochastic vehicle routing problem with multiple depots. In this case, there are nine depots and 30 vehicles corresponding to nine

  7. Access versus Choice: testing the “food desert” construct in Champaign, IL

    Jerch, Rhiannon L.; Baylis, Katherine R.; Dissanayake,Sahan T. M.

    2013-01-01

    How does one’s food environment affect food purchase decisions? Food access has received significant political and academic attention, particularly under the Obama administration. Existing literature on food access and “food deserts” mainly focuses on geographic distance or the retail of fresh fruits & vegetables versus fast food within a neighborhood to determine and identify inequitable access. In this paper I attempt to develop an endogenous measure of food access by asking how geographic ...

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

    Dessing, D.; Vries, S.I. (Sanne); Hegeman, G.; Mechelen, W. van; Pierik, F.H.

    2016-01-01

    Background: The purpose of this study is to increase our understanding of environmental correlates that are associated with route choice during active transportation to school (ATS) by comparing characteristics of actual walking and cycling routes between home and school with the shortest possible r

  9. Routes to Reading and Spelling: Testing the Predictions of Dual-Route Theory

    Sheriston, Lee; Critten, Sarah; Jones, Emily

    2016-01-01

    Dual-route theory, which emphasizes the importance of lexical and nonlexical routes, makes specific predictions about the kinds of strategies that young students might adopt when attempting to correctly read and spell regular and irregular words. The current study tests these predictions by assessing strategy choice on regular, irregular, and…

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

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

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

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

  12. The Balanced Billing Cycle Vehicle Routing Problem

    Groer, Christopher S [ORNL; Golden, Bruce [University of Maryland; Edward, Wasil [American University

    2009-01-01

    Utility companies typically send their meter readers out each day of the billing cycle in order to determine each customer s usage for the period. Customer churn requires the utility company to periodically remove some customer locations from its meter-reading routes. On the other hand, the addition of new customers and locations requires the utility company to add newstops to the existing routes. A utility that does not adjust its meter-reading routes over time can find itself with inefficient routes and, subsequently, higher meter-reading costs. Furthermore, the utility can end up with certain billing days that require substantially larger meter-reading resources than others. However, remedying this problem is not as simple as it may initially seem. Certain regulatory and customer service considerations can prevent the utility from shifting a customer s billing day by more than a few days in either direction. Thus, the problem of reducing the meterreading costs and balancing the workload can become quite difficult. We describe this Balanced Billing Cycle Vehicle Routing Problem in more detail and develop an algorithm for providing solutions to a slightly simplified version of the problem. Our algorithm uses a combination of heuristics and integer programming via a three-stage algorithm. We discuss the performance of our procedure on a real-world data set.

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

  14. A Packet Routing Model for Computer Networks

    O. Osunade

    2012-05-01

    Full Text Available The quest for reliable data transmission in today’s computer networks and internetworks forms the basis for which routing schemes need be improved upon. The persistent increase in the size of internetwork leads to a dwindling performance of the present routing algorithms which are meant to provide optimal path for forwarding packets from one network to the other. A mathematical and analytical routing model framework is proposed to address the routing needs to a substantial extent. The model provides schemes typical of packet sources, queuing system within a buffer, links and bandwidth allocation and time-based bandwidth generator in routing chunks of packets to their destinations. Principal to the choice of link are such design considerations as least-congested link in a set of links, normalized throughput, mean delay and mean waiting time and the priority of packets in a set of prioritized packets. These performance metrics were targeted and the resultant outcome is a fair, load-balanced network.

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

  16. Routing algorithms in networks-on-chip

    Daneshtalab, Masoud

    2014-01-01

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

  17. PHENIX Fast TOF

    Soha, Aria [Fermi National Accelerator Lab. (FNAL), Batavia, IL (United States); Chiu, Mickey [Brookhaven National Lab. (BNL), Upton, NY (United States); Mannel, Eric [Brookhaven National Lab. (BNL), Upton, NY (United States); Stoll, Sean [Brookhaven National Lab. (BNL), Upton, NY (United States); Lynch, Don [Brookhaven National Lab. (BNL), Upton, NY (United States); Boose, Steve [Brookhaven National Lab. (BNL), Upton, NY (United States); Northacker, Dave [Brookhaven National Lab. (BNL), Upton, NY (United States); Alfred, Marcus [Howard Univ., Washington, DC (United States); Lindesay, James [Howard Univ., Washington, DC (United States); Chujo, Tatsuya [Univ. of Tsukuba (Japan); Inaba, Motoi [Univ. of Tsukuba (Japan); Nonaka, Toshihiro [Univ. of Tsukuba (Japan); Sato, Wataru [Univ. of Tsukuba (Japan); Sakatani, Ikumi [Univ. of Tsukuba (Japan); Hirano, Masahiro [Univ. of Tsukuba (Japan); Choi, Ihnjea [Univ. of Illinois, Urbana-Champaign, IL (United States)

    2014-01-15

    This is a technical scope of work (TSW) between the Fermi National Accelerator Laboratory (Fermilab) and the experimenters of PHENIX Fast TOF group who have committed to participate in beam tests to be carried out during the FY2014 Fermilab Test Beam Facility program. The goals for this test beam experiment are to verify the timing performance of the two types of time-of-flight detector prototypes.

  18. Fast Air Temperature Sensors

    Hendricks, Elbert

    1998-01-01

    The note documents briefly work done on a newly developed sensor for making fast temperature measurements on the air flow in the intake ports of an SI engine and in the EGR input line. The work reviewed has been carried out in close cooperation with Civ. Ing. Michael Føns, the author (IAU......) and Spencer C. Sorenson (ET). The theory which decribes in detail the overall dynamic chracteristics of the sensor was developed at IAU, DTU....

  19. Beyond Fast Mapping

    Carey, Susan

    2010-01-01

    Since the seminal 1957 studies of word learning by Roger Brown, most experimental studies of lexical acquisition have concerned fast mapping: the process through which a new lexical entry is established, and through which representations of the linguistic context of a newly heard word interact with representations of its nonlinguistic context to fix an initial partial meaning. Here I focus on the subsequent extended process through which the adult meaning is approximated. Two factors lead to ...

  20. ADT fast losses MD

    Priebe, A; Dehning, B; Redaelli, S; Salvachua Ferrando, BM; Sapinski, M; Solfaroli Camillocci, M; Valuch, D

    2013-01-01

    The fast beam losses in the order of 1 ms are expected to be a potential major luminosity limitation for higher beam energies after the LHC long shutdown (LS1). Therefore a Quench Test is planned in the winter 2013 to estimate the quench limit in this timescale and revise the current models. This experiment was devoted to determination the LHC Transverse Damper (ADT) as a system for fast losses induction. A non-standard operation of the ADT was used to develop the beam oscillation instead of suppressing them. The sign flip method had allowed us to create the fast losses within several LHC turns at 450 GeV during the previous test (26th March 2012). Thus, the ADT could be potentially used for the studies of the UFO ("Unidentied Falling Object") impact on the cold magnets. Verification of the system capability and investigations of the disturbed beam properties were the main objectives of this MD. During the experiment, the pilot bunches of proton beam were excited independently in the horizontal and vertical ...