24 CFR 3285.307 - Perimeter support piers.

Science.gov (United States)

2010-04-01

... URBAN DEVELOPMENT MODEL MANUFACTURED HOME INSTALLATION STANDARDS Foundations § 3285.307 Perimeter support piers. (a) Piers required at mate-line supports, perimeter piers, and piers at exterior wall...

Trapped in Statelessness: Rohingya Refugees in Bangladesh.

Science.gov (United States)

Milton, Abul Hasnat; Rahman, Mijanur; Hussain, Sumaira; Jindal, Charulata; Choudhury, Sushmita; Akter, Shahnaz; Ferdousi, Shahana; Mouly, Tafzila Akter; Hall, John; Efird, Jimmy T

2017-08-21

The Rohingya people are one of the most ill-treated and persecuted refugee groups in the world, having lived in a realm of statelessness for over six generations, and who are still doing so. In recent years, more than 500,000 Rohingyas fled from Myanmar (Burma) to neighboring countries. This article addresses the Rohingya refugee crisis in Bangladesh, with special emphasis on the living conditions of this vulnerable population. We reviewed several documents on Rohingya refugees, visited a registered refugee camp (Teknaf), collected case reports, and conducted a series of meetings with stakeholders in the Cox's Bazar district of Bangladesh. A total of 33,131 registered Rohingya refugees are living in two registered camps in Cox's Bazar, and up to 80,000 additional refugees are housed in nearby makeshift camps. Overall, the living conditions of Rohingya refugees inside the overcrowded camps remain dismal. Mental health is poor, proper hygiene conditions are lacking, malnutrition is endemic, and physical/sexual abuse is high. A concerted diplomatic effort involving Bangladesh and Myanmar, and international mediators such as the Organization of Islamic Countries and the United Nations, is urgently required to effectively address this complex situation.

Divergence-Measure Fields, Sets of Finite Perimeter, and Conservation Laws

Science.gov (United States)

Chen, Gui-Qiang; Torres, Monica

2005-02-01

Divergence-measure fields in L∞ over sets of finite perimeter are analyzed. A notion of normal traces over boundaries of sets of finite perimeter is introduced, and the Gauss-Green formula over sets of finite perimeter is established for divergence-measure fields in L∞. The normal trace introduced here over a class of surfaces of finite perimeter is shown to be the weak-star limit of the normal traces introduced in Chen & Frid [6] over the Lipschitz deformation surfaces, which implies their consistency. As a corollary, an extension theorem of divergence-measure fields in L∞ over sets of finite perimeter is also established. Then we apply the theory to the initial-boundary value problem of nonlinear hyperbolic conservation laws over sets of finite perimeter.

Fire Perimeters - Southern California, Fall 2007 [ds385

Data.gov (United States)

California Natural Resource Agency — Southern Callifornia fire perimeters for the Fall 2007 wildfires. The perimeters were assembled from various sources by California Department of Fish and Game (DFG)...

Nuclear-power-plant perimeter-intrusion alarm systems

International Nuclear Information System (INIS)

Halsey, D.J.

1982-04-01

Timely intercept of an intruder requires the examination of perimeter barriers and sensors in terms of reliable detection, immediate assessment and prompt response provisions. Perimeter security equipment and operations must at the same time meet the requirements of the Code of Federal Regulations, 10 CFR 73.55 with some attention to the performance and testing figures of Nuclear Regulatory Guide 5.44, Revision 2, May 1980. A baseline system is defined which recommends a general approach to implementing perimeter security elements: barriers, lighting, intrusion detection, alarm assessment. The baseline approach emphasizes cost/effectiveness achieved by detector layering and logic processing of alarm signals to produce reliable alarms and low nuisance alarm rates. A cost benefit of layering along with video assessment is reduction in operating expense. The concept of layering is also shown to minimize testing costs where detectability performance as suggested by Regulatory Guide 5.44 is to be performed. Synthesis of the perimeter intrusion alarm system and limited testing of CCTV and Video Motion Detectors (VMD), were performed at E-Systems, Greenville Division, Greenville, Texas during 1981

Sadhana | Indian Academy of Sciences

Indian Academy of Sciences (India)

Position based opportunistic routing (POR) is a stateless, robust, and reliable geographic routing protocol in Mobile AdHoc NETwork (MANET). The opportunistic routing embraces broadcast property of wireless channels and utilizes it for opportunistic forwarding. Both the malicious node behavior and the backupnodes' ...

Perimeter intrusion sensors

International Nuclear Information System (INIS)

Eaton, M.J.

1977-01-01

To obtain an effective perimeter intrusion detection system requires careful sensor selection, procurement, and installation. The selection process involves a thorough understanding of the unique site features and how these features affect the performance of each type of sensor. It is necessary to develop procurement specifications to establish acceptable sensor performance limits. Careful explanation and inspection of critical installation dimensions is required during on-site construction. The implementation of these activities at a particular site is discussed

Fragmentation of percolation cluster perimeters

Science.gov (United States)

Debierre, Jean-Marc; Bradley, R. Mark

1996-05-01

We introduce a model for the fragmentation of porous random solids under the action of an external agent. In our model, the solid is represented by a bond percolation cluster on the square lattice and bonds are removed only at the external perimeter (or `hull') of the cluster. This model is shown to be related to the self-avoiding walk on the Manhattan lattice and to the disconnection events at a diffusion front. These correspondences are used to predict the leading and the first correction-to-scaling exponents for several quantities defined for hull fragmentation. Our numerical results support these predictions. In addition, the algorithm used to construct the perimeters reveals itself to be a very efficient tool for detecting subtle correlations in the pseudo-random number generator used. We present a quantitative test of two generators which supports recent results reported in more systematic studies.

Fiber-optic perimeter security system based on WDM technology

Science.gov (United States)

Polyakov, Alexandre V.

2017-10-01

Intelligent underground fiber optic perimeter security system is presented. Their structure, operation, software and hardware with neural networks elements are described. System allows not only to establish the fact of violation of the perimeter, but also to locate violations. This is achieved through the use of WDM-technology division spectral information channels. As used quasi-distributed optoelectronic recirculation system as a discrete sensor. The principle of operation is based on registration of the recirculation period change in the closed optoelectronic circuit at different wavelengths under microstrain exposed optical fiber. As a result microstrain fiber having additional power loss in a fiber optical propagating pulse, which causes a time delay as a result of switching moments of the threshold device. To separate the signals generated by intruder noise and interference, the signal analyzer is used, based on the principle of a neural network. The system detects walking, running or crawling intruder, as well as undermining attempts to register under the perimeter line. These alarm systems can be used to protect the perimeters of facilities such as airports, nuclear reactors, power plants, warehouses, and other extended territory.

21 CFR 886.1605 - Perimeter.

Science.gov (United States)

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Perimeter. 886.1605 Section 886.1605 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES... or manual device intended to determine the extent of the peripheral visual field of a patient. The...

Numerical quantification and minimization of perimeter losses in high-efficiency silicon solar cells

Energy Technology Data Exchange (ETDEWEB)

Altermatt, P.P.; Heiser, Gernot; Green, M.A. [New South Wales Univ., Kensington, NSW (Australia)

1996-09-01

This paper presents a quantitative analysis of perimeter losses in high-efficiency silicon solar cells. A new method of numerical modelling is used, which provides the means to simulate a full-sized solar cell, including its perimeter region. We analyse the reduction in efficiency due to perimeter losses as a function of the distance between the active cell area and the cut edge. It is shown how the optimum distance depends on whether the cells in the panel are shingled or not. The simulations also indicate that passivating the cut-face with a thermal oxide does not increase cell efficiency substantially. Therefore, doping schemes for the perimeter domain are suggested in order to increase efficiency levels above present standards. Finally, perimeter effects in cells that remain embedded in the wafer during the efficiency measurement are outlined. (author)

Historical Fire Perimeters - Southern California [ds384

Data.gov (United States)

California Natural Resource Agency — CDF, USDA Forest Service Region 5, BLM, NPS, Contract Counties and other agencies jointly maintain a comprehensive fire perimeter GIS layer for public and private...

Integrated multisensor perimeter detection systems

Science.gov (United States)

Kent, P. J.; Fretwell, P.; Barrett, D. J.; Faulkner, D. A.

2007-10-01

The report describes the results of a multi-year programme of research aimed at the development of an integrated multi-sensor perimeter detection system capable of being deployed at an operational site. The research was driven by end user requirements in protective security, particularly in threat detection and assessment, where effective capability was either not available or prohibitively expensive. Novel video analytics have been designed to provide robust detection of pedestrians in clutter while new radar detection and tracking algorithms provide wide area day/night surveillance. A modular integrated architecture based on commercially available components has been developed. A graphical user interface allows intuitive interaction and visualisation with the sensors. The fusion of video, radar and other sensor data provides the basis of a threat detection capability for real life conditions. The system was designed to be modular and extendable in order to accommodate future and legacy surveillance sensors. The current sensor mix includes stereoscopic video cameras, mmWave ground movement radar, CCTV and a commercially available perimeter detection cable. The paper outlines the development of the system and describes the lessons learnt after deployment in a pilot trial.

Real-time estimation of wildfire perimeters from curated crowdsourcing

Science.gov (United States)

Zhong, Xu; Duckham, Matt; Chong, Derek; Tolhurst, Kevin

2016-04-01

Real-time information about the spatial extents of evolving natural disasters, such as wildfire or flood perimeters, can assist both emergency responders and the general public during an emergency. However, authoritative information sources can suffer from bottlenecks and delays, while user-generated social media data usually lacks the necessary structure and trustworthiness for reliable automated processing. This paper describes and evaluates an automated technique for real-time tracking of wildfire perimeters based on publicly available “curated” crowdsourced data about telephone calls to the emergency services. Our technique is based on established data mining tools, and can be adjusted using a small number of intuitive parameters. Experiments using data from the devastating Black Saturday wildfires (2009) in Victoria, Australia, demonstrate the potential for the technique to detect and track wildfire perimeters automatically, in real time, and with moderate accuracy. Accuracy can be further increased through combination with other authoritative demographic and environmental information, such as population density and dynamic wind fields. These results are also independently validated against data from the more recent 2014 Mickleham-Dalrymple wildfires.

Computing nonsimple polygons of minimum perimeter

NARCIS (Netherlands)

Fekete, S.P.; Haas, A.; Hemmer, M.; Hoffmann, M.; Kostitsyna, I.; Krupke, D.; Maurer, F.; Mitchell, J.S.B.; Schmidt, A.; Schmidt, C.; Troegel, J.

2018-01-01

We consider the Minimum Perimeter Polygon Problem (MP3): for a given set V of points in the plane, find a polygon P with holes that has vertex set V , such that the total boundary length is smallest possible. The MP3 can be considered a natural geometric generalization of the Traveling Salesman

Ensuring Data Storage Security in Tree cast Routing Architecture for Sensor Networks

Science.gov (United States)

Kumar, K. E. Naresh; Sagar, U. Vidya; Waheed, Mohd. Abdul

2010-10-01

In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In contrast to traditional solutions, where the IT services are under proper physical, logical and personnel controls, this routing architecture moves the application software and databases to the large data centers, where the management of the data and services may not be fully trustworthy. This unique attribute, however, poses many new security challenges which have not been well understood. In this paper, we focus on data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users' data in this architecture, we propose an effective and flexible distributed scheme with two salient features, opposing to its predecessors. By utilizing the homomorphic token with distributed verification of erasure-coded data, our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s). Unlike most prior works, the new scheme further supports secure and efficient dynamic operations on data blocks, including: data update, delete and append. Extensive security and performance analysis shows that the proposed scheme is highly efficient and resilient against Byzantine failure, malicious data modification attack, and even server

Current Density Distribution on the Perimeter of Waveguide Exciter Cylindrical Vibrator Conductor

OpenAIRE

Zakharia, Yosyp

2010-01-01

On ground of electrodynamic analysis the surface current distribution nonuniformity on the perimeter of waveguide-exciter cylindrical conductor is found. Considerable influence of current distribution nonuniformity on exciter input reactance is established. It is also showed, that the current distribution on the vibrator perimeter, for conductor radius no greater then 0,07 of waveguide cross section breadth, approximately uniform is.

Determination of a BNI perimeter. Guide nr 9, Release of the 2013/10/31

International Nuclear Information System (INIS)

2013-01-01

This guide specifies modalities of definition of the perimeter of a BNI (basic nuclear installation), and elements of assessment of criteria for the inclusion of installations, works and equipment within this perimeter, in compliance with legal measures specified in the French Code of the Environment and in various decrees. It first proposes an overview of the concerned articles in these legal texts, and notices some articulation with other legal texts which do not address nuclear issues. It specifies the various criteria of definition of a BNI perimeter by distinguishing installations, works and equipment under the responsibility of the operator and needed for the BNI exploitation, and installations, works and equipment not needed for the BNI exploitation but under the responsibility of the operator and susceptible to modify risks or inconveniences of the BNI. It addresses some peculiar situations: effluent processing installations and plants, control piezometers, the dredging of water and release sampling works, underground or underwater installations, and some specific departments (medicine, laundry, and so on). It outlines some important aspects of the procedure of modification of a BNI perimeter. An appendix addresses the methodology related to the inclusion of installations, equipment or works within the perimeter

Tooth angulation and dental arch perimeter-the effect of orthodontic bracket prescription.

Science.gov (United States)

Pontes, Luana F; Cecim, Rodolpho L; Machado, Sissy M; Normando, David

2015-08-01

The aim of this study was to evaluate the effects of upper incisors and canine angulations introduced by different bracket prescriptions on dental arch perimeter. Cone beam computerized tomography scans collected using I-Cat (Imaging Sciences International, Hatfield, PA, USA) were selected conveniently from a database of routine exams of a clinical radiology center. Crown and radicular measurements of upper incisors and canines were made and exported to the Autocad 2011 software to create a virtual dental model. The virtual teeth were positioned with an angulation of zero; thereafter, a reference value for the perimeter of the arch was measured. Furthermore, teeth angulations were applied according to the standards of the Edgewise bracket system and the Straight-wire systems: MBT, Capelozza, Andrews, and Roth. The largest linear distances for tooth crown (anterior arch perimeter) and root (radicular distance) were obtained for each bracket prescription. The anterior perimeter for well-aligned incisors and canines without angulation was used as reference (crown: 47.34mm; root: 39.13mm). An increase in the arch perimeter was obtained for all bracket prescriptions evaluated, which ranged from 0.28 and 3.19mm in the Edgewise technique, for the crown and root measurements, respectively, to 1.09 and 11.28mm for the Roth prescription. Bracket prescriptions with greater angulation led to an increased use of space within the dental arch, mainly in the radicular region. The consequence of this radicular angular displacement will need to be further investigated. © The Author 2014. Published by Oxford University Press on behalf of the European Orthodontic Society. All rights reserved. For permissions, please email: journals.permissions@oup.com.

Visual field examination method using virtual reality glasses compared with the Humphrey perimeter

Directory of Open Access Journals (Sweden)

Tsapakis S

2017-08-01

Full Text Available Stylianos Tsapakis, Dimitrios Papaconstantinou, Andreas Diagourtas, Konstantinos Droutsas, Konstantinos Andreanos, Marilita M Moschos, Dimitrios Brouzas 1st Department of Ophthalmology, National and Kapodistrian University of Athens, Athens, Greece Purpose: To present a visual field examination method using virtual reality glasses and evaluate the reliability of the method by comparing the results with those of the Humphrey perimeter.Materials and methods: Virtual reality glasses, a smartphone with a 6 inch display, and software that implements a fast-threshold 3 dB step staircase algorithm for the central 24° of visual field (52 points were used to test 20 eyes of 10 patients, who were tested in a random and consecutive order as they appeared in our glaucoma department. The results were compared with those obtained from the same patients using the Humphrey perimeter.Results: High correlation coefficient (r=0.808, P<0.0001 was found between the virtual reality visual field test and the Humphrey perimeter visual field.Conclusion: Visual field examination results using virtual reality glasses have a high correlation with the Humphrey perimeter allowing the method to be suitable for probable clinical use. Keywords: visual fields, virtual reality glasses, perimetry, visual fields software, smartphone

Perimeter intrusion detection and assessment system

International Nuclear Information System (INIS)

Eaton, M.J.; Jacobs, J.; McGovern, D.E.

1977-11-01

To obtain an effective perimeter intrusion detection system requires careful sensor selection, procurement, and installation. The selection process involves a thorough understanding of the unique site features and how these features affect the performance of each type of sensor. It is necessary to develop procurement specifications to establish acceptable sensor performance limits. Careful explanation and inspection of critical installation dimensions is required during on-site construction. The implementation of these activities at a particular site is discussed

Urban Design Dimension Of Informality At The Perimeter Of Brawijaya University And UIN Maliki Malang

Directory of Open Access Journals (Sweden)

Tyaghita Cesarin Binar

2018-01-01

Full Text Available Informality is one of the commonly emerged issues in urban design which rarely explored, especially informality within university’s perimeter. Brawijaya as one of the biggest and oldest University in Malang over time has boosted the development of several of its perimeter, provided several hotspots for students and youth. These rapid hotspots growth is related to the growth of informal practices. For cities that developed by its universities, it is necessary to understand both of the formal and informal practices within its perimeter. Through this study I would like to know the characteristic of informality within university perimeter, which formed by Brawijaya, UIN Maliki, and ITN; and to frame it within Carmona’s Urban Design Dimension. Mapping is utilized as a primary method to analyze both formal and informality within site. The formal aspect consists of formal activities, function and site user. While informality mapper consists of street vendors and street art. The research found that while urban informality within Brawijaya and UIN Maliki are related to the character and morphology, its formal structure has; its relation is reciprocal. The morphological, visual and functional dimension of university perimeter is driven by the social, perceptual and temporal dimension formed by its user and showed through informality.

Convex lattice polygons of fixed area with perimeter-dependent weights.

Science.gov (United States)

Rajesh, R; Dhar, Deepak

2005-01-01

We study fully convex polygons with a given area, and variable perimeter length on square and hexagonal lattices. We attach a weight tm to a convex polygon of perimeter m and show that the sum of weights of all polygons with a fixed area s varies as s(-theta(conv))eK(t)square root(s) for large s and t less than a critical threshold tc, where K(t) is a t-dependent constant, and theta(conv) is a critical exponent which does not change with t. Using heuristic arguments, we find that theta(conv) is 1/4 for the square lattice, but -1/4 for the hexagonal lattice. The reason for this unexpected nonuniversality of theta(conv) is traced to existence of sharp corners in the asymptotic shape of these polygons.

Developmental Dyscalculia and Automatic Magnitudes Processing: Investigating Interference Effects between Area and Perimeter

Directory of Open Access Journals (Sweden)

Hili Eidlin-Levy

2017-12-01

Full Text Available The relationship between numbers and other magnitudes has been extensively investigated in the scientific literature. Here, the objectives were to examine whether two continuous magnitudes, area and perimeter, are automatically processed and whether adults with developmental dyscalculia (DD are deficient in their ability to automatically process one or both of these magnitudes. Fifty-seven students (30 with DD and 27 with typical development performed a novel Stroop-like task requiring estimation of one aspect (area or perimeter while ignoring the other. In order to track possible changes in automaticity due to practice, we measured performance after initial and continuous exposure to stimuli. Similar to previous findings, current results show a significant group × congruency interaction, evident beyond exposure level or magnitude type. That is, the DD group systematically showed larger Stroop effects. However, analysis of each exposure period showed that during initial exposure to stimuli the DD group showed larger Stroop effects in the perimeter and not in the area task. In contrast, during continuous exposure to stimuli no triple interaction was evident. It is concluded that both magnitudes are automatically processed. Nevertheless, individuals with DD are deficient in inhibiting irrelevant magnitude information in general and, specifically, struggle to inhibit salient area information after initial exposure to a perimeter comparison task. Accordingly, the findings support the assumption that DD involves a deficiency in multiple cognitive components, which include domain-specific and domain-general cognitive functions.

Developmental Dyscalculia and Automatic Magnitudes Processing: Investigating Interference Effects between Area and Perimeter.

Science.gov (United States)

Eidlin-Levy, Hili; Rubinsten, Orly

2017-01-01

The relationship between numbers and other magnitudes has been extensively investigated in the scientific literature. Here, the objectives were to examine whether two continuous magnitudes, area and perimeter, are automatically processed and whether adults with developmental dyscalculia (DD) are deficient in their ability to automatically process one or both of these magnitudes. Fifty-seven students (30 with DD and 27 with typical development) performed a novel Stroop-like task requiring estimation of one aspect (area or perimeter) while ignoring the other. In order to track possible changes in automaticity due to practice, we measured performance after initial and continuous exposure to stimuli. Similar to previous findings, current results show a significant group × congruency interaction, evident beyond exposure level or magnitude type. That is, the DD group systematically showed larger Stroop effects. However, analysis of each exposure period showed that during initial exposure to stimuli the DD group showed larger Stroop effects in the perimeter and not in the area task. In contrast, during continuous exposure to stimuli no triple interaction was evident. It is concluded that both magnitudes are automatically processed. Nevertheless, individuals with DD are deficient in inhibiting irrelevant magnitude information in general and, specifically, struggle to inhibit salient area information after initial exposure to a perimeter comparison task. Accordingly, the findings support the assumption that DD involves a deficiency in multiple cognitive components, which include domain-specific and domain-general cognitive functions.

Design and evaluation of the ReKon : an integrated detection and assessment perimeter system.

Energy Technology Data Exchange (ETDEWEB)

Dabling, Jeffrey Glenn; Andersen, Jason Jann; McLaughlin, James O. [Stonewater Control Systems, Inc., Kannapolis, NC

2013-02-01

Kontek Industries (Kannapolis, NC) and their subsidiary, Stonewater Control Systems (Kannapolis, NC), have entered into a cooperative research and development agreement with Sandia to jointly develop and evaluate an integrated perimeter security system solution, one that couples access delay with detection and assessment. This novel perimeter solution was designed to be configurable for use at facilities ranging from high-security military sites to commercial power plants, to petro/chemical facilities of various kinds. A prototype section of the perimeter has been produced and installed at the Sandia Test and Evaluation Center in Albuquerque, NM. This prototype system integrated fiber optic break sensors, active infrared sensors, fence disturbance sensors, video motion detection, and ground sensors. This report documents the design, testing, and performance evaluation of the developed ReKon system. The ability of the system to properly detect pedestrian or vehicle attempts to bypass, breach, or otherwise defeat the system is characterized, as well as the Nuisance Alarm Rate.

DAVID: A new video motion sensor for outdoor perimeter applications

International Nuclear Information System (INIS)

Alexander, J.C.

1986-01-01

To be effective, a perimeter intrusion detection system must comprise both sensor and rapid assessment components. The use of closed circuit television (CCTV) to provide the rapid assessment capability, makes possible the use of video motion detection (VMD) processing as a system sensor component. Despite it's conceptual appeal, video motion detection has not been widely used in outdoor perimeter systems because of an inability to discriminate between genuine intrusions and numerous environmental effects such as cloud shadows, wind motion, reflections, precipitation, etc. The result has been an unacceptably high false alarm rate and operator work-load. DAVID (Digital Automatic Video Intrusion Detector) utilizes new digital signal processing techniques to achieve a dramatic improvement in discrimination performance thereby making video motion detection practical for outdoor applications. This paper begins with a discussion of the key considerations in implementing an outdoor video intrusion detection system, followed by a description of the DAVID design in light of these considerations

Top scientists join Stephen Hawking at Perimeter Institute

Science.gov (United States)

Banks, Michael

2009-03-01

Nine leading researchers are to join Stephen Hawking as visiting fellows at the Perimeter Institute for Theoretical Physics in Ontario, Canada. The researchers, who include string theorists Leonard Susskind from Stanford University and Asoka Sen from the Harisch-Chandra Research Institute in India, will each spend a few months of the year at the institute as "distinguished research chairs". They will be joined by another 30 scientists to be announced at a later date.

Asymptotics of the $s$-perimeter as $s\\searrow 0$

OpenAIRE

Dipierro, Serena; Figalli, Alessio; Palatucci, Giampiero; Valdinoci, Enrico

2012-01-01

We deal with the asymptotic behavior of the $s$-perimeter of a set $E$ inside a domain $\\Omega$ as $s\\searrow0$. We prove necessary and sufficient conditions for the existence of such limit, by also providing an explicit formulation in terms of the Lebesgue measure of $E$ and $\\Omega$. Moreover, we construct examples of sets for which the limit does not exist.

Refined universal laws for hull volumes and perimeters in large planar maps

International Nuclear Information System (INIS)

Guitter, Emmanuel

2017-01-01

We consider ensembles of planar maps with two marked vertices at distance k from each other, and look at the closed line separating these vertices and lying at distance d from the first one ( d   <   k ). This line divides the map into two components, the hull at distance d which corresponds to the part of the map lying on the same side as the first vertex and its complementary. The number of faces within the hull is called the hull volume, and the length of the separating line the hull perimeter. We study the statistics of the hull volume and perimeter for arbitrary d and k in the limit of infinitely large planar quadrangulations, triangulations and Eulerian triangulations. We consider more precisely situations where both d and k become large with the ratio d / k remaining finite. For infinitely large maps, two regimes may be encountered: either the hull has a finite volume and its complementary is infinitely large, or the hull itself has an infinite volume and its complementary is of finite size. We compute the probability for the map to be in either regime as a function of d / k as well as a number of universal statistical laws for the hull perimeter and volume when maps are conditioned to be in one regime or the other. (paper)

Design of complex bone internal structure using topology optimization with perimeter control.

Science.gov (United States)

Park, Jaejong; Sutradhar, Alok; Shah, Jami J; Paulino, Glaucio H

2018-03-01

Large facial bone loss usually requires patient-specific bone implants to restore the structural integrity and functionality that also affects the appearance of each patient. Titanium alloys (e.g., Ti-6Al-4V) are typically used in the interfacial porous coatings between the implant and the surrounding bone to promote stability. There exists a property mismatch between the two that in general leads to complications such as stress-shielding. This biomechanical discrepancy is a hurdle in the design of bone replacements. To alleviate the mismatch, the internal structure of the bone replacements should match that of the bone. Topology optimization has proven to be a good technique for designing bone replacements. However, the complex internal structure of the bone is difficult to mimic using conventional topology optimization methods without additional restrictions. In this work, the complex bone internal structure is recovered using a perimeter control based topology optimization approach. By restricting the solution space by means of the perimeter, the intricate design complexity of bones can be achieved. Three different bone regions with well-known physiological loadings are selected to illustrate the method. Additionally, we found that the target perimeter value and the pattern of the initial distribution play a vital role in obtaining the natural curvatures in the bone internal structures as well as avoiding excessive island patterns. Copyright © 2018 Elsevier Ltd. All rights reserved.

Clock Drawing in Spatial Neglect: A Comprehensive Analysis of Clock Perimeter, Placement, and Accuracy

Science.gov (United States)

Chen, Peii; Goedert, Kelly M.

2012-01-01

Clock drawings produced by right-brain-damaged (RBD) individuals with spatial neglect often contain an abundance of empty space on the left while numbers and hands are placed on the right. However, the clock perimeter is rarely compromised in neglect patients’ drawings. By analyzing clock drawings produced by 71 RBD and 40 healthy adults, this study investigated whether the geometric characteristics of the clock perimeter reveal novel insights to understanding spatial neglect. Neglect participants drew smaller clocks than either healthy or non-neglect RBD participants. While healthy participants’ clock perimeter was close to circular, RBD participants drew radially extended ellipses. The mechanisms for these phenomena were investigated by examining the relation between clock-drawing characteristics and performance on six subtests of the Behavioral Inattention Test (BIT). The findings indicated that the clock shape was independent of any BIT subtest or the drawing placement on the test sheet and that the clock size was significantly predicted by one BIT subtest: the poorer the figure and shape copying, the smaller the clock perimeter. Further analyses revealed that in all participants, clocks decreased in size as they were placed farther from the center of the paper. However, even when neglect participants placed their clocks towards the center of the page, they were smaller than those produced by healthy or non-neglect RBD participants. These results suggest a neglect-specific reduction in the subjectively available workspace for graphic production from memory, consistent with the hypothesis that neglect patients are impaired in the ability to enlarge the attentional aperture. PMID:22390278

Towards Rural Land Use: Challenges for Oversizing Urban Perimeters in Shrinking Towns

Science.gov (United States)

Sá, João; Virtudes, Ana

2017-12-01

This article, based on the literature review, aims to study the challenges of the urban dispersion and oversizing of urban perimeters, in the cases where the towns are shrinking or spreading to the rural land-use. It is focused on the case of Portugal where during the last decades there was an escaping to the big cities alongside to the sea (Atlantic and Mediterranean) shore. In the Interior part of the country, which means near to the border with Spain, several towns are shrinking, despite their huge urban perimeters, proposed by the municipal master plans, since the middle of the nineties. Consequently, these urban perimeters are nowadays oversizing, with empty buildings and non-urbanized areas. At the same time, the social patterns of occupation of this territory have changed significantly, moving from a society with signs of rurality to an urban realm, understood not only in territorial terms but also regarding the current lifestyle. This deep changing has occurred not only in urbanistic terms but also in the economic, cultural and social organizations of the country, under a movement that corresponds to a decline of the small urban settlements in rural areas, far away from the cosmopolitan strip of land nearby the sea, in between the capital city, Lisbon and the second one Oporto. These transformations were not driven by any significant public policy for land-use actions. On the contrary, the production of urban areas, supporting the new model of economic and social development was largely left to the initiative of economic and social private agents and land owners. These agents were the leading responsible for the new urban developments and housing. In this sense, this research aims to present some strategies for the short time period regarding the devolution of urban areas to rural land use. In this sense, the next steps of spatial planning policies, under the role of local authorities (the 308 municipalities including Madeira and Azores islands, plus the

Experimental study of abdominal CT scanning exposal doses adjusted on the basis of pediatric abdominal perimeter

International Nuclear Information System (INIS)

Wei Wenzhou; Zhu Gongsheng; Zeng Lingyan; Yin Xianglin; Yang Fuwen; Liu Changsheng

2006-01-01

Objective: To optimize the abdominal helical CT scanning parameters in pediatric patients and to reduce its radiation hazards. Methods: 60 canines were evenly grouped into 4 groups on the basis of pediatric abdominal perimeter, scanned with 110,150,190 and 240 mAs, and their qualities of canine CT images were analyzed. 120 pediafric patients with clinic suspected abdominal diseases were divided into 4 groups on the basis of abdominal perimeter, scanned by optimal parameters and their image qualities were analyzed. Results: After CT exposure were reduced, the percentages of total A and B were 90.9 % and 92.0 % in experimental canines and in pediatric patients, respectively. Compared with conventional CT scanning, the exposure and single slice CT dose index weighted (CTDIw) were reduced to 45.8%-79.17%. Conclusion: By adjusted the pediatric helical CT parameters basedon the of pediatric abdominal perimeter, exposure of patient to the hazards of radiation is reduced. (authors)

Miniscrew-assisted rapid palatal expansion for managing arch perimeter in an adult patient

Directory of Open Access Journals (Sweden)

Amanda Carneiro da Cunha

Full Text Available ABSTRACT Introduction: Etiology of dental crowding may be related to arch constriction in diverse dimensions, and an appropriate manipulation of arch perimeter by intervening in basal bone discrepancies cases, may be a key for crowding relief, especially when incisors movement is limited due to underlying pathology, periodontal issues or restrictions related to soft tissue profile. Objectives: This case report illustrates a 24-year old woman, with maxillary transverse deficiency, upper and lower arches crowding, Class II, division 1, subdivision right relationship, previous upper incisors traumatic episode and straight profile. A non-surgical and non-extraction treatment approach was feasible due to the miniscrew-assisted rapid palatal expansion technique (MARPE. Methods: The MARPE appliance consisted of a conventional Hyrax expander supported by four orthodontic miniscrews. A slow expansion protocol was adopted, with an overall of 40 days of activation and a 3-month retention period. Intrusive traction miniscrew-anchored mechanics were used for correcting the Class II subdivision relationship, managing lower arch perimeter and midline deviation before including the upper central incisors. Results: Post-treatment records show an intermolar width increase of 5 mm, bilateral Class I molar and canine relationships, upper and lower crowding resolution, coincident dental midlines and proper intercuspation. Conclusions: The MARPE is an effective treatment approach for managing arch-perimeter deficiencies related to maxillary transverse discrepancies in adult patients.

Examining perimeter gating control of urban traffic networkswith locally adaptive traffic signals

NARCIS (Netherlands)

Keyvan Ekbatani, M.; Gao, X.; Gayah, V.V.; Knoop, V.L.

2015-01-01

Traditionally, urban traffic is controlled by traffic lights. Recent findings of the Macroscopic or Network Fundamental Diagram (MFD or NFD) have led to the development of novel traffic control strategies that can be applied at a networkwide level. One pertinent example is perimeter flow control

Differential GPS effectiveness in measuring area and perimeter in forested settings

International Nuclear Information System (INIS)

Frank, Jereme; Wing, Michael G

2013-01-01

This study quantifies area and perimeter measurement errors, traverse times, recording intervals, and overall time and cost effectiveness for using a mapping-grade differential Global Positioning System (GPS) receiver in forested settings. We compared two configurations including one that maximized data collection productivity (position dilution of precision (PDOP) 20, signal to noise ratio (SNR 33), and minimum elevation mask 5°) and a second that involved traditional receiver settings that was designed to improve accuracies (PDOP 6, SNR 39, and minimum elevation mask 15°). We determined that averaging 30 positions and using the settings that maximized productivity was the most time effective combination of recording interval and settings. This combination of recording interval and settings proved slightly more cost effective than other traditional surveying methods such as a laser with digital compass and string box. Average absolute per cent area errors when averaging 30 positions and using maximum settings were 2.6% and average absolute per cent perimeter errors were 2.0%. These results should help forest resource professionals more effectively evaluate GPS techniques and receiver configurations. (paper)

An armored-cable-based fiber Bragg grating sensor array for perimeter fence intrusion detection

Science.gov (United States)

Hao, Jianzhong; Dong, Bo; Varghese, Paulose; Phua, Jiliang; Foo, Siang Fook

2012-01-01

In this paper, an armored-cable-based optical fiber Bragg grating (FBG) sensor array, for perimeter fence intrusion detection, is demonstrated and some of the field trial results are reported. The field trial was conducted at a critical local installation in Singapore in December 2010. The sensor array was put through a series of both simulated and live intrusion scenarios to test the stability and suitability of operation in the local environmental conditions and to determine its capabilities in detecting and reporting these intrusions accurately to the control station. Such a sensor array can provide perimeter intrusion detection with fine granularity and preset pin-pointing accuracy. The various types of intrusions included aided or unaided climbs, tampering and cutting of the fence, etc. The unique sensor packaging structure provides high sensitivity, crush resistance and protection against rodents. It is also capable of resolving nuisance events such as rain, birds sitting on the fence or seismic vibrations. These sensors are extremely sensitive with a response time of a few seconds. They can be customized for a desired spatial resolution and pre-determined sensitivity. Furthermore, it is easy to cascade a series of such sensors to monitor and detect intrusion events over a long stretch of fence line. Such sensors can be applied to real-time intrusion detection for perimeter security, pipeline security and communications link security.

Swivel arm perimeter for visual field testing in different body positions.

Science.gov (United States)

Flammer, J; Hendrickson, P; Lietz, A; Stümpfig, D

1993-01-01

To investigate the influence of body position on visual field results, a 'swivel arm perimeter' was built, based on a modified Octopus 1-2-3. Here, the measuring unit was detected from the control unit and mounted on a swivel arm, allowing its movement in all directions. The first results obtained with this device have indicated that its development was worthwhile.

Network Architecture: lessons from the past, vision for the future

CERN Multimedia

CERN. Geneva

2004-01-01

The Architectural Principles of the Internet have dominated the past decade. Orthogonal to the telecommunications industry principles, they dramatically changed the networking landscape because they relied on iconoclastic ideas. First, the Internet end-to-end principle, which stipulates that the network should intervene minimally on the end-to-end traffic, pushing the complexity to the end-systems. Second, the ban of centralized functions: all the Internet techniques (routing, DNS, management) are based on distributed, decentralized mechanisms. Third, the absolute domination of connectionless (stateless) protocols (as with IP, HTTTP). However, when facing new requirements: multimedia traffic, security, Grid applications, these principles appear sometimes as architectural barriers. Multimedia requires QoS guarantees, but stateless systems are not good at QoS. Security requires active, intelligent networks, but dumb routers or plain end-to-end mail systems are insufficient. Grid applications require...

Perimeter generating functions for the mean-squared radius of gyration of convex polygons

International Nuclear Information System (INIS)

Jensen, Iwan

2005-01-01

We have derived long series expansions for the perimeter generating functions of the radius of gyration of various polygons with a convexity constraint. Using the series we numerically find simple (algebraic) exact solutions for the generating functions. In all cases the size exponent ν 1. (letter to the editor)

Evaluation of high-perimeter electrode designs for deep brain stimulation

Science.gov (United States)

Howell, Bryan; Grill, Warren M.

2014-08-01

Objective. Deep brain stimulation (DBS) is an effective treatment for movement disorders and a promising therapy for treating epilepsy and psychiatric disorders. Despite its clinical success, complications including infections and mis-programing following surgical replacement of the battery-powered implantable pulse generator adversely impact the safety profile of this therapy. We sought to decrease power consumption and extend battery life by modifying the electrode geometry to increase stimulation efficiency. The specific goal of this study was to determine whether electrode contact perimeter or area had a greater effect on increasing stimulation efficiency. Approach. Finite-element method (FEM) models of eight prototype electrode designs were used to calculate the electrode access resistance, and the FEM models were coupled with cable models of passing axons to quantify stimulation efficiency. We also measured in vitro the electrical properties of the prototype electrode designs and measured in vivo the stimulation efficiency following acute implantation in anesthetized cats. Main results. Area had a greater effect than perimeter on altering the electrode access resistance; electrode (access or dynamic) resistance alone did not predict stimulation efficiency because efficiency was dependent on the shape of the potential distribution in the tissue; and, quantitative assessment of stimulation efficiency required consideration of the effects of the electrode-tissue interface impedance. Significance. These results advance understanding of the features of electrode geometry that are important for designing the next generation of efficient DBS electrodes.

Design and testing of a perimeter of increment threshold by projection

OpenAIRE

García Domene, María del Carmen; Luque Cobija, María José; Fez Saiz, Dolores de

2017-01-01

In the present study, we have designed and tested a perimeter for the detection of damage in the chromatic mechanisms using a video projector. To this purpose, we have characterized pixel to pixel a video projector, to account for the inhomogeneities in the projection. We have measured the tristimulus values of the projector primaries as a function of digital level, at 49 locations of the projection screen and, from them, we have arrived to a characterization model which reduces the color dif...

[Irrigated perimeters as a geopolitical strategy for the development of the semi-arid region and its implications for health, labor and the environment].

Science.gov (United States)

Pontes, Andrezza Graziella Veríssimo; Gadelha, Diego; Freitas, Bernadete Maria Coêlho; Rigotto, Raquel Maria; Ferreira, Marcelo José Monteiro

2013-11-01

An analysis was made of irrigated perimeters as a geopolitical strategy for expanding Brazilian agricultural frontiers and the "development" of the northeastern semi-arid region with respect to social determinants in health in rural communities. Research was conducted in the Chapada do Apodi in the states of Ceará and Rio Grande do Norte between 2007 and 2011. Various research techniques and tools were adopted, such as research-action, ethnographic studies, questionnaires and laboratory exams, water contamination analyses, social cartography and focal groups. In the context of agribusiness expansion, it was revealed that public policies of irrigation have had consequences for health, labor and the environment with the implementation of the Jaguaribe-Apodi Irrigated Perimeter in Ceará. The social and environmental conflict and resistance in the phase prior to the installation of the Santa Cruz do Apodi Irrigated Perimeter in Rio Grande do Norte was significant as it had consequences for the health-disease process on rural communities. It is important for the evaluation of public irrigation policies to consider the impacts of the perimeters on the lifestyle, labor, health and the environment of the affected territories.

Analysis Of The Socioeconomic And Environmental Impacts Of Irrigated Agriculture In The Irrigated Perimeter Of Pau Dos Ferros (Rn

Directory of Open Access Journals (Sweden)

José Jobson Garcia de Almeida

2014-07-01

Full Text Available The Brazilian Government implemented irrigated perimeters to ameliorate problems of drought and poverty in the Northeast. In this sense, the objective of this work was to analyze the social, economic and environmental impacts generated by the practice of irrigated agriculture in the municipality of Pau dos Ferros-RN, resulting from the impacts caused by the activity. Obtained references on the topic, on-site visits and interviews with producers of the perimeter. It was observed the presence of negative impacts in the area, such as waste, contamination and water salinisation, compaction and soil erosion, deforestation caused by the removal of the native vegetation, high consumption of energy and public health problems.

THE IMPACT ASSESSMENT OF THE ABANDONED URANIUM MINING EXPLOITATIONS ON ROCKS AND SOILS - ZIMBRU PERIMETER, ARAD COUNTY

Directory of Open Access Journals (Sweden)

DIANA M. BANU

2016-10-01

Full Text Available The mining exploration and exploitation, especially the activity of uranium mineralization exploration and exploitation has a negative impact on the environment by the alterations of the landscape and the degradation of the environmental factors' quality. The principal environmental factors that could be affected by mining operations resulting from uranium exploitation are: water, air, soil, population, fauna, and flora. The aim of this study is, first, to identify the sources of pollution (natural radionuclides - natural radioactive series of uranium, radium, thorium, potassium and heavy metals that are accompanying the mineralizations for two of the most important environmental factors: rocks and soils: and, second, to assess the pollution impact on those two environmental factors. In order to identify this pollutants and their impact assessment it was selected as a study case an abandoned uranium mining perimeter named the Zimbru perimeter located in Arad County, Romania.

Application Development: AN Interactive, Non-Technical Perspective of the Geology and Geomorphology of the Ouray Perimeter Tail, CO.

Science.gov (United States)

Allen, H. M.; Giardino, J. R.

2015-12-01

Each year people seek respite from their busy lifestyles by traveling to state or national parks, national forests or wilderness areas. The majority of these parks were established in order to help preserve our natural heritage, including wildlife, forests, and the beauty of landscapes formed from thousands of years of geologic/geomorphologic processes. Whilst being able to enjoy the tranquility of nature, tourists are being robbed of a more in-depth experience as a result of the lack of a geologic background. One such location that attracts a large number of summer tourists is the perimeter trail in Ouray, Colorado. Located in the Southwestern portion of Colorado, Ouray is situated in the beautiful San Juan Mountain range along the "Million Dollar Highway." The Perimeter trail is a six-mile trail loop that circles the city of Ouray. The city is a very popular place for summertime tourism because of its unparalleled scenery. Ouray is situated in an area that is riddled with textbook angular unconformities, metasedimentary, sedimentary, and volcanic rocks. In the study area, The San Juans have been beautifully sculpted by an array of major faulting events, glacial activity and volcanics. With the understanding that technology is ever expanding, we think there is no better way to experience the Perimeter Trail than to have an interactive application that will be both educational as well as interesting. This application is a non-technical way of looking at the geology and geomorphology of the perimeter trail. Additionally, a paper brochure shows the most noteworthy points of interest. The brochure contains a brief geologic history of the San Juan Mountains accompanied with annotated photographs to illustrate the complex geology/geomorphology encountered on the trail. The application is based on an interactive three-dimensional map, which can be zoomed to various scales. The app hosts a locational service that uses the phone's GPS to communicate location of the hiker

Testing the effects of perimeter fencing and elephant exclosures on lion predation patterns in a Kenyan wildlife conservancy.

Science.gov (United States)

Dupuis-Desormeaux, Marc; Davidson, Zeke; Pratt, Laura; Mwololo, Mary; MacDonald, Suzanne E

2016-01-01

The use of fences to segregate wildlife can change predator and prey behaviour. Predators can learn to incorporate fencing into their hunting strategies and prey can learn to avoid foraging near fences. A twelve-strand electric predator-proof fence surrounds our study site. There are also porous one-strand electric fences used to create exclosures where elephant (and giraffe) cannot enter in order to protect blocs of browse vegetation for two critically endangered species, the black rhinoceros (Diceros bicornis) and the Grevy's zebra (Equus grevyi). The denser vegetation in these exclosures attracts both browsing prey and ambush predators. In this study we examined if lion predation patterns differed near the perimeter fencing and inside the elephant exclosures by mapping the location of kills. We used a spatial analysis to compare the predation patterns near the perimeter fencing and inside the exclosures to predation in the rest of the conservancy. Predation was not over-represented near the perimeter fence but the pattern of predation near the fence suggests that fences may be a contributing factor to predation success. Overall, we found that predation was over-represented inside and within 50 m of the exclosures. However, by examining individual exclosures in greater detail using a hot spot analysis, we found that only a few exclosures contained lion predation hot spots. Although some exclosures provide good hunting grounds for lions, we concluded that exclosures did not necessarily create prey-traps per se and that managers could continue to use this type of exclusionary fencing to protect stands of dense vegetation.

Testing the effects of perimeter fencing and elephant exclosures on lion predation patterns in a Kenyan wildlife conservancy

Directory of Open Access Journals (Sweden)

Marc Dupuis-Desormeaux

2016-02-01

Full Text Available The use of fences to segregate wildlife can change predator and prey behaviour. Predators can learn to incorporate fencing into their hunting strategies and prey can learn to avoid foraging near fences. A twelve-strand electric predator-proof fence surrounds our study site. There are also porous one-strand electric fences used to create exclosures where elephant (and giraffe cannot enter in order to protect blocs of browse vegetation for two critically endangered species, the black rhinoceros (Diceros bicornis and the Grevy’s zebra (Equus grevyi. The denser vegetation in these exclosures attracts both browsing prey and ambush predators. In this study we examined if lion predation patterns differed near the perimeter fencing and inside the elephant exclosures by mapping the location of kills. We used a spatial analysis to compare the predation patterns near the perimeter fencing and inside the exclosures to predation in the rest of the conservancy. Predation was not over-represented near the perimeter fence but the pattern of predation near the fence suggests that fences may be a contributing factor to predation success. Overall, we found that predation was over-represented inside and within 50 m of the exclosures. However, by examining individual exclosures in greater detail using a hot spot analysis, we found that only a few exclosures contained lion predation hot spots. Although some exclosures provide good hunting grounds for lions, we concluded that exclosures did not necessarily create prey-traps per se and that managers could continue to use this type of exclusionary fencing to protect stands of dense vegetation.

Chaos and order in stateless societies: Intercommunity exchange as a factor impacting the population dynamical patterns

International Nuclear Information System (INIS)

Medvinsky, Alexander B.; Rusakov, Alexey V.

2011-01-01

Highlights: → We model community dynamics in stateless societies. → Intercommunity barter is shown to be a factor impacting the societies dynamics. → Increase in the human population growth rate can lead to appearance of chaos. → Secular and millennial cycles are found to arise as a result of the barter. - Abstract: The once abstract notions of dynamical chaos now appear naturally in various systems [Kaplan D, Glass L. Understanding nonlinear dynamics. New York: Springer; 1995]. As a result, future trajectories of the systems may be difficult to predict. In this paper, we demonstrate the appearance of chaotic dynamics in model human communities, which consist of producers of agricultural product and producers of agricultural equipment. In the case of a solitary community, the horizon of predictability of the human population dynamics is shown to be dependent on both intrinsic instability of the dynamics and the chaotic attractor sizes. Since a separate community is usually a part of a larger commonality, we study the dynamics of social systems consisting of two interacting communities. We show that intercommunity barter can lead to stabilization of the dynamics in one of the communities, which implies persistence of stable equilibrium under changes of the maximum value of the human population growth rate. However, in the neighboring community, the equilibrium turns into a stable limit cycle as the maximum value of the human population growth rate increases. Following an increase in the maximum value of the human population growth rate leads to period-doubling bifurcations resulting in chaotic dynamics. The horizon of predictability of the chaotic oscillations is found to be limited by 5 years. We demonstrate that the intercommunity interaction can lead to the appearance of long-period harmonics in the chaotic time series. The period of the harmonics is of order 100 and 1000 years. Hence the long-period changes in the population size may be considered as an

Chaos and order in stateless societies: Intercommunity exchange as a factor impacting the population dynamical patterns

Energy Technology Data Exchange (ETDEWEB)

Medvinsky, Alexander B., E-mail: medvinsky@iteb.ru [Institute of Theoretical and Experimental Biophysics, Russian Academy of Sciences, Pushchino 142290, Moscow Region (Russian Federation); Rusakov, Alexey V. [Institute of Theoretical and Experimental Biophysics, Russian Academy of Sciences, Pushchino 142290, Moscow Region (Russian Federation)

2011-06-15

Highlights: > We model community dynamics in stateless societies. > Intercommunity barter is shown to be a factor impacting the societies dynamics. > Increase in the human population growth rate can lead to appearance of chaos. > Secular and millennial cycles are found to arise as a result of the barter. - Abstract: The once abstract notions of dynamical chaos now appear naturally in various systems [Kaplan D, Glass L. Understanding nonlinear dynamics. New York: Springer; 1995]. As a result, future trajectories of the systems may be difficult to predict. In this paper, we demonstrate the appearance of chaotic dynamics in model human communities, which consist of producers of agricultural product and producers of agricultural equipment. In the case of a solitary community, the horizon of predictability of the human population dynamics is shown to be dependent on both intrinsic instability of the dynamics and the chaotic attractor sizes. Since a separate community is usually a part of a larger commonality, we study the dynamics of social systems consisting of two interacting communities. We show that intercommunity barter can lead to stabilization of the dynamics in one of the communities, which implies persistence of stable equilibrium under changes of the maximum value of the human population growth rate. However, in the neighboring community, the equilibrium turns into a stable limit cycle as the maximum value of the human population growth rate increases. Following an increase in the maximum value of the human population growth rate leads to period-doubling bifurcations resulting in chaotic dynamics. The horizon of predictability of the chaotic oscillations is found to be limited by 5 years. We demonstrate that the intercommunity interaction can lead to the appearance of long-period harmonics in the chaotic time series. The period of the harmonics is of order 100 and 1000 years. Hence the long-period changes in the population size may be considered as an

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

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

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

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

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

Debate: Limitations on universality: the "right to health" and the necessity of legal nationality

Science.gov (United States)

2010-01-01

Background The "right to health," including access to basic healthcare, has been recognized as a universal human right through a number of international agreements. Attempts to protect this ideal, however, have relied on states as the guarantor of rights and have subsequently ignored stateless individuals, or those lacking legal nationality in any nation-state. While a legal nationality alone is not sufficient to guarantee that a right to healthcare is accessible, an absence of any legal nationality is almost certainly an obstacle in most cases. There are millions of so-called stateless individuals around the globe who are, in effect, denied medical citizenship in their countries of residence. A central motivating factor for this essay is the fact that statelessness as a concept is largely absent from the medical literature. The goal for this discussion, therefore, is primarily to illustrate the need for further monitoring of health access issues by the medical community, and for a great deal more research into the effects of statelessness upon access to healthcare. This is important both as a theoretical issue, in light of the recognition by many of healthcare as a universal right, as well as an empirical fact that requires further exploration and amelioration. Discussion Most discussions of the human right to health assume that every human being has legal nationality, but in reality there are at least 11 to 12 million stateless individuals worldwide who are often unable to access basic healthcare. The examples of the Roma in Europe, the hill tribes of Thailand, and many Palestinians in Israel highlight the negative health impacts associated with statelessness. Summary Stateless individuals often face an inability to access the most basic healthcare, much less the "highest attainable standard of health" outlined by international agreements. Rather than presuming nationality, statelessness must be recognized by the medical community. Additionally, it is imperative

Preferential Hyperacuity Perimeter (PreView PHP) for detecting choroidal neovascularization study.

Science.gov (United States)

Alster, Yair; Bressler, Neil M; Bressler, Susan B; Brimacombe, Judith A; Crompton, R Michael; Duh, Yi-Jing; Gabel, Veit-Peter; Heier, Jeffrey S; Ip, Michael S; Loewenstein, Anat; Packo, Kirk H; Stur, Michael; Toaff, Techiya

2005-10-01

To assess the ability of the Preferential Hyperacuity Perimeter (PreView PHP; Carl Zeiss Meditec, Dublin, CA) to detect recent-onset choroidal neovascularization (CNV) resulting from age-related macular degeneration (AMD) and to differentiate it from an intermediate stage of AMD. Prospective, comparative, concurrent, nonrandomized, multicenter study. Eligible participants' study eyes had a corrected visual acuity of 20/160 or better and either untreated CNV from AMD diagnosed within the last 60 days or an intermediate stage of AMD. After obtaining consent, visual acuity with habitual correction, masked PHP testing, stereoscopic color fundus photography, and fluorescein angiography were performed. Photographs and angiograms were evaluated by graders masked to diagnosis and PHP results. The reading center's diagnosis determined if the patient was categorized as having intermediate AMD or neovascular AMD. A successful study outcome was defined a priori as a sensitivity of at least 80% and a specificity of at least 80%. Of 185 patients who gave consent to be enrolled, 11 (6%) had PHP results judged to be unreliable. An additional 52 were not included because they did not meet all eligibility criteria. Of the remaining 122 patients, 57 had an intermediate stage of AMD and 65 had neovascular AMD. The sensitivity to detect newly diagnosed CNV using PHP testing was 82% (95% confidence interval [CI], 70%-90%). The specificity to differentiate newly diagnosed CNV from the intermediate stage of AMD using PHP testing was 88% (95% CI, 76%-95%). Preferential Hyperacuity Perimeter testing can detect recent-onset CNV resulting from AMD and can differentiate it from an intermediate stage of AMD with high sensitivity and specificity. These data suggest that monitoring with PHP should detect most cases of CNV of recent onset with few false-positive results at a stage when treatment usually would be beneficial. Thus, this monitoring should be considered in the management of the

Farmers’ willingness to pay for surface water in the West Mitidja irrigated perimeter, northern Algeria

International Nuclear Information System (INIS)

Azzi, M.; Calatrava, J.; Bedrani, S.

2018-01-01

Algeria is among the most water-stressed countries in the world. Because of its climatic conditions, irrigation is essential for agricultural production. Water prices paid by farmers in public irrigation districts are very low and do not cover the operation and maintenance (O&M) costs of the irrigated perimeters, thus leading to the deterioration of these infrastructures. The objective of this paper is to analyse whether farmer’s in the West Mitidja irrigation district in northern Algeria would be willing to pay more for surface water in order to maintain the water supply service in its current conditions. We estimated farmers’ willingness to pay (WTP) for water using data from a dichotomous choice contingent valuation survey to 112 randomly selected farmers. Farmers’ responses were modelled using logistic regression techniques. We also analysed which technical, structural, social and economic characteristics of farms and farmers explain the differences in WTP. Our results showed that nearly 80% of the surveyed farmers are willing to pay an extra price for irrigation water. The average WTP was 64% greater than the price currently paid by farmers, suggesting some scope for improving the financial resources of the Mitidja irrigated perimeter, but insufficient to cover all O&M costs. Some of the key identified factors that affect WTP for surface water relate to farm ownership, access to groundwater resources, cropping patterns, farmers’ agricultural training and risk exposure.

Rigorous derivation of the perimeter generating functions for the mean-squared radius of gyration of rectangular, Ferrers and pyramid polygons

International Nuclear Information System (INIS)

Lin, Keh Ying

2006-01-01

We have derived rigorously the perimeter generating functions for the mean-squared radius of gyration of rectangular, Ferrers and pyramid polygons. These functions were found by Jensen recently. His nonrigorous results are based on the analysis of the long series expansions. (comment)

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

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

Hurricane Evacuation Routes

Data.gov (United States)

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

The environmental impacts of land transformation in the coastal perimeter of the Mar Menor lagoon (Spain)

OpenAIRE

GARCÍA-AYLLON VEINTIMILLA, SALVADOR; Miralles García, José Luis

2014-01-01

Assigned to WIT Press all rights under copyright that may exist in and to the Work and any associated written or multimedia components or other enhancements accompanying the Work. The distinctive environment of the lagoon has long been attractive for visitors. A surge in touristic activities has taken place in the area since the early 1960s, characterised by intense urban development along the lagoon s perimeter to accommodate the growing seasonal population. This phenomenon has particular...

Farmers’ willingness to pay for surface water in the West Mitidja irrigated perimeter, northern Algeria

Directory of Open Access Journals (Sweden)

Malika Azzi

2018-04-01

Full Text Available Algeria is among the most water-stressed countries in the world. Because of its climatic conditions, irrigation is essential for agricultural production. Water prices paid by farmers in public irrigation districts are very low and do not cover the operation and maintenance (O&M costs of the irrigated perimeters, thus leading to the deterioration of these infrastructures. The objective of this paper is to analyse whether farmer’s in the West Mitidja irrigation district in northern Algeria would be willing to pay more for surface water in order to maintain the water supply service in its current conditions. We estimated farmers’ willingness to pay (WTP for water using data from a dichotomous choice contingent valuation survey to 112 randomly selected farmers. Farmers’ responses were modelled using logistic regression techniques. We also analysed which technical, structural, social and economic characteristics of farms and farmers explain the differences in WTP. Our results showed that nearly 80% of the surveyed farmers are willing to pay an extra price for irrigation water. The average WTP was 64% greater than the price currently paid by farmers, suggesting some scope for improving the financial resources of the Mitidja irrigated perimeter, but insufficient to cover all O&M costs. Some of the key identified factors that affect WTP for surface water relate to farm ownership, access to groundwater resources, cropping patterns, farmers’ agricultural training and risk exposure.

Area G perimeter surface-soil and single-stage water sampling: Environmental surveillance for fiscal year 94, Group ESH-19. Progress report

International Nuclear Information System (INIS)

Conrad, R.; Childs, M.; Lyons, C.R.; Coriz, F.

1996-08-01

ESH-19 personnel collected soil and single-stage water samples around the perimeter of Area G at Los Alamos National Laboratory during FY94 to characterize possible contaminant movement out of Area G through surface-water and sediment runoff. These samples were analyzed for tritium, total uranium, isotopic plutonium, americium-241, and cesium-137. Ten metals were also analyzed on selected soils using analytical laboratory techniques. All radiochemical data are compared with analogous samples collected during FY 93 and reported in LA-12986. Baseline concentrations for future disposal operations were established for metals and radionuclides by a sampling program in the proposed Area G Expansion Area. Considering the amount of radioactive waste that has been disposed at Area G, there is evidence of only low concentrations of radionuclides on perimeter surface soils. Consequently, little radioactivity is leaving the confines of Area G via the surface water runoff pathway

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

Institute of Scientific and Technical Information of China (English)

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

2003-01-01

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

Routing in opportunistic networks

CERN Document Server

Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

2013-01-01

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

29 CFR Appendix F to Subpart R of... - Perimeter Columns: Non-Mandatory Guidelines for Complying With § 1926.756(e) To Protect the...

Science.gov (United States)

2010-07-01

... to Subpart R of Part 1926 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND... Steel Erection Pt. 1926, Subpt. R, App. F Appendix F to Subpart R of Part 1926—Perimeter Columns: Non...

Ukraine-Japanese-Swedish project: Upgrading of perimeter protection system at Kharkov Institute of Physics and Technology (KIPT)

International Nuclear Information System (INIS)

Mikahaylov, V.; Lapshin, V.; Ek, P.; Flyghed, L.; Nilsson, A.; Ooka, N.; Shimizu, K.; Tanuma, K.

2001-01-01

Full text: Since the Ukraine voluntarily accepted the status of a non-nuclear-weapons state and concluded a Safeguards Agreement with the IAEA, the Kharkov Institute of Physics and Technology (KIPT) as a nuclear facility using the nuclear material of category 1, has become a Ukrainian priority object for the international community's efforts to ensure nuclear non-proliferation measures and to bring the existing protection systems to the generally accepted security standards. In March 1996, at the meeting held under the auspices of the IAEA in Kiev, the representatives from Japan, Sweden and the USA agreed to provide technical assistance concerning improvement of the nuclear material accountancy and control and physical protection system (MPC and A) available at KIPT. The Technical Secretariat of the Japan-Ukraine Committee for Co-operation on Reducing Nuclear Weapons and Swedish Nuclear Power Inspectorate undertook to solve the most expensive and labour-consuming task namely, the upgrading of the perimeter protection system at KIPT. This included that the current perimeter system, comprising several kilometers, should be completely replaced. Besides the above-mentioned problem, the upgrading should be carried out with the institute in operation. Thus, it was not allowed to replace the existing protection system by a new one unless KIPT was constantly protected. This required the creation of a new protected zone that to a large extent was occupied by the communication equipment, buildings, trees and other objects interfering with the work. All these difficulties required very comprehensive development of the project design as well as a great deal of flexibility during the implementation of the project. These problems were all successfully resolved thanks to a well working project organization, composed of experts from KIPT, JAERI and ANS, involving the highly qualified Swedish technical experts who played a leading role. In the framework of implementation of the

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

NARCIS (Netherlands)

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

2012-01-01

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

Comparison of perimeter trap crop varieties: effects on herbivory, pollination, and yield in butternut squash.

Science.gov (United States)

Adler, L S; Hazzard, R V

2009-02-01

Perimeter trap cropping (PTC) is a method of integrated pest management (IPM) in which the main crop is surrounded with a perimeter trap crop that is more attractive to pests. Blue Hubbard (Cucurbita maxima Duch.) is a highly effective trap crop for butternut squash (C. moschata Duch. ex Poir) attacked by striped cucumber beetles (Acalymma vittatum Fabricius), but its limited marketability may reduce adoption of PTC by growers. Research comparing border crop varieties is necessary to provide options for growers. Furthermore, pollinators are critical for cucurbit yield, and the effect of PTC on pollination to main crops is unknown. We examined the effect of five border treatments on herbivory, pollination, and yield in butternut squash and manipulated herbivory and pollination to compare their importance for main crop yield. Blue Hubbard, buttercup squash (C. maxima Duch.), and zucchini (C. pepo L.) were equally attractive to cucumber beetles. Border treatments did not affect butternut leaf damage, but butternut flowers had the fewest beetles when surrounded by Blue Hubbard or buttercup squash. Yield was highest in the Blue Hubbard and buttercup treatments, but this effect was not statistically significant. Native bees accounted for 87% of pollinator visits, and pollination did not limit yield. There was no evidence that border crops competed with the main crop for pollinators. Our results suggest that both buttercup squash and zucchini may be viable alternatives to Blue Hubbard as borders for the main crop of butternut squash. Thus, growers may have multiple border options that reduce pesticide use, effectively manage pests, and do not disturb mutualist interactions with pollinators.

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

International Nuclear Information System (INIS)

Johnson, P.E.

1995-01-01

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

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

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

System overview and applications of a panoramic imaging perimeter sensor

International Nuclear Information System (INIS)

Pritchard, D.A.

1995-01-01

This paper presents an overview of the design and potential applications of a 360-degree scanning, multi-spectral intrusion detection sensor. This moderate-resolution, true panoramic imaging sensor is intended for exterior use at ranges from 50 to 1,500 meters. This Advanced Exterior Sensor (AES) simultaneously uses three sensing technologies (infrared, visible, and radar) along with advanced data processing methods to provide low false-alarm intrusion detection, tracking, and immediate visual assessment. The images from the infrared and visible detector sets and the radar range data are updated as the sensors rotate once per second. The radar provides range data with one-meter resolution. This sensor has been designed for easy use and rapid deployment to cover wide areas beyond or in place of typical perimeters, and tactical applications around fixed or temporary high-value assets. AES prototypes are in development. Applications discussed in this paper include replacements, augmentations, or new installations at fixed sites where topological features, atmospheric conditions, environmental restrictions, ecological regulations, and archaeological features limit the use of conventional security components and systems

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

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

Area G perimeter surface-soil and single-stage water sampling: Environmental surveillance for fiscal year 1993

International Nuclear Information System (INIS)

Conrad, R.; Childs, M.; Rivera-Dirks, C.; Coriz, F.

1995-07-01

Area G, in Technical Area 54, has been the principle facility at Los Alamos National Laboratory for the storage and disposal of low-level and transuranic (TRU) radioactive wastes since 1957. The current environmental investigation consisted of ESH-19 personnel who collected soil and single-stage water samples around the perimeter of Area G to characterize possible contaminant movement through surface-water runoff. These samples were analyzed for tritium, total uranium, isotopic plutonium, americium-241 (soil only), and cesium 137. The metals, mercury, lead, and barium, were analyzed using x-ray fluorescence

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

NARCIS (Netherlands)

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

2016-01-01

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

The StreamCat Dataset: Accumulated Attributes for NHDPlusV2 Catchments (Version 2.1) for the Conterminous United States: Wildland Fire Perimeters By Year 2000 - 2010

Data.gov (United States)

U.S. Environmental Protection Agency — This dataset represents the historical fire perimeters within individual local NHDPlusV2 catchments and upstream, contributing watersheds based on the GeoMAC...

Evaluating the Relation between Dominant and Non-Dominant Hand Perimeters and Handgrip Strength of Basketball, Volleyball, Badminton and Handball Athletes

Science.gov (United States)

Kaplan, Defne Öcal

2016-01-01

In this study, it's aimed to evaluate the relation between dominant and non-dominant hand perimeters and handgrip strength of basketball, volleyball, badminton and handball athletes. Totally 101 active athletes (49 females, 52 male), of the average age in female 20±1.42 years, in male 21±1.99 years, joined to this study. Height, body weight, BMI…

The role of fire severity, distance from fire perimeter and vegetation on post-fire recovery of small-mammal communities in chaparal

Science.gov (United States)

Jay Diffendorfer; Genie M. Fleming; Scott Tremor; Wayne Spencer; Jan L. Beyers

2012-01-01

Chaparral shrublands in southern California, US, exhibit significant biodiversity but are prone to large, intense wildfires. Debate exists regarding fuel reduction to prevent such fires in wildland areas, but the effects of these fires on fauna are not well understood. We studied whether fire severity and distance from unburned fire perimeter influenced recovery of the...

Hazmat Routes (National)

Data.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Liu Liu

2017-11-01

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

Multihop Wireless Networks Opportunistic Routing

CERN Document Server

Zeng, Kai; Li, Ming

2011-01-01

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

Hardware implementation of adaptive filtering using charge-coupled devices. [For perimeter security sensors

Energy Technology Data Exchange (ETDEWEB)

Donohoe, G.W.

1977-01-01

Sandia Laboratories' Digital Systems Division/1734, as part of its work on the Base and Installation Security Systems (BISS) program has been making use of adaptive digital filters to improve the signal-to-noise ratio of perimeter sensor signals. In particular, the Widrow-Hoff least-mean-squares algorithm has been used extensively. This non-recursive linear predictor has been successful in extracting aperiodic signals from periodic noise. The adaptive filter generates a predictor signal which is subtracted from the input signal to produce an error signal. The value of this error is fed back to the filter to improve the quality of the next prediction. Implementation of the Widrow adaptive filter using a Charge-Coupled Device tapped analog delay line, analog voltage multipliers and operational amplifiers is described. The resulting filter adapts to signals with frequency components as high as several megahertz.

Understanding individual routing behaviour.

Science.gov (United States)

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

2016-03-01

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

The StreamCat Dataset: Accumulated Attributes for NHDPlusV2 Catchments Riparian Buffer (Version 2.1) for the Conterminous United States: Wildland Fire Perimeters By Year 2000 - 2010

Data.gov (United States)

U.S. Environmental Protection Agency — This dataset represents the historical fire perimeters within individual local NHDPlusV2 catchments and upstream, contributing watersheds riparian buffers based on...

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

OpenAIRE

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

2017-01-01

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

Personal continuous route pattern mining

Institute of Scientific and Technical Information of China (English)

Qian YE; Ling CHEN; Gen-cai CHEN

2009-01-01

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

Forming Of Spherical Titanium Cups From Circular Blanks With Cutouts On The Perimeter

Directory of Open Access Journals (Sweden)

Lacki P.

2015-06-01

Full Text Available Despite substantial demand for drawn parts made of high-strength sheet metal (including titanium alloys observed in the modern industry, particularly automotive and aviation, their application remains insignificant. This results from the fact that such sheet metal shows poor plasticity and its cold-forming is almost impossible. Low drawability makes it impossible to obtain even such simple shapes as spherical cups. The authors of this study developed circular sheet-metal blanks with cutouts on their perimeter. The blanks allow for cold forming of spherical cups from Ti6Al4V titanium alloy sheet metal using conventional rigid tools. The cutouts proposed in the study affect plastic strain distribution, which in turn leads to an increase in forming depth by about 30%. The numerical analysis, performed using the PamStamp 2G System software based on finite element method, was verified experimentally.

Class network routing

Science.gov (United States)

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

2009-09-08

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

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

Science.gov (United States)

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

2016-01-01

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

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

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

Robustness of airline route networks

Science.gov (United States)

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

2016-03-01

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

Pushing the physics envelope Canada's new Perimeter Institute is planning to apply the risk-taking approach of venture capitalism to the pursuit of theoretical physics

CERN Multimedia

Spurgeon, D

2001-01-01

An highly successful business man has donated 100 million Canadian dollars to found the Perimeter Institue for Theoretical Physics. It is designed to attract young, innovative scientists to tackle some of the most difficult problems in physics such as quantum gravity and quantum information theory (1 page).

Návrh integrace IPv6 do počítačové sítě Mendelovy univerzity v Brně v oblasti směrování

OpenAIRE

Filip, Tomáš

2015-01-01

This master thesis deals with integration of IPv6 network protocol into production computer network of Mendel University in Brno in the routing field. The integration includes the Dual Stack transition mechanism, IPv6 address plan, static routing at the perimeter of the university network, and OSPFv3 and MP-BGP routing protocols. Proposed integration plan was verified in the Laboratory of computer networking at the Department of Informatics at FBE MENDELU, and it serves as a template for a fi...

An overview of smart grid routing algorithms

Science.gov (United States)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

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

Southern states' routing agency report

International Nuclear Information System (INIS)

1989-02-01

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

Southern States' Routing Agency Report

International Nuclear Information System (INIS)

1990-03-01

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

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

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

Guidelines for selecting preferred highway routes for highway-route-controlled quantity shipments of radioactive materials

International Nuclear Information System (INIS)

1989-01-01

The document presents guidelines for use by State officials in selecting preferred routes for highway route controlled quantity shipments of radioactive materials. A methodology for analyzing and comparing safety factors of alternative routes is described. Technical information on the impacts of radioactive material transportation needed to apply the methodology is also presented. Application of the methodology will identify the route (or set of routes) that minimizes the radiological impacts from shipments of these radioactive materials within a given State. Emphasis in the document is on practical application of the methodology. Some details of the derivation of the methods and data are presented in the appendices. All references in the body of the report can be found listed in the Bibliography (Appendix F)

Avaliação do espaço adicional requerido no perímetro do arco inferior para o nivelamento da curva de Spee Assessment of the additional lower arch perimeter needed for leveling the curve of Spee

Directory of Open Access Journals (Sweden)

Marcio José da Silva Campos

2009-08-01

Full Text Available OBJETIVO: determinar o perímetro de arco adicional necessário para o nivelamento da curva de Spee através de uma técnica laboratorial em modelos de estudo. MÉTODOS: foram utilizados 70 modelos inferiores nos quais se mediu a profundidade da curva de Spee e o perímetro do arco (de segundo molar a segundo molar. Nos mesmos modelos, após a simulação do nivelamento da curva de Spee, o perímetro de arco foi novamente avaliado, mantendo sua forma e comprimento. RESULTADOS: foi confirmada a correlação entre a profundidade da curva de Spee e o perímetro de arco adicional, sendo deduzida a fórmula [Paa = 0,21 CSmax - 0,04]. CONCLUSÃO: a técnica proposta permitiu, através da avaliação do perímetro de arco com curva de Spee nivelada, a determinação do espaço disponível para o alinhamento dentário.AIM: To determine the additional arch perimeter needed for leveling the curve of Spee by means of a laboratory technique using dental casts. METHODS: Seventy lower dental models were used for measuring the depth of the curve of Spee and assessing the arch perimeter from second molar to second molar. In these dental casts, after simulation of leveling the curve of Spee, arch perimeter was reevaluated, after maintaining its form and length. RESULTS: The correlation between the depth of the curve of Spee and the additional arch perimeter was ratified, as can be shown by the formula [Paa = 0,21 CSmax - 0,04]. CONCLUSION: The proposed technique allowed, through the assessment of the arch perimeter with the leveled curve of Spee, the determination of the space available for tooth alignment.

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

Directory of Open Access Journals (Sweden)

Tad T Brunyé

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

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

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

Intelligent routing protocol for ad hoc wireless network

Science.gov (United States)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

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

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

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

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

International Nuclear Information System (INIS)

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

1998-05-01

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

Collective network routing

Science.gov (United States)

Hoenicke, Dirk

2014-12-02

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

Route Scherrer and Route Einstein closed for construction work

CERN Multimedia

2015-01-01

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

Highway route controlled quantity shipment routing reports - An overview

International Nuclear Information System (INIS)

Cashwell, J.W.; Welles, B.W.; Welch, M.J.

1989-01-01

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

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

Data.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

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

Route-specific analysis for radioactive materials transportation

International Nuclear Information System (INIS)

1986-01-01

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

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

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

2018-04-01

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

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

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

1981-01-01

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

RSRP: A Robust Secure Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Sinha Ditipriya

2014-05-01

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

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

Science.gov (United States)

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

2014-10-01

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

Vehicle Routing With User Generated Trajectory Data

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

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

The way of land use in the perimeter of town Podu Iloaiei.

Directory of Open Access Journals (Sweden)

Irina Elena TODAŞCĂ

2010-04-01

Full Text Available Podu Iloaiei is situated in the south part of Jijia Plain, in Bahlui hydrographic basin. The relief is predominantlysculptural, followed by the accumulation relief. There are quaternary and basarabian  sediments/deposits. The climate is temperate-continental with dryness nuances whichcontributed to the growth of forest steppe vegetation. The hidrography is represented by Bahlui river and its main tributary: Bahluet. Pedological layer is influenced by the particular factors and processes of pedogenesis of Podu Iloaiei. There are spread types ofsoil from the following soil classes:cernisols, fluvisols, protisols and anthrosols. Podu Iloaiei perimeter didn’t have a spectacular evolution concerning its target. Its use is predominantly agricultural(83%, no matter the period studied(before and after 1990 orits recently rural-urban administrative structure. We may speak, in this case, about the existence of an agricultural-town. Many lands of Podu Iloaiei research station were taken over after 1990, by local entrepreneurs who preserve the modern techniques of land use,inherited from it. More than that, it feels the pressure of Iasi city, which determined some lands to get real interest.

A Genetic Algorithm on Inventory Routing Problem

Directory of Open Access Journals (Sweden)

Nevin Aydın

2014-03-01

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

Zone routing in a torus network

Science.gov (United States)

Chen, Dong; Heidelberger, Philip; Kumar, Sameer

2013-01-29

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

Full perimeter intersection criteria. Definitions and implementations in SR-Site

Energy Technology Data Exchange (ETDEWEB)

Munier, Raymond

2010-03-15

Large fractures intersecting canisters have potential to reactivate due to nearby earthquakes and thereby jeopardising the canister/buffer integrity. The use of full perimeter intersection (FPI) as a proxy for fracture size has been explored within SKB since late 2004. A methodology to use FPI as a deposition hole rejection criterion was first reported in and the concept has successively matured ever since. As a response to feedback obtained from various instances of our organisation and external reviewers, additional analyses and benchmarks were reported in 2007. An analytical solution to the canister/fracture intersection probability was introduced, which enabled us to benchmark various aspects of the FPI simulations. The methodology was first applied within the framework of SR-CAN to compute the number of potentially critical canister positions and soon after, based on preliminary DFN models, as one of many prerequisites for repository design. The methodology and simulation logic has evolved substantially ever since it was originally reported in 2006 and the present report is intended to entirely replace previous reports on this subject, to thereby provide the interested reader with an description of the modelling procedure, prerequisites and limitations. As a consequence thereof, major portions of previous reports are repeated herein, though we occasionally refer to these reports for comparative purposes. Furthermore, as the final versions of the site descriptive models have been reported we find it convenient to, within this report, also apply the methodology using the most actual site specific fracture data

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

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

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

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

The Pyramidal Capacitated Vehicle Routing Problem

DEFF Research Database (Denmark)

Lysgaard, Jens

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

The pyramidal capacitated vehicle routing problem

DEFF Research Database (Denmark)

Lysgaard, Jens

2010-01-01

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

Routed planar networks

Directory of Open Access Journals (Sweden)

David J. Aldous

2016-04-01

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

Road Routes for Waste Disposal - MDC_RecyclingRoute

Data.gov (United States)

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

Porcelain tiles by the dry route

International Nuclear Information System (INIS)

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

2010-01-01

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

VANET Routing Protocols: Pros and Cons

OpenAIRE

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

2012-01-01

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

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

Science.gov (United States)

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

2015-11-01

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

AIRFIL: a FORTRAN program for reduction of data obtained from alpha spectrometry of perimeter air filters

International Nuclear Information System (INIS)

Hinton, E.R. Jr.; Howell, R.L.

1984-03-01

Isotopic alpha spectrometry of 238 U, 235 U, and 234 U, along with gross alpha/beta counting of perimeter air filters, is performed by the Oak Ridge Y-12 Plant Laboratory in support of the Envrirnomental Monitoring Section of the Radiation Safety Department. Weekly samples are gross alpha/beta counted and the isotopic analysis performed on quarterly composites. Calculations and data management represents a major portion of the anlaysis time when performed manually, even with a desktop calculator. In order to reduce calculation time, perform orderly data manipulation and management, reduce errors due to redundant calculations, and eliminate report typing turnaround time, a computer program (AIRFIL) has been developed that performs these functions. The program accepts data through user prompts, then calculates and prints intermediate and final data, including detection limits

Highway and interline transportation routing models

International Nuclear Information System (INIS)

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

1994-01-01

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

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

Science.gov (United States)

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

2015-01-01

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

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

Science.gov (United States)

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

2018-01-01

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

Whirlpool routing for mobility

KAUST Repository

Lee, Jung Woo

2010-01-01

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

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

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

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

Las Matematicas: Lenguaje Universal. Grados Intermedios, Nivel 5b: Medida Lineal, Perimetro y Area (Mathematics: A Universal Language. Intermediate Grades, Level 5b: Linear Measure, Perimeter and Area).

Science.gov (United States)

Dissemination and Assessment Center for Bilingual Education, Austin, TX.

This is one of a series of student booklets designed for use in a bilingual mathematics program in grades 6-8. The general format is to present each page in both Spanish and English. The mathematical topics in this booklet include measurement, perimeter, and area. (MK)

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

Science.gov (United States)

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

2018-01-01

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

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

NARCIS (Netherlands)

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

2016-01-01

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

Route selection issues for NWPA shipments

International Nuclear Information System (INIS)

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

1993-01-01

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

The influence of the road layout on the Network Fundamental Diagram

NARCIS (Netherlands)

Knoop, V.L.; De Jong, D.M.; Hoogendoorn, S.P.

2014-01-01

The Macroscopic or Network Fundamental Diagram (NFD) describes the relationship between the network flow and the number of travellers within the network. The shape of the NFD is important for control purposes like perimeter control or routing. However, it is unknown how the network structure

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

Science.gov (United States)

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

2018-05-18

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

Port Authority of Allegheny County Transit Routes

Data.gov (United States)

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

The QKD network: model and routing scheme

Science.gov (United States)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

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

Environmental factors along the Northern Sea Route

International Nuclear Information System (INIS)

Fjeld, P.E.

1993-01-01

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

CAN Tree Routing for Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao LI

2014-01-01

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

Pheromone based alternative route planning

Directory of Open Access Journals (Sweden)

Liangbing Feng

2016-08-01

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

Route planning algorithms: Planific@ Project

Directory of Open Access Journals (Sweden)

Gonzalo Martín Ortega

2009-12-01

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

Vehicle routing problem in investment fund allocation

Science.gov (United States)

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

2013-04-01

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

Comparison of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2011-09-01

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

Aircraft route forecasting under adverse weather conditions

Directory of Open Access Journals (Sweden)

Thomas Hauf

2017-04-01

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

The Silk Route from Land to Sea

Directory of Open Access Journals (Sweden)

Jack Weatherford

2018-04-01

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

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

Science.gov (United States)

Baldwin, Jarret Taylor

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

Perception bias in route choice

NARCIS (Netherlands)

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

2014-01-01

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

User habits and multimodal route planning

Directory of Open Access Journals (Sweden)

Géza Katona

2017-10-01

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

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

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

2001-01-01

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

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

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

Spatial and Temporal Patterns of Unburned Areas within Fire Perimeters in the Northwestern United States from 1984 to 2014

Science.gov (United States)

Meddens, A. J.; Kolden, C.; Lutz, J. A.; Abatzoglou, J. T.; Hudak, A. T.

2016-12-01

Recently, there has been concern about increasing extent and severity of wildfires across the globe given rapid climate change. Areas that do not burn within fire perimeters can act as fire refugia, providing (1) protection from the detrimental effects of the fire, (2) seed sources, and (3) post-fire habitat on the landscape. However, recent studies have mainly focused on the higher end of the burn severity spectrum whereas the lower end of the burn severity spectrum has been largely ignored. We developed a spatially explicit database for 2,200 fires across the inland northwestern USA, delineating unburned areas within fire perimeters from 1984 to 2014. We used 1,600 Landsat scenes with one or two scenes before and one or two scenes after the fires to capture the unburned proportion of the fire. Subsequently, we characterized the spatial and temporal patterns of unburned areas and related the unburned proportion to interannual climate variability. The overall classification accuracy detecting unburned locations was 89.2% using a 10-fold cross-validation classification tree approach in combination with 719 randomly located field plots. The unburned proportion ranged from 2% to 58% with an average of 19% for a select number of fires. We find that using both an immediate post-fire image and a one-year post fire image improves classification accuracy of unburned islands over using just a single post-fire image. The spatial characteristics of the unburned islands differ between forested and non-forested regions with a larger amount of unburned area within non-forest. In addition, we show trends of unburned proportion related primarily to concurrent climatic drought conditions across the entire region. This database is important for subsequent analyses of fire refugia prioritization, vegetation recovery studies, ecosystem resilience, and forest management to facilitate unburned islands through fuels breaks, prescribed burning, and fire suppression strategies.

A Machine Learning Concept for DTN Routing

Science.gov (United States)

Dudukovich, Rachel; Hylton, Alan; Papachristou, Christos

2017-01-01

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

Warehouse order-picking process. Order-picker routing problem

Directory of Open Access Journals (Sweden)

E. V. Korobkov

2015-01-01

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

Routing algorithms in networks-on-chip

CERN Document Server

Daneshtalab, Masoud

2014-01-01

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

Stochastic vehicle routing with recourse

DEFF Research Database (Denmark)

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

2012-01-01

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

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

Science.gov (United States)

Mulyasari, Joni; Mawengkang, Herman; Efendi, Syahril

2018-02-01

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

Identification of Robust Terminal-Area Routes in Convective Weather

Science.gov (United States)

Pfeil, Diana Michalek; Balakrishnan, Hamsa

2012-01-01

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

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

Science.gov (United States)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

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

Great Ellipse Route Planning Based on Space Vector

Directory of Open Access Journals (Sweden)

LIU Wenchao

2015-07-01

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

The Route Analysis Based On Flight Plan

Science.gov (United States)

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

2016-02-01

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

Is Entrepreneurship a Route Out of Deprivation?

DEFF Research Database (Denmark)

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

2014-01-01

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

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Science.gov (United States)

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

2013-01-01

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

Optimizing well intervention routes

Energy Technology Data Exchange (ETDEWEB)

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

2000-07-01

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

Energy-Aware Routing Protocol for Ad Hoc Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mann Raminder P

2005-01-01

Full Text Available Wireless ad hoc sensor networks differ from wireless ad hoc networks from the following perspectives: low energy, lightweight routing protocols, and adaptive communication patterns. This paper proposes an energy-aware routing protocol (EARP suitable for ad hoc wireless sensor networks and presents an analysis for its energy consumption in various phases of route discovery and maintenance. Based on the energy consumption associated with route request processing, EARP advocates the minimization of route requests by allocating dynamic route expiry times. This paper introduces a unique mechanism for estimation of route expiry time based on the probability of route validity, which is a function of time, number of hops, and mobility parameters. In contrast to AODV, EARP reduces the repeated flooding of route requests by maintaining valid routes for longer durations.

A study of routing algorithms for SCI-Based multistage networks

International Nuclear Information System (INIS)

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

1994-03-01

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

Towards seasonal Arctic shipping route predictions

Science.gov (United States)

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

2017-12-01

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

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2016-02-01

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

Lessons learned by southern states in designating alternative routes

International Nuclear Information System (INIS)

1989-08-01

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

Quantum chemistry-assisted synthesis route development

International Nuclear Information System (INIS)

Hori, Kenji; Sumimoto, Michinori; Murafuji, Toshihiro

2015-01-01

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

Area G perimeter surface-soil and single-stage water sampling. Environmental surveillance for fiscal year 95. Progress report

International Nuclear Information System (INIS)

Childs, M.; Conrad, R.

1997-09-01

ESH-19 personnel collected soil and single-stage water samples around the perimeter of Area G at Los Alamos National Laboratory (LANL) during FY 95 to characterize possible radionuclide movement out of Area G through surface water and entrained sediment runoff. Soil samples were analyzed for tritium, total uranium, isotopic plutonium, americium-241, and cesium-137. The single-stage water samples were analyzed for tritium and plutonium isotopes. All radiochemical data was compared with analogous samples collected during FY 93 and 94 and reported in LA-12986 and LA-13165-PR. Six surface soils were also submitted for metal analyses. These data were included with similar data generated for soil samples collected during FY 94 and compared with metals in background samples collected at the Area G expansion area

Route Choice Model Based on Game Theory for Commuters

Directory of Open Access Journals (Sweden)

Licai Yang

2016-06-01

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

On line routing per mobile phone

DEFF Research Database (Denmark)

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

2009-01-01

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

A tree routing protocol for cognitive radio network

Directory of Open Access Journals (Sweden)

Mohammed Hashem

2017-07-01

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

Route Network Construction with Location-Direction-Enabled Photographs

Science.gov (United States)

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

2018-05-01

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

Development of safe routes for children in urban environment

Science.gov (United States)

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

2018-01-01

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

Routing architecture and security for airborne networks

Science.gov (United States)

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

2009-05-01

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

Repeatability of Retinal Sensitivity Measurements Using a Medmont Dark-Adapted Chromatic Perimeter in Healthy and Age-Related Macular Degeneration Cases.

Science.gov (United States)

Tan, Rose S; Guymer, Robyn H; Luu, Chi D

2018-05-01

To determine the intrasession and intersession test-retest repeatability of retinal sensitivity measurements using a dark-adapted chromatic perimeter (DACP). For intrasession testing, retinal sensitivity within the central 24° for the 505-nm stimulus was measured after 20, 30, and 40 minutes of dark adaptation (DA) and for the 625-nm stimulus was measured after the first and second 505-nm tests. For intersession testing, retinal sensitivity for both stimuli was measured after 30 minutes of DA at baseline and 1 month. The point-wise sensitivity (PWS) difference and coefficient of repeatability (CoR) of each stimulus and group were determined. For intrasession testing, 10 age-related macular degeneration (AMD) and eight control subjects were recruited. The overall CoR for the 505-nm stimulus was 8.4 dB for control subjects and 9.1 dB for AMD cases, and for the 625-nm stimulus was 6.7 dB for control subjects and 9.5 dB for AMD cases. For intersession testing, seven AMD cases and 13 control subjects returned an overall CoR for the 505-nm stimulus of 8.2 dB for the control and 11.7 dB for the AMD group. For the 625-nm stimulus the CoR was 6.2 dB for the control group and 8.4 dB for the AMD group. Approximately 80% of all test points had a PWS difference of ±5 dB between the two intrasession or intersession measurements for both stimuli. The CoR for the DACP is larger than that reported for scotopic perimeters; however, the majority of test points had a PWS difference of ±5 dB between tests. The DACP offers an opportunity to measure static and dynamic rod function at multiple locations with an acceptable reproducibility level.

Constructibility Challenges for Perimeter Control Blasting and Slope Development in Shale and Other "Weak" Rocks

Science.gov (United States)

Scarpato, D. J.

2016-02-01

Slope construction in shale can present some interesting challenges for geotechnical design engineers and contractors alike. There are challenges that can be expected and designed for; however, all too frequently, such challenges manifest themselves as "surprises" in the field. Common constructibility challenges can include drill hole deviation during drilling for controlled blasting; and, excavation slope instability arising from inconsistent perimeter control drilling. Drill hole deviation results from the cumulative effects from both drilling mechanics and rock mass conditions. Once a hole has initiated the deviation trajectory, it is difficult to rectify drill steel position. Although such challenges are not necessarily unique to shale, they are often exacerbated by weak, weathered and transversely isotropic nature of bedrock conditions. All too often, the working assumption is that shale is "soft" and easily excavatable; however, this blanket assumption can prove to be costly. This paper is intended to provide design professionals and contractors with the practical considerations needed to avoid the "surprises" associated with drill hole deviation, and minimize the potential for costly claims.

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

Directory of Open Access Journals (Sweden)

Yan Han

2014-01-01

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

Optimizing departure times in vehicle routes

NARCIS (Netherlands)

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

2008-01-01

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

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

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

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2016-01-01

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

Routes and Stations

Data.gov (United States)

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

New TPG bus route 28

CERN Multimedia

2003-01-01

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

Interfacing Hardware Accelerators to a Time-Division Multiplexing Network-on-Chip

DEFF Research Database (Denmark)

Pezzarossa, Luca; Sørensen, Rasmus Bo; Schoeberl, Martin

2015-01-01

This paper addresses the integration of stateless hardware accelerators into time-predictable multi-core platforms based on time-division multiplexing networks-on-chip. Stateless hardware accelerators, like floating-point units, are typically attached as co-processors to individual processors in ...... implementation. The design evaluation is carried out using the open source T-CREST multi-core platform implemented on an Altera Cyclone IV FPGA. The size of the proposed design, including a floating-point accelerator, is about two-thirds of a processor....

Radionuclides, Heavy Metals, and Polychlorinated Biphenyls in Soils Collected Around the Perimeter of Low-Level Radioactive Waste Disposal Area G during 2006

International Nuclear Information System (INIS)

P. R. Fresquez

2007-01-01

Twenty-one soil surface samples were collected in March around the perimeter of Area G, the primary disposal facility for low-level radioactive solid waste at Los Alamos National Laboratory (LANL). Three more samples were collected in October around the northwest corner after elevated tritium levels were detected on an AIRNET station located north of pit 38 in May. Also, four soil samples were collected along a transect at various distances (48, 154, 244, and 282 m) from Area G, starting from the northeast corner and extending to the Pueblo de San Ildefonso fence line in a northeasterly direction (this is the main wind direction). Most samples were analyzed for radionuclides ( 3 H, 238 Pu, 239,240 Pu, 241 Am, 234 U, 235 U, and 238 U), inorganic elements (Al, Ba, Be, Ca, Cr, Co, Cu, Fe, Mg, Mn, Ni, K, Na, V, Hg, Zn, Sb, As, Cd, Pb, Se, Ag, and Tl) and polychlorinated biphenyl (PCB) concentrations. As in previous years, the highest levels of 3 H in soils (690 pCi/mL) were detected along the south portion of Area G near the 3 H shafts; whereas, the highest concentrations of 241 Am (1.2 pCi/g dry) and the Pu isotopes (1.9 pCi/g dry for 238 Pu and 5 pCi/g dry for 239,240 Pu) were detected along the northeastern portions near the transuranic waste pads. Concentrations of 3 H in three soil samples and 241 Am and Pu isotopes in one soil sample collected around the northwest corner in October increased over concentrations found in soils collected at the same locations earlier in the year. Almost all of the heavy metals, with the exception of Zn and Sb in one sample each, in soils around the perimeter of Area G were below regional statistical reference levels (mean plus three standard deviations) (RSRLs). Similarly, only one soil sample collected on the west side contained PCB concentrations--67 (micro)g/kg dry of aroclor-1254 and 94 (micro)g/kg dry of aroclor-1260. Radionuclide and inorganic element concentrations in soils collected along a transect from Area G to the

Perspectives on Illegal Routes in Nigeria

African Journals Online (AJOL)

Nneka Umera-Okeke

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

Optimizing Departure Times in Vehicle Routes

NARCIS (Netherlands)

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

2011-01-01

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

Classification of Dynamic Vehicle Routing Systems

DEFF Research Database (Denmark)

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

2007-01-01

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

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

Directory of Open Access Journals (Sweden)

Patrick Booz

2016-06-01

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

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

Directory of Open Access Journals (Sweden)

Noraziah Adzhar

2014-01-01

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

Sigma Routing Metric for RPL Protocol

Directory of Open Access Journals (Sweden)

Paul Sanmartin

2018-04-01

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

Traffic modifications on Routes Rutherford, Democrite and Fermi

CERN Multimedia

2015-01-01

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

Traffic modifications on Routes Rutherford, Democrite and Fermi

CERN Multimedia

2015-01-01

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

An adversarial queueing model for online server routing

NARCIS (Netherlands)

Bonifaci, V.

2007-01-01

In an online server routing problem, a vehicle or server moves in a network in order to process incoming requests at the nodes. Online server routing problems have been thoroughly studied using competitive analysis. We propose a new model for online server routing, based on adversarial queueing

41 CFR 109-40.302 - Standard routing principle.

Science.gov (United States)

2010-07-01

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

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

Directory of Open Access Journals (Sweden)

Tsung-Han Lee

2013-01-01

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

Energy Efficient Routing in Nomadic Networks

DEFF Research Database (Denmark)

Kristensen, Mads Darø; Bouvin, Niels Olof

2007-01-01

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

A Novel CAN Tree Coordinate Routing in Content-Addressable Network

Directory of Open Access Journals (Sweden)

Zhongtao Li

2014-09-01

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

Sinkhole Avoidance Routing in Wireless Sensor Networks

Science.gov (United States)

2011-05-09

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

Beyond Traditional DTN Routing: Social Networks for Opportunistic Communication

OpenAIRE

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

2011-01-01

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

Occurrence of radon in the Polish underground tourist routes

Directory of Open Access Journals (Sweden)

Jerzy Olszewski

2015-08-01

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

Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem

Directory of Open Access Journals (Sweden)

Baozhen Yao

2014-02-01

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

A Clustering Routing Protocol for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Jinke Huang

2016-01-01

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

TCPL: A Defense against wormhole attacks in wireless sensor networks

International Nuclear Information System (INIS)

Kumar, K. E. Naresh; Waheed, Mohd. Abdul; Basappa, K. Kari

2010-01-01

Do In this paper presents recent advances in technology have made low-cost, low-power wireless sensors with efficient energy consumption. A network of such nodes can coordinate among themselves for distributed sensing and processing of certain data. For which, we propose an architecture to provide a stateless solution in sensor networks for efficient routing in wireless sensor networks. This type of architecture is known as Tree Cast. We propose a unique method of address allocation, building up multiple disjoint trees which are geographically inter-twined and rooted at the data sink. Using these trees, routing messages to and from the sink node without maintaining any routing state in the sensor nodes is possible. In this paper, we introduce the wormhole attack, a severe attack in ad hoc networks that is particularly challenging to defend against. The wormhole attack is possible even if the attacker has not compromised any hosts and even if all communication provides authenticity and confidentiality. In the wormhole attack, an attacker records packets (or bits) at one location in the network, tunnels them to another location, and retransmits them there into the network. The wormhole attack can form a serious threat in wireless networks, especially against many sensor network routing protocols and location-based wireless security systems. For example, most existing ad hoc network routing protocols, without some mechanism to defend against the wormhole attack, would be unable to find routes longer than one or two hops, severely disrupting communication. We present a new, general mechanism, called packet leashes, for detecting and thus defending against wormhole attacks, and we present a specific protocol, called TIK, that implements leashes.

Routing in Optical and Stochastic Networks

NARCIS (Netherlands)

Yang, S.

2015-01-01

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

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

International Nuclear Information System (INIS)

Michelhaugh, R.D.

2000-01-01

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

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

Data.gov (United States)

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

Pharmacokinetics of Alternative Administration Routes of Melatonin

DEFF Research Database (Denmark)

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

2016-01-01

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

Energy Aware Simple Ant Routing Algorithm for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Sohail Jabbar

2015-01-01

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

Route Flap Damping Made Usable

Science.gov (United States)

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

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

Using Sphinx to Improve Onion Routing Circuit Construction

Science.gov (United States)

Kate, Aniket; Goldberg, Ian

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

Iconic memory-based omnidirectional route panorama navigation.

Science.gov (United States)

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

2005-01-01

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

Routing in Wireless Multimedia Home Networks

NARCIS (Netherlands)

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

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

Low Carbon Footprint Routes for Bird Watching

Directory of Open Access Journals (Sweden)

Wei-Ta Fang

2015-03-01

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

Perancangan dan Analisis Redistribution Routing Protocol OSPF dan EIGRP

Directory of Open Access Journals (Sweden)

DWI ARYANTA

2014-07-01

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

Analyzing multiday route choice behavior of commuters using GPS data

Directory of Open Access Journals (Sweden)

Wenyun Tang

2016-02-01

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

Route assessment using comparative risk factors integrated through a GIS

International Nuclear Information System (INIS)

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

1996-01-01

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

Routing in Wireless Multimedia Home Networks

NARCIS (Netherlands)

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

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

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

Indian Academy of Sciences (India)

NONITA SHARMA

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

Availability of processed foods in the perimeter of public schools in urban areas.

Science.gov (United States)

Leite, Fernanda Helena Marrocos; Oliveira, Maria Aparecida de; Cremm, Elena Carvalho; Abreu, Débora Silva Costa de; Maron, Luana Rieffe; Martins, Paula Andrea

2012-07-01

To assess the availability of food in relation to their degree of industrial processing and the types of food stores in the perimeters of elementary schools. This is a cross-sectional study. 82 food stores located within a 500 m radius buffer of three public schools located in three distinct regions with different socioeconomic levels in the municipality of Santos, state of São Paulo, Brazil, were assessed. All streets within a 500-meter radius of the schools were covered, geographic coordinates were recorded and information about the stores and food items available were collected by direct observation and interview with store managers. Available food items were classified in relation to their degree of industrial processing as ultra-processed foods and minimally processed foods. Kernel's density maps were used to assess the degree of agglomeration of stores near the schools. The stores that offered mostly ultra-processed foods were significantly closer to schools than those who offered mostly minimally processed foods. There was a significant difference between the availability of processed food in different types of stores and between the three regions assessed. The data found by this work evidence that children who attend the three public schools assessed are exposed to an environment that encourages the consumption of ultra-processed foods through easier access of these products in the studied stores.

A joint routing and speed optimization problem

OpenAIRE

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

2016-01-01

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

Suppressing traffic-driven epidemic spreading by adaptive routing strategy

International Nuclear Information System (INIS)

Yang, Han-Xin; Wang, Zhen

2016-01-01

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

Satellite network robust QoS-aware routing

CERN Document Server

Long, Fei

2014-01-01

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

An inventory location routing model with environmental considerations

Directory of Open Access Journals (Sweden)

Lerhlaly Sanaa

2017-01-01

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks.

Science.gov (United States)

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

2018-04-23

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

Path Diversity Improved Opportunistic Routing for Underwater Sensor Networks

Directory of Open Access Journals (Sweden)

Weigang Bai

2018-04-01

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

Data fusion concept in multispectral system for perimeter protection of stationary and moving objects

Science.gov (United States)

Ciurapiński, Wieslaw; Dulski, Rafal; Kastek, Mariusz; Szustakowski, Mieczyslaw; Bieszczad, Grzegorz; Życzkowski, Marek; Trzaskawka, Piotr; Piszczek, Marek

2009-09-01

The paper presents the concept of multispectral protection system for perimeter protection for stationary and moving objects. The system consists of active ground radar, thermal and visible cameras. The radar allows the system to locate potential intruders and to control an observation area for system cameras. The multisensor construction of the system ensures significant improvement of detection probability of intruder and reduction of false alarms. A final decision from system is worked out using image data. The method of data fusion used in the system has been presented. The system is working under control of FLIR Nexus system. The Nexus offers complete technology and components to create network-based, high-end integrated systems for security and surveillance applications. Based on unique "plug and play" architecture, system provides unmatched flexibility and simplistic integration of sensors and devices in TCP/IP networks. Using a graphical user interface it is possible to control sensors and monitor streaming video and other data over the network, visualize the results of data fusion process and obtain detailed information about detected intruders over a digital map. System provides high-level applications and operator workload reduction with features such as sensor to sensor cueing from detection devices, automatic e-mail notification and alarm triggering.

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

Science.gov (United States)

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

1989-01-01

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

Transportation of radioactive materials routing analysis: The Nevada experience

International Nuclear Information System (INIS)

Ardila-Coulson, M.V.

1991-01-01

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

Mobility Tolerant Firework Routing for Improving Reachability in MANETs

Directory of Open Access Journals (Sweden)

Gen Motoyoshi

2014-03-01

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

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

Indian Academy of Sciences (India)

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

Airway basement membrane perimeter in human airways is not a constant; potential implications for airway remodeling in asthma.

Science.gov (United States)

McParland, Brent E; Paré, Peter D; Johnson, Peter R A; Armour, Carol L; Black, Judith L

2004-08-01

Many studies that demonstrate an increase in airway smooth muscle in asthmatic patients rely on the assumption that bronchial internal perimeter (P(i)) or basement membrane perimeter (P(bm)) is a constant, i.e., not affected by fixation pressure or the degree of smooth muscle shortening. Because it is the basement membrane that has been purported to be the indistensible structure, this study examines the assumption that P(bm) is not affected by fixation pressure. P(bm) was determined for the same human airway segment (n = 12) fixed at distending pressures of 0 cmH(2)O and 21 cmH(2)O in the absence of smooth muscle tone. P(bm) for the segment fixed at 0 cmH(2)O was determined morphometrically, and the P(bm) for the same segment, had the segment been fixed at 21 cmH(2)O, was predicted from knowing the luminal volume and length of the airway when distended to 21 cmH(2)O (organ bath-derived P(i)). To ensure an accurate transformation of the organ bath-derived P(i) value to a morphometry-derived P(bm) value, had the segment been fixed at 21 cmH(2)O, the relationship between organ bath-derived P(i) and morphometry-derived P(bm) was determined for five different bronchial segments distended to 21 cmH(2)O and fixed at 21 cmH(2)O (r(2) = 0.99, P < 0.0001). Mean P(bm) for bronchial segments fixed at 0 cmH(2)O was 9.4 +/- 0.4 mm, whereas mean predicted P(bm), had the segments been fixed at 21 cmH(2)O, was 14.1 +/- 0.5 mm (P < 0.0001). This indicates that P(bm) is not a constant when isolated airway segments without smooth muscle tone are fixed distended to 21 cmH(2)O. The implication of these results is that the increase in smooth muscle mass in asthma may have been overestimated in some previous studies. Therefore, further studies are required to examine the potential artifact using whole lungs with and without abolition of airway smooth muscle tone and/or inflation.

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

Directory of Open Access Journals (Sweden)

Amit Sarkar

2016-12-01

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

An Indirect Route for Ethanol Production

Energy Technology Data Exchange (ETDEWEB)

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

2005-04-29

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

Alternative routes to olefins. Chances and challenges

Energy Technology Data Exchange (ETDEWEB)

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

2013-11-01

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

Privacy-Preserving Interdomain Routing at Internet Scale

Directory of Open Access Journals (Sweden)

Asharov Gilad

2017-07-01

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

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

Indian Academy of Sciences (India)

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

Benefits Analysis of Multi-Center Dynamic Weather Routes

Science.gov (United States)

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

2014-01-01

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

Integrating routing decisions in public transportation problems

CERN Document Server

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

On the vehicle routing problem with time windows

DEFF Research Database (Denmark)

Kallehauge, Brian

2006-01-01

. The fourth and final paper ‘Vehicle routing problem with time windows’ (Kallehauge, Larsen, Madsen, and Solomon. In Desaulniers, Desrosiers, and Solomon, editors, Column generation, pages 67-98, Springer, New York, 2005) is a contribution to a book on column generation edited by G. Desaulniers, J. Desrosiers......The vehicle routing problem with time windows is concerned with the optimal routing of a fleet of vehicles between a depot and a number of customers that must be visited within a specified time interval, called a time window. The purpose of this thesis is to develop new and efficient solution...... techniques for solving the vehicle routing problem with time windows (VRPTW). The thesis consists of a section of introductory remarks and four independent papers. The first paper ‘Formulations and exact approaches for the vehicle routing problem with time windows’ (Kallehauge, 2005, unpublished) is a review...

Improved Efficient Routing Strategy on Scale-Free Networks

Science.gov (United States)

Jiang, Zhong-Yuan; Liang, Man-Gui

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

Routing Optimization of Intelligent Vehicle in Automated Warehouse

Directory of Open Access Journals (Sweden)

Yan-cong Zhou

2014-01-01

Full Text Available Routing optimization is a key technology in the intelligent warehouse logistics. In order to get an optimal route for warehouse intelligent vehicle, routing optimization in complex global dynamic environment is studied. A new evolutionary ant colony algorithm based on RFID and knowledge-refinement is proposed. The new algorithm gets environmental information timely through the RFID technology and updates the environment map at the same time. It adopts elite ant kept, fallback, and pheromones limitation adjustment strategy. The current optimal route in population space is optimized based on experiential knowledge. The experimental results show that the new algorithm has higher convergence speed and can jump out the U-type or V-type obstacle traps easily. It can also find the global optimal route or approximate optimal one with higher probability in the complex dynamic environment. The new algorithm is proved feasible and effective by simulation results.

OSM-ORIENTED METHOD OF MULTIMODAL ROUTE PLANNING

Directory of Open Access Journals (Sweden)

X. Li

2015-07-01

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

Multifactor-Driven Hierarchical Routing on Enterprise Service Bus

Science.gov (United States)

Mi, Xueqiang; Tang, Xinhuai; Yuan, Xiaozhou; Chen, Delai; Luo, Xiangfeng

Message Routing is the foremost functionality on Enterprise Service Bus (ESB), but current ESB products don't provide an expected solution for it, especially in the aspects of runtime route change mechanism and service orchestration model. In order to solve the above drawbacks, this paper proposes a multifactor-driven hierarchical routing (MDHR) model. MDHR defines three layers for message routing on ESB. Message layer gives the original support for message delivery. Application layer can integration or encapsulate some legacy applications or un-standard services. Business layer introduces business model to supplies developers with a business rule configuration, which supports enterprise integration patterns and simplifies the service orchestration on ESB.

A Survey of Routing Protocols in Wireless Body Sensor Networks

Science.gov (United States)

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

2014-01-01

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

Exploring en-route parking type and parking-search route choice

DEFF Research Database (Denmark)

Kaplan, Sigal; Bekhor, Sholomo

2011-01-01

This paper describes the first phase of an on-going research investigating the joint choice of parking type, parking facility and cruising-for-parking route. The importance of this issue derives from the significant share of cruising-for-parking traffic in urban areas, the relevance of parking po...

Applications of RADTRAN 4 to route-specific analysis

International Nuclear Information System (INIS)

Neuhauser, Sieglinde; Weiner, Ruth F.

1992-01-01

The transportation risk evaluation code RADTRAN 4 is designed to evaluate doses and risks associated with the transportation of radioactive materials. RADTRAN 4 may be used to calculate dose consequences for incident- free transportation and dose risks for accidents. Consequences of normal (or incident-free) transportation include doses to crew members, persons at stops, and members of the public sharing a route segment (on-link) and residing near the segment (off-link) during normal transportation. These dose estimates are not multiplied by a probability factor and, hence, are referred to as dose consequences. Calculated doses that might be incurred during accidents arc multiplied by the probabilities of those accidents, and hence are referred to as dose risks. RADTRAN 4 includes a LINK option that allows the user to characterize each link or segment of a transportation route in greater detail than that provided by average or default values for route-related parameters. The LINK option increases the flexibility of the code in several ways: LINK allows the same route segment to be evaluated under a variety of conditions. This capability may be used to prepare environmental documentation and to evaluate alternative routes under V.S. Department of Transportation Docket HM-164 (49 CFR 171-177); LINK capability may be used to assess the impact of projected population shifts on transportation routes; LINK facilitates comparison of the national average data included as defaults in RADTRAN with available 'route-specific' data. (author)

Link reliability based hybrid routing for tactical mobile ad hoc network

Institute of Scientific and Technical Information of China (English)

Xie Xiaochuan; Wei Gang; Wu Keping; Wang Gang; Jia Shilou

2008-01-01

Tactical mobile ad hoc network (MANET) is a collection of mobile nodes forming a temporary network,without the aid of pre-established network infrastructure. The routing protocol has a crucial impact on the networkperformance in battlefields. Link reliability based hybrid routing (LRHR) is proposed, which is a novel hybrid routing protocol, for tactical MANET. Contrary to the traditional single path routing strategy, multiple paths are established between a pair of source-destination nodes. In the hybrid routing strategy, the rate of topological change provides a natural mechanism for switching dynamically between table-driven and on-demand routing. The simulation results indicate that the performances of the protocol in packet delivery ratio, routing overhead, and average end-to-end delay are better than the conventional routing protocol.

OSPF-TE Extensions for Green Routing in Optical Networks

DEFF Research Database (Denmark)

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

2012-01-01

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

Computer-based route-definition system for peripheral bronchoscopy.

Science.gov (United States)

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

2012-04-01

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

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

Science.gov (United States)

Santos, Andrés; Manzano, Gema

2010-04-14

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

Deduction of passengers' route choice from smart card data

NARCIS (Netherlands)

Van Der Hurk, Evelien; Kroon, Leo; Maroti, Gabor; Vervest, Peter

2013-01-01

Deducing passengers' route choice from smart card data provides public transport operators the opportunity to evaluate passenger service. Especially in case of disruptions when route choice models may not be valid this is an advantage. This paper proposes a method for deducing the chosen route of

Fast reactor calculational route for Pu burning core design

Energy Technology Data Exchange (ETDEWEB)

Hunter, S. [Power Reactor and Nuclear Fuel Development Corp., Oarai, Ibaraki (Japan). Oarai Engineering Center

1998-01-01

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

Uncertainties estimation in surveying measurands: application to lengths, perimeters and areas

Science.gov (United States)

Covián, E.; Puente, V.; Casero, M.

2017-10-01

The present paper develops a series of methods for the estimation of uncertainty when measuring certain measurands of interest in surveying practice, such as points elevation given a planimetric position within a triangle mesh, 2D and 3D lengths (including perimeters enclosures), 2D areas (horizontal surfaces) and 3D areas (natural surfaces). The basis for the proposed methodology is the law of propagation of variance-covariance, which, applied to the corresponding model for each measurand, allows calculating the resulting uncertainty from known measurement errors. The methods are tested first in a small example, with a limited number of measurement points, and then in two real-life measurements. In addition, the proposed methods have been incorporated to commercial software used in the field of surveying engineering and focused on the creation of digital terrain models. The aim of this evolution is, firstly, to comply with the guidelines of the BIPM (Bureau International des Poids et Mesures), as the international reference agency in the field of metrology, in relation to the determination and expression of uncertainty; and secondly, to improve the quality of the measurement by indicating the uncertainty associated with a given level of confidence. The conceptual and mathematical developments for the uncertainty estimation in the aforementioned cases were conducted by researchers from the AssIST group at the University of Oviedo, eventually resulting in several different mathematical algorithms implemented in the form of MATLAB code. Based on these prototypes, technicians incorporated the referred functionality to commercial software, developed in C++. As a result of this collaboration, in early 2016 a new version of this commercial software was made available, which will be the first, as far as the authors are aware, that incorporates the possibility of estimating the uncertainty for a given level of confidence when computing the aforementioned surveying

SET-Routes programme

CERN Multimedia

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.

A model of ant route navigation driven by scene familiarity.

Directory of Open Access Journals (Sweden)

Bart Baddeley

2012-01-01

Full Text Available In this paper we propose a model of visually guided route navigation in ants that captures the known properties of real behaviour whilst retaining mechanistic simplicity and thus biological plausibility. For an ant, the coupling of movement and viewing direction means that a familiar view specifies a familiar direction of movement. Since the views experienced along a habitual route will be more familiar, route navigation can be re-cast as a search for familiar views. This search can be performed with a simple scanning routine, a behaviour that ants have been observed to perform. We test this proposed route navigation strategy in simulation, by learning a series of routes through visually cluttered environments consisting of objects that are only distinguishable as silhouettes against the sky. In the first instance we determine view familiarity by exhaustive comparison with the set of views experienced during training. In further experiments we train an artificial neural network to perform familiarity discrimination using the training views. Our results indicate that, not only is the approach successful, but also that the routes that are learnt show many of the characteristics of the routes of desert ants. As such, we believe the model represents the only detailed and complete model of insect route guidance to date. What is more, the model provides a general demonstration that visually guided routes can be produced with parsimonious mechanisms that do not specify when or what to learn, nor separate routes into sequences of waypoints.

Ising model for packet routing control

International Nuclear Information System (INIS)

Horiguchi, Tsuyoshi; Takahashi, Hideyuki; Hayashi, Keisuke; Yamaguchi, Chiaki

2004-01-01

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

A Method for Driving Route Predictions Based on Hidden Markov Model

Directory of Open Access Journals (Sweden)

Ning Ye

2015-01-01

Full Text Available We present a driving route prediction method that is based on Hidden Markov Model (HMM. This method can accurately predict a vehicle’s entire route as early in a trip’s lifetime as possible without inputting origins and destinations beforehand. Firstly, we propose the route recommendation system architecture, where route predictions play important role in the system. Secondly, we define a road network model, normalize each of driving routes in the rectangular coordinate system, and build the HMM to make preparation for route predictions using a method of training set extension based on K-means++ and the add-one (Laplace smoothing technique. Thirdly, we present the route prediction algorithm. Finally, the experimental results of the effectiveness of the route predictions that is based on HMM are shown.

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

Directory of Open Access Journals (Sweden)

Wu Jieyi

2005-01-01

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

Proxies for Anonymous Routing

National Research Council Canada - National Science Library

Reed, Michael G; Syverson, Paul F; Goldschlag, David M

1996-01-01

...), and file transfers (FTP) have been implemented. Onion routing provides application independent, real-time, and bi-directional anonymous connections that are resistant to both eavesdropping and traffic analysis...

Introducing radiality constraints in capacitated location-routing problems

Directory of Open Access Journals (Sweden)

Eliana Mirledy Toro Ocampo

2017-03-01

Full Text Available In this paper, we introduce a unified mathematical formulation for the Capacitated Vehicle Routing Problem (CVRP and for the Capacitated Location Routing Problem (CLRP, adopting radiality constraints in order to guarantee valid routes and eliminate subtours. This idea is inspired by formulations already employed in electric power distribution networks, which requires a radial topology in its operation. The results show that the proposed formulation greatly improves the convergence of the solver.

An improved AODV routing protocol based on tower structure

Directory of Open Access Journals (Sweden)

Li Yong Qiang

2016-01-01

Full Text Available The paper proposed a new routing protocol(IAODV based on tower structure in the Ad Hoc network for the problem which Location Routing Protocol need hardware and Complex algorithm. By the simulation, The complexity of the new routing protocol is reduced without reducing the performance of the network.

Delay Management with Re-Routing of Passengers

NARCIS (Netherlands)

T.A.B. Dollevoet (Twan); D. Huisman (Dennis); M.E. Schmidt (Marie); A. Schöbel (Anita)

2010-01-01

textabstractThe question of delay management is whether trains should wait for a delayed feeder train or should depart on time. In classical delay management models passengers always take their originally planned route. In this paper, we propose a model where re-routing of passengers is

Joint route planning under varying market conditions

NARCIS (Netherlands)

Cruijssen, Frans; Bräysy, Olli; Dullaert, Wout; Fleuren, Hein; Salomon, Marc

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

Many routes leading to Rome: Potential causes for the multi-route migration system of Red Knots Calidris canutus islandica

NARCIS (Netherlands)

Bauer, S.; Ens, B.J.; Klaassen, M.R.J.

2010-01-01

Migrants, such as birds or representatives of other taxa, usually make use of several stopover sites to cover the distance between their site of origin and destination. Potentially, multiple routes exist, but often little is known about the causes and consequences of alternative migration routes.

A novel insight into beaconless geo-routing

KAUST Repository

Bader, Ahmed

2012-12-01

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

Location-Aided Reliable Routing for Opportunistic Networks

Institute of Scientific and Technical Information of China (English)

Yong Yang; Zhi Ren; Jibi Li

2012-01-01

In our study, we investigate the problem of location-based routing in opportunistic networks. Due to the uncertainty of end-to-end paths between sources and destinations, the classical location-based ad hoc routing protocols cannot adapt to the environment of opportunistic networks, which leads to the decrease of the delivery rate of data. To address it, we propose in this paper a novel location-aided routing protocol which is suitable for opportunistic networks. In our protocol, a node can send location information on demand by using prediction mechanism, and when sending a data packet, the node chooses multiple neighbors which are closer to the destination as next hops. If the candidate neighbors do not exist, the node carries the data till it meets a proper neighbor or the destination. Theoretical analysis and simulation results show that our proposed protocol outperforms DREAM (Distance Routing Effect Protocol Mobility) and one of its improved versions, BFDREAM (Boundary Forwarding DREAM), in terms of the delivery rate and overhead.

Coordinated Platoon Routing in a Metropolitan Network

Energy Technology Data Exchange (ETDEWEB)

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

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

Physiological intracellular crowdedness is defined by perimeter to area ratio of subcellular compartments

Directory of Open Access Journals (Sweden)

Noriko eHiroi

2012-07-01

Full Text Available The intracellular environment is known to be a crowded and inhomogeneous space. Such an in vivo environment differs from a well-diluted, homogeneous environment for biochemical reactions. However, the effects of both crowdedness and the inhomogeneity of environment on the behavior of a mobile particle have not yet been investigated sufficiently. As described in this paper, we constructed artificial reaction spaces with fractal models, which are assumed to be non-reactive solid obstacles in a reaction space with crevices that function as operating ranges for mobile particles threading the space. Because of the homogeneity of the structures of artificial reaction spaces, the models succeeded in reproducing the physiological fractal dimension of solid structures with a smaller number of non-reactive obstacles than in the physiological condition. This incomplete compatibility was mitigated when we chose a suitable condition of a perimeter-to-area ratio of the operating range to our model. Our results also show that a simulation space is partitioned into convenient reaction compartments as an in vivo environment with the exact amount of solid structures estimated from TEM images. The characteristics of these compartments engender larger mean square displacement of a mobile particle than that of particles in smaller compartments. Subsequently, the particles start to show confined particle-like behavior. These results are compatible with our previously presented results, which predicted that a physiological environment would produce quick-response and slow-exhaustion reactions.

Characterization of Static/Dynamic Topological Routing For Grid Networks

DEFF Research Database (Denmark)

Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir

2009-01-01

Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures. In addition, the high requirements of future services and applications demand more flexible...... and adaptive networks. Topological routing in grid networks is a simple and efficient alternative to traditional routing techniques, e.g. routing tables, and the paper extends this kind of routing providing a "Dynamic" attribute. This new property attempts to improve the overall network performance for future...

Technical Report: Sleep-Route - Routing through Sleeping Sensors

OpenAIRE

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

Cognitive load during route selection increases reliance on spatial heuristics.

Science.gov (United States)

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

2018-05-01

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

A Joint Link and Channel Assignment Routing Scheme for Cognitive Radio Networks

Directory of Open Access Journals (Sweden)

H.S.Zhao

2013-12-01

Full Text Available Cognitive radio (CR is a promising technology that enables opportunistic utilization of the temporarily vacant spectrum to mitigate the spectrum scarcity in wireless communications. Since secondary users (SUs should vacate the channel in use immediately after detecting the reappearances of primary users (PUs in cognitive radio networks (CRNs, the route reliability is a distinctive challenge for routing in CRNs. Furthermore, the throughput requirement of an SU session should be satisfied and it is always preferable to select a route with less negative influence on other current or latish sessions. To account for the route reliability challenge, we study the joint link and channel assignment routing problem for CRNs. It is formulated in a form of integer nonlinear programming (INLP, which is NP-hard, with the objective of minimizing the interference of a new route to other routes while providing route reliability and throughput guarantee. An on-demand route discovery algorithm is proposed to find reliable candidate paths, while a joint link and channel assignment routing algorithm with sequentially-connected-link coordination is proposed to choose the near-optimal route for improving the route reliability and minimizing negative influence. Simulation results demonstrate that the proposed algorithm achieves considerable improvement over existing schemes in both route reliability and throughput.

Selective epidemic vaccination under the performant routing algorithms

Science.gov (United States)

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

2018-04-01

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

Modeling Stochastic Route Choice Behaviors with Equivalent Impedance

Directory of Open Access Journals (Sweden)

Jun Li

2015-01-01

Full Text Available A Logit-based route choice model is proposed to address the overlapping and scaling problems in the traditional multinomial Logit model. The nonoverlapping links are defined as a subnetwork, and its equivalent impedance is explicitly calculated in order to simply network analyzing. The overlapping links are repeatedly merged into subnetworks with Logit-based equivalent travel costs. The choice set at each intersection comprises only the virtual equivalent route without overlapping. In order to capture heterogeneity in perception errors of different sizes of networks, different scale parameters are assigned to subnetworks and they are linked to the topological relationships to avoid estimation burden. The proposed model provides an alternative method to model the stochastic route choice behaviors without the overlapping and scaling problems, and it still maintains the simple and closed-form expression from the MNL model. A link-based loading algorithm based on Dial’s algorithm is proposed to obviate route enumeration and it is suitable to be applied on large-scale networks. Finally a comparison between the proposed model and other route choice models is given by numerical examples.

Analysis of Pervasive Mobile Ad Hoc Routing Protocols

Science.gov (United States)

Qadri, Nadia N.; Liotta, Antonio

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

Trade routes and plague transmission in pre-industrial Europe.

Science.gov (United States)

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

2017-10-11

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

Preventing Restricted Space Inference in Online Route Planning Services

Directory of Open Access Journals (Sweden)

Florian Dorfmeister

2016-03-01

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

Time and timing in vehicle routing problems

NARCIS (Netherlands)

Jabali, O.

2010-01-01

The distribution of goods to a set of geographically dispersed customers is a common problem faced by carrier companies, well-known as the Vehicle Routing Problem (VRP). The VRP consists of finding an optimal set of routes that minimizes total travel times for a given number of vehicles with a fixed

Principles of Vessel Route Planning in Ice on the Northern Sea Route

Directory of Open Access Journals (Sweden)

Tadeusz Pastusiak

2016-12-01

Full Text Available A complex of ice cover characteristics and the season of the year were considered in relation to vessel route planning in ice-covered areas on the NSR. The criteria for navigation in ice - both year-round and seasonal were analyzed. The analysis of the experts knowledge, dissipated in the literature, allowed to identify some rules of route planning in ice-covered areas. The most important processes from the navigation point of view are the development and disintegration of ice, the formation and disintegration of fast ice and behavior of the ice massifs and polynyas. The optimal route is selected on basis of available analysis and forecast maps of ice conditions and ice class, draught and seaworthiness of the vessel. The boundary of the ice indicates areas accessible to vessels without ice class. Areas with a concentration of ice from 0 to 6/10 are used for navigation of vessels of different ice classes. Areas of concentration of ice from 7/10 up are eligible for navigation for icebreakers and vessels with a high ice class with the assistance of icebreakers. These rules were collected in the decision tree. Following such developed decision-making model the master of the vessel may take decision independently by accepting grading criteria of priorities resulting from his knowledge, experience and the circumstances of navigation. Formalized form of decision making model reduces risk of the "human factor" in the decision and thereby help improve the safety of maritime transport.

Throughput Capacity of Ad Hoc Networks with Route Discovery

Directory of Open Access Journals (Sweden)

Blum Rick S

2007-01-01

Full Text Available Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network . However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity.

What is the optimal architecture for visual information routing?

Science.gov (United States)

Wolfrum, Philipp; von der Malsburg, Christoph

2007-12-01

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

Self-Interested Routing in Queueing Networks

OpenAIRE

Ali K. Parlaktürk; Sunil Kumar

2004-01-01

We study self-interested routing in stochastic networks, taking into account the discrete stochastic dynamics of such networks. We analyze a two-station multiclass queueing network in which the system manager chooses the scheduling rule and individual customers choose routes in a self-interested manner. We show that this network can be unstable in Nash equilibrium under some scheduling rules. We also design a nontrivial scheduling rule that negates the performance degradation resulting from s...

Identifying and prioritizing ungulate migration routes for landscape-level conservation

Science.gov (United States)

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

2009-01-01

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

Comparison of Mucosal, Subcutaneous and Intraperitoneal Routes of Rat Leptospira Infection

Science.gov (United States)

Zilber, Anne-Laure; Belli, Patrick; Grezel, Delphine; Artois, Marc; Kodjo, Angeli; Djelouadji, Zoheira

2016-01-01

Leptospirosis is a zoonosis found worldwide that is caused by a spirochete. The main reservoirs of Leptospira, which presents an asymptomatic infection, are wild rodents, including the brown rat (Rattus norvegicus). Experimental studies of the mechanisms of its renal colonization in rats have previously used an intraperitoneal inoculation route. However, knowledge of rat-rat transmission requires the use of a natural route of inoculation, such as a mucosal or subcutaneous route. We investigated for the first time the effects of subcutaneous and mucosal inoculation routes compared to the reference intraperitoneal route during Leptospira infection in adult rats. Infection characteristics were studied using Leptospira renal isolation, serology, and molecular and histological analyses. Leptospira infection was asymptomatic using each inoculation route, and caused similar antibody production regardless of renal colonization. The observed renal colonization rates were 8 out of 8 rats, 5 out of 8 rats and 1 out of 8 rats for the intraperitoneal, mucosal and subcutaneous inoculation routes, respectively. Thus, among the natural infection routes studied, mucosal inoculation was more efficient for renal colonization associated with urinary excretion than the subcutaneous route and induced a slower-progressing infection than the intraperitoneal route. These results can facilitate understanding of the infection modalities in rats, unlike the epidemiological studies conducted in wild rats. Future studies of other natural inoculation routes in rat models will increase our knowledge of rat-rat disease transmission and allow the investigation of infection kinetics. PMID:27031867

Energy Aware Cluster Based Routing Scheme For Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Roy Sohini

2015-09-01

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

DRO: domain-based route optimization scheme for nested mobile networks

Directory of Open Access Journals (Sweden)

Chuang Ming-Chin

2011-01-01

Full Text Available Abstract The network mobility (NEMO basic support protocol is designed to support NEMO management, and to ensure communication continuity between nodes in mobile networks. However, in nested mobile networks, NEMO suffers from the pinball routing problem, which results in long packet transmission delays. To solve the problem, we propose a domain-based route optimization (DRO scheme that incorporates a domain-based network architecture and ad hoc routing protocols for route optimization. DRO also improves the intra-domain handoff performance, reduces the convergence time during route optimization, and avoids the out-of-sequence packet problem. A detailed performance analysis and simulations were conducted to evaluate the scheme. The results demonstrate that DRO outperforms existing mechanisms in terms of packet transmission delay (i.e., better route-optimization, intra-domain handoff latency, convergence time, and packet tunneling overhead.

Efficient Secure and Privacy-Preserving Route Reporting Scheme for VANETs

Science.gov (United States)

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

2017-10-01

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

Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

Science.gov (United States)

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

2010-01-01

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

PLANNING ROUTES ACROSS ECONOMIC TERRAINS: MAXIMIZING UTILITY, FOLLOWING HEURISTICS

Directory of Open Access Journals (Sweden)

Hang eZhang

2010-12-01

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

29 CFR 1910.36 - Design and construction requirements for exit routes.

Science.gov (United States)

2010-07-01

... construction requirements for exit routes. (a) Basic requirements. Exit routes must meet the following design... your workplace, consult NFPA 101-2000, Life Safety Code. (c) Exit discharge. (1) Each exit discharge... route must be adequate. (1) Exit routes must support the maximum permitted occupant load for each floor...

Research on the optimization of vehicle distribution routes in logistics enterprises

Science.gov (United States)

Fan, Zhigou; Ma, Mengkun

2018-01-01

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

Segmented Routing for Speed-Performance and Routability in Field-Programmable Gate Arrays

Directory of Open Access Journals (Sweden)

Stephen Brown

1996-01-01

Full Text Available This paper addresses several issues involved for routing in Field-Programmable Gate Arrays (FPGAs that have both horizontal and vertical routing channels, with wire segments of various lengths. Routing is studied by using CAD routing tools to map a set of benchmark circuits into FPGAs, and measuring the effects that various parameters of the CAD tools have on the implementation of the circuits. A two-stage routing strategy of global followed by detailed routing is used, and the effects of both of these CAD stages are discussed, with emphasis on detailed routing. We present a new detailed routing algorithm designed specifically for the types of routing structures found in the most recent generation of FPGAs, and show that the new algorithm achieves significantly better results than previously published FPGA routers with respect to the speed-performance of implemented circuits.

Porcelain tiles by the dry route

Directory of Open Access Journals (Sweden)

Boschi, A. O.

2010-10-01

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

En Brasil, en este momento segundo productor mundial, el 70% de los pavimentos cerámicos se obtiene por vía seca. Una de las razones fundamentales se debe a que esta vía supone un consumo energético inferior, en un 30%, a la via húmeda tradicional. La creciente preocupación mundial sobre los problemas medioambientales y el reconocimiento del papel central que juega el agua en este proceso han favorecido el desarrollo de la vía seca. En este contexto, el objetivo del presente trabajo es estudiar la viabilidad de la producción de pavimentos porcelánicos de alta calidad por vía seca. Una breve comparación entre ambas vías, en las condiciones standard de producción vigentes para producciones que no son de porcelánico, indican que existen dos diferencias substanciales; el tamaño de

Research on routing algorithm based on the VANET

Directory of Open Access Journals (Sweden)

AN Li

2016-01-01

Full Text Available For the characteristics of high speed mobility of nodes, frequent changes of dynamic topology and frequent interrupts of the communication links in the VANET, this paper analyzed the defect of the current mobile ad-hoc network routing protocol, and carried on the simulation analysis on the adaptability of AODV, DSR and DSDV routing protocols in VANET applications in the VANET. Through the above research, this paper obtained the conclusion that the AODV routing protocol is more suitable for vehicular ad hoc network environment

Route selection for the transport of hazardous materials

Energy Technology Data Exchange (ETDEWEB)

Seiler, F A

1988-12-01

The factors governing the risk-weighted selection of routes for transport of hazardous materials are analyzed. Starting from a formulation for the total risk of these transports that assumes complete information, approximations for the more realistic case of partial and uncertain information are discussed. These approximations involve well-known risk assessment techniques and mathematical methods; among the latter, Monte Carlo calculations hold the most promise. The actual route selection is based on an index of total societal cost, evaluated for a set of potential routes. (author)

ARBR: Adaptive reinforcement-based routing for DTN

KAUST Repository

Elwhishi, Ahmed

2010-10-01

This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function at each contact with another node. The proposed protocol is characterized by not only considering the contact time statistics under a novel contact model, but also looks into the feedback on user behavior and network conditions, such as congestion and buffer occupancy sampled during each previous contact with any other node. Therefore, the proposed protocol can achieve high efficiency via an adaptive and intelligent routing mechanism according to network conditions. Extensive simulation is conducted to verify the proposed protocol, where a comparison is made with a number of existing encounter-based routing protocols in term of the number of transmissions of each message, message delivery delay, and delivery ratio. The results of the simulation demonstrate the effectiveness of the proposed technique.

Route Monopolie and Optimal Nonlinear Pricing

Science.gov (United States)

Tournut, Jacques

2003-01-01

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

Route Fidelity during Marine Megafauna Migration

Directory of Open Access Journals (Sweden)

Travis W. Horton

2017-12-01

Full Text Available The conservation and protection of marine megafauna require robust knowledge of where and when animals are located. Yet, our ability to predict animal distributions in space and time remains limited due to difficulties associated with studying elusive animals with large home ranges. The widespread deployment of satellite telemetry technology creates unprecedented opportunities to remotely monitor animal movements and to analyse the spatial and temporal trajectories of these movements from a variety of geophysical perspectives. Reproducible patterns in movement trajectories can help elucidate the potential mechanisms by which marine megafauna navigate across vast expanses of open-ocean. Here, we present an empirical analysis of humpback whale (Megaptera novaeangliae, great white shark (Carcharodon carcharias, and northern elephant seal (Mirounga angustirostris satellite telemetry-derived route fidelity movements in magnetic and gravitational coordinates. Our analyses demonstrate that: (1 humpback whales, great white sharks and northern elephant seals are capable of performing route fidelity movements across millions of square kilometers of open ocean with a spatial accuracy of better than 150 km despite temporal separations as long as 7 years between individual movements; (2 route fidelity movements include significant (p < 0.05 periodicities that are comparable in duration to the lunar cycles and semi-cycles; (3 latitude and bedrock-dependent gravitational cues are stronger predictors of route fidelity movements than spherical magnetic coordinate cues when analyzed with respect to the temporally dependent moon illumination cycle. We further show that both route fidelity and non-route fidelity movement trajectories, for all three species, describe overlapping in-phase or antiphase sinusoids when individual movements are normalized to the gravitational acceleration present at migratory departure sites. Although these empirical results provide an

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

Science.gov (United States)

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

2017-01-01

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

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

Science.gov (United States)

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

2017-05-22

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

Evolution Strategies in the Multipoint Connections Routing

Directory of Open Access Journals (Sweden)

L. Krulikovska

2010-09-01

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

Pheromone Static Routing Strategy for Complex Networks

Science.gov (United States)

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

2012-12-01

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

Hazardous materials routing - risk management of mismanagement

International Nuclear Information System (INIS)

Glickman, T.S.

1988-01-01

Along with emergency planning and preparedness, the placement of restrictions on routing has become an increasingly popular device for managing the highway and rail risks of hazardous materials transportation. Federal studies conducted in 1985 indicate that at that time there were 513 different state and local restrictions on the routing of hazardous materials for these two modes of transportation, and that there were 136 state and local notification requirements, that is, restrictions that take the form of a statute or ordinance requiring advance warning or periodic reporting about hazardous materials shipments. Routing restrictions also take the form of prohibiting the use of road, a tunnel, or a bridge for a specified set of hazardous materials

Evaluation of geocast routing trees on random and actual networks

NARCIS (Netherlands)

Meijerink, Berend Jan; Baratchi, Mitra; Heijenk, Geert; Koucheryavy, Yevgeni; Mamatas, Lefteris; Matta, Ibrahim; Ometov, Aleksandr; Papadimitriou, Panagiotis

2017-01-01

Efficient geocast routing schemes are needed to transmit messages to mobile networked devices in geographically scoped areas. To design an efficient geocast routing algorithm a comprehensive evaluation of different routing tree approaches is needed. In this paper, we present an analytical study

Energy Reduction Multipath Routing Protocol for MANET Using Recoil Technique

Directory of Open Access Journals (Sweden)

Rakesh Kumar Sahu

2018-04-01

Full Text Available In Mobile Ad-hoc networks (MANET, power conservation and utilization is an acute problem and has received significant attention from academics and industry in recent years. Nodes in MANET function on battery power, which is a rare and limited energy resource. Hence, its conservation and utilization should be done judiciously for the effective functioning of the network. In this paper, a novel protocol namely Energy Reduction Multipath Routing Protocol for MANET using Recoil Technique (AOMDV-ER is proposed, which conserves the energy along with optimal network lifetime, routing overhead, packet delivery ratio and throughput. It performs better than any other AODV based algorithms, as in AOMDV-ER the nodes transmit packets to their destination smartly by using a varying recoil off time technique based on their geographical location. This concept reduces the number of transmissions, which results in the improvement of network lifetime. In addition, the local level route maintenance reduces the additional routing overhead. Lastly, the prediction based link lifetime of each node is estimated which helps in reducing the packet loss in the network. This protocol has three subparts: an optimal route discovery algorithm amalgamation with the residual energy and distance mechanism; a coordinated recoiled nodes algorithm which eliminates the number of transmissions in order to reduces the data redundancy, traffic redundant, routing overhead, end to end delay and enhance the network lifetime; and a last link reckoning and route maintenance algorithm to improve the packet delivery ratio and link stability in the network. The experimental results show that the AOMDV-ER protocol save at least 16% energy consumption, 12% reduction in routing overhead, significant achievement in network lifetime and packet delivery ratio than Ad hoc on demand multipath distance vector routing protocol (AOMDV, Ad hoc on demand multipath distance vector routing protocol life

A Multicast Protocol Utilizing On-demand Routing Strategy for MPRN

Institute of Scientific and Technical Information of China (English)

无

2002-01-01

This paper proposes a multicast protocol utilizing ondemand routing strategy for mobile packet radio network. It does not maintain permanent route tables with full topological views. Instead, multicast senders apply on-demand procedures to dynamically discover routes and build forwarding group in this protocol. The data packets are propagated by each forwarding group member via scoped flooding, so the protocol can reduce network bandwidth overhead and avoid the propagation of potentially large routing updates throughout the network.

An Evolutionary Real-Time 3D Route Planner for Aircraft

Institute of Scientific and Technical Information of China (English)

郑昌文; 丁明跃; 周成平

2003-01-01

A novel evolutionary route planner for aircraft is proposed in this paper. In the new planner, individual candidates are evaluated with respect to the workspace, thus the computation of the configuration space is not required. By using problem-specific chromosome structure and genetic operators, the routes are generated in real time,with different mission constraints such as minimum route leg length and flying altitude, maximum turning angle, maximum climbing/diving angle and route distance constraint taken into account.

CBHRP: A Cluster Based Routing Protocol for Wireless Sensor Network

OpenAIRE

Rashed, M. G.; Kabir, M. Hasnat; Rahim, M. Sajjadur; Ullah, Sk. Enayet

2012-01-01

A new two layer hierarchical routing protocol called Cluster Based Hierarchical Routing Protocol (CBHRP) is proposed in this paper. It is an extension of LEACH routing protocol. We introduce cluster head-set idea for cluster-based routing where several clusters are formed with the deployed sensors to collect information from target field. On rotation basis, a head-set member receives data from the neighbor nodes and transmits the aggregated results to the distance base station. This protocol ...

A lower bound for the node, edge, and arc routing problem

DEFF Research Database (Denmark)

Bach, Lukas; Hasle, Geir; Wøhlk, Sanne

2013-01-01

The Node, Edge, and Arc Routing Problem (NEARP) was defined by Prins and Bouchenoua in 2004, although similar problems have been studied before. This problem, also called the Mixed Capacitated General Routing Problem (MCGRP), generalizes the classical Capacitated Vehicle Routing Problem (CVRP......), the Capacitated Arc Routing Problem (CARP), and the General Routing Problem. It captures important aspects of real-life routing problems that were not adequately modeled in previous Vehicle Routing Problem (VRP) variants. The authors also proposed a memetic algorithm procedure and defined a set of test instances...... called the CBMix benchmark. The NEARP definition and investigation contribute to the development of rich VRPs. In this paper we present the first lower bound procedure for the NEARP. It is a further development of lower bounds for the CARP. We also define two novel sets of test instances to complement...

Interval Routing and Minor-Monotone Graph Parameters

NARCIS (Netherlands)

Bakker, E.M.; Bodlaender, H.L.; Tan, R.B.; Leeuwen, J. van

2006-01-01

We survey a number of minor-monotone graph parameters and their relationship to the complexity of routing on graphs. In particular we compare the interval routing parameters κslir(G) and κsir(G) with Colin de Verdi`ere’s graph invariant μ(G) and its variants λ(G) and κ(G). We show that for all the

Indoor 3D Route Modeling Based On Estate Spatial Data

Science.gov (United States)

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

2014-04-01

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

HIGHWAY, a transportation routing model: program description and users' manual

International Nuclear Information System (INIS)

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

1982-12-01

A computerized transportation routing model has been developed at the Oak Ridge National Laboratory to be used for predicting likely routes for shipping radioactive materials. The HIGHWAY data base is a computerized road atlas containing descriptions of the entire interstate highway system, the federal highway system, and most of the principal state roads. In addition to its prediction of the most likely commercial route, options incorporated in the HIGHWAY model can allow for maximum use of interstate highways or routes that will bypass urbanized areas containing populations > 100,000. The user may also interactively modify the data base to predict routes that bypass any particular state, city, town, or specific highway segment

Routing of Electric Vehicles: City Distribution in Copenhagen

DEFF Research Database (Denmark)

Linde, Esben; Larsen, Allan; Nørrelund, Anders Vedsted

In this work, a Vehicle Routing Problem with Time Windows considering EV constraints of limited driving range and freight capacity is addressed (EVRPTW). The EVs are allowed to recharge at certain locations, and aspects of intelligent location of these recharging points are considered....... The objective is to find the least cost plan for EV routing and compare this to conventional routing. A heuristic method is developed and tested on data based on real-life collected data on distribution vehicles in central Copenhagen, Denmark. The EVRPTW has so far received little attention in the literature...

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

2012-01-01

In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

Acquisition of business intelligence from human experience in route planning

Science.gov (United States)

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

2015-04-01

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

Secure Trust Based Key Management Routing Framework for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jugminder Kaur

2016-01-01

Full Text Available Security is always a major concern in wireless sensor networks (WSNs. Several trust based routing protocols are designed that play an important role in enhancing the performance of a wireless network. However they still have some disadvantages like limited energy resources, susceptibility to physical capture, and little protection against various attacks due to insecure wireless communication channels. This paper presents a secure trust based key management (STKF routing framework that establishes a secure trustworthy route depending upon the present and past node to node interactions. This route is then updated by isolating the malicious or compromised nodes from the route, if any, and a dedicated link is created between every pair of nodes in the selected route with the help of “q” composite random key predistribution scheme (RKPS to ensure data delivery from source to destination. The performance of trust aware secure routing framework (TSRF is compared with the proposed routing scheme. The results indicate that STKF provides an effective mechanism for finding out a secure route with better trustworthiness than TSRF which avoids the data dropping, thereby increasing the data delivery ratio. Also the distance required to reach the destination in the proposed protocol is less hence effectively utilizing the resources.

Application of cloud computing in power routing for clusters of microgrids using oblivious network routing algorithm

DEFF Research Database (Denmark)

Amini, M. Hadi; Broojeni, Kianoosh G.; Dragicevic, Tomislav

2017-01-01

of microgrid while preventing congestion as well as minimizing the power loss. Then, we present a two-layer simulation platform which considers both communication layer and physical layer of the microgrids' cluster. In order to improve the security of communication network, we perform the computations...... regarding the oblivious power routing via a cloud-based network. The proposed framework can be used for further studies that deal with the real-time simulation of the clusters of microgrids. In order to validate the effectiveness of the proposed framework, we implement our proposed oblivious routing scheme...

Optimization Model for Headway of a Suburban Bus Route

Directory of Open Access Journals (Sweden)

Xiaohong Jiang

2014-01-01

Full Text Available Due to relatively low passenger demand, headways of suburban bus route are usually longer than those of urban bus route. Actually it is also difficult to balance the benefits between passengers and operators, subject to the service standards from the government. Hence the headway of a suburban bus route is usually determined on the empirical experience of transport planners. To cope with this problem, this paper proposes an optimization model for designing the headways of suburban bus routes by minimizing the operating and user costs. The user costs take into account both the waiting time cost and the crowding cost. The feasibility and validity of the proposed model are shown by applying it to the Route 206 in Jiangning district, Nanjing city of China. Weightages of passengers’ cost and operating cost are further discussed, considering different passenger flows. It is found that the headway and objective function are affected by the weightages largely.

Transmission Scheduling and Routing Algorithms for Delay Tolerant Networks

Science.gov (United States)

Dudukovich, Rachel; Raible, Daniel E.

2016-01-01

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

Influence of the Built Environment on Pedestrian Route Choices of Adolescent Girls

DEFF Research Database (Denmark)

Rodriguez, Daniel A.; Merlin, Louis; Prato, Carlo Giacomo

2015-01-01

We examined the influence of the built environment on pedestrian route selection among adolescent girls. Portable global positioning system units, accelerometers, and travel diaries were used to identify the origin, destination, and walking routes of girls in San Diego, California, and Minneapolis...... of route choice. Shorter distance had the strongest positive association with route choice, whereas the presence of a greenway or trail, higher safety, presence of sidewalks, and availability of destinations along a route were also consistently positively associated with route choice at both sites...

COMPARISON OF FAST PERIMETRIC STRATEGIES USING G2 PROGRAM ON OCTOPUS 101 PERIMETER

Directory of Open Access Journals (Sweden)

Jernej Pajek

2002-12-01

Full Text Available Background. The duration of the perimetric examination was significantly shortened by development of fast perimetric strategies. By analyzing the results of normal, dynamic and TOP strategy we studied the differences in determination of MD, LV, in determination of number of all points with a deficit and number of points with a significant deficit of p < 0.5%.Methods. 22 normal visual fields of 17 subjects (mean age 33 ± 15 years and 22 visual fields with defects of 17 patients (47 ± 16 years having different types and degrees of visual lesions were examined. All visual fields were examined once with each strategy in alternating order using Octopus 101 perimeter with the G2 program.Results. No statistically significant differences were measured in MD values. In abnormal visual fields group, TOP strategy showed 11 ± 14 dB2 lower LV values compared to dynamic strategy (p < 0.01 and 9.8 ± 16 dB2 lower LV values compared to normal strategy (p = 0.02. In the abnormal visual fields group the dynamic strategy measured in average 3 points with the deficit less compared to the other two strategies (p < 0.05. There were no significant differences between strategies in the number of points with a deficit of p < 0.5%.Conclusions. With the exception of lower LV values measured with TOP strategy, the differences between TOP, dynamic strategy results are small and the time sparing benefits are substantial. Therefore the usage of fast perimetric strategies is clinically justified.

Comparison of MANET routing protocols using a scaled indoor wireless grid

CSIR Research Space (South Africa)

Johnson, DL

2008-04-01

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

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

Science.gov (United States)

2014-01-01

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

77 FR 54805 - Revocation of Jet Route J-528; WA

Science.gov (United States)

2012-09-06

...-0749; Airspace Docket No. 11-ANM-29] RIN 2120-AA66 Revocation of Jet Route J-528; WA AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Final rule. SUMMARY: This action removes Jet Route J-528... 20591; telephone: (202) 267-8783. SUPPLEMENTARY INFORMATION: Background Jet Route J-528 is currently...

On the Core of Routing Games with Revenues

NARCIS (Netherlands)

A. Estévez-Fernandéz (Arantza); P. Borm; M. Meertens; H. Reijnierse

2006-01-01

htmlabstract Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours

On the Core of Routing Games with Revenues

NARCIS (Netherlands)

Estevez Fernandez, M.A.; Borm, P.E.M.; Meertens, M.; Reijnierse, J.H.

2006-01-01

Traveling salesman problems with revenues form a generalization of traveling salesman problems.Here, next to travel costs an explicit revenue is generated by visiting a city.We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along

Generalized routing protocols for multihop relay networks

KAUST Repository

Khan, Fahd Ahmed

2011-07-01

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

Locating Depots for Capacitated Vehicle Routing

DEFF Research Database (Denmark)

Gørtz, Inge Li; Nagarajan, Viswanath

2011-01-01

that all demands are satisfied and the total cost is minimized. Our main result is a constant-factor approximation algorithm for k-LocVRP. To achieve this result, we reduce k-LocVRP to the following generalization of k median, which might be of independent interest. Given a metric (V, d), bound k...... median forest, which leads to a (12+E)-approximation algorithm for k-LocVRP, for any constant E > 0. The algorithm for k median forest is t-swap local search, and we prove that it has locality gap 3 + 2 t ; this generalizes the corresponding result for k median [3]. Finally we consider the k median......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...

Energy Efficient MANET Routing Using a Combination of Span and BECA/AFECA

DEFF Research Database (Denmark)

Kristensen, Mads Darø; Bouvin, Niels Olof

2008-01-01

This paper presents some novel approaches for energy efficient routing in mobile ad-hoc networks. Two known energy preserving techniques, Span and BECA/AFECA, are combined with a well-known re-active routing protocol, AODV, to create a new energy efficient routing protocol. Furthermore, the proto......This paper presents some novel approaches for energy efficient routing in mobile ad-hoc networks. Two known energy preserving techniques, Span and BECA/AFECA, are combined with a well-known re-active routing protocol, AODV, to create a new energy efficient routing protocol. Furthermore...

Evolutionary algorithms for the Vehicle Routing Problem with Time Windows

NARCIS (Netherlands)

Bräysy, Olli; Dullaert, Wout; Gendreau, Michel

2004-01-01

This paper surveys the research on evolutionary algorithms for the Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as the problem of designing least cost routes from a single depot to a set of geographically scattered points. The routes must be designed in such a way

On the core of routing games with revenues

NARCIS (Netherlands)

Estevez Fernandez, M.A.; Borm, P.; Meertens, M.; Reijnierse, H.

2009-01-01

Traveling salesman problems with revenues form a generalization of traveling salesman problems. Here, next to travel costs an explicit revenue is generated by visiting a city. We analyze routing problems with revenues, where a predetermined route on all cities determines the tours along subgroups.

k-Shortest routing of trains on shunting yards

NARCIS (Netherlands)

Riezebos, Jan; van Wezel, Wout

2009-01-01

We consider the problem of designing algorithmic support for k-best routing decisions in train shunting scheduling. A study at the Netherlands Railways revealed that planners like to interact with the solution process of finding suitable routes. Two types of interaction were required: the

Reverse stream flow routing by using Muskingum models

Indian Academy of Sciences (India)

Reverse stream flow routing is a procedure that determines the upstream hydrograph given the downstream hydrograph. This paper presents the development of methodology for Muskingum models parameter estimation for reverse stream flow routing. The standard application of the Muskingum models involves calibration ...

Tourism Routes, Local Economic Promotion and Pro-Poor ...

African Journals Online (AJOL)

In southern Africa, there is growing interest in the potential for establishing tourism routes as vehicles for tourism expansion and the promotion of local economic development. This article contributes towards understanding the potential and importance of organising routes for local tourism promotion and economic ...

Automated Flight Routing Using Stochastic Dynamic Programming

Science.gov (United States)

Ng, Hok K.; Morando, Alex; Grabbe, Shon

2010-01-01

Airspace capacity reduction due to convective weather impedes air traffic flows and causes traffic congestion. This study presents an algorithm that reroutes flights in the presence of winds, enroute convective weather, and congested airspace based on stochastic dynamic programming. A stochastic disturbance model incorporates into the reroute design process the capacity uncertainty. A trajectory-based airspace demand model is employed for calculating current and future airspace demand. The optimal routes minimize the total expected traveling time, weather incursion, and induced congestion costs. They are compared to weather-avoidance routes calculated using deterministic dynamic programming. The stochastic reroutes have smaller deviation probability than the deterministic counterpart when both reroutes have similar total flight distance. The stochastic rerouting algorithm takes into account all convective weather fields with all severity levels while the deterministic algorithm only accounts for convective weather systems exceeding a specified level of severity. When the stochastic reroutes are compared to the actual flight routes, they have similar total flight time, and both have about 1% of travel time crossing congested enroute sectors on average. The actual flight routes induce slightly less traffic congestion than the stochastic reroutes but intercept more severe convective weather.

Efficient Routing in Wireless Sensor Networks with Multiple Sessions

OpenAIRE

Dianjie Lu; Guijuan Zhang; Ren Han; Xiangwei Zheng; Hong Liu

2014-01-01

Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficu...

Applied Multiprotocol Routing in IP Telephony

Directory of Open Access Journals (Sweden)

Miroslav Voznak

2010-01-01

Full Text Available The aim of the project was to create a multi-protocol system using SIP, H.323 and MGCP standards, which would ensure routing to various types of VoIP networks. The priority was to provide multi-protocol support to SIP and H.323 signalling and the support of the routing using the ENUM standard which has recently passed from the trial phase into full operation in the Czech Republic. The document describes the system's architecture and the components used. It also briefly describes ENUM.

The influence of advertisements on the conspicuity of routing information.

Science.gov (United States)

Boersema, T; Zwaga, H J

1985-12-01

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

Comparison of MANET Routing Protocols in Different Traffic and Mobility Models

Directory of Open Access Journals (Sweden)

J. Baraković

2010-06-01

Full Text Available Routing protocol election in MANET (Mobile Ad Hoc Network is a great challenge, because of its frequent topology changes and routing overhead. This paper compares performances of three routing protocols: Destination Sequenced Distance Vector (DSDV, Ad Hoc Ondemand Distance Vector (AODV and Dynamic Source Routing (DSR, based on results analysis obtained using simulations with different load and mobility scenarios performed with Network Simulator version 2 (NS-2. In low load and low mobility scenarios routing protocols perform in a similar manner. However, with mobility and load increasing DSR outperforms AODV and DSDV protocols.

Alternative route to metal halide free ionic liquids

International Nuclear Information System (INIS)

Takao, Koichiro; Ikeda, Yasuhisa

2008-01-01

An alternative synthetic route to metal halide free ionic liquids using trialkyloxonium salt is proposed. Utility of this synthetic route has been demonstrated by preparing 1-ethyl-3-methylimidazolium tetrafluoroborate ionic liquid through the reaction between 1-methylimidazole and triethyloxonium tetra-fluoroborate in anhydrous ether. (author)

Adaptive Probabilistic Routing in Wireless Ad Hoc Networks

OpenAIRE

Hasan, Affaf; Liaqat, Ismail

2013-01-01

The goal of this thesis work is to analyze how design elements and wireless attributes affect opportunistic routing, and in this context develop a new protocol. The algorithm developed aims to improve opportunistic elements in comparison to a well-known opportunistic protocol Simple Opportunistic Adaptive Routing (SOAR).

Assessing green waste route by using Network Analysis

Science.gov (United States)

Hasmantika, I. H.; Maryono, M.

2018-02-01

Green waste, such as waste from park need treat proper. One of the main problems of green waste management is how to design optimum collection. This research aims to determine the optimum green waste collection by determining optimum route among park. The route optimum was assessed by using network analysis method. And the region five of Semarang city’s park within 20 parks in chose as case study. To enhancing recycle of green waste, three scenarios of treatment are proposed. Scenario 1 used one integrated treatment facility as terminal for enhancing recycle of green waste, Scenario 2 used two sites and scenario 3 used three sites. According to the assessment, the length of route of scenario 1 is 36.126 km and the time for collection estimated is 46 minutes. In scenario 2, the length of route is 36.471 km with a travel time is 47 minutes. The length of scenario three is 46.934 km and the time of collection is 60 minutes.

Routing Protocol for Mobile Ad-hoc Wireless Networks

Directory of Open Access Journals (Sweden)

I. M. B. Nogales

2007-09-01

Full Text Available Bluetooth is a cutting-edge technology used for implementing wireless ad hoc networks. In order to provide an overall scheme for mobile ad hoc networks, this paper deals with scatternet topology formation and routing algorithm to form larger ad hoc wireless Networks. Scatternet topology starts by forming a robust network, which is less susceptible to the problems posed by node mobility. Mobile topology relies on the presence of free nodes that create multiple connections with the network and on their subsequently rejoining the network. Our routing protocol is a proactive routing protocol, which is tailor made for the Bluetooth ad hoc network. The connection establishment connects nodes in a structure that simplifies packet routing and scheduling. The design allows nodes to arrive and leave arbitrarily, incrementally building the topology and healing partitions when they occur. We present simulation results that show that the algorithm presents low formation latency and also generates an efficient topology for forwarding packets along ad-hoc wireless networks.

I/O routing in a multidimensional torus network

Science.gov (United States)

Chen, Dong; Eisley, Noel A.; Heidelberger, Philip

2018-04-24

A method, system and computer program product are disclosed for routing data packet in a computing system comprising a multidimensional torus compute node network including a multitude of compute nodes, and an I/O node network including a plurality of I/O nodes. In one embodiment, the method comprises assigning to each of the data packets a destination address identifying one of the compute nodes; providing each of the data packets with a toio value; routing the data packets through the compute node network to the destination addresses of the data packets; and when each of the data packets reaches the destination address assigned to said each data packet, routing said each data packet to one of the I/O nodes if the toio value of said each data packet is a specified value. In one embodiment, each of the data packets is also provided with an ioreturn value used to route the data packets through the compute node network.

On the Capacity of Hybrid Wireless Networks with Opportunistic Routing

Directory of Open Access Journals (Sweden)

Le Tan

2010-01-01

Full Text Available This paper studies the capacity of hybrid wireless networks with opportunistic routing (OR. We first extend the opportunistic routing algorithm to exploit high-speed data transmissions in infrastructure network through base stations. We then develop linear programming models to calculate the end-to-end throughput bounds from multiple source nodes to single as well as multiple destination nodes. The developed models are applied to study several hybrid wireless network examples. Through case studies, we investigate several factors that have significant impacts on the hybrid wireless network capacity under opportunistic routing, such as node transmission range, density and distribution pattern of base stations (BTs, and number of wireless channels on wireless nodes and base stations. Our numerical results demonstrate that opportunistic routing could achieve much higher throughput on both ad hoc and hybrid networks than traditional unicast routing (UR. Moreover, opportunistic routing can efficiently utilize base stations and achieve significantly higher throughput gains in hybrid wireless networks than in pure ad hoc networks especially with multiple-channel base stations.

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

Science.gov (United States)

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

2005-03-01

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

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

International Nuclear Information System (INIS)

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

1985-01-01

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

PROPOSAL OF ALGORITHM FOR ROUTE OPTIMIZATION

Directory of Open Access Journals (Sweden)

Robert Ramon de Carvalho Sousa

2016-06-01

Full Text Available This article uses “Six Sigma” methodology for the elaboration of an algorithm for routing problems which is able to obtain more efficient results than those from Clarke and Wright´s (CW algorithm (1964 in situations of random increase of product delivery demands, facing the incapability of service level increase . In some situations, the algorithm proposed obtained more efficient results than the CW algorithm. The key factor was a reduction in the number of mistakes (one way routes and in the level of result variation.

Eco-sustainable routing in optical networks

DEFF Research Database (Denmark)

Ricciardi, Sergio; Wang, Jiayuan; Palmieri, Francesco

2013-01-01

infrastructures are now widely recognized to play a fundamental role in the emission of green-house gases (GHG) in the at- mosphere, signicantly aecting the environmental sustainability of new evolutions in network architectures as well as technological developments in communication devices. In this paper......, a novel eco-sustainable Routing and Wavelength Assignment (RWA) algorithm, based on shortest-path routing with an adaptive link weighting function relying on an extension of the OSPF-TE protocol to convey carbon footprint information, has been proposed to decrease the network ecological impact while...

Multi-objective evacuation routing optimization for toxic cloud releases

International Nuclear Information System (INIS)

Gai, Wen-mei; Deng, Yun-feng; Jiang, Zhong-an; Li, Jing; Du, Yan

2017-01-01

This paper develops a model for assessing the risks associated with the evacuation process in response to potential chemical accidents, based on which a multi-objective evacuation routing model for toxic cloud releases is proposed taking into account that the travel speed on each arc will be affected by disaster extension. The objectives of the evacuation routing model are to minimize travel time and individual evacuation risk along a path respectively. Two heuristic algorithms are proposed to solve the multi-objective evacuation routing model. Simulation results show the effectiveness and feasibility of the model and algorithms presented in this paper. And, the methodology with appropriate modification is suitable for supporting decisions in assessing emergency route selection in other cases (fires, nuclear accidents). - Highlights: • A model for assessing and visualizing the risks is developed. • A multi-objective evacuation routing model is proposed for toxic cloud releases. • A modified Dijkstra algorithm is designed to obtain an solution of the model. • Two heuristic algorithms have been developed as the optimization tool.

75 FR 66344 - Amendment of Jet Route J-93; CA

Science.gov (United States)

2010-10-28

...-1022; Airspace Docket No. 10-AWP-4] RIN 2120-AA66 Amendment of Jet Route J-93; CA AGENCY: Federal... proposes to amend Jet Route J-93 in California between the Julian VHF Omnidirectional Radio Range Tactical... is necessary to realign Jet Route J-93 with the revised location of the Penasco VOR. The Proposal The...

The extended TRIP supporting VoIP routing reservation with distributed QoS

Science.gov (United States)

Wang, Furong; Wu, Ye

2004-04-01

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

Synthesis of graphene platelets by chemical and electrochemical route

Energy Technology Data Exchange (ETDEWEB)

Ramachandran, Rajendran; Felix, Sathiyanathan [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Joshi, Girish M. [Materials Physics Division, School of Advanced Sciences, VIT University, Vellore 632014, Tamil Nadu (India); Raghupathy, Bala P.C., E-mail: balapraveen2000@yahoo.com [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Research and Advanced Engineering Division (Materials), Renault Nissan Technology and Business Center India (P) Ltd., Chennai, Tamil Nadu (India); Jeong, Soon Kwan, E-mail: jeongsk@kier.re.kr [Climate Change Technology Research Division, Korea Institute of Energy Research, Yuseong-gu, Daejeon 305-343 (Korea, Republic of); Grace, Andrews Nirmala, E-mail: anirmalagrace@vit.ac.in [Centre for Nanotechnology Research, VIT University, Vellore 632014, Tamil Nadu (India); Climate Change Technology Research Division, Korea Institute of Energy Research, Yuseong-gu, Daejeon 305-343 (Korea, Republic of)

2013-10-15

Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH{sub 4} was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide.

Synthesis of graphene platelets by chemical and electrochemical route

International Nuclear Information System (INIS)

Ramachandran, Rajendran; Felix, Sathiyanathan; Joshi, Girish M.; Raghupathy, Bala P.C.; Jeong, Soon Kwan; Grace, Andrews Nirmala

2013-01-01

Graphical abstract: A schematic showing the overall reduction process of graphite to reduced graphene platelets by chemical and electrochemical route. - Highlights: • Graphene was prepared by diverse routes viz. chemical and electrochemical methods. • NaBH 4 was effective for removing oxygen functional groups from graphene oxide. • Sodium borohydride reduced graphene oxide (SRGO) showed high specific capacitance. • Electrochemical rendered a cheap route for production of graphene in powder form. - Abstract: Graphene platelets were synthesized from graphene oxide by chemical and electrochemical route. Under the chemical method, sodium borohydride and hydrazine chloride were used as reductants to produce graphene. In this paper, a novel and cost effective electrochemical method, which can simplify the process of reduction on a larger scale, is demonstrated. The electrochemical method proposed in this paper produces graphene in powder form with good yield. The atomic force microscopic images confirmed that the graphene samples prepared by all the routes have multilayers of graphene. The electrochemical process provided a new route to make relatively larger area graphene sheets, which will have interest for further patterning applications. Attempt was made to quantify the quantum of reduction using cyclic voltammetry and choronopotentiometry techniques on reduced graphene samples. As a measure in reading the specific capacitance values, a maximum specific capacitance value of 265.3 F/g was obtained in sodium borohydride reduced graphene oxide

Closure of the Route de Meyrin as of 11 February 2008

CERN Multimedia

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

Closure of the Route de Meyrin as of 11 February 2008

CERN Multimedia

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

One Kind of Routing Algorithm Modified in Wireless Sensor Network

Directory of Open Access Journals (Sweden)

Wei Ni Ni

2016-01-01

Full Text Available The wireless sensor networks are the emerging next generation sensor networks, Routing technology is the wireless sensor network communication layer of the core technology. To build reliable paths in wireless sensor networks, we can consider two ways: providing multiple paths utilizing the redundancy to assure the communication reliability or constructing transmission reliability mechanism to assure the reliability of every hop. Braid multipath algorithm and ReInforM routing algorithm are the realizations of these two mechanisms. After the analysis of these two algorithms, this paper proposes a ReInforM routing algorithm based braid multipath routing algorithm.

Influence of queue propagation and dissipation on route travel times

DEFF Research Database (Denmark)

Raovic, Nevena

into account (Bliemer, 2008). Yperman (2007) indicates that there is a significant difference in queue-propagation and queue-dissipation between the LTM and DQM. This results in different route travel times, and can further affect route choice. In this paper, different approaches to represent queue propagation...... and dissipation through the CTM, LTM and DQM are studied. A simple network allows to show how these approaches influence route travel time. Furthermore, the possibility of changing the existing DQM is considered in order to more realistically represent queue propagation and dissipation, which would lead to more...... accurate route travel times....

Routing Unmanned Vehicles in GPS-Denied Environments

OpenAIRE

Sundar, Kaarthik; Misra, Sohum; Rathinam, Sivakumar; Sharma, Rajnikant

2017-01-01

Most of the routing algorithms for unmanned vehicles, that arise in data gathering and monitoring applications in the literature, rely on the Global Positioning System (GPS) information for localization. However, disruption of GPS signals either intentionally or unintentionally could potentially render these algorithms not applicable. In this article, we present a novel method to address this difficulty by combining methods from cooperative localization and routing. In particular, the article...

Radon exposure in selected underground touring routes in Poland

International Nuclear Information System (INIS)

Olszewski, J.; Chruscielewski, W.; Jankowski, J.

2006-01-01

The radioactive elements abounding in the natural environment cause that the whole human population is exposed to radiation. In Poland, mean gamma radiation dose power is 45.4 n Gy h -1 , while atmospheric radon concentration is 4.4 Bq m -3 [1]. In closed rooms, where radon tends to accumulate, the concentrations may be many times higher.Underground touring routes located in caves, mines, ancient cellars, vaults may accumulate radon at concentrations several thousand times exceeding its atmospheric levels. Studies on natural radioactivity in underground touring routes, with particular reference to caves, have continued worldwide since the 80's. Current register of underground touring routes in Poland comprises over 30 items, which include caves (e.g. Niedzwiedzia), mines (Wieliczka), cellars and underground stores (Opatow City vaults) and military objects (underground factories of Walim). The Nofer Institute of Occupational Medicine has for several years already continued determinations of periodical mean radon concentrations in four underground touring routes (starting date in parentheses): Niedzwiedzia Cave (1995); Kowary Drifts closed uranium mine (2001); closed uranium mine in Kletno (2004); Zloty Stok closed gold mine (2004); Osowka underground city in Gluszyca (2004).The results of our determinations of radon concentrations at five selected touring routes lead to the following conclusions. 1. The exposure in the Kowary Drifts touring route is at the level of 5% of the recommended maximum annual admissible limit of 20 mSv. 2. It is assessed that workers of the touring routes where exposures are estimated from the measured concentrations and the time spent underground may receive doses ranging from 0.01 to 5 mSv. (N.C.)

Radon exposure in selected underground touring routes in Poland

Energy Technology Data Exchange (ETDEWEB)

Olszewski, J.; Chruscielewski, W.; Jankowski, J. [Nofer Institute of Occupational Medicine, Dept. of Radiation Protection, Lodz (Poland)

2006-07-01

The radioactive elements abounding in the natural environment cause that the whole human population is exposed to radiation. In Poland, mean gamma radiation dose power is 45.4 n Gy h{sup -1}, while atmospheric radon concentration is 4.4 Bq m{sup -3} [1]. In closed rooms, where radon tends to accumulate, the concentrations may be many times higher.Underground touring routes located in caves, mines, ancient cellars, vaults may accumulate radon at concentrations several thousand times exceeding its atmospheric levels. Studies on natural radioactivity in underground touring routes, with particular reference to caves, have continued worldwide since the 80's. Current register of underground touring routes in Poland comprises over 30 items, which include caves (e.g. Niedzwiedzia), mines (Wieliczka), cellars and underground stores (Opatow City vaults) and military objects (underground factories of Walim). The Nofer Institute of Occupational Medicine has for several years already continued determinations of periodical mean radon concentrations in four underground touring routes (starting date in parentheses): Niedzwiedzia Cave (1995); Kowary Drifts closed uranium mine (2001); closed uranium mine in Kletno (2004); Zloty Stok closed gold mine (2004); Osowka underground city in Gluszyca (2004).The results of our determinations of radon concentrations at five selected touring routes lead to the following conclusions. 1. The exposure in the Kowary Drifts touring route is at the level of 5% of the recommended maximum annual admissible limit of 20 mSv. 2. It is assessed that workers of the touring routes where exposures are estimated from the measured concentrations and the time spent underground may receive doses ranging from 0.01 to 5 mSv. (N.C.)

Improved routing strategies for data traffic in scale-free networks

International Nuclear Information System (INIS)

Wu, Zhi-Xi; Peng, Gang; Wong, Wing-Ming; Yeung, Kai-Hau

2008-01-01

We study the information packet routing process in scale-free networks by mimicking Internet traffic delivery. We incorporate both the global shortest paths information and local degree information of the network in the dynamic process, via two tunable parameters, α and β, to guide the packet routing. We measure the performance of the routing method by both the average transit times of packets and the critical packet generation rate (above which packet aggregation occurs in the network). We found that the routing strategies which integrate ingredients of both global and local topological information of the underlying networks perform much better than the traditional shortest path routing protocol taking into account the global topological information only. Moreover, by doing comparative studies with some related works, we found that the performance of our proposed method shows universal efficiency characteristic against the amount of traffic

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

Science.gov (United States)

Mardiana Panggabean, Ellis; Mawengkang, Herman; Azis, Zainal; Filia Sari, Rina

2018-01-01

The paper develops a model for the optimal management of logistic delivery of a given commodity. The company has different type of vehicles with different capacity to deliver the commodity for customers. The problem is then called Periodic Heterogeneous Vehicle Routing Problem (PHVRP). The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the sum of the costs of all routes over the planning horizon. We propose a combined approach of heuristic algorithm and exact method to solve the problem.

DIRECTIONAL OPPORTUNISTIC MECHANISM IN CLUSTER MESSAGE CRITICALITY LEVEL BASED ZIGBEE ROUTING

OpenAIRE

B.Rajeshkanna *1, Dr.M.Anitha 2

2018-01-01

The cluster message criticality level based zigbee routing(CMCLZOR) has been proposed for routing the cluster messages in wireless smart energy home area networks. It employs zigbee opportunistic shortcut tree routing(ZOSTR) and AODV individually for routing normal messages and highly critical messages respectively. ZOSTR allows the receiving nodes to compete for forwarding a packet with the priority of left-over hops rather than stating single next hop node like unicast protocols. Since it h...

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

OpenAIRE

Purser, H. R.; Farran, E. K.; Courbois, Y.; Lemahieu, A.; Mellier, D.; Sockeel, P.; Blades, M.

2012-01-01

The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11years and to relate route-learning performance to the components of Baddeley's model of working memory. Children carried out tasks that included measures of verbal and visuospatial short-term memory and executive control and also measures of verbal and visuospatial long-term memory; the route-learning task was conducted using a maze in a virtual environment. In contrast to previous research, correlation...

Sternal Route More Effective than Tibial Route for Intraosseous Amiodarone Administration in a Swine Model of Ventricular Fibrillation.

Science.gov (United States)

Burgert, James M; Martinez, Andre; O'Sullivan, Mara; Blouin, Dawn; Long, Audrey; Johnson, Arthur D

2018-01-01

The pharmacokinetics of IO administered lipid soluble amiodarone during ventricular fibrillation (VF) with ongoing CPR are unknown. This study measured mean plasma concentration over 5 minutes, maximum plasma concentration (Cmax), and time to maximum concentration (Tmax) of amiodarone administered by the sternal IO (SIO), tibial IO (TIO), and IV routes in a swine model of VF with ongoing CPR. Twenty-one Yorkshire-cross swine were randomly assigned to three groups: SIO, TIO, and IV. Ventricular fibrillation was induced under general anesthesia. After 4 minutes in VF, 300 mg amiodarone was administered as indicated by group assignment. Serial blood specimens collected at 30, 60, 90, 120, 150, 180, 240, and 300 seconds were analyzed using high performance liquid chromatography with tandem mass spectrometry. The mean plasma concentration of IV amiodarone over 5 minutes was significantly higher than the TIO group at 60 seconds (P = 0.02) and 90 seconds (P = 0.017) post-injection. No significant differences in Cmax between the groups were found (P <0.05). The Tmax of amiodarone was significantly shorter in the SIO (99 secs) and IV (86 secs) groups compared to the TIO group (215 secs); P = 0.002 and P = 0.002, respectively. The SIO and IV routes of amiodarone administration were comparable. The TIO group took nearly three times longer to reach Tmax than the SIO and IV groups, likely indicating depot of lipid-soluble amiodarone in adipose-rich tibial yellow bone marrow. The SIO route was more effective than the TIO route for amiodarone delivery in a swine model of VF with ongoing CPR. Further investigations are necessary to determine if the kinetic differences found between the SIO and TIO routes in this study affect survival of VF in humans.

Routing protocol extension for resilient GMPLS multi-domain networks

DEFF Research Database (Denmark)

Manolova, Anna Vasileva; Ruepp, Sarah Renée; Romeral, Ricardo

2010-01-01

This paper evaluates the performance of multi-domain networks under the Generalized Multi-Protocol Label Switching control framework in case of a single inter-domain link failure. We propose and evaluate a routing protocol extension for the Border Gateway Protocol, which allows domains to obtain...... two Autonomous System disjoint paths and use them efficiently under failure conditions. Three main applications for the protocol extension are illustrated: reducing traffic loss on existing connections by xploiting pre-selected backup paths derived with our proposal, applying multi-domain restoration...... as survivability mechanism in case of single link failure, and employing proper failure notification mechanisms for routing of future connection requests under routing protocol re-convergence. Via simulations we illustrate the benefits of utilizing the proposed routing protocol extension for networks employing...

Predicting Catastrophic BGP Routing Instabilities

National Research Council Canada - National Science Library

Nguyen, Lien

2004-01-01

.... Currently, this critical function is performed by the Border Gateway Protocol (BGP) version 4 RF01771. Like all routing protocols, BGP is vulnerable to instabilities that reduce its effectiveness...

Performance analysis of routing protocols for IoT

Science.gov (United States)

Manda, Sridhar; Nalini, N.

2018-04-01

Internet of Things (IoT) is an arrangement of advancements that are between disciplinary. It is utilized to have compelling combination of both physical and computerized things. With IoT physical things can have personal virtual identities and participate in distributed computing. Realization of IoT needs the usage of sensors based on the sector for which IoT is integrated. For instance, in healthcare domain, IoT needs to have integration with wearable sensors used by patients. As sensor devices produce huge amount of data, often called big data, there should be efficient routing protocols in place. To the extent remote systems is worried there are some current protocols, for example, OLSR, DSR and AODV. It additionally tosses light into Trust based routing protocol for low-power and lossy systems (TRPL) for IoT. These are broadly utilized remote directing protocols. As IoT is developing round the corner, it is basic to investigate routing protocols that and evaluate their execution regarding throughput, end to end delay, and directing overhead. The execution experiences can help in settling on very much educated choices while incorporating remote systems with IoT. In this paper, we analyzed different routing protocols and their performance is compared. It is found that AODV showed better performance than other routing protocols aforementioned.

Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

Directory of Open Access Journals (Sweden)

Ahmad Maleki

2014-09-01

Full Text Available An important issue in ad-hoc on-demand distance vector (AODV routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561 using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters.

CulRoute: Gamified WebGIS3D platform for selection of touristic routes

Directory of Open Access Journals (Sweden)

E.P.L. Baptista

2015-11-01

Full Text Available The importance of tourist information disclosure on digital platforms is, nowadays, reinforced by public entities such as Turismo de Portugal and Turismo do Algarve. The incorporation of strategies to encourage greater interest and involvement of the users are likely to contribute to a more effective dissemination of tourist destinations and their historical and cultural heritage. This paper presents the concepts, strategies and technologies in the design and implementation of the gamified WebGIS3D platform named CulRoute. This platform enables the users to visualize and navigate the three-dimensional virtual models of monuments and to explore the 'treasures' of each monument in a gaming environment, as well as to test their knowledge by answering optional quizzes. From the list of visited monuments and other information available on the platform, the user can create customized routes, save them into files or print as maps for later use.

Neighboring and Connectivity-Aware Routing in VANETs

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2014-01-01

Full Text Available A novel position-based routing protocol anchor-based connectivity-aware routing (ACAR for vehicular ad hoc networks (VANETs is proposed in this paper to ensure connectivity of routes with more successfully delivered packets. Both buses and cars are considered as vehicular nodes running in both clockwise and anticlockwise directions in a city scenario. Both directions are taken into account for faster communication. ACAR is a hybrid protocol, using both the greedy forwarding approach and the store-carry-and-forward approach to minimize the packet drop rate on the basis of certain assumptions. Our solution to situations that occur when the network is sparse and when any (source or intermediate node has left its initial position makes this protocol different from those existing in the literature. We consider only vehicle-to-vehicle (V2V communication in which both the source and destination nodes are moving vehicles. Also, no road-side units are considered. Finally, we compare our protocol with A-STAR (a plausible connectivity-aware routing protocol for city environments, and simulation results in NS-2 show improvement in the number of packets delivered to the destination using fewer hops. Also, we show that ACAR has more successfully-delivered long-distance packets with reasonable packet delay than A-STAR.

Next Generation Network Routing and Control Plane

DEFF Research Database (Denmark)

Fu, Rong

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

Potential Valuation of Route Prague – Trutnov after D11 Completion

Directory of Open Access Journals (Sweden)

Hašek Jakub

2017-11-01

Full Text Available In the Czech Republic, there are many regions with unbalanced competition between bus and rail transport on main transport routes. This is due to differences in the quality of transport infrastructure, the attractiveness of the region, routing traffic routes or economic attractiveness for new investors and industry. The aim of this article is to evaluate the potential for bus operators on the route from Prague to Trutnov after completion of D11 highway project.

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

Science.gov (United States)

Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

2017-01-01

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

Efficient Networks Communication Routing Using Swarm Intelligence

OpenAIRE

Koushal Kumar

2012-01-01

As demonstrated by natural biological swarm’s collective intelligence has an abundance of desirable properties for problem-solving like in network routing. The focus of this paper is in the applications of swarm based intelligence in information routing for communication networks. As we know networks are growing and adopting new platforms as new technologies comes. Also according to new demands and requirements networks topologies and its complexity is increasing with time. Thus it is becomin...

Nature-Inspired and Energy Efficient Route Planning

DEFF Research Database (Denmark)

Schlichtkrull, Anders; Christensen, J. B. S.; Feld, T.

2015-01-01

Cars are responsible for substantial CO2 emission worldwide. Computers can help solve this problem by computing shortest routes on maps. A good example of this is the popular Google Maps service. However, such services often require the order of the stops on the route to be fixed. By not enforcing....... The app is aimed at private persons and small businesses. The app works by using a nature-inspired algorithm called Ant Colony Optimization....

Learning Points and Routes to Recommend Trajectories

OpenAIRE

Chen, Dawei; Ong, Cheng Soon; Xie, Lexing

2016-01-01

The problem of recommending tours to travellers is an important and broadly studied area. Suggested solutions include various approaches of points-of-interest (POI) recommendation and route planning. We consider the task of recommending a sequence of POIs, that simultaneously uses information about POIs and routes. Our approach unifies the treatment of various sources of information by representing them as features in machine learning algorithms, enabling us to learn from past behaviour. Info...

High throughput route selection in multi-rate wireless mesh networks

Institute of Scientific and Technical Information of China (English)

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

2008-01-01

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

Evaluation of RPL-compliant routing solutions in real-life WSNs

Directory of Open Access Journals (Sweden)

Zahariadis Theodore

2016-01-01

Full Text Available Wireless Sensor Networks (WSN applications continue to expand and already cover almost all our daily activities improving from security and environmental efficiency to gaming experience. The diverse applications running on top of WSNs have led to the design of an immense number of routing protocols. Few years ago, the IETF standardized the IPv6 routing protocol for low-power and lossy networks (RPL which is based on routing metrics to build communication paths between a source and the destination node. While significant efforts have focused on the design of routing metrics that satisfy the various applications, limited work has been reported on validating their performance using real-life motes. In this paper, we focus on validating the simulation results (obtained through the JSim simulator using TelosB motes for a set of routing metrics that have been proposed in our previous articles.

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Directory of Open Access Journals (Sweden)

Ji Ung Sun

2015-01-01

Full Text Available We consider a capacitated hub location-routing problem (HLRP which combines the hub location problem and multihub vehicle routing decisions. The HLRP not only determines the locations of the capacitated p-hubs within a set of potential hubs but also deals with the routes of the vehicles to meet the demands of customers. This problem is formulated as a 0-1 mixed integer programming model with the objective of the minimum total cost including routing cost, fixed hub cost, and fixed vehicle cost. As the HLRP has impractically demanding for the large sized problems, we develop a solution method based on the endosymbiotic evolutionary algorithm (EEA which solves hub location and vehicle routing problem simultaneously. The performance of the proposed algorithm is examined through a comparative study. The experimental results show that the proposed EEA can be a viable solution method for the supply chain network planning.

HIGHWAY, a transportation routing model: program description and revised users' manual

International Nuclear Information System (INIS)

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

1983-10-01

A computerized transportation routing model has been developed at the Oak Ridge National Laboratory to be used for predicting likely routes for shipping radioactive materials. The HIGHWAY data base is a computerized road atlas containing descriptions of the entire Interstate System, the federal highway system, and most of the principal state roads. In addition to its prediction of the most likely commercial route, options incorporated in the HIGHWAY model can allow for maximum use of Interstate highways or routes that will bypass urbanized areas containing populations greater than 100,000 persons. The user may also interactively modify the data base to predict routes that bypass any particular state, city, town, or specific highway segment

Southern routes for high-level radioactive waste: Agencies, contacts, and designations

International Nuclear Information System (INIS)

1991-05-01

The Southern Routes for High-Level Radioactive Waste: Agencies, Contacts and Designations is a compendium of sixteen southern states' routing programs for the transportation of high-level radioactive materials. The report identifies the state-designated routing agencies as defined under 49 Code of Federal Regulations (CFR) Part 171 and provides a reference to the source and scope of the agencies' rulemaking authority. Additionally, the state agency and contact designated by the state's governor to receive advance notification and shipment routing information under 10 CFR Parts 71 and 73 are also listed. This report also examines alternative route designations made by southern states and the lessons that were learned from the designation process

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

Science.gov (United States)

Wang, Yufei; Liu, Feng

2016-04-01

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

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

Science.gov (United States)

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

2018-04-16

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

Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles

National Research Council Canada - National Science Library

Sonmezocak, Erkan; Kurt, Senol

2008-01-01

.... The route planning of UAVs is the most critical and challenging problem of wartime. This thesis will develop three algorithms to solve a model that produces executable routings in order to dispatch three Unmanned Aerial Vehicles (UAV...

STIMULATION METHODS IMPROVEMENT OF EXIT ROUTE ON RAILWAY TRANSPORT

Directory of Open Access Journals (Sweden)

A. I. Verlan

2014-01-01

Full Text Available Purpose. The purpose of the article is to assess the costs, which are redistributed in the system «shipper−railroad−consignee» during routing of rail transportation and the development of tariff simulation methods of shippers to the exit routes formation. Methodology. Using economic and mathematical analysis the distribution of costs among the various participants of transportation process during the exit routes formation is investigated in the article. Findings. For implementation of the tariff simulation methods of exit routes and retention of the existing tariff structure it is proposed to provide in the «Tariff catalogue for freight transportation by railway transport of Ukraine» the discount, differentiated from haulage distance. A new method for determining the fees amount for cars supply and removal on approach tracks by train locomotives was also offered. Originality. As a result of the research a new method for determination of the exit rout efficiency that, unlike the existing one, takes into account the various interests of the individual participants in the transportation process was proposed. The dependence of the correction factors to the tariff for freight transportation in their own cars by direct exit routes from distance haulage was obtained. Implementation of these coefficients provides an approximation of railway tariffs to the traffic handling costs. A method for determination the rate of fees for cars supply and removal on approach tracks by train locomotives was offered. Practical value. InUkraine creation of the tariff discounts system for freight transportation by exit routes consistent with international practice and allows bringing the tariff to the real traffic handling cost. This change on the one hand will provide stimulation for private capital investments in infrastructure development and shunting means of approach tracks, on the other – it will fix the shippers to the railroads and stop their outflow

A Bioinspired Adaptive Congestion-Avoidance Routing for Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Huang Qiong

2014-01-01

Full Text Available Traditional mobile Ad Hoc network routing protocols are mainly based on the Shortest Path, which possibly results in many congestion nodes that incur routing instability and rerouting. To mitigate the side-efforts, this paper proposed a new bioinspired adaptive routing protocol (ATAR based on a mathematics biology model ARAS. This paper improved the ARAS by reducing the randomness and by introducing a new routing-decision metric “the next-hop fitness” which was denoted as the congestion level of node and the length of routing path. In the route maintenance, the nodes decide to forward the data to next node according to a threshold value of the fitness. In the recovery phase, the node will adopt random manner to select the neighbor as the next hop by calculation of the improved ARAS. With this route mechanism, the ATAR could adaptively circumvent the congestion nodes and the rerouting action is taken in advance. Theoretical analysis and numerical simulation results show that the ATAR protocol outperforms AODV and MARAS in terms of delivery ratio, ETE delay, and the complexity. In particular, ATAR can efficiently mitigate the congestion.

A Multipath Routing Protocol Based on Bloom Filter for Multihop Wireless Networks

Directory of Open Access Journals (Sweden)

Junwei Jin

2016-01-01

Full Text Available On-demand multipath routing in a wireless ad hoc network is effective in achieving load balancing over the network and in improving the degree of resilience to mobility. In this paper, the salvage capable opportunistic node-disjoint multipath routing (SNMR protocol is proposed, which forms multiple routes for data transmission and supports packet salvaging with minimum overhead. The proposed mechanism constructs a primary path and a node-disjoint backup path together with alternative paths for the intermediate nodes in the primary path. It can be achieved by considering the reverse route back to the source stored in the route cache and the primary path information compressed by a Bloom filter. Our protocol presents higher capability in packet salvaging and lower overhead in forming multiple routes. Simulation results show that SNMR outperforms the compared protocols in terms of packet delivery ratio, normalized routing load, and throughput.

Trams and roadworks on the route de Meyrin

CERN Multimedia

2007-01-01

The project to bring trams to CERN’s doorstep will require a lot of roadworks on the route de Meyrin, so traffic diversions and restrictions are to be expected. Traffic will be diverted away from the route de Meyrin as of the beginning of February 2008. Work on the future Cornavin-Meyrin-CERN tram route (TCMC) is progressing nicely. The first section up to Avanchet was inaugurated on 8 December but users will not be able to ride the tram all the way to CERN, via Meyrin Village and Cité de Meyrin, until 2010. Until then, all road users will have to be patient. To make room for the tram and to alleviate traffic flow in the centre of Meyrin Village, a 755-m long underpass will be constructed. Traffic coming from the centre of Geneva will enter the underpass at the Ecole de Golette and emerge at the Carrosserie de la Tour, having passed 15 metres below Meyrin Village centre. This "cut-and-cover" construction will entail traffic diversions via the rout...

Route-Based Signal Preemption Control of Emergency Vehicle

Directory of Open Access Journals (Sweden)

Haibo Mu

2018-01-01

Full Text Available This paper focuses on the signal preemption control of emergency vehicles (EV. A signal preemption control method based on route is proposed to reduce time delay of EV at intersections. According to the time at which EV is detected and the current phase of each intersection on the travelling route of EV, the calculation methods of the earliest start time and the latest start time of green light at each intersection are given. Consequently, the effective time range of green light at each intersection is determined in theory. A multiobjective programming model, whose objectives are the minimal residence time of EV at all intersections and the maximal passing numbers of general society vehicles, is presented. Finally, a simulation calculation is carried out. Calculation results indicate that, by adopting the signal preemption method based on route, the delay of EV is reduced and the number of society vehicles passing through the whole system is increased. The signal preemption control method of EV based on route can reduce the time delay of EV and improve the evacuation efficiency of the system.

An Improved Differential Evolution Algorithm for Maritime Collision Avoidance Route Planning

Directory of Open Access Journals (Sweden)

Yu-xin Zhao

2014-01-01

Full Text Available High accuracy navigation and surveillance systems are pivotal to ensure efficient ship route planning and marine safety. Based on existing ship navigation and maritime collision prevention rules, an improved approach for collision avoidance route planning using a differential evolution algorithm was developed. Simulation results show that the algorithm is capable of significantly enhancing the optimized route over current methods. It has the potential to be used as a tool to generate optimal vessel routing in the presence of conflicts.

Deterministic Greedy Routing with Guaranteed Delivery in 3D Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Su Xia

2014-05-01

Full Text Available With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in extending greedy routing from 2D to 3D space. In this research, we develop decentralized solutions to achieve greedy routing in 3D sensor networks. Our proposed approach is based on a unit tetrahedron cell (UTC mesh structure. We propose a distributed algorithm to realize volumetric harmonic mapping (VHM of the UTC mesh under spherical boundary condition. It is a one-to-one map that yields virtual coordinates for each node in the network without or with one internal hole. Since a boundary has been mapped to a sphere, node-based greedy routing is always successful thereon. At the same time, we exploit the UTC mesh to develop a face-based greedy routing algorithm and prove its success at internal nodes. To deliver a data packet to its destination, face-based and node-based greedy routing algorithms are employed alternately at internal and boundary UTCs, respectively. For networks with multiple internal holes, a segmentation and tunnel-based routing strategy is proposed on top of VHM to support global end-to-end routing. As far as we know, this is the first work that realizes truly deterministic routing with constant-bounded storage and computation in general 3D wireless sensor networks.

Economic Possibilities of Shipping though Northern Sea Route1

Directory of Open Access Journals (Sweden)

Sung-Woo Lee

2014-12-01

Full Text Available Global warming and climate change haves brought a new issue in the Arctic sea. Therefore, we can now explore new shipping routes through the Arctic Ocean instead of the existing commercial route. In particular, the Northern Sea Route (NSR is one of the feasible shipping routes and, has provided tremendous shipping benefits. If the NSR becomes commercialized, we will be able to save about 5,000 nautical miles in distance and sailing time. In this study, we will emphasize some of the important results on the possibility of commercializing the shipping route in the Arctic. The NSR may bring positive economic effects in terms of shipping distance and time. For example, when utilizing the NSR, the maximum cargo traffic between Asia and Europe is expected to be around 46 million TEU. However, we also need to consider an expensive passage fee that is currently imposed by Russia. In conclusion, we maintain our efforts to protect the environment in the Arctic, in terms of logistics, and we need to explore every possible avenue to bring possible economic benefits to the North Pacific countries.

An Improved 6LoWPAN Hierarchical Routing Protocol

Directory of Open Access Journals (Sweden)

Xue Li

2015-10-01

Full Text Available IETF 6LoWPAN working group is engaged in the IPv6 protocol stack research work based on IEEE802.15.4 standard. In this working group, the routing protocol is one of the important research contents. In the 6LoWPAN, HiLow is a well-known layered routing protocol. This paper puts forward an improved hierarchical routing protocol GHiLow by improving HiLow parent node selection and path restoration strategy. GHiLow improves the parent node selection by increasing the choice of parameters. Simutaneously, it also improves path recovery by analysing different situations to recovery path. Therefore, GHiLow contributes to the ehancement of network performance and the decrease of network energy consumption.

Nanocrystalline spinel ferrites by solid state reaction route

Indian Academy of Sciences (India)

Wintec

Nanocrystalline spinel ferrites by solid state reaction route. T K KUNDU* and S MISHRA. Department of Physics, Visva-Bharati, Santiniketan 731 235, India. Abstract. Nanostructured NiFe2O4, MnFe2O4 and (NiZn)Fe2O4 were synthesized by aliovalent ion doping using conventional solid-state reaction route. With the ...

Cultural Routes and Intangible Heritage

Directory of Open Access Journals (Sweden)

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.

DTN routing in body sensor networks with dynamic postural partitioning.

Science.gov (United States)

Quwaider, Muhannad; Biswas, Subir

2010-11-01

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

Route Selection with Unspecified Sites Using Knowledge Based Genetic Algorithm

Science.gov (United States)

Kanoh, Hitoshi; Nakamura, Nobuaki; Nakamura, Tomohiro

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

ASR performance analysis of an experimental call routing system

CSIR Research Space (South Africa)

Modipa, T

2009-11-01

Full Text Available Call routing is an important application of Automatic Speech Recognition (ASR) technology. In this paper the authors discuss the main issues affecting the performance of a call routing system and describe the ASR component of the "Auto...

Estimating Common Pedestrian Routes through Indoor Path Networks using Position Traces

DEFF Research Database (Denmark)

Prentow, Thor Siiger; Blunck, Henrik; Grønbæk, Kaj

2014-01-01

routes between locations. These methods are sufficiently efficient to provide common routes based on real-time data from thousands of devices simultaneously. Furthermore, we show that the methods operate robustly even on basis of noisy and coarse-grained position estimates as provided by large......Abstract—Accurate information about how people commonly travel in a given large-scale building environment and which routes they take for given start and destination points is essential for applications such as indoor navigation, route prediction, and mobile work planning and logistics...

Cooperative Route Planning for Multiple Aircraft in a Semifree ATC System

Directory of Open Access Journals (Sweden)

Yi Yang

2018-01-01

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

Radiological mapping of Mumbai-Arakkonam rail route

International Nuclear Information System (INIS)

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

2018-01-01

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

Glaciers along proposed routes extending the Copper River Highway, Alaska

Science.gov (United States)

Glass, R.L.

1996-01-01

Three inland highway routes are being considered by the Alaska Department of Transportation and Public Facilities to connect the community of Cordova in southcentral Alaska to a statewide road system. The routes use part of a Copper River and Northwest Railway alignment along the Copper River through mountainous terrain having numerous glaciers. An advance of any of several glaciers could block and destroy the roadway, whereas retreating glaciers expose large quantities of unconsolidated, unvegetated, and commonly ice-rich sediments. The purpose of this study was to map historical locations of glacier termini near these routes and to describe hazards associated with glaciers and seasonal snow. Historical and recent locations of glacier termini along the proposed Copper River Highway routes were determined by reviewing reports and maps and by interpreting aerial photographs. The termini of Childs, Grinnell, Tasnuna, and Woodworth Glaciers were 1 mile or less from a proposed route in the most recently available aerial photography (1978-91); the termini of Allen, Heney, and Schwan Glaciers were 1.5 miles or less from a proposed route. In general, since 1911, most glaciers have slowly retreated, but many glaciers have had occasional advances. Deserted Glacier and one of its tributary glaciers have surge-type medial moraines, indicating potential rapid advances. The terminus of Deserted Glacier was about 2.1 miles from a proposed route in 1978, but showed no evidence of surging. Snow and rock avalanches and snowdrifts are common along the proposed routes and will periodically obstruct the roadway. Floods from ice-dammed lakes also pose a threat. For example, Van Cleve Lake, adjacent to Miles Glacier, is as large as 4.4 square miles and empties about every 6 years. Floods from drainages of Van Cleve Lake have caused the Copper River to rise on the order of 20 feet at Million Dollar Bridge.

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

Science.gov (United States)

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

2018-01-01

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

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

Science.gov (United States)

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

2015-01-01

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

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

Directory of Open Access Journals (Sweden)

Jeevaa Katiravan

2015-01-01

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

B-iTRS: A Bio-Inspired Trusted Routing Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2015-01-01

Full Text Available In WSNs, routing algorithms need to handle dynamical changes of network topology, extra overhead, energy saving, and other requirements. Therefore, routing in WSNs is an extremely interesting and challenging issue. In this paper, we present a novel bio-inspired trusted routing scheme (B-iTRS based on ant colony optimization (ACO and Physarum autonomic optimization (PAO. For trust assessment, B-iTRS monitors neighbors’ behavior in real time, receives feedback from Sink, and then assesses neighbors’ trusts based on the acquired information. For routing scheme, each node finds routes to the Sink based on ACO and PAO. In the process of path finding, B-iTRS senses the load and trust value of each node and then calculates the link load and link trust of the found routes to support the route selection. Moreover, B-iTRS also assesses the route based on PAO to maintain the route table. Simulation results show how B-iTRS can achieve the effective performance compared to existing state-of-the-art algorithms.

QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization

Directory of Open Access Journals (Sweden)

Admir Barolli

2011-01-01

Full Text Available Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing.

Enhanced DSR Routing Protocol for the Short Time Disconnected MANET

Directory of Open Access Journals (Sweden)

PAPAJ Ján

2013-05-01

Full Text Available Data delivery in Mobile Ad-Hoc network (MANET is a very difficult task due to the fact the sporadic connections between mobile nodes. For this reason, we introduce the new modified routing protocol that enables the data delivery in the case that the connections are disconnected. A key aspect of the protocol is a process of finding connections between source and destination nodes that can provide low end-to-end delay and better delivery performance in a disconnected MANET. The protocol provides the concepts of opportunistic routing of the routing packets in disconnected MANETs. In this paper we present a modification of the DSR routing protocol and also some results of a simulation.

Reconstruction after esophagectomy for esophageal cancer: Retrosternal or posterior mediastinal route?

Directory of Open Access Journals (Sweden)

Mei-Lin Chan

2011-11-01

Conclusion: For patients with esophageal cancer who undergo an esophagectomy followed by gastric conduit reconstruction, the posterior mediastinal route is superior to the retrosternal route in regard to anastomotic leakage and hospital mortality. Adjuvant radiotherapy did not influence the postoperative functions of the gastric conduit used for reconstruction in either route.

VT Route Log Points 2017

Data.gov (United States)

Vermont Center for Geographic Information — This data layer is used with VTrans' Integrated Route Log System (IRA). It is also used to calibrate the linear referencing systems, including the End-to-End and...

Roots/Routes: Part II

Science.gov (United States)

Swanson, Dalene M.

2009-01-01

This narrative acts as an articulation of a journey of many routes. Following Part I of the same research journey of rootedness/routedness, it debates the nature of transformation and transcendence beyond personal and political paradoxes informed by neoliberalism and related repressive globalizing discourses. Through a more personal, descriptive,…

Multipath Routing in Wireless Sensor Networks: Survey and Research Challenges

Science.gov (United States)

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

2012-01-01

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

Reinforcement Learning for Routing in Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Hasan A. A. Al-Rawi

2014-01-01

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

A Simulation-Based Dynamic Stochastic Route Choice Model for Evacuation

Directory of Open Access Journals (Sweden)

Xing Zhao

2012-01-01

Full Text Available This paper establishes a dynamic stochastic route choice model for evacuation to simulate the propagation process of traffic flow and estimate the stochastic route choice under evacuation situations. The model contains a lane-group-based cell transmission model (CTM which sets different traffic capacities for links with different turning movements to flow out in an evacuation situation, an actual impedance model which is to obtain the impedance of each route in time units at each time interval and a stochastic route choice model according to the probit-based stochastic user equilibrium. In this model, vehicles loading at each origin at each time interval are assumed to choose an evacuation route under determinate road network, signal design, and OD demand. As a case study, the proposed model is validated on the network nearby Nanjing Olympic Center after the opening ceremony of the 10th National Games of the People's Republic of China. The traffic volumes and clearing time at five exit points of the evacuation zone are calculated by the model to compare with survey data. The results show that this model can appropriately simulate the dynamic route choice and evolution process of the traffic flow on the network in an evacuation situation.

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

Science.gov (United States)

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

2012-01-01

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

A dual-route approach to orthographic processing.

Science.gov (United States)

Grainger, Jonathan; Ziegler, Johannes C

2011-01-01

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

A dual-route approach to orthographic processing

Directory of Open Access Journals (Sweden)

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.

A Geographical Heuristic Routing Protocol for VANETs

Science.gov (United States)

Urquiza-Aguiar, Luis; Tripp-Barba, Carolina; Aguilar Igartua, Mónica

2016-01-01

Vehicular ad hoc networks (VANETs) leverage the communication system of Intelligent Transportation Systems (ITS). Recently, Delay-Tolerant Network (DTN) routing protocols have increased their popularity among the research community for being used in non-safety VANET applications and services like traffic reporting. Vehicular DTN protocols use geographical and local information to make forwarding decisions. However, current proposals only consider the selection of the best candidate based on a local-search. In this paper, we propose a generic Geographical Heuristic Routing (GHR) protocol that can be applied to any DTN geographical routing protocol that makes forwarding decisions hop by hop. GHR includes in its operation adaptations simulated annealing and Tabu-search meta-heuristics, which have largely been used to improve local-search results in discrete optimization. We include a complete performance evaluation of GHR in a multi-hop VANET simulation scenario for a reporting service. Our study analyzes all of the meaningful configurations of GHR and offers a statistical analysis of our findings by means of MANOVA tests. Our results indicate that the use of a Tabu list contributes to improving the packet delivery ratio by around 5% to 10%. Moreover, if Tabu is used, then the simulated annealing routing strategy gets a better performance than the selection of the best node used with carry and forwarding (default operation). PMID:27669254

A Sociability-Based Routing Scheme for Delay-Tolerant Networks

Directory of Open Access Journals (Sweden)

Fabbri Flavio

2011-01-01

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

Alternative routes for highway shipments of radioactive materials and lessons learned from state designations

International Nuclear Information System (INIS)

1990-07-01

Pursuant to the Hazardous Materials Transportation Act (HMTA), the Department of Transportation (DOT) has promulgated a comprehensive set of regulations regarding the highway transportation of high-level radioactive materials. These regulations, under docket numbers HM-164 and HM-164A, establish interstate highways as the preferred routes for the transportation of radioactive materials within and through the states. The regulations also provide a methodology by which a state may select altemative routes. First, the state must establish a ''state routing agency'', defined as an entity authorized to use the state legal process to impose routing requirements on carriers of radioactive material (49 CFR 171.8). Once identified, the state routing agency must select routes in accordance with DOTs Guidelines for Selecting Preferred Highway Routes for Large Quantity Shipments of Radioactive Materials or an equivalent routing analysis. Adjoining states and localities should be consulted on the impact of proposed alternative routes as a prerequisite of final route selection. Lastly, the states must provide written notice to DOT of any alternative route designation before the routes are deemed effective. The purpose of this report is to discuss the ''lessons learned'' by the five states within the southern region that have designated alternative or preferred routes under the regulations of the Department of Transportation (DOT) established for the transportation of radioactive materials. The document was prepared by reviewing applicable federal laws and regulations, examining state reports and documents and contacting state officials and routing agencies involved in making routing decisions. In undertaking this project, the Southern States Energy Board hopes to reveal the process used by states that have designated alternative routes and thereby share their experiences (i.e., lessons learned) with other southern states that have yet to make designations

Performance Analysis of On-Demand Routing Protocols in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Arafatur RAHMAN

2009-01-01

Full Text Available Wireless Mesh Networks (WMNs have recently gained a lot of popularity due to their rapid deployment and instant communication capabilities. WMNs are dynamically self-organizing, self-configuring and self-healing with the nodes in the network automatically establishing an adiej hoc network and preserving the mesh connectivity. Designing a routing protocol for WMNs requires several aspects to consider, such as wireless networks, fixed applications, mobile applications, scalability, better performance metrics, efficient routing within infrastructure, load balancing, throughput enhancement, interference, robustness etc. To support communication, various routing protocols are designed for various networks (e.g. ad hoc, sensor, wired etc.. However, all these protocols are not suitable for WMNs, because of the architectural differences among the networks. In this paper, a detailed simulation based performance study and analysis is performed on the reactive routing protocols to verify the suitability of these protocols over such kind of networks. Ad Hoc On-Demand Distance Vector (AODV, Dynamic Source Routing (DSR and Dynamic MANET On-demand (DYMO routing protocol are considered as the representative of reactive routing protocols. The performance differentials are investigated using varying traffic load and number of source. Based on the simulation results, how the performance of each protocol can be improved is also recommended.

The influence of advertisements on the conspicuity of routing information

OpenAIRE

Boersema, T.; Zwaga, H.J.G.

1985-01-01

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

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

OpenAIRE

Yan Han; Hongzhi Guan; Jiaying Duan

2014-01-01

The question prompted is how to design the tour route to make the tourists get the maximum satisfactions considering the tourists’ demand. The influence factors of the tour route choices of tourists were analyzed and tourists’ behavior characteristics and psychological preferences were regarded as the important influence factors based on the tourist behavioral theories. A questionnaire of tourists’ tour route information and satisfaction degree was carried out. Some information about the scen...

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

Science.gov (United States)

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

2018-01-01

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

Vehicle routing with dynamic travel times : a queueing approach

NARCIS (Netherlands)

Woensel, van T.; Kerbache, L.; Peremans, H.; Vandaele, N.J.

2008-01-01

Transportation is an important component of supply chain competitiveness since it plays a major role in the inbound, inter-facility, and outbound logistics. In this context, assigning and scheduling vehicle routes is a crucial management problem. In this paper, a vehicle routing problem with dynamic

Deduction of passengers' route choices from smart card data

NARCIS (Netherlands)

van der Hurk, E.; Kroon, L.G.; Maroti, G.; Vervest, P.

2015-01-01

Deducing passengers' route choices from smart card data provides public transport operators the opportunity to evaluate and improve their passenger service. Particularly in the case of disruptions, when traditional route choice models may not be valid, this is an advantage. This paper proposes a

Multicriteria vehicle routing problem solved by artificial immune system

Directory of Open Access Journals (Sweden)

Bogna MRÓWCZYŃSKA

2015-09-01

Full Text Available Vehicles route planning in large transportation companies, where drivers are workers, usually takes place on the basis of experience or intuition of the employees. Because of the cost and environmental protection, it is important to save fuel, thus planning routes in an optimal way. In this article an example of the problem is presented solving delivery vans route planning taking into account the distance and travel time within the constraints of vehicle capacities, restrictions on working time of drivers and having varying degrees of movement. An artificial immune system was used for the calculations.

Optimizing investment fund allocation using vehicle routing problem framework

Science.gov (United States)

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

2014-07-01

The objective of investment is to maximize total returns or minimize total risks. To determine the optimum order of investment, vehicle routing problem method is used. The method which is widely used in the field of resource distribution shares almost similar characteristics with the problem of investment fund allocation. In this paper we describe and elucidate the concept of using vehicle routing problem framework in optimizing the allocation of investment fund. To better illustrate these similarities, sectorial data from FTSE Bursa Malaysia is used. Results show that different values of utility for risk-averse investors generate the same investment routes.

Role of route previewing strategies on climbing fluency and exploratory movements

Science.gov (United States)

Cordier, Romain; Orth, Dominic; Courtine, Yoan; Croft, James L.

2017-01-01

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

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

Directory of Open Access Journals (Sweden)

Ludovic Seifert

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

The Prohibitive Link between Position-based Routing and Planarity

Directory of Open Access Journals (Sweden)

David Cairns

2013-12-01

Full Text Available Position-based routing is touted as an ideal routing strategy for resource-constrained wireless networks. One persistent barrier to adoption is due to its recovery phase, where messages are forwarded according to leftor right-hand rule (LHR. This is often referred to as face-routing. In this paper we investigate the limits of LHR with respect to planarity.We show that the gap between non-planarity and successful delivery is a single link within a single configuration. Our work begins with an analysis to enumerate all node configurations that cause intersections in the unit-disc graph. We find that left-hand rule is able to recover from all but a single case, the ‘umbrella’ configuration so named for its appearance. We use this information to propose the Prohibitive Link Detection Protocol (PLDP that can guarantee delivery over non-planar graphs using standard face-routing techniques. As the name implies, the protocol detects and circumvents the ‘bad’ links that hamper LHR. The goal of this work is to maintain routing guarantees while disturbing the network graph as little as possible. In doing so, a new starting point emerges from which to build rich distributed protocols in the spirit of CLDP and GDSTR.

Performance Evaluation of AODV Routing Protocol in VANET with NS2

Directory of Open Access Journals (Sweden)

Divya Rathi

2017-03-01

Full Text Available In intelligent transportation systems, the collaboration between vehicles and the road side units is essential to bring these systems to realization. The emerging Vehicular Ad Hoc Network (VANET is becoming more and more important as it provides intelligent transportation application, comfort, safety, entertainment for people in vehicles. In order to provide stable routes and to get good performance in VANET, there is a need of proper routing protocols must be designed. In this paper, we are working with the very well-known ad-hoc on-demand distance vector (AODV routing protocol. The existing Routing protocol AODV-L which is based on the Link expiration time is extended to propose a more reliable AODV-AD which is based on multichannel MAC protocol. For the performance evaluation of routing protocols, a simulation tool ‘NS2’ has been used. Simulation results show that the proposed AODV-AD protocol can achieves better performances in forms of high Route stability, Packet Delivery ratio and packet loss rate than traditional AODV-L and traditional AODV.

Walkable Route Perceptions and Physical Features: Converging Evidence for En Route Walking Experiences

Science.gov (United States)

Brown, Barbara B.; Werner, Carol M.; Amburgey, Jonathan W.; Szalay, Caitlin

2007-01-01

Guided walks near a light rail stop in downtown Salt Lake City, Utah, were examined using a 2 (gender) x 3 (route walkability: low-mixed-, or high-walkability features) design. Trained raters confirmed that more walkable segments had more traffic, environmental, and social safety; pleasing aesthetics; natural features; pedestrian amenities; and…

Waste Collection Vehicle Routing Problem: Literature Review

Directory of Open Access Journals (Sweden)

Hui Han

2015-08-01

Full Text Available Waste generation is an issue which has caused wide public concern in modern societies, not only for the quantitative rise of the amount of waste generated, but also for the increasing complexity of some products and components. Waste collection is a highly relevant activity in the reverse logistics system and how to collect waste in an efficient way is an area that needs to be improved. This paper analyzes the major contribution about Waste Collection Vehicle Routing Problem (WCVRP in literature. Based on a classification of waste collection (residential, commercial and industrial, firstly the key findings for these three types of waste collection are presented. Therefore, according to the model (Node Routing Problems and Arc Routing problems used to represent WCVRP, different methods and techniques are analyzed in this paper to solve WCVRP. This paper attempts to serve as a roadmap of research literature produced in the field of WCVRP.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed; Ho, Pin Han; Naik, Sagar; Shihada, Basem

2011-01-01

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2011-08-21

This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of miniature devices such as smart phones, hand-held devices, and sensors mounted in fixed or mobile objects. SAURP aims to explore the possibility of taking mobile nodes as message carriers in order for end-to-end delivery of the messages. The best carrier for a message is determined by the prediction result using a novel contact model, where the network status, including wireless link condition and nodal buffer availability, are jointly considered. The paper argues and proves that the nodal movement and the predicted collocation with the message recipient can serve as meaningful information to achieve an intelligent message forwarding decision at each node. The proposed protocol has been implemented and compared with a number of existing encounter-based routing approaches in terms of delivery delay, and the number of transmissions required for message delivery. The simulation results show that the proposed SAURP outperforms all the counterpart multi-copy encounter-based routing protocols considered in the study.

Traffic routing for multicomputer networks with virtual cut-through capability

Science.gov (United States)

Kandlur, Dilip D.; Shin, Kang G.

1992-01-01

Consideration is given to the problem of selecting routes for interprocess communication in a network with virtual cut-through capability, while balancing the network load and minimizing the number of times that a message gets buffered. An approach is proposed that formulates the route selection problem as a minimization problem with a link cost function that depends upon the traffic through the link. The form of this cost function is derived using the probability of establishing a virtual cut-through route. The route selection problem is shown to be NP-hard, and an algorithm is developed to incrementally reduce the cost by rerouting the traffic. The performance of this algorithm is exemplified by two network topologies: the hypercube and the C-wrapped hexagonal mesh.

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

Science.gov (United States)

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

2014-01-01

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

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

Directory of Open Access Journals (Sweden)

Elham Ahmadi Moghaddam

2016-12-01

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

Performance evaluation of routing metrics for wireless mesh networks

CSIR Research Space (South Africa)

Nxumalo, SL

2009-08-01

Full Text Available for WMN. The routing metrics have not been compared with QoS parameters. This paper is a work in progress of the project in which researchers want to compare the performance of different routing metrics in WMN using a wireless test bed. Researchers...

The vehicle routing problem latest advances and new challenges

CERN Document Server

Golden, Bruce L; Wasil, Edward A

2008-01-01

The Vehicle Routing Problem (VRP) has been an especially active and fertile area of research. Over the past five to seven years, there have been numerous technological advances and exciting challenges that are of considerable interest to students, teachers, and researchers. The Vehicle Routing Problem: Latest Advances and New Challenges will focus on a host of significant technical advances that have evolved over the past few years for modeling and solving vehicle routing problems and variants. New approaches for solving VRPs have been developed from important methodological advances. These developments have resulted in faster solution algorithms, more accurate techniques, and an improvement in the ability to solve large-scale, complex problems. The book will systematically examine these recent developments in the VRP and provide the following in a unified and carefully developed presentation: Present novel problems that have arisen in the vehicle routing domain and highlight new challenges for the field; Pre...

GIS-Based Population Model Applied to Nevada Transportation Routes

International Nuclear Information System (INIS)

Mills, G.S.; Neuhauser, K.S.

1999-01-01

Recently, a model based on geographic information system (GIS) processing of US Census Block data has made high-resolution population analysis for transportation risk analysis technically and economically feasible. Population density bordering each kilometer of a route may be tabulated with specific route sections falling into each of three categories (Rural, Suburban or Urban) identified for separate risk analysis. In addition to the improvement in resolution of Urban areas along a route, the model provides a statistically-based correction to population densities in Rural and Suburban areas where Census Block dimensions may greatly exceed the 800-meter scale of interest. A semi-automated application of the GIS model to a subset of routes in Nevada (related to the Yucca Mountain project) are presented, and the results compared to previous models including a model based on published Census and other data. These comparisons demonstrate that meaningful improvement in accuracy and specificity of transportation risk analyses is dependent on correspondingly accurate and geographically-specific population density data

Delay Tolerance in Underwater Wireless Communications: A Routing Perspective

Directory of Open Access Journals (Sweden)

Safdar Hussain Bouk

2016-01-01

Full Text Available Similar to terrestrial networks, underwater wireless networks (UWNs also aid several critical tasks including coastal surveillance, underwater pollution detection, and other maritime applications. Currently, once underwater sensor nodes are deployed at different levels of the sea, it is nearly impossible or very expensive to reconfigure the hardware, for example, battery. Taking this issue into account, considerable amount of research has been carried out to ensure minimum energy costs and reliable communication between underwater nodes and base stations. As a result, several different network protocols were proposed for UWN, including MAC, PHY, transport, and routing. Recently, a new paradigm was introduced claiming that the intermittent nature of acoustic channel and signal resulted in designing delay tolerant routing schemes for the UWN, known as an underwater delay tolerant network. In this paper, we provide a comprehensive survey of underwater routing protocols with emphasis on the limitations, challenges, and future open issues in the context of delay tolerant network routing.

A Novel Message Scheduling Framework for Delay Tolerant Networks Routing

KAUST Repository

Elwhishi, Ahmed

2013-05-01

Multicopy routing strategies have been considered the most applicable approaches to achieve message delivery in Delay Tolerant Networks (DTNs). Epidemic routing and two-hop forwarding routing are two well-reported approaches for delay tolerant networks routing which allow multiple message replicas to be launched in order to increase message delivery ratio and/or reduce message delivery delay. This advantage, nonetheless, is at the expense of additional buffer space and bandwidth overhead. Thus, to achieve efficient utilization of network resources, it is important to come up with an effective message scheduling strategy to determine which messages should be forwarded and which should be dropped in case of buffer is full. This paper investigates a new message scheduling framework for epidemic and two-hop forwarding routing in DTNs, such that the forwarding/dropping decision can be made at a node during each contact for either optimal message delivery ratio or message delivery delay. Extensive simulation results show that the proposed message scheduling framework can achieve better performance than its counterparts.

Cost and risk tradeoff for routing nuclear spent fuel movements

International Nuclear Information System (INIS)

Chin, S.M.

1988-01-01

In the transportation industry, much effort has been devoted to finding the least cost routes for shipping goods from their production sites to the market areas. In addition to cost, the decision maker must take the risk of an incident into consideration for transportation routing involving hazardous materials. The transportation of spent nuclear fuel from reactor sites to repositories is an example. Given suitable network information, existing routing methods can readily determine least cost or least risk routes for any shipment. These two solutions, however, represent the extremes of a large number of alternatives with different combinations of risk and cost. In the selection of routes and also in the evaluation of alternative storage sites it is not enough to know which is the lease cost or lowest risk. Intelligent decision-marking requires knowledge of how much it will cost to lower risk by a certain amount. The objective of this study is to develop an automated system to evaluate the tradeoff between transportation cost and potential population at risk under different nuclear spent fuel transportation strategies

Roots/Routes: Part I

Science.gov (United States)

Swanson, Dalene M.

2009-01-01

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

New routes of allergen immunotherapy.

Science.gov (United States)

Aricigil, Mitat; Muluk, Nuray Bayar; Sakarya, Engin Umut; Sakalar, Emine Güven; Senturk, Mehmet; Reisacher, William R; Cingi, Cemal

2016-11-01

Allergen immunotherapy is the only cure for immunoglobulin E mediated type I respiratory allergies. Subcutaneous immunotherapy (SCIT) and sublingual immunotherapy (SLIT) are the most common treatments. In this article, we reviewed new routes of allergen immunotherapy. Data on alternative routes to allow intralymphatic immunotherapy (ILIT), epicutaneous immunotherapy (EPIT), local nasal immunotherapy (LNIT), oral immunotherapy (OIT), and oral mucosal immunotherapy (OMIT) were gathered from the literature and were discussed. ILIT features direct injection of allergens into lymph nodes. ILIT may be clinically effective after only a few injections and induces allergen-specific immunoglobulin G, similarly to SCIT. A limitation of ILIT is that intralymphatic injections are required. EPIT features allergen administration by using patches mounted on the skin. EPIT seeks to target epidermal antigen-presenting Langerhans cells rather than mast cells or the vasculature; this should reduce both local and systemic adverse effects. LNIT involves the spraying of allergen extracts into the nasal cavity. Natural or chemically modified allergens (the latter, termed allergoids, lack immunoglobulin E reactivity) are prepared in a soluble form. OIT involves the regular administration of small amounts of a food allergen by mouth and commences with low oral doses, which are then increased as tolerance develops. OMIT seeks to deliver allergenic proteins to an expanded population of Langerhans cells in the mucosa of the oral cavity. ILIT, EPIT, LNIT, OIT, and OMIT are new routes for allergen immunotherapy. They are safe and effective.

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

International Nuclear Information System (INIS)

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

2010-01-01

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

Route planning with transportation network maps: an eye-tracking study.

Science.gov (United States)

Grison, Elise; Gyselinck, Valérie; Burkhardt, Jean-Marie; Wiener, Jan Malte

2017-09-01

Planning routes using transportation network maps is a common task that has received little attention in the literature. Here, we present a novel eye-tracking paradigm to investigate psychological processes and mechanisms involved in such a route planning. In the experiment, participants were first presented with an origin and destination pair before we presented them with fictitious public transportation maps. Their task was to find the connecting route that required the minimum number of transfers. Based on participants' gaze behaviour, each trial was split into two phases: (1) the search for origin and destination phase, i.e., the initial phase of the trial until participants gazed at both origin and destination at least once and (2) the route planning and selection phase. Comparisons of other eye-tracking measures between these phases and the time to complete them, which depended on the complexity of the planning task, suggest that these two phases are indeed distinct and supported by different cognitive processes. For example, participants spent more time attending the centre of the map during the initial search phase, before directing their attention to connecting stations, where transitions between lines were possible. Our results provide novel insights into the psychological processes involved in route planning from maps. The findings are discussed in relation to the current theories of route planning.

Cost Effectiveness of Alternative Route Special Education Teacher Preparation

Science.gov (United States)

Sindelar, Paul T.; Dewey, James F.; Rosenberg, Michael S.; Corbett, Nancy L.; Denslow, David; Lotfinia, Babik

2012-01-01

In this study, the authors estimated costs of alternative route preparation to provide states a basis for allocating training funds to maximize production. Thirty-one special education alternative route program directors were interviewed and completed cost tables. Two hundred and twenty-four program graduates were also surveyed. The authors…

14 CFR 121.161 - Airplane limitations: Type of route.

Science.gov (United States)

2010-01-01

... 14 Aeronautics and Space 3 2010-01-01 2010-01-01 false Airplane limitations: Type of route. 121... OPERATING REQUIREMENTS: DOMESTIC, FLAG, AND SUPPLEMENTAL OPERATIONS Aircraft Requirements § 121.161 Airplane... specifications, no certificate holder may operate a turbine-engine-powered airplane over a route that contains a...

Effect of Different Routes of Vitamin/Mineral premix Administration ...

African Journals Online (AJOL)

An experiment was conducted to determine the best route of vitamin/mineral premix administration to broilers using a completely randomized design. The routes of administrations were through formulated diets, daily in drinking water, and daily mixing in feed ration. Histological examination of the liver did not reveal any ...

A fully distributed geo-routing scheme for wireless sensor networks

KAUST Repository

Bader, Ahmed

2013-12-01

When marrying randomized distributed space-time coding (RDSTC) to beaconless geo-routing, new performance horizons can be created. In order to reach those horizons, however, beaconless geo-routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geo-routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes. © 2013 IEEE.

A fully distributed geo-routing scheme for wireless sensor networks

KAUST Repository

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

2013-01-01

When marrying randomized distributed space-time coding (RDSTC) to beaconless geo-routing, new performance horizons can be created. In order to reach those horizons, however, beaconless geo-routing protocols must evolve to operate in a fully distributed fashion. In this letter, we expose a technique to construct a fully distributed geo-routing scheme in conjunction with RDSTC. We then demonstrate the performance gains of this novel scheme by comparing it to one of the prominent classical schemes. © 2013 IEEE.

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

Science.gov (United States)

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

2018-05-01

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