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

Science.gov (United States)

Huibin, Liu; Jun, Zhang

2016-04-01

Mobile Ad Hoc Networks were playing an increasingly important part in disaster reliefs, military battlefields and scientific explorations. However, networks routing difficulties are more and more outstanding due to inherent structures. This paper proposed an improved cuckoo searching-based Ad hoc On-Demand Distance Vector Routing protocol (CSAODV). It elaborately designs the calculation methods of optimal routing algorithm used by protocol and transmission mechanism of communication-package. In calculation of optimal routing algorithm by CS Algorithm, by increasing QoS constraint, the found optimal routing algorithm can conform to the requirements of specified bandwidth and time delay, and a certain balance can be obtained among computation spending, bandwidth and time delay. Take advantage of NS2 simulation software to take performance test on protocol in three circumstances and validate the feasibility and validity of CSAODV protocol. In results, CSAODV routing protocol is more adapt to the change of network topological structure than AODV protocol, which improves package delivery fraction of protocol effectively, reduce the transmission time delay of network, reduce the extra burden to network brought by controlling information, and improve the routing efficiency of network.

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.

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.

Digital arteriography of kidney arteries by intraveinous route. Simplified technique

International Nuclear Information System (INIS)

Guisgand, M.; Dardenne, A.N.

1989-01-01

Of the 1,000 patients addressed to us for intravenous digital angiography (IVDA) of the renal arteries for arterial hypertension, for control of the artery of a transplanted kidney or for preoperative check-up prior to transplantation of a kidney, 738 were examined by a simplified technique. Compared to the standard practice this method simply consists of a manual injection of a standard ionic contrast medium via an antecubital vein punctured with a large catheter needle (caliber 14 G), without preparatory injection of an intestinal antispasmodic. This method has produced a satisfactory arterial opacification in 96 % of the cases. The advantages and disadvantages of the technique are discussed. Of the 262 remaining patients, 250 were also examined by the peripheral venous mode, but the technique had to be modified in at least one of its aspects for one reason or another. Only 12 patients were not examined by the peripheral venous mode (7 puncture failures, 4 permanent venous accesses already installed). The IVDA simplified technique appears to be reliable for detecting reno-vascular arterial hyper-tension and, with certain limitations, for the control of kidney grafts. With regard to the preoperative check-up before kidney transplantation, IVDA still does not seem a suitable replacement for the traditional method of angiography [fr

BioSimplify: an open source sentence simplification engine to improve recall in automatic biomedical information extraction.

Science.gov (United States)

Jonnalagadda, Siddhartha; Gonzalez, Graciela

2010-11-13

BioSimplify is an open source tool written in Java that introduces and facilitates the use of a novel model for sentence simplification tuned for automatic discourse analysis and information extraction (as opposed to sentence simplification for improving human readability). The model is based on a "shot-gun" approach that produces many different (simpler) versions of the original sentence by combining variants of its constituent elements. This tool is optimized for processing biomedical scientific literature such as the abstracts indexed in PubMed. We tested our tool on its impact to the task of PPI extraction and it improved the f-score of the PPI tool by around 7%, with an improvement in recall of around 20%. The BioSimplify tool and test corpus can be downloaded from https://biosimplify.sourceforge.net.

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

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

Aircraft Route Recovery Based on An Improved GRASP Method

Directory of Open Access Journals (Sweden)

Yang He

2017-01-01

Full Text Available Aircrafts maintenance, temporary airport closures are common factors that disrupt normal flight schedule. The aircraft route recovery aims to recover original schedules by some strategies, including flights swaps, and cancellations, which is a NP-hard problem. This paper proposes an improved heuristic procedure based on Greedy Random Adaptive Search Procedure (GRASP to solve this problem. The effectiveness and high global optimization capability of the heuristic is illustrated through experiments based on large-scale problems. Compared to the original one, it is shown that the improved procedure can find feasible flight recovered schedules with lower cost in a short time.

Improving the road network performance with dynamic route guidance by considering the indifference band of road users

NARCIS (Netherlands)

Vreeswijk, J.D.; Landman, R.L.; Van Berkum, E.C.; Hegyi, A.; Hoogendoorn, S.P.; Van Arem, B.

2012-01-01

When applying dynamic route guidance to improve the network performance, it is important to balance the interests of the road authorities and the road users. In this paper we will illustrate how bounded rationality and indifference bands can be taken into account in dynamic route guidance to improve

An Improved PRoPHET Routing Protocol in Delay Tolerant Network

Directory of Open Access Journals (Sweden)

Seung Deok Han

2015-01-01

Full Text Available In delay tolerant network (DTN, an end-to-end path is not guaranteed and packets are delivered from a source node to a destination node via store-carry-forward based routing. In DTN, a source node or an intermediate node stores packets in buffer and carries them while it moves around. These packets are forwarded to other nodes based on predefined criteria and finally are delivered to a destination node via multiple hops. In this paper, we improve the dissemination speed of PRoPHET (probability routing protocol using history of encounters and transitivity protocol by employing epidemic protocol for disseminating message m, if forwarding counter and hop counter values are smaller than or equal to the threshold values. The performance of the proposed protocol was analyzed from the aspect of delivery probability, average delay, and overhead ratio. Numerical results show that the proposed protocol can improve the delivery probability, average delay, and overhead ratio of PRoPHET protocol by appropriately selecting the threshold forwarding counter and threshold hop counter values.

Life Cycle Design - a Route to the Sustainable Industrial Culture?

DEFF Research Database (Denmark)

Hauschild, Michael Zwicky; Wenzel, Henrik; Alting, Leo

1999-01-01

In the attempt to reorient Society's development in a more sustainable direction attention is focused on the environmental impact of products and systems over their entire life cycle, but how can the environmental life cycle perspective be introduced into the design of new solutions and how much...... can be optained through life cycle design? The authors' experience with integration of environmental considerations in product development is presented, ranging from the detailed interactive approach to the EDIP-method through various simplified approaches. The potential for environmental improvements...... is reviewed and the overall question of to what extent life cycle design is a route to the sustainable industrial culture is discussed....

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.

A model to improve the routing performance of Cognitive Radio Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Lesiba Morries Kola

2017-12-01

Full Text Available The increasing demand for broadband wireless technologies has led to the scarcity, inefficient utilization, and underutilization of the spectrum. The Cognitive Radio (CR technology has emerged as the promising solution which improves the utilization of the spectrum. However, routing is a challenge due to the dynamic nature of the CR networks. The link quality varies in space and time as nodes join and leave the network. The network connectivity is intermittent due to node mobility and the activities of the primary user. The spectrum aware, spectrum agile, and interference aware routing protocols are vital for the sturdiness of the network and efficient utilization of the resources. We propose an interference aware, spectrum aware, and agile extended Weighted Cumulative Expected Transmission Time (xWCETT routing protocol. The protocol integrates the features of the Ad-hoc On-demand Distance Vector (AODV and the weighted cumulative expected transmission time (WCETT routing protocols. The xWCETT was simulated using the Network Simulator 2 and its performance compared with the AODV and the WCETT routing protocols. The xWCETT was evaluated with respect to quality of service related metrics and the results show that it outperformed the AODV and WCETT routing protocols.

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

Improved emergency elevated air release for simplified PWR

International Nuclear Information System (INIS)

Naitoh, T.; Bruce, R.A.; Hirota, K.; Tajiri, Y.

1992-01-01

In developing the application of the simplified PWR in Japan, one of the most important areas is to limit post-accident site boundary whole body dose. In addressing this, the concept of Emergency Passive Air Filtration System (EPAFS) and it's feasibility is developed. The efficiency of charcoal filtering and the atmospheric diffusion effect of an elevated air release are important for dose reduction. The performance of these functions was evaluated by confirmatory testing. The test results confirmed a 99 percent efficiency of charcoal filter and an atmospheric diffusion effect higher than that of a conventional plant. The Emergency Passive Air Filtration System (EPAFS) and the atmospheric diffusion effect of elevated air release contribute to making the calculated post-accident site boundary whole body dose of simplified PWR as low as that of the conventional Japanese PWR plant. (author)

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.

IMHRP: Improved Multi-Hop Routing Protocol for Wireless Sensor Networks

Science.gov (United States)

Huang, Jianhua; Ruan, Danwei; Hong, Yadong; Zhao, Ziming; Zheng, Hong

2017-10-01

Wireless sensor network (WSN) is a self-organizing system formed by a large number of low-cost sensor nodes through wireless communication. Sensor nodes collect environmental information and transmit it to the base station (BS). Sensor nodes usually have very limited battery energy. The batteries cannot be charged or replaced. Therefore, it is necessary to design an energy efficient routing protocol to maximize the network lifetime. This paper presents an improved multi-hop routing protocol (IMHRP) for homogeneous networks. In the IMHRP protocol, based on the distances to the BS, the CH nodes are divided into internal CH nodes and external CH nodes. The set-up phase of the protocol is based on the LEACH protocol and the minimum distance between CH nodes are limited to a special constant distance, so a more uniform distribution of CH nodes is achieved. In the steady-state phase, the routes of different CH nodes are created on the basis of the distances between the CH nodes. The energy efficiency of communication can be maximized. The simulation results show that the proposed algorithm can more effectively reduce the energy consumption of each round and prolong the network lifetime compared with LEACH protocol and MHT protocol.

Critical success factors simplified implementing the powerful drivers of dramatic business improvement

CERN Document Server

Howell, Marvin T

2010-01-01

Critical-to-success factors (CSFs) have become essential elements to strategic planning and no business can achieve consistent success without effectively adopting them. To take full advantage of CSFs, however, an organization must first understand what they are and how they can be used to drive organizational initiatives and processes. Critical Success Factors Simplified: Implementing the Powerful Drivers of Dramatic Business Improvement provides a concise manual on CSFs that will teach you how to identify and select the right CSFs, measure their impact, and adjust them as needed to reach your goals.

Improving biobank consent comprehension: a national randomized survey to assess the effect of a simplified form and review/retest intervention

Science.gov (United States)

Beskow, Laura M.; Lin, Li; Dombeck, Carrie B.; Gao, Emily; Weinfurt, Kevin P.

2017-01-01

Purpose: To determine the individual and combined effects of a simplified form and a review/retest intervention on biobanking consent comprehension. Methods: We conducted a national online survey in which participants were randomized within four educational strata to review a simplified or traditional consent form. Participants then completed a comprehension quiz; for each item answered incorrectly, they reviewed the corresponding consent form section and answered another quiz item on that topic. Results: Consistent with our first hypothesis, comprehension among those who received the simplified form was not inferior to that among those who received the traditional form. Contrary to expectations, receipt of the simplified form did not result in significantly better comprehension compared with the traditional form among those in the lowest educational group. The review/retest procedure significantly improved quiz scores in every combination of consent form and education level. Although improved, comprehension remained a challenge in the lowest-education group. Higher quiz scores were significantly associated with willingness to participate. Conclusion: Ensuring consent comprehension remains a challenge, but simplified forms have virtues independent of their impact on understanding. A review/retest intervention may have a significant effect, but assessing comprehension raises complex questions about setting thresholds for understanding and consequences of not meeting them. Genet Med advance online publication 13 October 2016 PMID:27735922

Utilization of handheld computing to simplify compliance

International Nuclear Information System (INIS)

Galvin, G.; Rasmussen, J.; Haines, A.

2008-01-01

Monitoring job site performance and building a continually improving organization is an ongoing challenge for operators of process and power generation facilities. Stakeholders need to accurately capture records of quality and safety compliance, job progress, and operational experiences (OPEX). This paper explores the use of technology-enabled processes as a means for simplifying compliance to quality, safety, administrative, maintenance and operations activities. The discussion will explore a number of emerging technologies and their application to simplifying task execution and process compliance. This paper will further discuss methodologies to further refine processes through trending improvements in compliance and continually optimizing and simplifying through the use of technology. (author)

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.

Exploring the Feasibility of Reputation Models for Improving P2P Routing under Churn

Science.gov (United States)

Sànchez-Artigas, Marc; García-López, Pedro; Herrera, Blas

Reputation mechanisms help peer-to-peer (P2P) networks to detect and avoid unreliable or uncooperative peers. Recently, it has been discussed that routing protocols can be improved by conditioning routing decisions to the past behavior of forwarding peers. However, churn — the continuous process of node arrival and departure — may severely hinder the applicability of rating mechanisms. In particular, short lifetimes mean that reputations are often generated from a small number of transactions.

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

Depletion velocities for atmospheric pollutants oriented To improve the simplified regional dispersion modelling

International Nuclear Information System (INIS)

Sanchez Gacita, Madeleine; Turtos Carbonell, Leonor; Rivero Oliva, Jose de Jesus

2005-01-01

The present work is aimed to improve externalities assessment using Simplified Methodologies, through the obtaining of depletion velocities for primary pollutants SO 2 , NO X and TSP (Total Suspended Particles) and for sulfate and nitrate aerosols, the secondary pollutants created from the first ones. The main goal proposed was to estimate these values for different cases, in order to have an ensemble of values for the geographic area, among which the most representative could be selected for using it in future studies that appeal to a simplified methodology for the regional dispersion assessment, taking into account the requirements of data, qualified manpower and time for a detailed approach. The results where obtained using detailed studies of the regional dispersion that were conduced for six power facilities, three from Cuba (at the localities of Mariel, Santa Cruz and Tallapiedra) and three from Mexico (at the localities of Tuxpan, Tula and Manzanillo). The depletion velocity for SO 2 was similar for all cases. Results obtained for Tallapiedra, Santa Cruz, Mariel and Manzanillo were similar. For Tula and Tuxpan a high uncertainty was found

Meeting Air Transportation Demand in 2025 by Using Larger Aircraft and Alternative Routing to Complement NextGen Operational Improvements

Science.gov (United States)

Smith, Jeremy C.; Guerreiro, Nelson M.; Viken, Jeffrey K.; Dollyhigh, Samuel M.; Fenbert, James W.

2010-01-01

A study was performed that investigates the use of larger aircraft and alternative routing to complement the capacity benefits expected from the Next Generation Air Transportation System (NextGen) in 2025. National Airspace System (NAS) delays for the 2025 demand projected by the Transportation Systems Analysis Models (TSAM) were assessed using NASA s Airspace Concept Evaluation System (ACES). The shift in demand from commercial airline to automobile and from one airline route to another was investigated by adding the route delays determined from the ACES simulation to the travel times used in the TSAM and re-generating new flight scenarios. The ACES simulation results from this study determined that NextGen Operational Improvements alone do not provide sufficient airport capacity to meet the projected demand for passenger air travel in 2025 without significant system delays. Using larger aircraft with more seats on high-demand routes and introducing new direct routes, where demand warrants, significantly reduces delays, complementing NextGen improvements. Another significant finding of this study is that the adaptive behavior of passengers to avoid congested airline-routes is an important factor when projecting demand for transportation systems. Passengers will choose an alternative mode of transportation or alternative airline routes to avoid congested routes, thereby reducing delays to acceptable levels for the 2025 scenario; the penalty being that alternative routes and the option to drive increases overall trip time by 0.4% and may be less convenient than the first-choice route.

A Subpath-based Logit Model to Capture the Correlation of Routes

Directory of Open Access Journals (Sweden)

Xinjun Lai

2016-06-01

Full Text Available A subpath-based methodology is proposed to capture the travellers’ route choice behaviours and their perceptual correlation of routes, because the original link-based style may not be suitable in application: (1 travellers do not process road network information and construct the chosen route by a link-by-link style; (2 observations from questionnaires and GPS data, however, are not always link-specific. Subpaths are defined as important portions of the route, such as major roads and landmarks. The cross-nested Logit (CNL structure is used for its tractable closed-form and its capability to explicitly capture the routes correlation. Nests represent subpaths other than links so that the number of nests is significantly reduced. Moreover, the proposed method simplifies the original link-based CNL model; therefore, it alleviates the estimation and computation difficulties. The estimation and forecast validation with real data are presented, and the results suggest that the new method is practical.

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.

Improved simplified scheme of atom equivalents to calculate enthalpies of formation of alkyl radicals

International Nuclear Information System (INIS)

Castro, Eduardo A.

2002-01-01

An improved simplified method of atom equivalents is applied to the calculation of enthalpies of formation of several alkyl radicals. Some statistical mechanics and thermodynamic corrections are added to compare theoretical values with available experimental data. The estimation is quite satisfactory and the average error is similar to current experimental uncertainties, thus providing a direct and simple procedure for this sort of calculation when experimental results are unavailable or/and as an independent check when experimental data are in doubt. (Author) [es

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

Competitive energy markets. The effective route to improving the environment

International Nuclear Information System (INIS)

Swinden, D.J.

1996-01-01

Market forces, operating in an increasingly competitive energy market, are a preferred route to achieving environmental and energy efficiency benefits, than those which can be achieved through a managed approach adopted by many governments. It is shown, through examples, how electricity is a catalyst for change at several levels in business, the community and the general economy. Experience in the United Kingdom indicates that free market forces and inter-energy competition not only help improve the regional and therefore national economy, but they offer a very effective way of introducing improvements in energy efficiency and the environment. Governments should establish the framework for competition and regulation but not attempt to manage an industry, which is invariably done more effectively by those who run them. (author)

Ways to improve the environmental conditions of their buses in operation on passenger routes of cities

Directory of Open Access Journals (Sweden)

Melnychuk S.V.

2017-04-01

Full Text Available The results of studies on operational and environmental parameters buses used on bus routes Zhitomir city. It uses statistical methods for determining the intensity of traffic, passenger traffic and ecology in traffic. To assess the environmental chosen stop with the greatest intensity of traffic, which is the probability of accumulation of pollution transport emissions that exceed permissible limits. Calculation of environmental pollution emission route for vehicles made stops street «Str. Hundreds of Heaven» «CUM», «vul. Hlibna» on the main trunk street Kievska. Results obtained environmental field experiments compared with the data defined calculation methods, based on the proposed use appropriate operational vehicles. The conclusions that indicate the seriousness of the problem and the urgency to address it. The system of environmental safety and road safety in Zhitomir requires significant improvements due to the increased quantities bus vehicles plying city routes. Recommendations to improve the ecological condition of intersections can be developed through the optimization of traffic using buses with environmentally improved operating parameters. Keywords: environmental and operational parameters; ecological safety; environmental assessment; intensity of traffic; passenger traffic; environmental conditions; operation; bus choice; stop.

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

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

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

BioSimplify: an open source sentence simplification engine to improve recall in automatic biomedical information extraction

OpenAIRE

Jonnalagadda, Siddhartha; Gonzalez, Graciela

2011-01-01

BioSimplify is an open source tool written in Java that introduces and facilitates the use of a novel model for sentence simplification tuned for automatic discourse analysis and information extraction (as opposed to sentence simplification for improving human readability). The model is based on a "shot-gun" approach that produces many different (simpler) versions of the original sentence by combining variants of its constituent elements. This tool is optimized for processing biomedical scien...

Improving the Dominating-Set Routing over Delay-Tolerant Mobile Ad-Hoc Networks via Estimating Node Intermeeting Times

Directory of Open Access Journals (Sweden)

Preiss Bruno

2011-01-01

Full Text Available With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In our previous research, we presented a supernode system architecture that employs the delay-tolerant network (DTN concept to provide seamless communications for roaming users over interconnected heterogeneous wireless networks. Mobile ad hoc networks (MANETs are considered a key component of the supernode system for services over an area not covered by other wireless networks. Within the super node system, a dominating-set routing technique is proposed to improve message delivery over MANETs and to achieve better resource utilization. The performance of the dominating-set routing technique depends on estimation accuracy of the probability of a future contact between nodes. This paper studies how node mobility can be modeled and used to better estimate the probability of a contact. We derive a distribution for the node-to-node intermeeting time and present numerical results to demonstrate that the distribution can be used to improve the dominating-set routing technique performance. Moreover, we investigate how the distribution can be employed to relax the constraints of selecting the dominating-set members in order to improve the system resource utilization.

Simplified application of electronic data processing in a natural science and technology special library in combination with an improved literature description

Energy Technology Data Exchange (ETDEWEB)

Bretnuetz, E.

1975-10-01

A pilot project in a special library for natural science and technology to record bibliographic data on several kinds of literature within a simplified scheme and to process them in a computer by simple programs is described. The printout consists of several lists arranged according to several aspects. At the same time a relevant thesaurus is tested as to its suitability for an improved description of the literature. The results show that the literature handled is identified sufficiently within this simplified scheme. After supplementation by some special terms, the thesaurus can be used for a deeper analysis of the literature. (auth)

Does laser diode irradiation improve the degree of conversion of simplified dentin bonding systems?

Directory of Open Access Journals (Sweden)

Leticia Ferreira de Freitas BRIANEZZI

Full Text Available Abstract Simplified dentin-bonding systems are clinically employed for most adhesive procedures, and they are prone to hydrolytic degradation. Objective This study aimed to investigate the effect of laser diode irradiation on the degree of conversion (DC, water sorption (WS, and water solubility (WSB of these bonding systems in an attempt to improve their physico-mechanical resistance. Material and Methods Two bonding agents were tested: a two-step total-etch system [Adper™ Single Bond 2, 3M ESPE (SB] and a universal system [Adper™ Single Bond Universal, 3M ESPE (SU]. Square-shaped specimens were prepared and assigned into 4 groups (n=5: SB and SU (control groups – no laser irradiation and SB-L and SU-L [SB and SU laser (L – irradiated groups]. DC was assessed using Fourier transform infrared spectroscopy with attenuated total reflectance. Additional uncured resin samples (≈3.0 µL, n=5 of each adhesive were also scanned for final DC calculation. For WS/WSB tests, similar specimens (n=10 were prepared and measured by monitoring the mass changes after dehydration/water storage cycles. For both tests, adhesive fluids were dropped into standardized Teflon molds (6.0×6.0×1.0 mm, irradiated with a 970-nm laser diode, and then polymerized with an LED-curing unit (1 W/cm2. Results Laser irradiation immediately before photopolymerization increased the DC (% of the tested adhesives: SB-L>SB>SU-L>SU. For WS/WSB (μg/mm3, only the dentin bonding system (DBS was a significant factor (pSU. Conclusion Irradiation with a laser diode improved the degree of conversion of all tested simplified dentin bonding systems, with no impact on water sorption and solubility.

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.

NLM's Medical Library Resource Improvement Grant for Consortia Development: a proposed outline to simplify the application process.

Science.gov (United States)

Kabler, A W

1980-01-01

The National Library of Medicine's Resource Improvement Grant for Consortia is available to assist with developing hospital library consortia, and to support the development of basic healthy information collections. In an effort to simplify the grant application process, this paper presents suggestions for writing the narrative section of the first budget-period application, using the outline in NLM's Application Instructions for Consortium Applicants. Suggestions for writing the narratives of the second budget-period application and the collection development application are also included.

Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms

Directory of Open Access Journals (Sweden)

Mattas Konstantinos

2016-12-01

Full Text Available The determination of the optimal circular path has become widely known for its difficulty in producing a solution and for the numerous applications in the scope of organization and management of passenger and freight transport. It is a mathematical combinatorial optimization problem for which several deterministic and heuristic models have been developed in recent years, applicable to route organization issues, passenger and freight transport, storage and distribution of goods, waste collection, supply and control of terminals, as well as human resource management. Scope of the present paper is the development, with the use of fuzzy sets, of a practical, comprehensible and speedy heuristic algorithm for the improvement of the ability of the classical deterministic algorithms to identify optimum, symmetrical or non-symmetrical, circular route. The proposed fuzzy heuristic algorithm is compared to the corresponding deterministic ones, with regard to the deviation of the proposed solution from the best known solution and the complexity of the calculations needed to obtain this solution. It is shown that the use of fuzzy sets reduced up to 35% the deviation of the solution identified by the classical deterministic algorithms from the best known solution.

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

Science.gov (United States)

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

2015-01-01

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

Simplified design of flexible expansion anchored plates for nuclear structures

International Nuclear Information System (INIS)

Mehta, N.K.; Hingorani, N.V.; Longlais, T.G.; Sargent and Lundy, Chicago, IL)

1984-01-01

In nuclear power plant construction, expansion anchored plates are used to support pipe, cable tray and HVAC duct hangers, and various structural elements. The expansion anchored plates provide flexibility in the installation of field-routed lines where cast-in-place embedments are not available. General design requirements for expansion anchored plate assemblies are given in ACI 349, Appendix B (1). The manufacturers recommend installation procedures for their products. Recent field testing in response to NRC Bulletin 79-02 (2) indicates that anchors, installed in accordance with manufacturer's recommended procedures, perform satisfactorily under static and dynamic loading conditions. Finite element analysis is a useful tool to correctly analyze the expansion anchored plates subject to axial tension and biaxial moments, but it becomes expensive and time-consuming to apply this tool for a large number of plates. It is, therefore, advantageous to use a simplified method, even though it may be more conservative as compared to the exact method of analysis. This paper presents a design method referred to as the modified rigid plate analysis approach to simplify both the initial design and the review of as-built conditions

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.

Windows 8 simplified

CERN Document Server

McFedries, Paul

2012-01-01

The easiest way for visual learners to get started with Windows 8 The popular Simplified series makes visual learning easier than ever, and with more than 360,000 copies sold, previous Windows editions are among the bestselling Visual books. This guide goes straight to the point with easy-to-follow, two-page tutorials for each task. With full-color screen shots and step-by-step directions, it gets beginners up and running on the newest version of Windows right away. Learn to work with the new interface and improved Internet Explorer, manage files, share your computer, and much more. Perfect fo

Generic simplified simulation model for DFIG with active crowbar

Energy Technology Data Exchange (ETDEWEB)

Buendia, Francisco Jimenez [Gamesa Innovation and Technology, Sarriguren, Navarra (Spain). Technology Dept.; Barrasa Gordo, Borja [Assystem Iberia, Bilbao, Vizcaya (Spain)

2012-07-01

Simplified models for transient stability studies are a general requirement for transmission system operators to wind turbine (WTG) manufacturers. Those models must represent the performance of the WTGs for transient stability studies, mainly voltage dips originated by short circuits in the electrical network. Those models are implemented in simulation software as PSS/E, DigSilent or PSLF. Those software platforms allow simulation of transients in large electrical networks with thousands of busses, generators and loads. The high complexity of the grid requires that the models inserted into the grid should be simplified in order to allow the simulations being executed as fast as possible. The development of a model which is simplified enough to be integrated in those complex grids and represent the performance of WTG is a challenge. The IEC TC88 working group has developed generic models for different types of generators, among others for WTGs using doubly fed induction generators (DFIG). This paper will focus in an extension of the models for DFIG WTGs developed in IEC in order to be able to represent the simplified model of DFIG with an active crowbar, which is required to withstand voltage dips without disconnecting from the grid. This paper improves current generic model of Type 3 for DFIG adding a simplified version of the generator including crowbar functionality and a simplified version of the crowbar firing. In addition, this simplified model is validated by correlation with voltage dip field test from a real wind turbine. (orig.)

A human-machine cooperation route planning method based on improved A* algorithm

Science.gov (United States)

Zhang, Zhengsheng; Cai, Chao

2011-12-01

To avoid the limitation of common route planning method to blindly pursue higher Machine Intelligence and autoimmunization, this paper presents a human-machine cooperation route planning method. The proposed method includes a new A* path searing strategy based on dynamic heuristic searching and a human cooperated decision strategy to prune searching area. It can overcome the shortage of A* algorithm to fall into a local long term searching. Experiments showed that this method can quickly plan a feasible route to meet the macro-policy thinking.

Simplified proceeding as a civil procedure model

Directory of Open Access Journals (Sweden)

Олексій Юрійович Зуб

2016-01-01

Full Text Available Currently the directions for the development of modern civil procedural law such as optimization, facilitation, forwarding proceedings promoting the increase of the civil procedure efficiency factor are of peculiar importance. Their results are occurrence and functionality of simplified proceedings system designed to facilitate significantly hearing some categories of cases, promotion of their consideration within reasonable time and reduce legal expenses so far as it is possible. The category “simplified proceedings” in the native science of the procedural law is underexamined. A good deal of scientists-processualists were limited to studying summary (in the context of optimization as a way to improve the civil procedural form, summary proceedings and procedures functioning in terms of the mentioned proceedings, consideration of case in absentia as well as their modification. Among the Ukrainian scientist who studied some aspects of the simplified proceedings are: E. A. Belyanevych, V. I. Bobrik, S. V. Vasilyev, M. V. Verbitska, S. I. Zapara, A. A. Zgama, V. V. Komarov, D. D. Luspenuk, U. V. Navrotska, V. V. Protsenko, T. V. Stepanova, E. A. Talukin, S. Y. Fursa, M. Y. Shtefan others. The problems of the simplified proceedings were studied by the foreign scientists as well, such as: N. Andrews, Y. Y. Grubanon, N. A. Gromoshina, E. P. Kochanenko, J. Kohler, D. I. Krumskiy, E. M. Muradjan, I. V. Reshetnikova, U. Seidel, N. V. Sivak, M. Z. Shvarts, V. V. Yarkov and others. The paper objective is to develop theoretically supported, practically reasonable notion of simplified proceedings in the civil process, and also basing on the notion of simplified proceedings, international experience of the legislative regulation of simplified proceedings, native and foreign doctrine, to distinguish essential features of simplified proceedings in the civil process and to describe them. In the paper we generated the notion of simplified proceedings that

An Improved Routing Optimization Algorithm Based on Travelling Salesman Problem for Social Networks

Directory of Open Access Journals (Sweden)

Naixue Xiong

2017-06-01

Full Text Available A social network is a social structure, which is organized by the relationships or interactions between individuals or groups. Humans link the physical network with social network, and the services in the social world are based on data and analysis, which directly influence decision making in the physical network. In this paper, we focus on a routing optimization algorithm, which solves a well-known and popular problem. Ant colony algorithm is proposed to solve this problem effectively, but random selection strategy of the traditional algorithm causes evolution speed to be slow. Meanwhile, positive feedback and distributed computing model make the algorithm quickly converge. Therefore, how to improve convergence speed and search ability of algorithm is the focus of the current research. The paper proposes the improved scheme. Considering the difficulty about searching for next better city, new parameters are introduced to improve probability of selection, and delay convergence speed of algorithm. To avoid the shortest path being submerged, and improve sensitive speed of finding the shortest path, it updates pheromone regulation formula. The results show that the improved algorithm can effectively improve convergence speed and search ability for achieving higher accuracy and optimal results.

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

SModelS v1.1 user manual: Improving simplified model constraints with efficiency maps

Science.gov (United States)

Ambrogi, Federico; Kraml, Sabine; Kulkarni, Suchita; Laa, Ursula; Lessa, Andre; Magerl, Veronika; Sonneveld, Jory; Traub, Michael; Waltenberger, Wolfgang

2018-06-01

SModelS is an automatized tool for the interpretation of simplified model results from the LHC. It allows to decompose models of new physics obeying a Z2 symmetry into simplified model components, and to compare these against a large database of experimental results. The first release of SModelS, v1.0, used only cross section upper limit maps provided by the experimental collaborations. In this new release, v1.1, we extend the functionality of SModelS to efficiency maps. This increases the constraining power of the software, as efficiency maps allow to combine contributions to the same signal region from different simplified models. Other new features of version 1.1 include likelihood and χ2 calculations, extended information on the topology coverage, an extended database of experimental results as well as major speed upgrades for both the code and the database. We describe in detail the concepts and procedures used in SModelS v1.1, explaining in particular how upper limits and efficiency map results are dealt with in parallel. Detailed instructions for code usage are also provided.

Lobatamide C: total synthesis, stereochemical assignment, preparation of simplified analogues, and V-ATPase inhibition studies.

Science.gov (United States)

Shen, Ruichao; Lin, Cheng Ting; Bowman, Emma Jean; Bowman, Barry J; Porco, John A

2003-07-02

The total synthesis and stereochemical assignment of the potent antitumor macrolide lobatamide C, as well as synthesis of simplified lobatamide analogues, is reported. Cu(I)-mediated enamide formation methodology has been developed to prepare the highly unsaturated enamide side chain of the natural product and analogues. A key fragment coupling employs base-mediated esterification of a beta-hydroxy acid and a salicylate cyanomethyl ester. Three additional stereoisomers of lobatamide C have been prepared using related synthetic routes. The stereochemistry at C8, C11, and C15 of lobatamide C was assigned by comparison of stereoisomers and X-ray analysis of a crystalline derivative. Synthetic lobatamide C, stereoisomers, and simplified analogues have been evaluated for inhibition of bovine chromaffin granule membrane V-ATPase. The salicylate phenol, enamide NH, and ortho-substitution of the salicylate ester have been shown to be important for V-ATPase inhibitory activity.

A Location-Inventory-Routing Problem in Forward and Reverse Logistics Network Design

Directory of Open Access Journals (Sweden)

Qunli Yuchi

2016-01-01

Full Text Available We study a new problem of location-inventory-routing in forward and reverse logistic (LIRP-FRL network design, which simultaneously integrates the location decisions of distribution centers (DCs, the inventory policies of opened DCs, and the vehicle routing decision in serving customers, in which new goods are produced and damaged goods are repaired by a manufacturer and then returned to the market to satisfy customers’ demands as new ones. Our objective is to minimize the total costs of manufacturing and remanufacturing goods, building DCs, shipping goods (new or recovered between the manufacturer and opened DCs, and distributing new or recovered goods to customers and ordering and storage costs of goods. A nonlinear integer programming model is proposed to formulate the LIRP-FRL. A new tabu search (NTS algorithm is developed to achieve near optimal solution of the problem. Numerical experiments on the benchmark instances of a simplified version of the LIRP-FRL, the capacitated location routing problem, and the randomly generated LIRP-FRL instances demonstrate the effectiveness and efficiency of the proposed NTS algorithm in problem resolution.

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.

MINOS: A simplified Pn solver for core calculation

International Nuclear Information System (INIS)

Baudron, A.M.; Lautard, J.J.

2007-01-01

This paper describes a new generation of the neutronic core solver MINOS resulting from developments done in the DESCARTES project. For performance reasons, the numerical method of the existing MINOS solver in the SAPHYR system has been reused in the new system. It is based on the mixed-dual finite element approximation of the simplified transport equation. We have extended the previous method to the treatment of unstructured geometries composed by quadrilaterals, allowing us to treat geometries where fuel pins are exactly represented. For Cartesian geometries, the solver takes into account assembly discontinuity coefficients in the simplified P n context. The solver has been rewritten in C + + programming language using an object-oriented design. Its general architecture was reconsidered in order to improve its capability of evolution and its maintainability. Moreover, the performance of the previous version has been improved mainly regarding the matrix construction time; this result improves significantly the performance of the solver in the context of industrial application requiring thermal-hydraulic feedback and depletion calculations. (authors)

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.

Green open location-routing problem considering economic and environmental costs

Directory of Open Access Journals (Sweden)

Eliana M. Toro

2016-12-01

Full Text Available This paper introduces a new bi-objective vehicle routing problem that integrates the Open Location Routing Problem (OLRP, recently presented in the literature, coupled with the growing need for fuel consumption minimization, named Green OLRP (G-OLRP. Open routing problems (ORP are known to be NP-hard problems, in which vehicles start from the set of existing depots and are not required to return to the starting depot after completing their service. The OLRP is a strategic-level problem involving the selection of one or many depots from a set of candidate locations and the planning of delivery radial routes from the selected depots to a set of customers. The concept of radial paths allows us to use a set of constraints focused on maintaining the radiality condition of the paths, which significantly simplifies the set of constraints associated with the connectivity and capacity requirements and provides a suitable alternative when compared with the elimination problem of sub-tours traditionally addressed in the literature. The emphasis in the paper will be placed on modeling rather than solution methods. The model proposed is formulated as a bi-objective problem, considering the minimization of operational costs and the minimization of environmental effects, and it is solved by using the epsilon constraint technique. The results illustrate that the proposed model is able to generate a set of trade-off solutions leading to interesting conclusions about the relationship between operational costs and environmental impact.

Improvement In MAODV Protocol Using Location Based Routing Protocol

Directory of Open Access Journals (Sweden)

Kaur Sharnjeet

2016-01-01

Full Text Available Energy saving is difficult in wireless sensor network (WSN due to limited resources. Each node in WSN is constrained by their limited battery power for their energy. The energy is reduced as the time goes off due to the packet transmission and reception. Energy management techniques are necessary to minimize the total power consumption of all the nodes in the network in order to maximize its life span. Our proposed protocol Location based routing (LBR aimed to find a path which utilizes the minimum energy to transmit the packets between the source and the destination. The required energy for the transmission and reception of data is evaluated in MATLAB. LBR is implemented on Multicast Ad hoc On Demand Distance Vector Routing Protocol (MAODV to manage the energy consumption in the transmission and reception of data. Simulation results of LBR show the energy consumption has been reduced.

Knee Kinematic Improvement After Total Knee Replacement Using a Simplified Quantitative Gait Analysis Method

Directory of Open Access Journals (Sweden)

Hassan Sarailoo

2013-10-01

Full Text Available Objectives: The aim of this study was to extract suitable spatiotemporal and kinematic parameters to determine how Total Knee Replacement (TKR alters patients’ knee kinematics during gait, using a rapid and simplified quantitative two-dimensional gait analysis procedure. Methods: Two-dimensional kinematic gait pattern of 10 participants were collected before and after the TKR surgery, using a 60 Hz camcorder in sagittal plane. Then, the kinematic parameters were extracted using the gait data. A student t-test was used to compare the group-average of spatiotemporal and peak kinematic characteristics in the sagittal plane. The knee condition was also evaluated using the Oxford Knee Score (OKS Questionnaire to ensure thateach subject was placed in the right group. Results: The results showed a significant improvement in knee flexion during stance and swing phases after TKR surgery. The walking speed was increased as a result of stride length and cadence improvement, but this increment was not statistically significant. Both post-TKR and control groups showed an increment in spatiotemporal and peak kinematic characteristics between comfortable and fast walking speeds. Discussion: The objective kinematic parameters extracted from 2D gait data were able to show significant improvements of the knee joint after TKR surgery. The patients with TKR surgery were also able to improve their knee kinematics during fast walking speed equal to the control group. These results provide a good insight into the capabilities of the presented method to evaluate knee functionality before and after TKR surgery and to define a more effective rehabilitation program.

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.

Performance Improvements and Congestion Reduction for Routing-based Synthesis for Digital Microfluidic Biochips

DEFF Research Database (Denmark)

Windh, Skyler; Phung, Calvin; Grissom, Daniel T.

2017-01-01

Routing-based synthesis for digital microfluidic biochips yields faster assay execution times compared to module-based synthesis. We show that routing-based synthesis can lead to deadlocks and livelocks in specific cases, and that dynamically detecting them and adjusting the probabilities...

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.

Improved Simplified Methods for Effective Seismic Analysis and Design of Isolated and Damped Bridges in Western and Eastern North America

Science.gov (United States)

Koval, Viacheslav

The seismic design provisions of the CSA-S6 Canadian Highway Bridge Design Code and the AASHTO LRFD Seismic Bridge Design Specifications have been developed primarily based on historical earthquake events that have occurred along the west coast of North America. For the design of seismic isolation systems, these codes include simplified analysis and design methods. The appropriateness and range of application of these methods are investigated through extensive parametric nonlinear time history analyses in this thesis. It was found that there is a need to adjust existing design guidelines to better capture the expected nonlinear response of isolated bridges. For isolated bridges located in eastern North America, new damping coefficients are proposed. The applicability limits of the code-based simplified methods have been redefined to ensure that the modified method will lead to conservative results and that a wider range of seismically isolated bridges can be covered by this method. The possibility of further improving current simplified code methods was also examined. By transforming the quantity of allocated energy into a displacement contribution, an idealized analytical solution is proposed as a new simplified design method. This method realistically reflects the effects of ground-motion and system design parameters, including the effects of a drifted oscillation center. The proposed method is therefore more appropriate than current existing simplified methods and can be applicable to isolation systems exhibiting a wider range of properties. A multi-level-hazard performance matrix has been adopted by different seismic provisions worldwide and will be incorporated into the new edition of the Canadian CSA-S6-14 Bridge Design code. However, the combined effect and optimal use of isolation and supplemental damping devices in bridges have not been fully exploited yet to achieve enhanced performance under different levels of seismic hazard. A novel Dual-Level Seismic

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

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.

A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Ligang Cui

2013-01-01

Full Text Available The capacitated vehicle routing problem (CVRP is the most classical vehicle routing problem (VRP; many solution techniques are proposed to find its better answer. In this paper, a new improved quantum evolution algorithm (IQEA with a mixed local search procedure is proposed for solving CVRPs. First, an IQEA with a double chain quantum chromosome, new quantum rotation schemes, and self-adaptive quantum Not gate is constructed to initialize and generate feasible solutions. Then, to further strengthen IQEA's searching ability, three local search procedures 1-1 exchange, 1-0 exchange, and 2-OPT, are adopted. Experiments on a small case have been conducted to analyze the sensitivity of main parameters and compare the performances of the IQEA with different local search strategies. Together with results from the testing of CVRP benchmarks, the superiorities of the proposed algorithm over the PSO, SR-1, and SR-2 have been demonstrated. At last, a profound analysis of the experimental results is presented and some suggestions on future researches are given.

Simplifying the design of microstructured optical fibre pressure sensors.

Science.gov (United States)

Osório, Jonas H; Chesini, Giancarlo; Serrão, Valdir A; Franco, Marcos A R; Cordeiro, Cristiano M B

2017-06-07

In this paper, we propose a way to simplify the design of microstructured optical fibres with high sensitivity to applied pressure. The use of a capillary fibre with an embedded core allows the exploration of the pressure-induced material birefringence due to the capillary wall displacements and the photoelastic effect. An analytical description of pressure-induced material birefringence is provided, and fibre modal characteristics are explored through numerical simulations. Moreover, a capillary fibre with an embedded core is fabricated and used to probe pressure variations. Even though the embedded-core fibre has a non-optimized structure, measurements showed a pressure sensitivity of (1.04 ± 0.01) nm/bar, which compares well with more complex, specially designed fibre geometries reported in the literature. These results demonstrate that this geometry enables a novel route towards the simplification of microstructured fibre-based pressure sensors.

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.

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

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.

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.

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

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

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.

Simplified slow anti-coincidence circuit for Compton suppression systems

International Nuclear Information System (INIS)

Al-Azmi, Darwish

2008-01-01

Slow coincidence circuits for the anti-coincidence measurements have been considered for use in Compton suppression technique. The simplified version of the slow circuit has been found to be fast enough, satisfactory and allows an easy system setup, particularly with the advantage of the automatic threshold setting of the low-level discrimination. A well-type NaI detector as the main detector surrounded by plastic guard detector has been arranged to investigate the performance of the Compton suppression spectrometer using the simplified slow circuit. The system has been tested to observe the improvement in the energy spectra for medium to high-energy gamma-ray photons from terrestrial and environmental samples

Simplified Metrics Calculation for Soft Bit Detection in DVB-T2

Directory of Open Access Journals (Sweden)

D. Perez-Calderon

2014-04-01

Full Text Available The constellation rotation and cyclic quadrature component delay (RQD technique has been adopted in the second generation terrestrial digital video broadcasting (DVB-T2 standard. It improves the system performance under severe propagation conditions, but introduces serious complexity problems in the hardware implementation of the detection process. In this paper, we present a simplified scheme that greatly reduces the complexity of the demapper by simplifying the soft bit metrics computation having a negligible overall system performance loss.

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

Sarsen Stones of Stonehenge: How and by what route were the stones transported? What is the significance of their markings?

Science.gov (United States)

Hill, P A

1961-04-21

A route via Lockeridge and the Avon Valley, involving a slide down the chalk escarpment, is postulated for the sarsen stones of Stonehenge. The transportation problem would have been greatly simplified if the stones had been relayed from point to point over snow or slush during successive winters. Markings on the stones hitherto undescribed are interpreted.

Comparative assessment of spent nuclear fuel transportation routes using risk factors and a geographic information system

International Nuclear Information System (INIS)

Toth, D.M.

1996-01-01

The assessment of potential alternative routes was simplified through the use of six comparative risk factors evaluated using detailed, route-specific data. The route and environmental attributes varied strongly with location and were developed from national, state, and local sources. The six comparative factors were risk measures of incident-free transportation radiation exposure, radiological accident population exposure, nonradiological accidents, contamination of environmental sensitive areas, environmental justice for minority populations, and environmental justice for low-income populations. An assessment of four real North-Central Florida routes provided a sample implementation of the analysis tools and risk factors. The assessment routes, consisting of common beginning and end locations, included an interstate highway, a rural highway, a mostly urban highway, and a combination interstate highway with rural bypass. This route comparative assessment study predicted that the interstate highway, despite a higher population density, greater traffic volume, and greater number of vehicular fatality accidents, would present the lowest cumulative risk. On the contrary, the rural highway route, characterized as having the lowest population density, minimal vehicle traffic volume, and the lowest percentages of minority and low-income populations, displayed the highest cumulative risk measure. Factors contributing to the high risk for the rural highway route included greater route length, higher vehicular fatality accident rates per vehicle mile traveled, and the close proximity to environmentally sensitive areas. This route comparative assessment study predicted that the interstate highway, despite a higher population density, greater traffic volume, and greater number of vehicular fatality accidents, would present the lowest cumulative risk. On the contrary, the rural highway route, characterized as having the lowest population density, minimal vehicle traffic volume

Improving catchment discharge predictions by inferring flow route contributions from a nested-scale monitoring and model setup

Science.gov (United States)

van der Velde, Y.; Rozemeijer, J. C.; de Rooij, G. H.; van Geer, F. C.; Torfs, P. J. J. F.; de Louw, P. G. B.

2011-03-01

Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for the estimation of flow route volumes and for predictions of catchment discharge. In order to relate field-site measurements to the catchment-scale an upscaling approach is introduced that assumes that scale differences in flow route fluxes originate from differences in the relationship between groundwater storage and the spatial structure of the groundwater table. This relationship is characterized by the Groundwater Depth Distribution (GDD) curve that relates spatial variation in groundwater depths to the average groundwater depth. The GDD-curve was measured for a single field site (0.009 km2) and simple process descriptions were applied to relate groundwater levels to flow route discharges. This parsimonious model could accurately describe observed storage, tube drain discharge, overland flow and groundwater flow simultaneously with Nash-Sutcliff coefficients exceeding 0.8. A probabilistic Monte Carlo approach was applied to upscale field-site measurements to catchment scales by inferring scale-specific GDD-curves from the hydrographs of two nested catchments (0.4 and 6.5 km2). The estimated contribution of tube drain effluent (a dominant source for nitrates) decreased with increasing scale from 76-79% at the field-site to 34-61% and 25-50% for both catchment scales. These results were validated by demonstrating that a model conditioned on nested-scale measurements improves simulations of nitrate loads and predictions of extreme discharges during validation periods compared to a model that was conditioned on catchment discharge only.

Effects of simplifying outreach materials for energy conservation programs that target low-income consumers

International Nuclear Information System (INIS)

Wong-Parodi, Gabrielle; Bruine de Bruin, Wändi; Canfield, Casey

2013-01-01

Critics have speculated that the limited success of energy conservation programs among low-income consumers may partly be due to recipients having insufficient literacy to understand the outreach materials. Indeed, we found outreach materials for low-income consumers to require relatively high levels of reading comprehension. We therefore improved the Flesch–Kincaid readability statistics for two outreach brochures, by using shorter words and shorter sentences to describe their content. We examined the effect of that simplification on low-income consumers′ responses. Participants from low-income communities in the greater Pittsburgh area, who varied in literacy, were randomly assigned to either original communications about energy conservation programs or our simplified versions. Our findings suggest that lowering readability statistics successfully simplified only the more straightforward brochure in our set of two, likely because its content lent itself better to simplification. Findings for this brochure showed that simplification improved understanding of its content among both low-literacy and high-literacy recipients, without adversely affecting their evaluation of the materials, or their intention to enroll in the advertised programs. We discuss strategies for improving communication materials that aim to reach out to low-income populations. - Highlights: • Brochures about energy programs for low-income consumers can be too hard to read. • We made brochures easier to read by using shorter words and shorter sentences. • Simplifying a straightforward brochure improved the understanding of all recipients. • However, simplifying a complex brochure had no effect on understanding. • We suggest strategies for improving outreach to low-income consumers

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

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

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.

Improved protein kinase C affinity through final step diversification of a simplified salicylate-derived bryostatin analog scaffold.

Science.gov (United States)

Wender, Paul A; Staveness, Daryl

2014-10-03

Bryostatin 1, in clinical trials or preclinical development for cancer, Alzheimer's disease, and a first-of-its-kind strategy for HIV/AIDS eradication, is neither readily available nor optimally suited for clinical use. In preceding work, we disclosed a new class of simplified bryostatin analogs designed for ease of access and tunable activity. Here we describe a final step diversification strategy that provides, in only 25 synthetic steps, simplified and tunable analogs with bryostatin-like PKC modulatory activities.

An Opportunistic Routing Mechanism Combined with Long-Term and Short-Term Metrics for WMN

Directory of Open Access Journals (Sweden)

Weifeng Sun

2014-01-01

Full Text Available WMN (wireless mesh network is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX.

An opportunistic routing mechanism combined with long-term and short-term metrics for WMN.

Science.gov (United States)

Sun, Weifeng; Wang, Haotian; Piao, Xianglan; Qiu, Tie

2014-01-01

WMN (wireless mesh network) is a useful wireless multihop network with tremendous research value. The routing strategy decides the performance of network and the quality of transmission. A good routing algorithm will use the whole bandwidth of network and assure the quality of service of traffic. Since the routing metric ETX (expected transmission count) does not assure good quality of wireless links, to improve the routing performance, an opportunistic routing mechanism combined with long-term and short-term metrics for WMN based on OLSR (optimized link state routing) and ETX is proposed in this paper. This mechanism always chooses the highest throughput links to improve the performance of routing over WMN and then reduces the energy consumption of mesh routers. The simulations and analyses show that the opportunistic routing mechanism is better than the mechanism with the metric of ETX.

Reliable Ant Colony Routing Algorithm for Dual-Channel Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

YongQiang Li

2018-01-01

Full Text Available For the problem of poor link reliability caused by high-speed dynamic changes and congestion owing to low network bandwidth in ad hoc networks, an ant colony routing algorithm, based on reliable path under dual-channel condition (DSAR, is proposed. First, dual-channel communication mode is used to improve network bandwidth, and a hierarchical network model is proposed to optimize the dual-layer network. Thus, we reduce network congestion and communication delay. Second, a comprehensive reliable path selection strategy is designed, and the reliable path is selected ahead of time to reduce the probability of routing restart. Finally, the ant colony algorithm is used to improve the adaptability of the routing algorithm to changes of network topology. Simulation results show that DSAR improves the reliability of routing, packet delivery, and throughput.

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

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

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.

Energy Route Multi-Objective Optimization of Wireless Power Transfer Network: An Improved Cross-Entropy Method

Directory of Open Access Journals (Sweden)

Lijuan Xiang

2017-06-01

Full Text Available This paper identifies the Wireless Power Transfer Network (WPTN as an ideal model for long-distance Wireless Power Transfer (WPT in a certain region with multiple electrical equipment. The schematic circuit and design of each power node and the process of power transmission between the two power nodes are elaborated. The Improved Cross-Entropy (ICE method is proposed as an algorithm to solve for optimal energy route. Non-dominated sorting is introduced for optimization. A demonstration of the optimization result of a 30-nodes WPTN system based on the proposed algorithm proves ICE method to be efficacious and efficiency.

Improving catchment discharge predictions by inferring flow route contributions from a nested-scale monitoring and model setup

Directory of Open Access Journals (Sweden)

Y. van der Velde

2011-03-01

Full Text Available Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for the estimation of flow route volumes and for predictions of catchment discharge. In order to relate field-site measurements to the catchment-scale an upscaling approach is introduced that assumes that scale differences in flow route fluxes originate from differences in the relationship between groundwater storage and the spatial structure of the groundwater table. This relationship is characterized by the Groundwater Depth Distribution (GDD curve that relates spatial variation in groundwater depths to the average groundwater depth. The GDD-curve was measured for a single field site (0.009 km² and simple process descriptions were applied to relate groundwater levels to flow route discharges. This parsimonious model could accurately describe observed storage, tube drain discharge, overland flow and groundwater flow simultaneously with Nash-Sutcliff coefficients exceeding 0.8. A probabilistic Monte Carlo approach was applied to upscale field-site measurements to catchment scales by inferring scale-specific GDD-curves from the hydrographs of two nested catchments (0.4 and 6.5 km². The estimated contribution of tube drain effluent (a dominant source for nitrates decreased with increasing scale from 76–79% at the field-site to 34–61% and 25–50% for both catchment scales. These results were validated by demonstrating that a model conditioned on nested-scale measurements improves simulations of nitrate loads and predictions of extreme discharges during validation periods compared to a model that was conditioned on catchment discharge only.

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.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Nadeem Javaid

2017-03-01

Full Text Available In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast, second technique is the improved Hydrocast (improved-Hydrocast, and third one is the cooperative improved Hydrocast (Co-improved Hydrocast. In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR of the received signal is not within the predefined threshold then the maximal ratio combining (MRC is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

Cooperative Opportunistic Pressure Based Routing for Underwater Wireless Sensor Networks.

Science.gov (United States)

Javaid, Nadeem; Muhammad; Sher, Arshad; Abdul, Wadood; Niaz, Iftikhar Azim; Almogren, Ahmad; Alamri, Atif

2017-03-19

In this paper, three opportunistic pressure based routing techniques for underwater wireless sensor networks (UWSNs) are proposed. The first one is the cooperative opportunistic pressure based routing protocol (Co-Hydrocast), second technique is the improved Hydrocast (improved-Hydrocast), and third one is the cooperative improved Hydrocast (Co-improved Hydrocast). In order to minimize lengthy routing paths between the source and the destination and to avoid void holes at the sparse networks, sensor nodes are deployed at different strategic locations. The deployment of sensor nodes at strategic locations assure the maximum monitoring of the network field. To conserve the energy consumption and minimize the number of hops, greedy algorithm is used to transmit data packets from the source to the destination. Moreover, the opportunistic routing is also exploited to avoid void regions by making backward transmissions to find reliable path towards the destination in the network. The relay cooperation mechanism is used for reliable data packet delivery, when signal to noise ratio (SNR) of the received signal is not within the predefined threshold then the maximal ratio combining (MRC) is used as a diversity technique to improve the SNR of the received signals at the destination. Extensive simulations validate that our schemes perform better in terms of packet delivery ratio and energy consumption than the existing technique; Hydrocast.

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.

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.

A dynamic continental runoff routing model applied to the last Northern Hemisphere deglaciation

Directory of Open Access Journals (Sweden)

H. Goelzer

2012-05-01

Full Text Available We describe and evaluate a dynamical continental runoff routing model for the Northern Hemisphere that calculates the runoff pathways in response to topographic modifications due to changes in ice thickness and isostatic adjustment. The algorithm is based on the steepest gradient method and takes as simplifying assumption that depressions are filled at all times and water drains through the lowest outlet points. It also considers changes in water storage and lake drainage in post-processing mode that become important in the presence of large ice dammed proglacial lakes. Although applicable to other scenarios as well, the model was conceived to study the routing of freshwater fluxes during the last Northern Hemisphere deglaciation. For that specific application we simulated the Northern Hemisphere ice sheets with an existing 3-D thermomechanical ice sheet model, which calculates changes in topography due to changes in ice cover and isostatic adjustment, as well as the evolution of freshwater fluxes resulting from surface ablation, iceberg calving and basal melt. The continental runoff model takes this input, calculates the drainage pathways and routes the freshwater fluxes to the surface grid points of an existing ocean model. This results in a chronology of temporally and spatially varying freshwater fluxes from the Last Glacial Maximum to the present day. We analyse the dependence of the runoff routing to grid resolution and parameters of the isostatic adjustment module of the ice sheet model.

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.

An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

Directory of Open Access Journals (Sweden)

Huanlin Liu

2014-01-01

Full Text Available Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the former K shortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

Simplified nonplanar wafer bonding for heterogeneous device integration

Science.gov (United States)

Geske, Jon; Bowers, John E.; Riley, Anton

2004-07-01

We demonstrate a simplified nonplanar wafer bonding technique for heterogeneous device integration. The improved technique can be used to laterally integrate dissimilar semiconductor device structures on a lattice-mismatched substrate. Using the technique, two different InP-based vertical-cavity surface-emitting laser active regions have been integrated onto GaAs without compromising the quality of the photoluminescence. Experimental and numerical simulation results are presented.

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

Standard Versus Simplified Consent Materials for Biobank Participation: Differences in Patient Knowledge and Trial Accrual.

Science.gov (United States)

Garrett, Sarah B; Murphy, Marie; Wiley, James; Dohan, Daniel

2017-12-01

Replacing standard consent materials with simplified materials is a promising intervention to improve patient comprehension, but there is little evidence on its real-world implementation. We employed a sequential two-arm design to compare the effect of standard versus simplified consent materials on potential donors' understanding of biobank processes and their accrual to an active biobanking program. Participants were female patients of a California breast health clinic. Subjects from the simplified arm answered more items correctly ( p = .064), reported "don't know" for fewer items ( p = .077), and consented to donate to the biobank at higher rates ( p = .025) than those from the standard arm. Replacing an extant consent form with a simplified version is feasible and may benefit patient comprehension and study accrual.

Improvement of routes and production of CaSO4-based dosimeters with unusual doping

International Nuclear Information System (INIS)

Junot, Danilo Oliveira

2017-01-01

The widespread use of ionizing radiation in medicine and industry, associated with the known risks that this type of radiation can cause, has motivated the search for new radiation detectors, seeking improvements in the dosimetric characteristics and in the cost of production in comparison with commercial dosimeters disseminated. The motivation of this work is, therefore, to produce new thermoluminescent detectors through improved routes. Unusual elements in CaSO 4 matrix doping, such as terbium (Tb) and ytterbium (Yb), were used as dopants in this matrix, as well as the europium (Eu), the thulium (Tm) and the silver (Ag), resulting in samples of CaSO 4 :Eu,Tb, CaSO 4 :Tb,Yb, CaSO 4 :Tm,Ag and CaSO 4 :Eu,Ag that were prepared by means of an adaptation of the method developed by Yamashita (1971). The route of synthesis is based on the mixture of calcium carbonate (CaCO 3 ) and dopant oxide (except for silver, incorporated in the form of metallic nanoparticles) in a solution of sulfuric acid. The mixture is heated until all the acid evaporates and only the powder of the material remains. In this route, the sulfuric acid is collected and can be reused. The phosphors produced were characterized by X-ray diffraction and radioluminescence techniques. The silver particles, produced by the polyol method, were characterized by scanning electron microscopy. Composites were obtained from the addition of Teflon to the phosphors. The thermoluminescence (TL) and the optically stimulated luminescence (OSL) of the new materials produced were investigated. Thermoluminescent characteristics such as sensitivity, linearity, reproducibility, minimum detectable dose, kinetic order and fading were evaluated and discussed. The CaSO 4 :Tb,Eu composites showed TL glow curves with peaks at temperatures of 170 °C, 270 °C and 340 °C. The CaSO 4 :Tb,Yb composites presented TL glow curves with peaks at temperatures of 90 °C, 160 °C, 240 °C and 340 °C. CaSO 4 :Tm showed peaks at

Evaluation of svr: a wireless sensor network routing protocol

International Nuclear Information System (INIS)

Baloch, J.; Khanzada, T.J.S.

2014-01-01

The advancement in technology has made it possible to create small in size, low cost sensor nodes. However, the small size and low cost of such nodes comesat at price that is, reduced processing power, low memory and significantly small battery energy storage. WSNs (Wireless Sensor Networks) are inherently ad hoc in nature and are assumed to work in the toughest terrain. The network lifetime plays a pivotal role in a wireless sensor network. A long network lifetime, could be achieved by either making significant changes in these low cost devices, which is not a feasible solution or by improving the means of communication throughout the network. The communication in such networks could be improved by employing energy efficient routing protocols, to route the data throughout the network. In this paper the SVR (Spatial Vector Routing) protocol is compared against the most common WSN routing protocols, and from the results it could be inferred that the SVR protocol out performs its counterparts. The protocol provides an energy efficient means of communication in the network. (author)

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

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems.

Science.gov (United States)

Yu, Hao; Solvang, Wei Deng

2016-05-31

Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems

Directory of Open Access Journals (Sweden)

Hao Yu

2016-05-01

Full Text Available Hazardous waste location-routing problems are of importance due to the potential risk for nearby residents and the environment. In this paper, an improved mathematical formulation is developed based upon a multi-objective mixed integer programming approach. The model aims at assisting decision makers in selecting locations for different facilities including treatment plants, recycling plants and disposal sites, providing appropriate technologies for hazardous waste treatment, and routing transportation. In the model, two critical factors are taken into account: system operating costs and risk imposed on local residents, and a compensation factor is introduced to the risk objective function in order to account for the fact that the risk level imposed by one type of hazardous waste or treatment technology may significantly vary from that of other types. Besides, the policy instruments for promoting waste recycling are considered, and their influence on the costs and risk of hazardous waste management is also discussed. The model is coded and calculated in Lingo optimization solver, and the augmented ε-constraint method is employed to generate the Pareto optimal curve of the multi-objective optimization problem. The trade-off between different objectives is illustrated in the numerical experiment.

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

Simplified Clinical Tools and Educational Outreach for Health Workers

International Development Research Centre (IDRC) Digital Library (Canada)

Developed in South Africa, simplified tools and training have been shown to improve outcomes for HIV, tuberculosis (TB) and primary care patients, and to enhance staff ... Les conclusions d'un programme financé par le CRDI au premier plan de la conférence annuelle de l'Institut d'étude du développement international de ...

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.

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.

[Simplified laparoscopic gastric bypass. Initial experience].

Science.gov (United States)

Hernández-Miguelena, Luis; Maldonado-Vázquez, Angélica; Cortes-Romano, Pablo; Ríos-Cruz, Daniel; Marín-Domínguez, Raúl; Castillo-González, Armando

2014-01-01

Obesity surgery includes various gastrointestinal procedures. Roux-en-Y gastric bypass is the prototype of mixed procedures being the most practiced worldwide. A similar and novel technique has been adopted by Dr. Almino Cardoso Ramos and Dr. Manoel Galvao called "simplified bypass," which has been accepted due to the greater ease and very similar results to the conventional technique. The aim of this study is to describe the results of the simplified gastric bypass for treatment of morbid obesity in our institution. We performed a descriptive, retrospective study of all patients undergoing simplified gastric bypass from January 2008 to July 2012 in the obesity clinic of a private hospital in Mexico City. A total of 90 patients diagnosed with morbid obesity underwent simplified gastric bypass. Complications occurred in 10% of patients; these were more frequent bleeding and internal hernia. Mortality in the study period was 0%. The average weight loss at 12 months was 72.7%. Simplified gastric bypass surgery is safe with good mid-term results and a loss of adequate weight in 71% of cases.

The Fast Simulation of Scattering Characteristics from a Simplified Time Varying Sea Surface

Directory of Open Access Journals (Sweden)

Yiwen Wei

2015-01-01

Full Text Available This paper aims at applying a simplified sea surface model into the physical optics (PO method to accelerate the scattering calculation from 1D time varying sea surface. To reduce the number of the segments and make further improvement on the efficiency of PO method, a simplified sea surface is proposed. In this simplified sea surface, the geometry of long waves is locally approximated by tilted facets that are much longer than the electromagnetic wavelength. The capillary waves are considered to be sinusoidal line superimposing on the long waves. The wavenumber of the sinusoidal waves is supposed to satisfy the resonant condition of Bragg waves which is dominant in all the scattered short wave components. Since the capillary wave is periodical within one facet, an analytical integration of the PO term can be performed. The backscattering coefficient obtained from a simplified sea surface model agrees well with that obtained from a realistic sea surface. The Doppler shifts and width also agree well with the realistic model since the capillary waves are taken into consideration. The good agreements indicate that the simplified model is reasonable and valid in predicting both the scattering coefficients and the Doppler spectra.

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

The Northern Sea Routes and Korea's Trade with Europe: Implications for Korea's Shipping Industry

Directory of Open Access Journals (Sweden)

Yeong-Seok Ha

2014-12-01

Full Text Available Melting Arctic waters have brought about global opportunities and challenges. One distinctive opportunity presented by the increasingly ice-free Arctic Ocean is its availability for shipping cargos between Europe and Asia. In adopting highly simplified assumptions of the Northern Sea Route (NSR being navigable and economical enough for shipping and NSR completely substituting for the incumbent Suez Canal route, this paper analyzes the maximum number of voyages possible for the transshipment of container cargo throughput for Korea's trade with Europe, particularly with Europe-17 and Europe-7. Our analysis shows the number of voyages range from over 2,900 to as little as 237 for Europe-17, depending on vessel sizes, when NSR is available for the whole year. With NSR opening for three months, the corresponding figures vary between 727 and 60 for Europe-17, and the figures for Europe-7 are between 2,725 and 222 and 682 and 56 voyages, respectively.

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.

Analysis of Wind Turbine Simulation Models: Assessment of Simplified versus Complete Methodologies: Preprint

Energy Technology Data Exchange (ETDEWEB)

Honrubia-Escribano, A.; Jimenez-Buendia, F.; Molina-Garcia, A.; Fuentes-Moreno, J. A.; Muljadi, Eduard; Gomez-Lazaro, E.

2015-09-14

This paper presents the current status of simplified wind turbine models used for power system stability analysis. This work is based on the ongoing work being developed in IEC 61400-27. This international standard, for which a technical committee was convened in October 2009, is focused on defining generic (also known as simplified) simulation models for both wind turbines and wind power plants. The results of the paper provide an improved understanding of the usability of generic models to conduct power system simulations.

3.6 simplified methods for design

International Nuclear Information System (INIS)

Nickell, R.E.; Yahr, G.T.

1981-01-01

Simplified design analysis methods for elevated temperature construction are classified and reviewed. Because the major impetus for developing elevated temperature design methodology during the past ten years has been the LMFBR program, considerable emphasis is placed upon results from this source. The operating characteristics of the LMFBR are such that cycles of severe transient thermal stresses can be interspersed with normal elevated temperature operational periods of significant duration, leading to a combination of plastic and creep deformation. The various simplified methods are organized into two general categories, depending upon whether it is the material, or constitutive, model that is reduced, or the geometric modeling that is simplified. Because the elastic representation of material behavior is so prevalent, an entire section is devoted to elastic analysis methods. Finally, the validation of the simplified procedures is discussed

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

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

Directory of Open Access Journals (Sweden)

Won-Suk Kim

2015-01-01

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

Application of Game Theory Approaches in Routing Protocols for Wireless Networks

Science.gov (United States)

Javidi, Mohammad M.; Aliahmadipour, Laya

2011-09-01

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

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

Rectifier Current Control for an LLC Resonant Converter Based on a Simplified Linearized Model

OpenAIRE

Zhijian Fang; Junhua Wang; Shanxu Duan; Liangle Xiao; Guozheng Hu; Qisheng Liu

2018-01-01

In this paper, a rectifier current control for an LLC resonant converter is proposed, based on a simplified, two-order, linearized model that adds a rectifier current feedback inner loop to improve dynamic performance. Compared to the traditional large-signal model with seven resonant states, this paper utilizes a rectifier current state to represent the characteristics of the resonant states, simplifying the LLC resonant model from seven orders to two orders. Then, the rectifier current feed...

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

Rectifier Current Control for an LLC Resonant Converter Based on a Simplified Linearized Model

Directory of Open Access Journals (Sweden)

Zhijian Fang

2018-03-01

Full Text Available In this paper, a rectifier current control for an LLC resonant converter is proposed, based on a simplified, two-order, linearized model that adds a rectifier current feedback inner loop to improve dynamic performance. Compared to the traditional large-signal model with seven resonant states, this paper utilizes a rectifier current state to represent the characteristics of the resonant states, simplifying the LLC resonant model from seven orders to two orders. Then, the rectifier current feedback inner loop is proposed to increase the control system damping, improving dynamic performance. The modeling and design methodology for the LLC resonant converter are also presented in this paper. A frequency analysis is conducted to verify the accuracy of the simplified model. Finally, a 200 W LLC resonant converter prototype is built to verify the effectiveness of the proposed control strategy. Compared to a traditional single-loop controller, the settling time and voltage droop were reduced from 10.8 ms to 8.6 ms and from 6.8 V to 4.8 V, respectively, using the proposed control strategy.

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.

Cognitive Routing in Software-Defined Underwater Acoustic Networks

Directory of Open Access Journals (Sweden)

Huma Ghafoor

2017-12-01

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

Simplified Models for LHC New Physics Searches

CERN Document Server

Alves, Daniele; Arora, Sanjay; Bai, Yang; Baumgart, Matthew; Berger, Joshua; Buckley, Matthew; Butler, Bart; Chang, Spencer; Cheng, Hsin-Chia; Cheung, Clifford; Chivukula, R.Sekhar; Cho, Won Sang; Cotta, Randy; D'Alfonso, Mariarosaria; El Hedri, Sonia; Essig, Rouven; Evans, Jared A.; Fitzpatrick, Liam; Fox, Patrick; Franceschini, Roberto; Freitas, Ayres; Gainer, James S.; Gershtein, Yuri; Gray, Richard; Gregoire, Thomas; Gripaios, Ben; Gunion, Jack; Han, Tao; Haas, Andy; Hansson, Per; Hewett, JoAnne; Hits, Dmitry; Hubisz, Jay; Izaguirre, Eder; Kaplan, Jared; Katz, Emanuel; Kilic, Can; Kim, Hyung-Do; Kitano, Ryuichiro; Koay, Sue Ann; Ko, Pyungwon; Krohn, David; Kuflik, Eric; Lewis, Ian; Lisanti, Mariangela; Liu, Tao; Liu, Zhen; Lu, Ran; Luty, Markus; Meade, Patrick; Morrissey, David; Mrenna, Stephen; Nojiri, Mihoko; Okui, Takemichi; Padhi, Sanjay; Papucci, Michele; Park, Michael; Park, Myeonghun; Perelstein, Maxim; Peskin, Michael; Phalen, Daniel; Rehermann, Keith; Rentala, Vikram; Roy, Tuhin; Ruderman, Joshua T.; Sanz, Veronica; Schmaltz, Martin; Schnetzer, Stephen; Schuster, Philip; Schwaller, Pedro; Schwartz, Matthew D.; Schwartzman, Ariel; Shao, Jing; Shelton, Jessie; Shih, David; Shu, Jing; Silverstein, Daniel; Simmons, Elizabeth; Somalwar, Sunil; Spannowsky, Michael; Spethmann, Christian; Strassler, Matthew; Su, Shufang; Tait, Tim; Thomas, Brooks; Thomas, Scott; Toro, Natalia; Volansky, Tomer; Wacker, Jay; Waltenberger, Wolfgang; Yavin, Itay; Yu, Felix; Zhao, Yue; Zurek, Kathryn

2012-01-01

This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the "Topologies for Early LHC Searches" workshop, held at SLAC in September of 2010, the purpose of which was to develop a...

Node Load Balance Multi-flow Opportunistic Routing in Wireless Mesh Networks

Directory of Open Access Journals (Sweden)

Wang Tao

2014-04-01

Full Text Available Opportunistic routing (OR has been proposed to improve the performance of wireless networks by exploiting the multi-user diversity and broadcast nature of the wireless medium. It involves multiple candidate forwarders to relay packets every hop. The existing OR doesn’t take account of the traffic load and load balance, therefore some nodes may be overloaded while the others may not, leading to network performance decline. In this paper, we focus on opportunities routing selection with node load balance which is described as a convex optimization problem. To solve the problem, by combining primal-dual and sub-gradient methods, a fully distributed Node load balance Multi-flow Opportunistic Routing algorithm (NMOR is proposed. With node load balance constraint, NMOR allocates the flow rate iteratively and the rate allocation decides the candidate forwarder selection of opportunities routing. The simulation results show that NMOR algorithm improves 100 %, 62 % of the aggregative throughput than ETX and EAX, respectively.

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

Probabilistic Routing Based on Two-Hop Information in Delay/Disruption Tolerant Networks

Directory of Open Access Journals (Sweden)

Xu Wang

2015-01-01

Full Text Available We investigate an opportunistic routing protocol in delay/disruption tolerant networks (DTNs where the end-to-end path between source and destination nodes may not exist for most of the time. Probabilistic routing protocol using history of encounters and transitivity (PRoPHET is an efficient history-based routing protocol specifically proposed for DTNs, which only utilizes the delivery predictability of one-hop neighbors to make a decision for message forwarding. In order to further improve the message delivery rate and to reduce the average overhead of PRoPHET, in this paper we propose an improved probabilistic routing algorithm (IPRA, where the history information of contacts for the immediate encounter and two-hop neighbors has been jointly used to make an informed decision for message forwarding. Based on the Opportunistic Networking Environment (ONE simulator, the performance of IPRA has been evaluated via extensive simulations. The results show that IPRA can significantly improve the average delivery rate while achieving a better or comparable performance with respect to average overhead, average delay, and total energy consumption compared with the existing algorithms.

DESIGN OF ENERGY EFFICIENT ROUTING ALGORITHM FOR WIRELESS SENSOR NETWORK (WSN) USING PASCAL GRAPH

OpenAIRE

Deepali Panwar; Subhrendu Guha Neogi

2013-01-01

Development of energy efficient Wireless Sensor Network (WSN) routing protocol is nowadays main area of interest amongst researchers. This research is an effort in designing energy efficient Wireless Sensor Network (WSN) routing protocol under certain parameters consideration. Research report discusses various existing WSN routing protocols and propose a new WSN energy efficient routing protocol. Results show a significant improvement in life cycle of the nodes and enhancement ...

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.

Optimal Routing and Scheduling of Charge for Electric Vehicles: Case Study

OpenAIRE

Barco, John; Guerra, Andres; Muñoz, Luis; Quijano, Nicanor

2013-01-01

In Colombia, there is an increasing interest about improving public transportation. One of the proposed strategies in that way is the use battery electric vehicles (BEVs). One of the new challenges is the BEVs routing problem, which is subjected to the traditional issues of the routing problems, and must also consider the particularities of autonomy, charge and battery degradation of the BEVs. In this work, a scheme that coordinates the routing, scheduling of charge and operating costs of BEV...

Quantum routing of single optical photons with a superconducting flux qubit

Science.gov (United States)

Xia, Keyu; Jelezko, Fedor; Twamley, Jason

2018-05-01

Interconnecting optical photons with superconducting circuits is a challenging problem but essential for building long-range superconducting quantum networks. We propose a hybrid quantum interface between the microwave and optical domains where the propagation of a single-photon pulse along a nanowaveguide is controlled in a coherent way by tuning the electromagnetically induced transparency window with the quantum state of a flux qubit mediated by the spin in a nanodiamond. The qubit can route a single-photon pulse using the nanodiamond into a quantum superposition of paths without the aid of an optical cavity—simplifying the setup. By preparing the flux qubit in a superposition state our cavityless scheme creates a hybrid state-path entanglement between a flying single optical photon and a static superconducting qubit.

Efficient priority queueing routing strategy on networks of mobile agents

Science.gov (United States)

Wu, Gan-Hua; Yang, Hui-Jie; Pan, Jia-Hui

2018-03-01

As a consequence of their practical implications for communications networks, traffic dynamics on complex networks have recently captivated researchers. Previous routing strategies for improving transport efficiency have paid little attention to the orders in which the packets should be forwarded, just simply used first-in-first-out queue discipline. Here, we apply a priority queuing discipline and propose a shortest-distance-first routing strategy on networks of mobile agents. Numerical experiments reveal that the proposed scheme remarkably improves both the network throughput and the packet arrival rate and reduces both the average traveling time and the rate of waiting time to traveling time. Moreover, we find that the network capacity increases with an increase in both the communication radius and the number of agents. Our work may be helpful for the design of routing strategies on networks of mobile agents.

An improved simplified model predictive control algorithm and its application to a continuous fermenter

Directory of Open Access Journals (Sweden)

W. H. Kwong

2000-06-01

Full Text Available The development of a new simplified model predictive control algorithm has been proposed in this work. The algorithm is developed within the framework of internal model control, and it is easy to understanding and implement. Simulation results for a continuous fermenter, which show that the proposed control algorithm is robust for moderate variations in plant parameters, are presented. The algorithm shows a good performance for setpoint tracking.

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

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N.

2015-01-01

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

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

Science.gov (United States)

Palanisamy, Thirumoorthy; Krishnasamy, Karthikeyan N

2015-01-01

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

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.

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.

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

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.

Congestion control and routing over satellite networks

Science.gov (United States)

Cao, Jinhua

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

Robust On-Demand Multipath Routing with Dynamic Path Upgrade for Delay-Sensitive Data over Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Sunil Kumar

2013-01-01

Full Text Available Node mobility in mobile ad hoc networks (MANETs causes frequent route breakages and intermittent link stability. In this paper, we introduce a robust routing scheme, known as ad hoc on-demand multipath distance vector with dynamic path update (AOMDV-DPU, for delay-sensitive data transmission over MANET. The proposed scheme improves the AOMDV scheme by incorporating the following features: (i a routing metric based on the combination of minimum hops and received signal strength indicator (RSSI for discovery of reliable routes; (ii a local path update mechanism which strengthens the route, reduces the route breakage frequency, and increases the route longevity; (iii a keep alive mechanism for secondary route maintenance which enables smooth switching between routes and reduces the route discovery frequency; (iv a packet salvaging scheme to improve packet delivery in the event of a route breakage; and (v low HELLO packet overhead. The simulations are carried out in ns-2 for varying node speeds, number of sources, and traffic load conditions. Our AOMDV-DPU scheme achieves significantly higher throughput, lower delay, routing overhead, and route discovery frequency and latency compared to AOMDV. For H.264 compressed video traffic, AOMDV-DPU scheme achieves 3 dB or higher PSNR gain over AOMDV at both low and high node speeds.

Improving biobank consent comprehension: a national randomized survey to assess the effect of a simplified form and review/retest intervention

OpenAIRE

Beskow, Laura M.; Lin, Li; Dombeck, Carrie B.; Gao, Emily; Weinfurt, Kevin P.

2016-01-01

Purpose: To determine the individual and combined effects of a simplified form and a review/retest intervention on biobanking consent comprehension. Methods: We conducted a national online survey in which participants were randomized within four educational strata to review a simplified or traditional consent form. Participants then completed a comprehension quiz; for each item answered incorrectly, they reviewed the corresponding consent form section and answered another quiz item on that to...

Reliable Rescue Routing Optimization for Urban Emergency Logistics under Travel Time Uncertainty

Directory of Open Access Journals (Sweden)

Qiuping Li

2018-02-01

Full Text Available The reliability of rescue routes is critical for urban emergency logistics during disasters. However, studies on reliable rescue routing under stochastic networks are still rare. This paper proposes a multiobjective rescue routing model for urban emergency logistics under travel time reliability. A hybrid metaheuristic integrating ant colony optimization (ACO and tabu search (TS was designed to solve the model. An experiment optimizing rescue routing plans under a real urban storm event, was carried out to validate the proposed model. The experimental results showed how our approach can improve rescue efficiency with high travel time reliability.

The development of a practical pipe auto-routing system in a shipbuilding CAD environment using network optimization

Science.gov (United States)

Kim, Shin-Hyung; Ruy, Won-Sun; Jang, Beom Seon

2013-09-01

An automatic pipe routing system is proposed and implemented. Generally, the pipe routing design as a part of the shipbuilding process requires a considerable number of man hours due to the complexity which comes from physical and operational constraints and the crucial influence on outfitting construction productivity. Therefore, the automation of pipe routing design operations and processes has always been one of the most important goals for improvements in shipbuilding design. The proposed system is applied to a pipe routing design in the engine room space of a commercial ship. The effectiveness of this system is verified as a reasonable form of support for pipe routing design jobs. The automatic routing result of this system can serve as a good basis model in the initial stages of pipe routing design, allowing the designer to reduce their design lead time significantly. As a result, the design productivity overall can be improved with this automatic pipe routing system

The development of a practical pipe auto-routing system in a shipbuilding CAD environment using network optimization

Directory of Open Access Journals (Sweden)

Shin-Hyung Kim

2013-09-01

Full Text Available An automatic pipe routing system is proposed and implemented. Generally, the pipe routing design as a part of the shipbuilding process requires a considerable number of man hours due to the complexity which comes from physical and operational constraints and the crucial influence on outfitting construction productivity. Therefore, the automation of pipe routing design operations and processes has always been one of the most important goals for improvements in shipbuilding design. The proposed system is applied to a pipe routing design in the engine room space of a commercial ship. The effectiveness of this system is verified as a reasonable form of support for pipe routing design jobs. The automatic routing result of this system can serve as a good basis model in the initial stages of pipe routing design, allowing the designer to reduce their design lead time significantly. As a result, the design productivity overall can be improved with this automatic pipe routing system.

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.

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.

Influencing Factors and Simplified Model of Film Hole Irrigation

Directory of Open Access Journals (Sweden)

Yi-Bo Li

2017-07-01

Full Text Available Film hole irrigation is an advanced low-cost and high-efficiency irrigation method, which can improve water conservation and water use efficiency. Given its various advantages and potential applications, we conducted a laboratory study to investigate the effects of soil texture, bulk density, initial soil moisture, irrigation depth, opening ratio (ρ, film hole diameter (D, and spacing on cumulative infiltration using SWMS-2D. We then proposed a simplified model based on the Kostiakov model for infiltration estimation. Error analyses indicated SWMS-2D to be suitable for infiltration simulation of film hole irrigation. Additional SWMS-2D-based investigations indicated that, for a certain soil, initial soil moisture and irrigation depth had the weakest effects on cumulative infiltration, whereas ρ and D had the strongest effects on cumulative infiltration. A simplified model with ρ and D was further established, and its use was then expanded to different soils. Verification based on seven soil types indicated that the established simplified double-factor model effectively estimates cumulative infiltration for film hole irrigation, with a small mean average error of 0.141–2.299 mm, a root mean square error of 0.177–2.722 mm, a percent bias of −2.131–1.479%, and a large Nash–Sutcliffe coefficient that is close to 1.0.

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

Directory of Open Access Journals (Sweden)

Thirumoorthy Palanisamy

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

Performansi Algoritma CODEQ dalam Penyelesaian Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Annisa Kesy Garside

2014-01-01

Full Text Available Genetic Algorithm, Tabu Search, Simulated Annealing, and Ant Colony Optimization showed a good performance in solving vehicle routing problem. However, the generated solution of those algorithms was changeable regarding on the input parameter of each algorithm. CODEQ is a new, parameter free meta-heuristic algorithm that had been successfully used to solve constrained optimization problems, integer programming, and feed-forward neural network. The purpose of this research are improving CODEQ algorithm to solve vehicle routing problem and testing the performance of the improved algorithm. CODEQ algorithm is started with population initiation as initial solution, generated of mutant vector for each parent in every iteration, replacement of parent by mutant when fitness function value of mutant is better than parent’s, generated of new vector for each iteration based on opposition value or chaos principle, replacement of worst solution by new vector when fitness function value of new vector is better, iteration ceasing when stooping criterion is achieved, and sub-tour determination based on vehicle capacity constraint. The result showed that the average deviation of the best-known and the best-test value is 6.35%. Therefore, CODEQ algorithm is good in solving vehicle routing problem.

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

Simplified Models for LHC New Physics Searches

International Nuclear Information System (INIS)

Alves, Daniele; Arkani-Hamed, Nima; Arora, Sanjay; Bai, Yang; Baumgart, Matthew; Berger, Joshua; Butler, Bart; Chang, Spencer; Cheng, Hsin-Chia; Cheung, Clifford; Chivukula, R. Sekhar; Cho, Won Sang; Cotta, Randy; D'Alfonso, Mariarosaria; El Hedri, Sonia; Essig, Rouven; Fitzpatrick, Liam; Fox, Patrick; Franceschini, Roberto

2012-01-01

This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the 'Topologies for Early LHC Searches' workshop, held at SLAC in September of 2010, the purpose of which was to develop a set of representative models that can be used to cover all relevant phase space in experimental searches. Particular emphasis is placed on searches relevant for the first ∼ 50-500 pb -1 of data and those motivated by supersymmetric models. This note largely summarizes material posted at http://lhcnewphysics.org/, which includes simplified model definitions, Monte Carlo material, and supporting contacts within the theory community. We also comment on future developments that may be useful as more data is gathered and analyzed by the experiments.

Simplified Models for LHC New Physics Searches

Energy Technology Data Exchange (ETDEWEB)

Alves, Daniele; /SLAC; Arkani-Hamed, Nima; /Princeton, Inst. Advanced Study; Arora, Sanjay; /Rutgers U., Piscataway; Bai, Yang; /SLAC; Baumgart, Matthew; /Johns Hopkins U.; Berger, Joshua; /Cornell U., Phys. Dept.; Buckley, Matthew; /Fermilab; Butler, Bart; /SLAC; Chang, Spencer; /Oregon U. /UC, Davis; Cheng, Hsin-Chia; /UC, Davis; Cheung, Clifford; /UC, Berkeley; Chivukula, R.Sekhar; /Michigan State U.; Cho, Won Sang; /Tokyo U.; Cotta, Randy; /SLAC; D' Alfonso, Mariarosaria; /UC, Santa Barbara; El Hedri, Sonia; /SLAC; Essig, Rouven, (ed.); /SLAC; Evans, Jared A.; /UC, Davis; Fitzpatrick, Liam; /Boston U.; Fox, Patrick; /Fermilab; Franceschini, Roberto; /LPHE, Lausanne /Pittsburgh U. /Argonne /Northwestern U. /Rutgers U., Piscataway /Rutgers U., Piscataway /Carleton U. /CERN /UC, Davis /Wisconsin U., Madison /SLAC /SLAC /SLAC /Rutgers U., Piscataway /Syracuse U. /SLAC /SLAC /Boston U. /Rutgers U., Piscataway /Seoul Natl. U. /Tohoku U. /UC, Santa Barbara /Korea Inst. Advanced Study, Seoul /Harvard U., Phys. Dept. /Michigan U. /Wisconsin U., Madison /Princeton U. /UC, Santa Barbara /Wisconsin U., Madison /Michigan U. /UC, Davis /SUNY, Stony Brook /TRIUMF; /more authors..

2012-06-01

This document proposes a collection of simplified models relevant to the design of new-physics searches at the LHC and the characterization of their results. Both ATLAS and CMS have already presented some results in terms of simplified models, and we encourage them to continue and expand this effort, which supplements both signature-based results and benchmark model interpretations. A simplified model is defined by an effective Lagrangian describing the interactions of a small number of new particles. Simplified models can equally well be described by a small number of masses and cross-sections. These parameters are directly related to collider physics observables, making simplified models a particularly effective framework for evaluating searches and a useful starting point for characterizing positive signals of new physics. This document serves as an official summary of the results from the 'Topologies for Early LHC Searches' workshop, held at SLAC in September of 2010, the purpose of which was to develop a set of representative models that can be used to cover all relevant phase space in experimental searches. Particular emphasis is placed on searches relevant for the first {approx} 50-500 pb{sup -1} of data and those motivated by supersymmetric models. This note largely summarizes material posted at http://lhcnewphysics.org/, which includes simplified model definitions, Monte Carlo material, and supporting contacts within the theory community. We also comment on future developments that may be useful as more data is gathered and analyzed by the experiments.

Simplified hydraulic model of French vertical-flow constructed wetlands.

Science.gov (United States)

Arias, Luis; Bertrand-Krajewski, Jean-Luc; Molle, Pascal

2014-01-01

Designing vertical-flow constructed wetlands (VFCWs) to treat both rain events and dry weather flow is a complex task due to the stochastic nature of rain events. Dynamic models can help to improve design, but they usually prove difficult to handle for designers. This study focuses on the development of a simplified hydraulic model of French VFCWs using an empirical infiltration coefficient--infiltration capacity parameter (ICP). The model was fitted using 60-second-step data collected on two experimental French VFCW systems and compared with Hydrus 1D software. The model revealed a season-by-season evolution of the ICP that could be explained by the mechanical role of reeds. This simplified model makes it possible to define time-course shifts in ponding time and outlet flows. As ponding time hinders oxygen renewal, thus impacting nitrification and organic matter degradation, ponding time limits can be used to fix a reliable design when treating both dry and rain events.

Boundary-layer transition prediction using a simplified correlation-based model

Directory of Open Access Journals (Sweden)

Xia Chenchao

2016-02-01

Full Text Available This paper describes a simplified transition model based on the recently developed correlation-based γ-Reθt transition model. The transport equation of transition momentum thickness Reynolds number is eliminated for simplicity, and new transition length function and critical Reynolds number correlation are proposed. The new model is implemented into an in-house computational fluid dynamics (CFD code and validated for low and high-speed flow cases, including the zero pressure flat plate, airfoils, hypersonic flat plate and double wedge. Comparisons between the simulation results and experimental data show that the boundary-layer transition phenomena can be reasonably illustrated by the new model, which gives rise to significant improvements over the fully laminar and fully turbulent results. Moreover, the new model has comparable features of accuracy and applicability when compared with the original γ-Reθt model. In the meantime, the newly proposed model takes only one transport equation of intermittency factor and requires fewer correlations, which simplifies the original model greatly. Further studies, especially on separation-induced transition flows, are required for the improvement of the new model.

Simplified Stability Criteria for Delayed Neutral Systems

Directory of Open Access Journals (Sweden)

Xinghua Zhang

2014-01-01

Full Text Available For a class of linear time-invariant neutral systems with neutral and discrete constant delays, several existing asymptotic stability criteria in the form of linear matrix inequalities (LMIs are simplified by using matrix analysis techniques. Compared with the original stability criteria, the simplified ones include fewer LMI variables, which can obviously reduce computational complexity. Simultaneously, it is theoretically shown that the simplified stability criteria and original ones are equivalent; that is, they have the same conservativeness. Finally, a numerical example is employed to verify the theoretic results investigated in this paper.

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

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.

A simplified technique for shakedown limit load determination

International Nuclear Information System (INIS)

Abdalla, Hany F.; Megahed, Mohammad M.; Younan, Maher Y.A.

2007-01-01

In this paper, a simplified technique is presented to determine the shakedown limit load of a structure using the finite element method. The simplified technique determines the shakedown limit load without performing lengthy time consuming full elastic-plastic cyclic loading simulations or conventional iterative elastic techniques. Instead, the shakedown limit load is determined by performing two analyses namely: an elastic analysis and an elastic-plastic analysis. By extracting the results of the two analyses, the shakedown limit load is determined through the calculation of the residual stresses developed within the structure. The simplified technique is applied and verified using two bench mark shakedown problems namely: the two-bar structure subjected to constant axial force and cyclic thermal loading, and the Bree cylinder subjected to constant internal pressure and cyclic high temperature variation across its wall. The results of the simplified technique showed very good correlation with the, analytically determined, Bree diagrams of both structures. In order to gain confidence in the simplified technique, the shakedown limit loads output by the simplified technique are used to perform full elastic-plastic cyclic loading simulations to check for shakedown behavior of both structures

Simplified design of filter circuits

CERN Document Server

Lenk, John

1999-01-01

Simplified Design of Filter Circuits, the eighth book in this popular series, is a step-by-step guide to designing filters using off-the-shelf ICs. The book starts with the basic operating principles of filters and common applications, then moves on to describe how to design circuits by using and modifying chips available on the market today. Lenk's emphasis is on practical, simplified approaches to solving design problems.Contains practical designs using off-the-shelf ICsStraightforward, no-nonsense approachHighly illustrated with manufacturer's data sheets

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

Science.gov (United States)

Al-Nahari, Abdulaziz; Mohamad, Mohd Murtadha

2016-01-01

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

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.

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.

An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions

Directory of Open Access Journals (Sweden)

Liyang Xiao

2018-03-01

Full Text Available Many government agencies and business organizations have realized that it is necessary to consider not only the economic cost but also the road transport emissions when they determine the transport policies and operations. In this study, a patient transportation problem with the aim of reducing transport emissions has been formulated by implementing CVRP model. In order to determine the routes of patient transportation with optimized emissions for targeted hospital, an improved Cuckoo Search (ICS algorithm is proposed. In this study, a ‘split’ procedure has been implemented to simplify the individual’s representation. A new category of cuckoos has been introduced to improve the ICS’s search ability. Two heuristics have been applied to improve the quality of initial population. A local search mechanism has been embedded in the search procedure to improve the quality of solutions obtained at the end of each iteration. The computational results were encouraging and demonstrated the effectiveness of the proposed solution method.

Route 6, Section Pristina – Skopje

OpenAIRE

, F. Isufi; , N. Kelmendi; , F. Humolli; , S. Bulliqi

2016-01-01

Republic of Kosovo in the last 3-4 years has improved the road infrastructure, among others, by improving conditions for the needs of citizens of the country and by meeting the requirements of international organizations who are seeking with the right that the region of South-East to have the performance equivalent to EU standards. Section Pristina-Skopje of Route 6 represents one of the most important sections of this road going through important parts of the country and enabling direct link...

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

Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics

DEFF Research Database (Denmark)

Scholz, Jan Carsten; Greiner, Martin

The transport capacity of Internet-like communication networks and hence their efficiency may be improved by a factor of 5-10 through the use of highly optimized routing metrics, as demonstrated previously. Numerical determination of such routing metrics can be computationally demanding...... metrics. The new metrics have negligible computational cost and result in an approximately 5-fold performance increase, providing distinguished competitiveness with the computationally costly counterparts. They are applicable to very large networks and easy to implement in today's Internet routing...

S-Channel Dark Matter Simplified Models and Unitarity

CERN Document Server

Englert, Christoph; Spannowsky, Michael

The ultraviolet structure of $s$-channel mediator dark matter simplified models at hadron colliders is considered. In terms of commonly studied $s$-channel mediator simplified models it is argued that at arbitrarily high energies the perturbative description of dark matter production in high energy scattering at hadron colliders will break down in a number of cases. This is analogous to the well documented breakdown of an EFT description of dark matter collider production. With this in mind, to diagnose whether or not the use of simplified models at the LHC is valid, perturbative unitarity of the scattering amplitude in the processes relevant to LHC dark matter searches is studied. The results are as one would expect: at the LHC and future proton colliders the simplified model descriptions of dark matter production are in general valid. As a result of the general discussion, a simple new class of previously unconsidered `Fermiophobic Scalar' simplified models is proposed, in which a scalar mediator couples to...

A simplified approach for simulation of wake meandering

Energy Technology Data Exchange (ETDEWEB)

Thomsen, Kenneth; Aagaard Madsen, H.; Larsen, Gunner; Juul Larsen, T.

2006-03-15

This fact-sheet describes a simplified approach for a part of the recently developed dynamic wake model for aeroelastic simulations for wind turbines operating in wake. The part described in this fact-sheet concern the meandering process only, while the other part of the simplified approach the wake deficit profile is outside the scope of the present fact-sheet. Work on simplified models for the wake deficit profile is ongoing. (au)

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

Science.gov (United States)

Rachamalla, Sandhya; Kancherla, Anitha Sheela

2016-01-01

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

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

Improving catchment discharge predictions by inferring flow route contributions from a nested-scale monitoring and model setup

NARCIS (Netherlands)

Velde, Y. van der; Rozemeijer, J.C.; Rooij, G.H. de; Geer, F.C. van; Torfs, P.J.J.F.; Louw, P.G.B. de

2011-01-01

Identifying effective measures to reduce nutrient loads of headwaters in lowland catchments requires a thorough understanding of flow routes of water and nutrients. In this paper we assess the value of nested-scale discharge and groundwater level measurements for the estimation of flow route volumes

Versatile composite resins simplifying the practice of restorative dentistry.

Science.gov (United States)

Margeas, Robert

2014-01-01

After decades of technical development and refinement, composite resins continue to simplify the practice of restorative dentistry, offering clinicians versatility, predictability, and enhanced physical properties. With a wide range of products available today, composite resins are a reliable, conservative, multi-functional restorative material option. As manufacturers strive to improve such properties as compression strength, flexural strength, elastic modulus, coefficient of thermal expansion, water sorption, and wear resistance, several classification systems of composite resins have been developed.

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.

Endodontics Simplified

OpenAIRE

Kansal, Rohit; Talwar, Sangeeta; Yadav, Seema; Chaudhary, Sarika; Nawal, Ruchika

2014-01-01

The preparation of the root canal system is essential for a successful outcome in root canal treatment. The development of rotary nickel titanium instruments is considered to be an important innovation in the field of endodontics. During few last years, several new instrument systems have been introduced but the quest for simplifying the endodontic instrumentation sequence has been ongoing for almost 20 years, resulting in more than 70 different engine-driven endodontic instrumentation system...

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

Science.gov (United States)

McNally, B. David; Love, John

2011-01-01

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

Route-Based Control of Hybrid Electric Vehicles: Preprint

Energy Technology Data Exchange (ETDEWEB)

Gonder, J. D.

2008-01-01

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

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

Science.gov (United States)

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

2014-01-01

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

The Deployment of Routing Protocols in Distributed Control Plane of SDN

Directory of Open Access Journals (Sweden)

Zhou Jingjing

2014-01-01

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

An optimized routing algorithm for the automated assembly of standard multimode ribbon fibers in a full-mesh optical backplane

Science.gov (United States)

Basile, Vito; Guadagno, Gianluca; Ferrario, Maddalena; Fassi, Irene

2018-03-01

In this paper a parametric, modular and scalable algorithm allowing a fully automated assembly of a backplane fiber-optic interconnection circuit is presented. This approach guarantees the optimization of the optical fiber routing inside the backplane with respect to specific criteria (i.e. bending power losses), addressing both transmission performance and overall costs issues. Graph theory has been exploited to simplify the complexity of the NxN full-mesh backplane interconnection topology, firstly, into N independent sub-circuits and then, recursively, into a limited number of loops easier to be generated. Afterwards, the proposed algorithm selects a set of geometrical and architectural parameters whose optimization allows to identify the optimal fiber optic routing for each sub-circuit of the backplane. The topological and numerical information provided by the algorithm are then exploited to control a robot which performs the automated assembly of the backplane sub-circuits. The proposed routing algorithm can be extended to any array architecture and number of connections thanks to its modularity and scalability. Finally, the algorithm has been exploited for the automated assembly of an 8x8 optical backplane realized with standard multimode (MM) 12-fiber ribbons.

Do Online Bicycle Routing Portals Adequately Address Prevalent Safety Concerns?

Directory of Open Access Journals (Sweden)

Martin Loidl

2018-03-01

Full Text Available Safety concerns are among the most prevalent deterrents for bicycling. The provision of adequate bicycling infrastructure is considered as one of the most efficient means to increase cycling safety. However, limited public funding does not always allow agencies to implement cycling infrastructure improvements at the desirable level. Thus, bicycle trip planners can at least partly alleviate the lack of adequate infrastructure by recommending optimal routes in terms of safety. The presented study provides a systematic review of 35 bicycle routing applications and analyses to which degree they promote safe bicycling. The results show that most trip planners lack corresponding routing options and therefore do not sufficiently address safety concerns of bicyclists. Based on these findings, we developed recommendations on how to better address bicycling safety in routing portals. We suggest employing current communication technology and analysis to consider safety concerns more explicitly.

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.

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

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 GOMS model applied to a simplified control panel design

International Nuclear Information System (INIS)

Chavez, C.; Edwards, R.M.

1992-01-01

The design of the user interface for a new system requires many decisions to be considered. To develop sensitivity to user needs requires understanding user behavior. The how-to-do-it knowledge is a mixture of task-related and interface-related components. A conscientious analysis of these components, allows the designer to construct a model in terms of goals, operators, methods, and selection (GOMS model) rules that can be advantageously used in the design process and evaluation of a user interface. The emphasis of the present work is on describing the importance and use of a GOMS model as a formal user interface analysis tool in the development of a simplified panel for the control of a nuclear power plant. At Pennsylvania State University, a highly automated control system with a greatly simplified human interface has been proposed to improve power plant safety. Supervisory control is to be conducted with a simplified control panel with the following functions: startup, shutdown, increase power, decrease power, reset, and scram. Initial programming of the operator interface has been initiated within the framework of a U.S. Department of Energy funded university project for intelligent distributed control. A hypothesis to be tested is that this scheme can be also used to estimate mental work load content and predict human performance

Conceptual design of simplified PWR

International Nuclear Information System (INIS)

Tabata, Hiroaki

1996-01-01

The limited availability for location of nuclear power plant in Japan makes plants with higher power ratings more desirable. Having no intention of constructing medium-sized plants as a next generation standard plant, Japanese utilities are interested in applying passive technologies to large ones. So, Japanese utilities have studied large passive plants based on AP600 and SBWR as alternative future LWRs. In a joint effort to develop a new generation nuclear power plant which is more friendly to operator and maintenance personnel and is economically competitive with alternative sources of power generation, JAPC and Japanese Utilities started the study to modify AP600 and SBWR, in order to accommodate the Japanese requirements. During a six year program up to 1994, basic concepts for 1000 MWe class Simplified PWR (SPWR) and Simplified BWR (SBWR) were developed, though there still remain several areas to be improved. These studies have now stepped into the phase of reducing construction cost and searching for maximum power rating that can be attained by reasonably practical technology. These results also suggest that it is hopeful to develop a large 3-loop passive plant (∼1200 MWe). Since Korea mainly deals with PWR, this paper summarizes SPWR study. The SPWR is jointly studied by JAPC, Japanese PWR Utilities, EdF, WH and Mitsubishi Heavy Industry. Using the AP-600 reference design as a basis, we enlarged the plant size to 3-loops and added engineering features to conform with Japanese practice and Utilities' preference. The SPWR program definitively confirmed the feasibility of a passive plant with an NSSS rating about 1000 MWe and 3 loops. (J.P.N.)

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.

Use of a simplified pathways model to improve the environmental surveillance program at the radioactive waste management complex of the Idaho National Engineering Laboratory (INEL)

International Nuclear Information System (INIS)

Case, M.J.; Rope, S.K.

1985-01-01

Systems analysis, including a simple pathways model based on first-order kinetics, is a useful way to design or improve environmental monitoring networks. This method allows investigators and administrators to consider interactions that may be occurring in the system and provides guidance in determining the need to collect data on various system components and processes. A simplified pathways model of radionuclide movement from low-level waste and transuranic waste buried at the Radioactive Waste Management Complex was developed (1) to identify critical pathways that should be monitored and (2) to identify key input parameters that need investigation by special studies. The model was modified from the Savannah River Laboratory DOSTOMAN code. Site-specific data were used in the model, if available. Physical and biological pathways include airborne and waterborne transport of surface soil, subsurface migration to the aquifer, waste container degradation, plant uptake, small mammal burrowing, and a few simplified food chain pathways. The model was run using a set of radionuclides determined to be significant in terms of relative hazard. Critical transport pathways which should be monitored were selected based on relative influence on model results. Key input parameters were identified for possible special studies by evaluating the sensitivity of model response to the parameters used to define transport pathways. A description of the approaches used and the guidance recommended to improve the environmental surveillance program are presented in this paper. 5 references, 1 figure, 2 tables

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

Directory of Open Access Journals (Sweden)

Hong SeungHo

2011-01-01

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

48 CFR 1552.232-74 - Payments-simplified acquisition procedures financing.

Science.gov (United States)

2010-10-01

... acquisition procedures financing. 1552.232-74 Section 1552.232-74 Federal Acquisition Regulations System... Provisions and Clauses 1552.232-74 Payments—simplified acquisition procedures financing. As prescribed in... acquisition procedures financing. Payments—Simplified Acquisition Procedures Financing (JUN 2006) Simplified...

A route-specific system for risk assessment of radioactive materials transportation accidents

International Nuclear Information System (INIS)

Moore, J.E.; Sandquist, G.M.; Slaughter, D.M.

1995-01-01

A low-cost, powerful geographic information system (GIS) that operates on a personal computer was integrated into a software system to provide route specific assessment of the risks associated with the atmospheric release of radioactive and hazardous materials in transportation accidents. The highway transportation risk assessment (HITRA) software system described here combines a commercially available GIS (TransCAD) with appropriate models and data files for route- and accident-specific factors, such as meteorology, dispersion, demography, and health effects to permit detailed analysis of transportation risk assessment. The HITRA system allows a user to interactively select a highway or railroad route from a GIS database of major US transportation routes. A route-specific risk assessment is then performed to estimate downwind release concentrations and the resulting potential health effects imposed on the exposed population under local environmental and temporal conditions. The integration of GIS technology with current risk assessment methodology permits detailed analysis coupled with enhanced user interaction. Furthermore, HITRA provides flexibility and documentation for route planning, updating and improving the databases required for evaluating specific transportation routes, changing meteorological and environmental conditions, and local demographics

Simplified 3D Finite Element Analysis of Linear Inductor Motor for Integrated Magnetic Suspension/Propulsion Applications

Energy Technology Data Exchange (ETDEWEB)

Jeong, Sang Sub; Jang Seok Myeong [Chungnam National University(Korea)

2000-06-01

The 4-pole linear homopolar synchronous motor (LHSM), so called linear inductor motor, is composed of the figure-of-eight shaped 3-phase armature windings, DC field windings, and the segmented secondary with the transverse bar track. To reduce the calculation time, the simplified 3D finite element model with equivalent reluctance and/or permanent magnet is presented. To obtain a clear understanding, propriety and usefulness of the developed mode., we compare with the results of simplified 3D FEA and test. Consequently, the results of simplified and 3D FEM analysis are nearly identical, but much larger than that of static test at d-axis armature excitation. Therefore the improved FEA model, such as full model with half slot, is needed for the precise analysis. (author). refs., figs., tabs.

Validation of Simplified Load Equations Through Loads Measurement and Modeling of a Small Horizontal-Axis Wind Turbine Tower

Energy Technology Data Exchange (ETDEWEB)

Dana, Scott [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Van Dam, Jeroen J [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Damiani, Rick R [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2018-04-24

As part of an ongoing effort to improve the modeling and prediction of small wind turbine dynamics, the National Renewable Energy Laboratory (NREL) tested a small horizontal-axis wind turbine in the field at the National Wind Technology Center. The test turbine was a 2.1-kW downwind machine mounted on an 18-m multi-section fiberglass composite tower. The tower was instrumented and monitored for approximately 6 months. The collected data were analyzed to assess the turbine and tower loads and further validate the simplified loads equations from the International Electrotechnical Commission (IEC) 61400-2 design standards. Field-measured loads were also compared to the output of an aeroelastic model of the turbine. In particular, we compared fatigue loads as measured in the field, predicted by the aeroelastic model, and calculated using the simplified design equations. Ultimate loads at the tower base were assessed using both the simplified design equations and the aeroelastic model output. The simplified design equations in IEC 61400-2 do not accurately model fatigue loads and a discussion about the simplified design equations is discussed.

An Environment-Friendly Multipath Routing Protocol for Underwater Acoustic Sensor Network

Directory of Open Access Journals (Sweden)

Yun Li

2017-01-01

Full Text Available Underwater Acoustic Sensor Network (UASN is a promising technique by facilitating a wide range of aquatic applications. However, routing scheme in UASN is a challenging task because of the characteristics of the nodes mobility, interruption of link, and interference caused by other underwater acoustic systems such as marine mammals. In order to achieve reliable data delivery in UASN, in this work, we present a disjoint multipath disruption-tolerant routing protocol for UASN (ENMR, which incorporates the Hue, Saturation, and Value color space (HSV model to establish routing paths to greedily forward data packets to sink nodes. ENMR applies the mechanism to maintain the network topology. Simulation results show that, compared with the classic underwater routing protocols named PVBF, ENMR can improve packet delivery ratio and reduce network latency while avoiding introducing additional energy consumption.

A Hybrid Adaptive Routing Algorithm for Event-Driven Wireless Sensor Networks

Science.gov (United States)

Figueiredo, Carlos M. S.; Nakamura, Eduardo F.; Loureiro, Antonio A. F.

2009-01-01

Routing is a basic function in wireless sensor networks (WSNs). For these networks, routing algorithms depend on the characteristics of the applications and, consequently, there is no self-contained algorithm suitable for every case. In some scenarios, the network behavior (traffic load) may vary a lot, such as an event-driven application, favoring different algorithms at different instants. This work presents a hybrid and adaptive algorithm for routing in WSNs, called Multi-MAF, that adapts its behavior autonomously in response to the variation of network conditions. In particular, the proposed algorithm applies both reactive and proactive strategies for routing infrastructure creation, and uses an event-detection estimation model to change between the strategies and save energy. To show the advantages of the proposed approach, it is evaluated through simulations. Comparisons with independent reactive and proactive algorithms show improvements on energy consumption. PMID:22423207

Simplified method evaluation for piping elastic follow-up

International Nuclear Information System (INIS)

Severud, L.K.

1983-05-01

A proposed simplified method for evaluating elastic follow-up effects in high temperature pipelines is presented. The method was evaluated by comparing the simplified analysis results with those obtained from detailed inelastic solutions. Nine different pipelines typical of a nuclear breeder reactor power plant were analyzed; the simplified method is attractive because it appears to give fairly accurate and conservative results. It is easy to apply and inexpensive since it employs iterative elastic solutions for the pipeline coupled with the readily available isochronous stress-strain data provided in the ASME Code

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

Simplified Dark Matter Models

OpenAIRE

Morgante, Enrico

2018-01-01

I review the construction of Simplified Models for Dark Matter searches. After discussing the philosophy and some simple examples, I turn the attention to the aspect of the theoretical consistency and to the implications of the necessary extensions of these models.

a New Model for Fuzzy Personalized Route Planning Using Fuzzy Linguistic Preference Relation

Science.gov (United States)

Nadi, S.; Houshyaripour, A. H.

2017-09-01

This paper proposes a new model for personalized route planning under uncertain condition. Personalized routing, involves different sources of uncertainty. These uncertainties can be raised from user's ambiguity about their preferences, imprecise criteria values and modelling process. The proposed model uses Fuzzy Linguistic Preference Relation Analytical Hierarchical Process (FLPRAHP) to analyse user's preferences under uncertainty. Routing is a multi-criteria task especially in transportation networks, where the users wish to optimize their routes based on different criteria. However, due to the lake of knowledge about the preferences of different users and uncertainties available in the criteria values, we propose a new personalized fuzzy routing method based on the fuzzy ranking using center of gravity. The model employed FLPRAHP method to aggregate uncertain criteria values regarding uncertain user's preferences while improve consistency with least possible comparisons. An illustrative example presents the effectiveness and capability of the proposed model to calculate best personalize route under fuzziness and uncertainty.

Hypersonic Vehicle Propulsion System Simplified Model Development

Science.gov (United States)

Stueber, Thomas J.; Raitano, Paul; Le, Dzu K.; Ouzts, Peter

2007-01-01

This document addresses the modeling task plan for the hypersonic GN&C GRC team members. The overall propulsion system modeling task plan is a multi-step process and the task plan identified in this document addresses the first steps (short term modeling goals). The procedures and tools produced from this effort will be useful for creating simplified dynamic models applicable to a hypersonic vehicle propulsion system. The document continues with the GRC short term modeling goal. Next, a general description of the desired simplified model is presented along with simulations that are available to varying degrees. The simulations may be available in electronic form (FORTRAN, CFD, MatLab,...) or in paper form in published documents. Finally, roadmaps outlining possible avenues towards realizing simplified model are presented.

48 CFR 3032.003 - Simplified acquisition procedures financing.

Science.gov (United States)

2010-10-01

... 48 Federal Acquisition Regulations System 7 2010-10-01 2010-10-01 false Simplified acquisition procedures financing. 3032.003 Section 3032.003 Federal Acquisition Regulations System DEPARTMENT OF HOMELAND... FINANCING Scope of Part 3032.003 Simplified acquisition procedures financing. Contract financing may be...

Route optimization as an instrument to improve animal welfare and economics in pre-slaughter logistics

Science.gov (United States)

2018-01-01

Each year, more than three million animals are transported from farms to abattoirs in Sweden. Animal transport is related to economic and environmental costs and a negative impact on animal welfare. Time and the number of pick-up stops between farms and abattoirs are two key parameters for animal welfare. Both are highly dependent on efficient and qualitative transportation planning, which may be difficult if done manually. We have examined the benefits of using route optimization in cattle transportation planning. To simulate the effects of various planning time windows and transportation time regulations and number of pick-up stops along each route, we have used data that represent one year of cattle transport. Our optimization model is a development of a model used in forestry transport that solves a general pick-up and delivery vehicle routing problem. The objective is to minimize transportation costs. We have shown that the length of the planning time window has a significant impact on the animal transport time, the total driving time and the total distance driven; these parameters that will not only affect animal welfare but also affect the economy and environment in the pre-slaughter logistic chain. In addition, we have shown that changes in animal transportation regulations, such as minimizing the number of allowed pick-up stops on each route or minimizing animal transportation time, will have positive effects on animal welfare measured in transportation hours and number of pick-up stops. However, this leads to an increase in working time and driven distances, leading to higher transportation costs for the transport and negative environmental impact. PMID:29513704

Route optimization as an instrument to improve animal welfare and economics in pre-slaughter logistics.

Science.gov (United States)

Frisk, Mikael; Jonsson, Annie; Sellman, Stefan; Flisberg, Patrik; Rönnqvist, Mikael; Wennergren, Uno

2018-01-01

Each year, more than three million animals are transported from farms to abattoirs in Sweden. Animal transport is related to economic and environmental costs and a negative impact on animal welfare. Time and the number of pick-up stops between farms and abattoirs are two key parameters for animal welfare. Both are highly dependent on efficient and qualitative transportation planning, which may be difficult if done manually. We have examined the benefits of using route optimization in cattle transportation planning. To simulate the effects of various planning time windows and transportation time regulations and number of pick-up stops along each route, we have used data that represent one year of cattle transport. Our optimization model is a development of a model used in forestry transport that solves a general pick-up and delivery vehicle routing problem. The objective is to minimize transportation costs. We have shown that the length of the planning time window has a significant impact on the animal transport time, the total driving time and the total distance driven; these parameters that will not only affect animal welfare but also affect the economy and environment in the pre-slaughter logistic chain. In addition, we have shown that changes in animal transportation regulations, such as minimizing the number of allowed pick-up stops on each route or minimizing animal transportation time, will have positive effects on animal welfare measured in transportation hours and number of pick-up stops. However, this leads to an increase in working time and driven distances, leading to higher transportation costs for the transport and negative environmental impact.

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.

Simplifying Multiproject Scheduling Problem Based on Design Structure Matrix and Its Solution by an Improved aiNet Algorithm

Directory of Open Access Journals (Sweden)

Chunhua Ju

2012-01-01

Full Text Available Managing multiple project is a complex task involving the unrelenting pressures of time and cost. Many studies have proposed various tools and techniques for single-project scheduling; however, the literature further considering multimode or multiproject issues occurring in the real world is rather scarce. In this paper, design structure matrix (DSM and an improved artificial immune network algorithm (aiNet are developed to solve a multi-mode resource-constrained scheduling problem. Firstly, the DSM is used to simplify the mathematic model of multi-project scheduling problem. Subsequently, aiNet algorithm comprised of clonal selection, negative selection, and network suppression is adopted to realize the local searching and global searching, which will assure that it has a powerful searching ability and also avoids the possible combinatorial explosion. Finally, the approach is tested on a set of randomly cases generated from ProGen. The computational results validate the effectiveness of the proposed algorithm comparing with other famous metaheuristic algorithms such as genetic algorithm (GA, simulated annealing algorithm (SA, and ant colony optimization (ACO.

Route activity tracking and management using available technology

Directory of Open Access Journals (Sweden)

Sam Yousef Khoury

2012-01-01

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

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

Multiple depots vehicle routing based on the ant colony with the genetic algorithm

Directory of Open Access Journals (Sweden)

ChunYing Liu

2013-09-01

Full Text Available Purpose: the distribution routing plans of multi-depots vehicle scheduling problem will increase exponentially along with the adding of customers. So, it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm. On the basis of building the model of multi-depots vehicle scheduling problem, in order to improve the efficiency of the multiple depots vehicle routing, the paper puts forward a fusion algorithm on multiple depots vehicle routing based on the ant colony algorithm with genetic algorithm. Design/methodology/approach: to achieve this objective, the genetic algorithm optimizes the parameters of the ant colony algorithm. The fusion algorithm on multiple depots vehicle based on the ant colony algorithm with genetic algorithm is proposed. Findings: simulation experiment indicates that the result of the fusion algorithm is more excellent than the other algorithm, and the improved algorithm has better convergence effective and global ability. Research limitations/implications: in this research, there are some assumption that might affect the accuracy of the model such as the pheromone volatile factor, heuristic factor in each period, and the selected multiple depots. These assumptions can be relaxed in future work. Originality/value: In this research, a new method for the multiple depots vehicle routing is proposed. The fusion algorithm eliminate the influence of the selected parameter by optimizing the heuristic factor, evaporation factor, initial pheromone distribute, and have the strong global searching ability. The Ant Colony algorithm imports cross operator and mutation operator for operating the first best solution and the second best solution in every iteration, and reserves the best solution. The cross and mutation operator extend the solution space and improve the convergence effective and the global ability. This research shows that considering both the ant colony and genetic algorithm

Screening efficacy of a simplified logMAR chart

Directory of Open Access Journals (Sweden)

Naganathan Muthuramalingam

2016-04-01

Aim: This study evaluates the efficacy of a simplified logMAR chart, designed for VA testing over the conventional Snellen chart, in a school-based vision-screening programme. Methods: We designed a simplified logMAR chart by employing the principles of the Early Treatment Diabetic Retinopathy Study (ETDRS chart in terms of logarithmic letter size progression, inter-letter spacing, and inter-line spacing. Once the simplified logMAR chart was validated by students in the Elite school vision-screening programme, we set out to test the chart in 88 primary and middle schools in the Tiruporur block of Kancheepuram district in Tamil Nadu. One school teacher in each school was trained to screen a cross-sectional population of 10 354 primary and secondary school children (girls: 5488; boys: 4866 for VA deficits using a new, simplified logMAR algorithm. An experienced paediatric optometrist was recruited to validate the screening methods and technique used by the teachers to collect the data. Results: The optometrist screened a subset of 1300 school children from the total sample. The optometrist provided the professional insights needed to validate the clinical efficacy of the simplified logMAR algorithm and verified the reliability of the data collected by the teachers. The mean age of children sampled for validation was 8.6 years (range: 9–14 years. The sensitivity and the specificity of the simplified logMAR chart when compared to the standard logMAR chart were found to be 95% and 98%, respectively. Kappa value was 0.97. Sensitivity of the teachers’ screening was 66.63% (95% confidence interval [CI]: 52.73–77.02 and the specificity was 98.33% (95% CI: 97.49–98.95. Testing of VA was done under substandard illumination levels in 87% of the population. A total of 10 354 children were screened, 425 of whom were found to have some form of visual and/or ocular defect that was identified by the teacher or optometrist. Conclusion: The simplified logMAR testing algorithm

Adaptive MANET Multipath Routing Algorithm Based on the Simulated Annealing Approach

Directory of Open Access Journals (Sweden)

Sungwook Kim

2014-01-01

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

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.

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

Science.gov (United States)

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

2014-04-01

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

Simplified design of switching power supplies

CERN Document Server

Lenk, John

1995-01-01

* Describes the operation of each circuit in detail * Examines a wide selection of external components that modify the IC package characteristics * Provides hands-on, essential information for designing a switching power supply Simplified Design of Switching Power Supplies is an all-inclusive, one-stop guide to switching power-supply design. Step-by-step instructions and diagrams render this book essential for the student and the experimenter, as well as the design professional. Simplified Design of Switching Power Supplies concentrates on the use of IC regulators. All popular forms of swit

The weak acid resin process: a dustless conversion route for the synthesis of americium bearing-blanket precursors

International Nuclear Information System (INIS)

Picart, S.; Gauthe, A.; Parant, P.; Remy, E.; Jobelin, I.; Pomared, J.M.; Grangaud, P.; Dauby, J.; Delahaye, T.; Caisso, M.; Bataille, M.; Bayle, J.P.; Frost, C.; Delage, C.; Martin, C.L.; Ayral, E.

2016-01-01

Mixed uranium-americium oxides are one of the materials envisaged for Americium Bearing Blankets dedicated to transmutation in fast neutron reactors. Conversion and fabrication processes are currently developed to make those materials in the form of dense and homogeneous oxide ceramic pellets or dense granulates incorporating uranium and americium. Their development points out the need of a simplified and optimized process which could lower hazards linked to dust generation of highly contaminating and irradiating compounds and facilitate material transfer in remote handling operations. This reason motivated the development of innovative 'dustless' route such as the Weak Acid Resin route (WAR) which provides the oxide precursors in the form of sub-millimeter-sized microspheres with optimal flowability and limits dust generation during conversion and fabrication steps. This study is thus devoted to the synthesis of mixed uranium-americium oxide microspheres by the WAR process and to the characterization of such precursors. This work also deals with their application to the fabrication of dense or porous pellets and with their potential use as dense spherules to make Sphere-Pac fuel. (authors)

The weak acid resin process: a dustless conversion route for the synthesis of americium bearing-blanket precursors

Energy Technology Data Exchange (ETDEWEB)

Picart, S.; Gauthe, A.; Parant, P.; Remy, E.; Jobelin, I.; Pomared, J.M.; Grangaud, P.; Dauby, J.; Delahaye, T. [CEA, Centre de Marcoule, DEN/MAR/DRCP, F-30207 Bagnols-sur-Ceze (France); Caisso, M.; Bataille, M.; Bayle, J.P. [CEA, Centre de Marcoule, DEN/MAR/DTEC, F-30207 Bagnols-sur-Ceze (France); Frost, C. [CEA, Centre de Marcoule, DEN/MAR/DRCP, F-30207 Bagnols-sur-Ceze (France); Institut Europeen des Membranes, CNRS-ENSCM-UM, CC47, University of Montpellier, F-34095 Montpellier (France); Delage, C. [CEA, Centre de Cadarache, DEN/CAD/DEC, Saint-Paul-lez-Durance (France); Martin, C.L. [Univ. Grenoble Alpes, CNRS, SIMAP, F-38000 Grenoble (France); Ayral, E. [Institut Europeen des Membranes, CNRS-ENSCM-UM, CC47, University of Montpellier, F-34095 Montpellier (France)

2016-07-01

Mixed uranium-americium oxides are one of the materials envisaged for Americium Bearing Blankets dedicated to transmutation in fast neutron reactors. Conversion and fabrication processes are currently developed to make those materials in the form of dense and homogeneous oxide ceramic pellets or dense granulates incorporating uranium and americium. Their development points out the need of a simplified and optimized process which could lower hazards linked to dust generation of highly contaminating and irradiating compounds and facilitate material transfer in remote handling operations. This reason motivated the development of innovative 'dustless' route such as the Weak Acid Resin route (WAR) which provides the oxide precursors in the form of sub-millimeter-sized microspheres with optimal flowability and limits dust generation during conversion and fabrication steps. This study is thus devoted to the synthesis of mixed uranium-americium oxide microspheres by the WAR process and to the characterization of such precursors. This work also deals with their application to the fabrication of dense or porous pellets and with their potential use as dense spherules to make Sphere-Pac fuel. (authors)

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

Full-shipload tramp ship routing and scheduling with variable speeds

DEFF Research Database (Denmark)

Wen, M.; Røpke, Stefan; Petersen, Hanne Løhmann

2016-01-01

This paper investigates the simultaneous optimization problem of routing and sailing speed in the context of full-shipload tramp shipping. In this problem, a set of cargoes can be transported from their load to discharge ports by a fleet of heterogeneous ships of different speed ranges and load......-dependent fuel consumption. The objective is to determine which orders to serve and to find the optimal route for each ship and the optimal sailing speed on each leg of the route so that the total profit is maximized. The problem originated from a real-life challenge faced by a Danish tramp shipping company....... It is shown that speed optimization can improve the total profit by 16% on average and the fuel price has a significant effect on the average sailing speed and total profit....

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

Directory of Open Access Journals (Sweden)

Hamadoun Tall

2017-10-01

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

Simplified approach for estimating large early release frequency

International Nuclear Information System (INIS)

Pratt, W.T.; Mubayi, V.; Nourbakhsh, H.; Brown, T.; Gregory, J.

1998-04-01

The US Nuclear Regulatory Commission (NRC) Policy Statement related to Probabilistic Risk Analysis (PRA) encourages greater use of PRA techniques to improve safety decision-making and enhance regulatory efficiency. One activity in response to this policy statement is the use of PRA in support of decisions related to modifying a plant's current licensing basis (CLB). Risk metrics such as core damage frequency (CDF) and Large Early Release Frequency (LERF) are recommended for use in making risk-informed regulatory decisions and also for establishing acceptance guidelines. This paper describes a simplified approach for estimating LERF, and changes in LERF resulting from changes to a plant's CLB

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.

Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks.

Science.gov (United States)

Jia, Jie; Chen, Jian; Deng, Yansha; Wang, Xingwei; Aghvami, Abdol-Hamid

2017-10-09

The development of wireless power transfer (WPT) technology has inspired the transition from traditional battery-based wireless sensor networks (WSNs) towards wireless rechargeable sensor networks (WRSNs). While extensive efforts have been made to improve charging efficiency, little has been done for routing optimization. In this work, we present a joint optimization model to maximize both charging efficiency and routing structure. By analyzing the structure of the optimization model, we first decompose the problem and propose a heuristic algorithm to find the optimal charging efficiency for the predefined routing tree. Furthermore, by coding the many-to-one communication topology as an individual, we further propose to apply a genetic algorithm (GA) for the joint optimization of both routing and charging. The genetic operations, including tree-based recombination and mutation, are proposed to obtain a fast convergence. Our simulation results show that the heuristic algorithm reduces the number of resident locations and the total moving distance. We also show that our proposed algorithm achieves a higher charging efficiency compared with existing algorithms.

Optimized energy-delay sub-network routing protocol development and implementation for wireless sensor networks

International Nuclear Information System (INIS)

Fonda, James W; Zawodniok, Maciej; Jagannathan, S; Watkins, Steve E

2008-01-01

The development and the implementation issues of a reactive optimized energy-delay sub-network routing (OEDSR) protocol for wireless sensor networks (WSN) are introduced and its performance is contrasted with the popular ad hoc on-demand distance vector (AODV) routing protocol. Analytical results illustrate the performance of the proposed OEDSR protocol, while experimental results utilizing a hardware testbed under various scenarios demonstrate improvements in energy efficiency of the OEDSR protocol. A hardware platform constructed at the University of Missouri-Rolla (UMR), now the Missouri University of Science and Technology (MST), based on the Generation 4 Smart Sensor Node (G4-SSN) prototyping platform is also described. Performance improvements are shown in terms of end-to-end (E2E) delay, throughput, route-set-up time and drop rates and energy usage is given for three topologies, including a mobile topology. Additionally, results from the hardware testbed provide valuable lessons for network deployments. Under testing OEDSR provides a factor of ten improvement in the energy used in the routing session and extends network lifetime compared to AODV. Depletion experiments show that the time until the first node failure is extended by a factor of three with the network depleting and network lifetime is extended by 6.7%

Simplified Least Squares Shadowing sensitivity analysis for chaotic ODEs and PDEs

Energy Technology Data Exchange (ETDEWEB)

Chater, Mario, E-mail: chaterm@mit.edu; Ni, Angxiu, E-mail: niangxiu@mit.edu; Wang, Qiqi, E-mail: qiqi@mit.edu

2017-01-15

This paper develops a variant of the Least Squares Shadowing (LSS) method, which has successfully computed the derivative for several chaotic ODEs and PDEs. The development in this paper aims to simplify Least Squares Shadowing method by improving how time dilation is treated. Instead of adding an explicit time dilation term as in the original method, the new variant uses windowing, which can be more efficient and simpler to implement, especially for PDEs.

Energy efficient routing protocols for wireless sensor networks: comparison and future directions

Directory of Open Access Journals (Sweden)

Loganathan Murukesan

2017-01-01

Full Text Available Wireless sensor network consists of nodes with limited resources. Hence, it is important to design protocols or algorithms which increases energy efficiency in order to improve the network lifetime. In this paper, techniques used in the network layer (routing of the internet protocol stack to achieve energy efficiency are reviewed. Usually, the routing protocols are classified into four main schemes: (1 Network Structure, (2 Communication Model, (3 Topology Based, and (4 Reliable Routing. In this work, only network structure based routing protocols are reviewed due to the page constraint. Besides, this type of protocols are much popular among the researchers since they are fairly simple to implement and produce good results as presented in this paper. Also, the pros and cons of each protocols are presented. Finally, the paper concludes with possible further research directions.

Multipath Activity Based Routing Protocol for Mobile ‎Cognitive Radio Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Shereen Omar

2017-01-01

Full Text Available Cognitive radio networks improve spectrum utilization by ‎sharing licensed spectrum with cognitive radio devices. In ‎cognitive radio ad hoc networks the routing protocol is one ‎of the most challenging tasks due to the changes in ‎frequency spectrum and the interrupted connectivity ‎caused by the primary user activity. In this paper, a multi‎path activity based routing protocol for cognitive radio ‎network (MACNRP is proposed. The protocol utilizes ‎channel availability and creates multiple node-disjoint ‎routes between the source and destination nodes. The ‎proposed protocol is compared with D2CARP and FTCRP ‎protocols. The performance evaluation is conducted ‎through mathematical analysis and using OPNET ‎simulation. The performance of the proposed protocol ‎achieves an increase in network throughput; besides it ‎decreases the probability of route failure due to node ‎mobility and primary user activity. We have found that the ‎MACNRP scheme results in 50% to 75% reduction in ‎blocking probability and 33% to 78% improvement in ‎network throughput, with a reasonable additional routing ‎overhead and average packet delay. Due to the successful ‎reduction of collision between primary users and ‎cognitive users, the MACNRP scheme results in decreasing ‎the path failure rate by 50% to 87%.‎

Revealed Preference Methods for Studying Bicycle Route Choice—A Systematic Review

Directory of Open Access Journals (Sweden)

Ray Pritchard

2018-03-01

Full Text Available One fundamental aspect of promoting utilitarian bicycle use involves making modifications to the built environment to improve the safety, efficiency and enjoyability of cycling. Revealed preference data on bicycle route choice can assist greatly in understanding the actual behaviour of a highly heterogeneous group of users, which in turn assists the prioritisation of infrastructure or other built environment initiatives. This systematic review seeks to compare the relative strengths and weaknesses of the empirical approaches for evaluating whole journey route choices of bicyclists. Two electronic databases were systematically searched for a selection of keywords pertaining to bicycle and route choice. In total seven families of methods are identified: GPS devices, smartphone applications, crowdsourcing, participant-recalled routes, accompanied journeys, egocentric cameras and virtual reality. The study illustrates a trade-off in the quality of data obtainable and the average number of participants. Future additional methods could include dockless bikeshare, multiple camera solutions using computer vision and immersive bicycle simulator environments.

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.

A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Jiawei Tang

2018-03-01

Full Text Available The Internet of things (IoT is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs. The main contributions of a TBSR are (a the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of

A Trust-Based Secure Routing Scheme Using the Traceback Approach for Energy-Harvesting Wireless Sensor Networks.

Science.gov (United States)

Tang, Jiawei; Liu, Anfeng; Zhang, Jian; Xiong, Neal N; Zeng, Zhiwen; Wang, Tian

2018-03-01

The Internet of things (IoT) is composed of billions of sensing devices that are subject to threats stemming from increasing reliance on communications technologies. A Trust-Based Secure Routing (TBSR) scheme using the traceback approach is proposed to improve the security of data routing and maximize the use of available energy in Energy-Harvesting Wireless Sensor Networks (EHWSNs). The main contributions of a TBSR are (a) the source nodes send data and notification to sinks through disjoint paths, separately; in such a mechanism, the data and notification can be verified independently to ensure their security. (b) Furthermore, the data and notification adopt a dynamic probability of marking and logging approach during the routing. Therefore, when attacked, the network will adopt the traceback approach to locate and clear malicious nodes to ensure security. The probability of marking is determined based on the level of battery remaining; when nodes harvest more energy, the probability of marking is higher, which can improve network security. Because if the probability of marking is higher, the number of marked nodes on the data packet routing path will be more, and the sink will be more likely to trace back the data packet routing path and find malicious nodes according to this notification. When data packets are routed again, they tend to bypass these malicious nodes, which make the success rate of routing higher and lead to improved network security. When the battery level is low, the probability of marking will be decreased, which is able to save energy. For logging, when the battery level is high, the network adopts a larger probability of marking and smaller probability of logging to transmit notification to the sink, which can reserve enough storage space to meet the storage demand for the period of the battery on low level; when the battery level is low, increasing the probability of logging can reduce energy consumption. After the level of battery

A Case Study of Control and Improved Simplified Swarm Optimization for Economic Dispatch of a Stand-Alone Modular Microgrid

Directory of Open Access Journals (Sweden)

Xianyong Zhang

2018-03-01

Full Text Available Due to the complex configuration and control framework, the conventional microgrid is not cost-effective for engineering applications with small or medium capacity. A stand-alone modular microgrid with separated AC bus and decentralized control strategy is proposed in this paper. Each module is a self-powered system, which consists of wind and solar power, a storage battery, load and three-port converter. The modules are interconnected by three-port converters to form the microgrid. Characteristics, operation principle, control of the modular microgrid and the three-port converter are analyzed in detail. Distributed storage batteries enable power exchanges among modules to enhance economic returns. Economic dispatch of the stand-alone modular microgrid is a mixed-integer programming problem. A day-ahead operation optimization model including fuel cost, battery operation cost, and power transmission cost is established. Because there are so many constraints, it is difficult to produce a feasible solution and even more difficult to have an improved solution. An improved simplified swarm optimization (iSSO method is therefore proposed. The iSSO scheme designs the new update mechanism and survival of the fittest policy. The experimental results from the demonstration project on DongAo Island reflect the effectiveness of the stand-alone modular microgrid and the economic dispatch strategy based on the iSSO method.

Simplified model-based optimal control of VAV air-conditioning system

Energy Technology Data Exchange (ETDEWEB)

Nassif, N.; Kajl, S.; Sabourin, R. [Ecole de Technologie Superieure, Montreal, PQ (Canada). Dept. of Construction Engineering

2005-07-01

The improvement of Variable Air Volume (VAV) system performance is one of several attempts being made to minimize the high energy use associated with the operation of heating, ventilation and air conditioning (HVAC) systems. A Simplified Optimization Process (SOP) comprised of controller set point strategies and a simplified VAV model was presented in this paper. The aim of the SOP was to determine supply set points. The advantage of the SOP over previous methods was that it did not require a detailed VAV model and optimization program. In addition, the monitored data for representative local-loop control can be checked on-line, after which controller set points can be updated in order to ensure proper operation by opting for real situations with minimum energy use. The SOP was validated using existing monitoring data and a model of an existing VAV system. Energy use simulations were compared to that of the existing VAV system. At each simulation step, 3 controller set point values were proposed and studied using the VAV model in order to select a value for each point which corresponded to the best performance of the VAV system. Simplified VAV component models were presented. Strategies for controller set points were described, including zone air temperature, duct static pressure set points; chilled water supply set points and supply air temperature set points. Simplified optimization process calculations were presented. Results indicated that the SOP provided significant energy savings when applied to specific AHU systems. In a comparison with a Detailed Optimization Process (DOP), the SOP was capable of determining set points close to those obtained by the DOP. However, it was noted that the controller set points determined by the SOP need a certain amount of time to reach optimal values when outdoor conditions or thermal loads are significantly changed. It was suggested that this disadvantage could be overcome by the use of a dynamic incremental value, which

Improving the Reliability of Optimised Link State Routing in a Smart Grid Neighbour Area Network based Wireless Mesh Network Using Multiple Metrics

Directory of Open Access Journals (Sweden)

Yakubu Tsado

2017-02-01

Full Text Available Reliable communication is the backbone of advanced metering infrastructure (AMI. Within the AMI, the neighbourhood area network (NAN transports a multitude of traffic, each with unique requirements. In order to deliver an acceptable level of reliability and latency, the underlying network, such as the wireless mesh network(WMN, must provide or guarantee the quality-of-service (QoS level required by the respective application traffic. Existing WMN routing protocols, such as optimised link state routing (OLSR, typically utilise a single metric and do not consider the requirements of individual traffic; hence, packets are delivered on a best-effort basis. This paper presents a QoS-aware WMN routing technique that employs multiple metrics in OLSR optimal path selection for AMI applications. The problems arising from this approach are non deterministic polynomial time (NP-complete in nature, which were solved through the combined use of the analytical hierarchy process (AHP algorithm and pruning techniques. For smart meters transmitting Internet Protocol (IP packets of varying sizes at different intervals, the proposed technique considers the constraints of NAN and the applications’ traffic characteristics. The technique was developed by combining multiple OLSR path selection metrics with the AHP algorithminns-2. Compared with the conventional link metric in OLSR, the results show improvements of about 23% and 45% in latency and Packet Delivery Ratio (PDR, respectively, in a 25-node grid NAN.

Analysis of parameter estimation and optimization application of ant colony algorithm in vehicle routing problem

Science.gov (United States)

Xu, Quan-Li; Cao, Yu-Wei; Yang, Kun

2018-03-01

Ant Colony Optimization (ACO) is the most widely used artificial intelligence algorithm at present. This study introduced the principle and mathematical model of ACO algorithm in solving Vehicle Routing Problem (VRP), and designed a vehicle routing optimization model based on ACO, then the vehicle routing optimization simulation system was developed by using c ++ programming language, and the sensitivity analyses, estimations and improvements of the three key parameters of ACO were carried out. The results indicated that the ACO algorithm designed in this paper can efficiently solve rational planning and optimization of VRP, and the different values of the key parameters have significant influence on the performance and optimization effects of the algorithm, and the improved algorithm is not easy to locally converge prematurely and has good robustness.

Design of Logistics Route Planning for Printing Enterprises Based on Baidu Map

Directory of Open Access Journals (Sweden)

Da Zhong-Yue

2017-01-01

Full Text Available As traditional printing industry is facing fierce competition in the market and logistics becomes a new sources of growth, the traditional printing enterprises want to build and improve their logistics system. So in this paper, the author has designed the logistics planning system based on the Baidu map development kit. It has the function of route planning and location tracking. This system meet the printing enterprise logistics route planning and tracking demand.

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)

Adaptive local routing strategy on a scale-free network

International Nuclear Information System (INIS)

Feng, Liu; Han, Zhao; Ming, Li; Yan-Bo, Zhu; Feng-Yuan, Ren

2010-01-01

Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load (packet queue length) and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated (whose queue lengths are longer than their critical queue lengths), more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies. (general)

Three routes forward for biofuels: Incremental, leapfrog, and transitional

International Nuclear Information System (INIS)

Morrison, Geoff M.; Witcover, Julie; Parker, Nathan C.; Fulton, Lew

2016-01-01

This paper examines three technology routes for lowering the carbon intensity of biofuels: (1) a leapfrog route that focuses on major technological breakthroughs in lignocellulosic pathways at new, stand-alone biorefineries; (2) an incremental route in which improvements are made to existing U.S. corn ethanol and soybean biodiesel biorefineries; and (3) a transitional route in which biotechnology firms gain experience growing, handling, or chemically converting lignocellulosic biomass in a lower-risk fashion than leapfrog biorefineries by leveraging existing capital stock. We find the incremental route is likely to involve the largest production volumes and greenhouse gas benefits until at least the mid-2020s, but transitional and leapfrog biofuels together have far greater long-term potential. We estimate that the Renewable Fuel Standard, California's Low Carbon Fuel Standard, and federal tax credits provided an incentive of roughly $1.5–2.5 per gallon of leapfrog biofuel between 2012 and 2015, but that regulatory elements in these policies mostly incentivize lower-risk incremental investments. Adjustments in policy may be necessary to bring a greater focus on transitional technologies that provide targeted learning and cost reduction opportunities for leapfrog biofuels. - Highlights: • Three technological pathways are compared that lower carbon intensity of biofuels. • Incremental changes lead to faster greenhouse gas reductions. • Leapfrog changes lead to greatest long-term potential. • Two main biofuel policies (RFS and LCFS) are largely incremental in nature. • Transitional biofuels offer medium-risk, medium reward pathway.

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

Science.gov (United States)

Zhang, Zhenjing; Ma, Maode; Jin, Zhigang

2014-12-25

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

Using simplified peer review processes to fund research: a prospective study

Science.gov (United States)

Herbert, Danielle L; Graves, Nicholas; Clarke, Philip; Barnett, Adrian G

2015-01-01

Objective To prospectively test two simplified peer review processes, estimate the agreement between the simplified and official processes, and compare the costs of peer review. Design, participants and setting A prospective parallel study of Project Grant proposals submitted in 2013 to the National Health and Medical Research Council (NHMRC) of Australia. The official funding outcomes were compared with two simplified processes using proposals in Public Health and Basic Science. The two simplified processes were: panels of 7 reviewers who met face-to-face and reviewed only the nine-page research proposal and track record (simplified panel); and 2 reviewers who independently reviewed only the nine-page research proposal (journal panel). The official process used panels of 12 reviewers who met face-to-face and reviewed longer proposals of around 100 pages. We compared the funding outcomes of 72 proposals that were peer reviewed by the simplified and official processes. Main outcome measures Agreement in funding outcomes; costs of peer review based on reviewers’ time and travel costs. Results The agreement between the simplified and official panels (72%, 95% CI 61% to 82%), and the journal and official panels (74%, 62% to 83%), was just below the acceptable threshold of 75%. Using the simplified processes would save $A2.1–$A4.9 million per year in peer review costs. Conclusions Using shorter applications and simpler peer review processes gave reasonable agreement with the more complex official process. Simplified processes save time and money that could be reallocated to actual research. Funding agencies should consider streamlining their application processes. PMID:26137884

A Routing Strategy for Non-Cooperation Wireless Multi-Hop Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Dung T. Tran

2012-01-01

Full Text Available Choosing routes such that the network lifetime is maximized in a wireless network with limited energy resources is a major routing problem in wireless multi-hop ad hoc networks. In this paper, we study the problem where participants are rationally selfish and non-cooperative. By selfish we designate the users who are ready to tamper with their source-routing (senders could choose intermediate nodes in the routing paths or next hop selection strategies in order to increase the total number of packets transmitted, but do not try to harm or drop packets of the other nodes. The problem therefore amounts to a non-cooperative game. In the works [2,6,19,23], the authors show that the game admits Nash equilibria [1]. Along this line, we first show that if the cost function is linear, this game has pure-strategy equilibrium flow even though participants have different demands. However, finding a Nash equilibrium for a normal game is computationally hard [9]. In this work, inspired by mixed-strategy equilibrium, we propose a simple local routing algorithm called MIxed Path Routing protocol (MiPR. Using analysis and simulations, we show that MiPR drives the system to an equilibrium state where selfish participants do not have incentive to deviate. Moreover, MiPR significantly improves the network lifetime as compared to original routing protocols.

Setting limits on supersymmetry using simplified models

CERN Document Server

Gutschow, C.

2012-01-01

Experimental limits on supersymmetry and similar theories are difficult to set because of the enormous available parameter space and difficult to generalize because of the complexity of single points. Therefore, more phenomenological, simplified models are becoming popular for setting experimental limits, as they have clearer physical implications. The use of these simplified model limits to set a real limit on a concrete theory has not, however, been demonstrated. This paper recasts simplified model limits into limits on a specific and complete supersymmetry model, minimal supergravity. Limits obtained under various physical assumptions are comparable to those produced by directed searches. A prescription is provided for calculating conservative and aggressive limits on additional theories. Using acceptance and efficiency tables along with the expected and observed numbers of events in various signal regions, LHC experimental results can be re-cast in this manner into almost any theoretical framework, includ...

Development of long operating cycle simplified BWR

International Nuclear Information System (INIS)

Heki, H.; Nakamaru, M.; Maruya, T.; Hiraiwa, K.; Arai, K.; Narabayash, T.; Aritomi, M.

2002-01-01

This paper describes an innovative plant concept for long operating cycle simplified BWR (LSBWR) In this plant concept, 1) Long operating cycle ( 3 to 15 years), 2) Simplified systems and building, 3) Factory fabrication in module are discussed. Designing long operating core is based on medium enriched U-235 with burnable poison. Simplified systems and building are realized by using natural circulation with bottom located core, internal CRD and PCV with passive system and an integrated reactor and turbine building. This LSBWR concept will have make high degree of safety by IVR (In Vessel Retention) capability, large water inventory above the core region and no PCV vent to the environment due to PCCS (Passive Containment Cooling System) and internal vent tank. Integrated building concept could realize highly modular arrangement in hull structure (ship frame structure), ease of seismic isolation capability and high applicability of standardization and factory fabrication. (authors)

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

Directory of Open Access Journals (Sweden)

Yifan Hu

2012-01-01

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

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

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

Simplified nuclear plant design for tomorrow's energy needs

International Nuclear Information System (INIS)

Slember, R.

1989-09-01

Commercial nuclear powered plants play an important role in the strategic energy plans of many countries throughout the world. Many energy planners agree that nuclear plants will have to supply an increasing amount of electrical energy in the 1990s and beyond. Just as other major industries are continually taking steps to update and improve existing products, the United States' nuclear industry has embarked on a program to simplify plant systems, shorten construction time and improve economics for new plant models. One of the models being developed by Westinghouse Electric Corporation and Burns and Roe Company is the Advanced Passive 600 MWe design which incorporates safety features that passively protect the reactor during assumed abnormal operating events. These passive safety systems utilize natural circulation/cooling for mitigating abnormal events and simplify plant design and operation. This type of system eliminates the need for costly active safety grade components, results in a reduction of ancillary equipment and assists in shortening construction time. The use of passive safety systems also permits design simplification of the auxiliary systems effectively reducing operating and maintenance requirements. Collectively, the AP600 design features result in a safe plant that addresses and alleviates the critical industry issues that developed in the 1980s. Further, the design addresses utility and regulatory requirements for safety, reliability, maintainability, operations and economics. Program results to date give confidence that the objectives of the Advanced Passive 600 design are achievable through overall plant simplification. The report will include timely results from the work being performed on the salient technical features of the design, plant construction and operation. Other required institutional changes, such as the prerequisite for a design which is complete and licensed prior to start of construction, will also be presented

Research on distributed QOS routing algorithm based on TCP/IP

Science.gov (United States)

Liu, Xiaoyue; Chen, Yongqiang

2011-10-01

At present, network environment follow protocol standard of IPV4 is intended to do the best effort of network to provide network applied service for users, however, not caring about service quality.Thus the packet loss rate is high, it cannot reach an ideal applied results. This article through the establishment of mathematical model, put forward a new distributed multi QOS routing algorithm, given the realization process of this distributed QOS routing algorithm, and simulation was carried out by simulation software. The results show the proposed algorithm can improve the utilization rate of network resources and the service quality of network application.

The Social Relationship Based Adaptive Multi-Spray-and-Wait Routing Algorithm for Disruption Tolerant Network

Directory of Open Access Journals (Sweden)

Jianfeng Guan

2017-01-01

Full Text Available The existing spray-based routing algorithms in DTN cannot dynamically adjust the number of message copies based on actual conditions, which results in a waste of resource and a reduction of the message delivery rate. Besides, the existing spray-based routing protocols may result in blind spots or dead end problems due to the limitation of various given metrics. Therefore, this paper proposes a social relationship based adaptive multiple spray-and-wait routing algorithm (called SRAMSW which retransmits the message copies based on their residence times in the node via buffer management and selects forwarders based on the social relationship. By these means, the proposed algorithm can remove the plight of the message congestion in the buffer and improve the probability of replicas to reach their destinations. The simulation results under different scenarios show that the SRAMSW algorithm can improve the message delivery rate and reduce the messages’ dwell time in the cache and further improve the buffer effectively.

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

Directory of Open Access Journals (Sweden)

Wei Zhang

2016-01-01

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

Simplified versus geometrically accurate models of forefoot anatomy to predict plantar pressures: A finite element study.

Science.gov (United States)

Telfer, Scott; Erdemir, Ahmet; Woodburn, James; Cavanagh, Peter R

2016-01-25

Integration of patient-specific biomechanical measurements into the design of therapeutic footwear has been shown to improve clinical outcomes in patients with diabetic foot disease. The addition of numerical simulations intended to optimise intervention design may help to build on these advances, however at present the time and labour required to generate and run personalised models of foot anatomy restrict their routine clinical utility. In this study we developed second-generation personalised simple finite element (FE) models of the forefoot with varying geometric fidelities. Plantar pressure predictions from barefoot, shod, and shod with insole simulations using simplified models were compared to those obtained from CT-based FE models incorporating more detailed representations of bone and tissue geometry. A simplified model including representations of metatarsals based on simple geometric shapes, embedded within a contoured soft tissue block with outer geometry acquired from a 3D surface scan was found to provide pressure predictions closest to the more complex model, with mean differences of 13.3kPa (SD 13.4), 12.52kPa (SD 11.9) and 9.6kPa (SD 9.3) for barefoot, shod, and insole conditions respectively. The simplified model design could be produced in 3h in the case of the more detailed model, and solved on average 24% faster. FE models of the forefoot based on simplified geometric representations of the metatarsal bones and soft tissue surface geometry from 3D surface scans may potentially provide a simulation approach with improved clinical utility, however further validity testing around a range of therapeutic footwear types is required. Copyright © 2015 Elsevier Ltd. All rights reserved.

Inventory slack routing application in emergency logistics and relief distributions.

Science.gov (United States)

Yang, Xianfeng; Hao, Wei; Lu, Yang

2018-01-01

Various natural and manmade disasters during last decades have highlighted the need of further improving on governmental preparedness to emergency events, and a relief supplies distribution problem named Inventory Slack Routing Problem (ISRP) has received increasing attentions. In an ISRP, inventory slack is defined as the duration between reliefs arriving time and estimated inventory stock-out time. Hence, a larger inventory slack could grant more responsive time in facing of various factors (e.g., traffic congestion) that may lead to delivery lateness. In this study, the relief distribution problem is formulated as an optimization model that maximize the minimum slack among all dispensing sites. To efficiently solve this problem, we propose a two-stage approach to tackle the vehicle routing and relief allocation sub-problems. By analyzing the inter-relations between these two sub-problems, a new objective function considering both delivery durations and dispensing rates of demand sites is applied in the first stage to design the vehicle routes. A hierarchical routing approach and a sweep approach are also proposed in this stage. Given the vehicle routing plan, the relief allocation could be easily solved in the second stage. Numerical experiment with a comparison of multi-vehicle Traveling Salesman Problem (TSP) has demonstrated the need of ISRP and the capability of the proposed solution approaches.

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.

Sailing Vessel Routing Considering Safety Zone and Penalty Time for Altering Course

Directory of Open Access Journals (Sweden)

Marcin Zyczkowski

2017-06-01

Full Text Available In this paper we introduce new model for simulation sea vessel routing. Besides a vessel types (polar diagram and weather forecast, travel security and the number of maneuvers are considered. Based on these data both the minimal travelling costs and the minimal processing time are found for different vessels and different routes. To test our model the applications SailingAssistance wad improved. The obtained results shows that we can obtain quite acceptable results.

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

Separation of mobile long-lived nuclides in a simplified reprocessing

International Nuclear Information System (INIS)

Fujine, Sachio; Uchiyama, Gunzo; Kihara, Takehiro; Asakura, Toshihide; Sakurai, Tsutomu

1997-01-01

Enhancing confinement efficiency of long-lived nuclides in a simplified Purex process is the primary subject of our PARC (Partitioning Conundrum Key) R and D project. Nuclides focused here are all susceptible to diffuse into the environment and highly concerned as potential hazard among the long-lived nuclides in spent fuels. New functions in PARC concept are designed to mitigate the environmental impacts of reprocessing wastes and also to improve the economy of reprocessing in the future. Experimental work has been conducted to demonstrate the feasibility of the concept. (author)

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

Energy Efficient Routing in Wireless Sensor Networks based on Ant ...

African Journals Online (AJOL)

PROF. O. E. OSUAGWU

2013-09-01

Sep 1, 2013 ... improved Ant System and their application in WSN routing process. The simulation results show ... and Mobile ad-hoc networks (MANETs) are inappropriate for ... Dorigo in 1992 in his PhD thesis, the first algorithm was aiming ...

Evacuation route planning during nuclear emergency using genetic algorithm

International Nuclear Information System (INIS)

Suman, Vitisha; Sarkar, P.K.

2012-01-01

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

Practicing more retrieval routes leads to greater memory retention.

Science.gov (United States)

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

2016-09-01

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

A Monarch Butterfly Optimization for the Dynamic Vehicle Routing Problem

Directory of Open Access Journals (Sweden)

Shifeng Chen

2017-09-01

Full Text Available The dynamic vehicle routing problem (DVRP is a variant of the Vehicle Routing Problem (VRP in which customers appear dynamically. The objective is to determine a set of routes that minimizes the total travel distance. In this paper, we propose a monarch butterfly optimization (MBO algorithm to solve DVRPs, utilizing a greedy strategy. Both migration operation and the butterfly adjusting operator only accept the offspring of butterfly individuals that have better fitness than their parents. To improve performance, a later perturbation procedure is implemented, to maintain a balance between global diversification and local intensification. The computational results indicate that the proposed technique outperforms the existing approaches in the literature for average performance by at least 9.38%. In addition, 12 new best solutions were found. This shows that this proposed technique consistently produces high-quality solutions and outperforms other published heuristics for the DVRP.

Simplified models for dark matter face their consistent completions

Energy Technology Data Exchange (ETDEWEB)

Gonçalves, Dorival; Machado, Pedro A. N.; No, Jose Miguel

2017-03-01

Simplified dark matter models have been recently advocated as a powerful tool to exploit the complementarity between dark matter direct detection, indirect detection and LHC experimental probes. Focusing on pseudoscalar mediators between the dark and visible sectors, we show that the simplified dark matter model phenomenology departs significantly from that of consistent ${SU(2)_{\\mathrm{L}} \\times U(1)_{\\mathrm{Y}}}$ gauge invariant completions. We discuss the key physics simplified models fail to capture, and its impact on LHC searches. Notably, we show that resonant mono-Z searches provide competitive sensitivities to standard mono-jet analyses at $13$ TeV LHC.

Lower Bound of Energy-Latency Tradeoff of Opportunistic Routing in Multihop Networks

Directory of Open Access Journals (Sweden)

Gorce Jean-Marie

2011-01-01

Full Text Available Opportunistic networking aims at exploiting sporadic radio links to improve the connectivity of multihop networks and to foster data transmissions. The broadcast nature of wireless channels is an important feature that can be exploited to improve transmissions by using several potential receivers. Opportunistic relaying is thus the first brick for opportunistic networking. However, the advantage of opportunistic relaying may be degraded due to energy increase related to having multiple active receivers. This paper proposes a thorough analysis of opportunistic relaying efficiency under different realistic radio channel conditions. The study is intended to find the best tradeoff between two objectives: energy and latency minimizations, with a hard reliability constraint. We derive an optimal bound, namely, the Pareto front of the related optimization problem, which offers a good insight into the benefits of opportunistic routings compared with classical multihop routing schemes. Meanwhile, the lower bound provides a framework to optimize the parameters at the physical layer, MAC layer, and routing layer from the viewpoint of cross layer during the design or planning phase of a network.

Simplified High-Power Inverter

Science.gov (United States)

Edwards, D. B.; Rippel, W. E.

1984-01-01

Solid-state inverter simplified by use of single gate-turnoff device (GTO) to commutate multiple silicon controlled rectifiers (SCR's). By eliminating conventional commutation circuitry, GTO reduces cost, size and weight. GTO commutation applicable to inverters of greater than 1-kilowatt capacity. Applications include emergency power, load leveling, drives for traction and stationary polyphase motors, and photovoltaic-power conditioning.

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.

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Holden, Jacob [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Gonder, Jeffrey D [National Renewable Energy Laboratory (NREL), Golden, CO (United States); Wood, Eric W [National Renewable Energy Laboratory (NREL), Golden, CO (United States)

2017-07-31

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigation systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.

Comparative efficacy of a simplified handwashing program for improvement in hand hygiene and reduction of school absenteeism among children with intellectual disability.

Science.gov (United States)

Lee, Regina L T; Leung, Cynthia; Tong, Wah Kun; Chen, Hong; Lee, Paul H

2015-09-01

Infectious diseases are common among schoolchildren as a result of their poor hand hygiene, especially in those who have developmental disabilities. A quasi-experimental study using a pre- to post-test design with a control group was used to test the feasibility and sustainability of simplified 5-step handwashing techniques to measure the hand hygiene outcome for students with mild intellectual disability. Sickness-related school absenteeism was compared. The intervention group experienced a significant increase in the rating of their handwashing quality in both hands from pre- to post-test: left dorsum (+1.05, P absenteeism rate (0.0167) than the control group in the same year (0.028, P = .04).Students in this study showed better performance in simplified handwashing techniques and experienced lower absenteeism than those using usual practice in special education school settings. The simplified 5-step hand hygiene technique has been proven effective in reducing the spread of infectious diseases. Copyright © 2015 Association for Professionals in Infection Control and Epidemiology, Inc. Published by Elsevier Inc. All rights reserved.

Simplified Freeman-Tukey test statistics for testing probabilities in ...

African Journals Online (AJOL)

This paper presents the simplified version of the Freeman-Tukey test statistic for testing hypothesis about multinomial probabilities in one, two and multidimensional contingency tables that does not require calculating the expected cell frequencies before test of significance. The simplified method established new criteria of ...

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

The Application of RPL Routing Protocol in Low Power Wireless Sensor and Lossy Networks

Directory of Open Access Journals (Sweden)

Xun Yang

2014-05-01

Full Text Available With the continuous development of computer information technology, wireless sensor has been successfully changed the mode of human life, at the same time, as one of the technologies continues to improve the future life, how to better integration with the RPL routing protocols together become one of research focuses in the current climate. This paper start from the wireless sensor network, briefly discusses the concept, followed by systematic exposition of RPL routing protocol developed background, relevant standards, working principle, topology and related terms, and finally explore the RPL routing protocol in wireless sensor low power lossy network applications.

A Cross-Layer Optimized Opportunistic Routing Scheme for Loss-and-Delay Sensitive WSNs

Science.gov (United States)

Xu, Xin; Yuan, Minjiao; Liu, Xiao; Cai, Zhiping; Wang, Tian

2018-01-01

In wireless sensor networks (WSNs), communication links are typically error-prone and unreliable, so providing reliable and timely data routing for loss- and delay-sensitive applications in WSNs it is a challenge issue. Additionally, with specific thresholds in practical applications, the loss and delay sensitivity implies requirements for high reliability and low delay. Opportunistic Routing (OR) has been well studied in WSNs to improve reliability for error-prone and unreliable wireless communication links where the transmission power is assumed to be identical in the whole network. In this paper, a Cross-layer Optimized Opportunistic Routing (COOR) scheme is proposed to improve the communication link reliability and reduce delay for loss-and-delay sensitive WSNs. The main contribution of the COOR scheme is making full use of the remaining energy in networks to increase the transmission power of most nodes, which will provide a higher communication reliability or further transmission distance. Two optimization strategies referred to as COOR(R) and COOR(P) of the COOR scheme are proposed to improve network performance. In the case of increasing the transmission power, the COOR(R) strategy chooses a node that has a higher communication reliability with same distance in comparison to the traditional opportunistic routing when selecting the next hop candidate node. Since the reliability of data transmission is improved, the delay of the data reaching the sink is reduced by shortening the time of communication between candidate nodes. On the other hand, the COOR(P) strategy prefers a node that has the same communication reliability with longer distance. As a result, network performance can be improved for the following reasons: (a) the delay is reduced as fewer hops are needed while the packet reaches the sink in longer transmission distance circumstances; (b) the reliability can be improved since it is the product of the reliability of every hop of the routing path

A Cross-Layer Optimized Opportunistic Routing Scheme for Loss-and-Delay Sensitive WSNs.

Science.gov (United States)

Xu, Xin; Yuan, Minjiao; Liu, Xiao; Liu, Anfeng; Xiong, Neal N; Cai, Zhiping; Wang, Tian

2018-05-03

In wireless sensor networks (WSNs), communication links are typically error-prone and unreliable, so providing reliable and timely data routing for loss- and delay-sensitive applications in WSNs it is a challenge issue. Additionally, with specific thresholds in practical applications, the loss and delay sensitivity implies requirements for high reliability and low delay. Opportunistic Routing (OR) has been well studied in WSNs to improve reliability for error-prone and unreliable wireless communication links where the transmission power is assumed to be identical in the whole network. In this paper, a Cross-layer Optimized Opportunistic Routing (COOR) scheme is proposed to improve the communication link reliability and reduce delay for loss-and-delay sensitive WSNs. The main contribution of the COOR scheme is making full use of the remaining energy in networks to increase the transmission power of most nodes, which will provide a higher communication reliability or further transmission distance. Two optimization strategies referred to as COOR(R) and COOR(P) of the COOR scheme are proposed to improve network performance. In the case of increasing the transmission power, the COOR(R) strategy chooses a node that has a higher communication reliability with same distance in comparison to the traditional opportunistic routing when selecting the next hop candidate node. Since the reliability of data transmission is improved, the delay of the data reaching the sink is reduced by shortening the time of communication between candidate nodes. On the other hand, the COOR(P) strategy prefers a node that has the same communication reliability with longer distance. As a result, network performance can be improved for the following reasons: (a) the delay is reduced as fewer hops are needed while the packet reaches the sink in longer transmission distance circumstances; (b) the reliability can be improved since it is the product of the reliability of every hop of the routing path

A Cross-Layer Optimized Opportunistic Routing Scheme for Loss-and-Delay Sensitive WSNs

Directory of Open Access Journals (Sweden)

Xin Xu

2018-05-01

Full Text Available In wireless sensor networks (WSNs, communication links are typically error-prone and unreliable, so providing reliable and timely data routing for loss- and delay-sensitive applications in WSNs it is a challenge issue. Additionally, with specific thresholds in practical applications, the loss and delay sensitivity implies requirements for high reliability and low delay. Opportunistic Routing (OR has been well studied in WSNs to improve reliability for error-prone and unreliable wireless communication links where the transmission power is assumed to be identical in the whole network. In this paper, a Cross-layer Optimized Opportunistic Routing (COOR scheme is proposed to improve the communication link reliability and reduce delay for loss-and-delay sensitive WSNs. The main contribution of the COOR scheme is making full use of the remaining energy in networks to increase the transmission power of most nodes, which will provide a higher communication reliability or further transmission distance. Two optimization strategies referred to as COOR(R and COOR(P of the COOR scheme are proposed to improve network performance. In the case of increasing the transmission power, the COOR(R strategy chooses a node that has a higher communication reliability with same distance in comparison to the traditional opportunistic routing when selecting the next hop candidate node. Since the reliability of data transmission is improved, the delay of the data reaching the sink is reduced by shortening the time of communication between candidate nodes. On the other hand, the COOR(P strategy prefers a node that has the same communication reliability with longer distance. As a result, network performance can be improved for the following reasons: (a the delay is reduced as fewer hops are needed while the packet reaches the sink in longer transmission distance circumstances; (b the reliability can be improved since it is the product of the reliability of every hop of the

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.

Enhanced ant colony optimization for inventory routing problem

Science.gov (United States)

Wong, Lily; Moin, Noor Hasnah

2015-10-01

The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

Reliable Freestanding Position-Based Routing in Highway Scenarios

Science.gov (United States)

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

2012-01-01

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

Simplified pipe gun

International Nuclear Information System (INIS)

Sorensen, H.; Nordskov, A.; Sass, B.; Visler, T.

1987-01-01

A simplified version of a deuterium pellet gun based on the pipe gun principle is described. The pipe gun is made from a continuous tube of stainless steel and gas is fed in from the muzzle end only. It is indicated that the pellet length is determined by the temperature gradient along the barrel right outside the freezing cell. Velocities of around 1000 m/s with a scatter of +- 2% are obtained with a propellant gas pressure of 40 bar

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

Science.gov (United States)

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

2018-01-01

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

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

Science.gov (United States)

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

2018-01-01

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

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

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.

Improvement of dose evaluation system for employees at severe accident in a nuclear power plant. Introduction of the dose rate conversion coefficient and addition of the access route edit function

International Nuclear Information System (INIS)

Sasaki, Yasuhiro; Minami, Noritoshi; Yoshida, Yoshitaka

2006-01-01

Institute of Nuclear Safety System, Inc. had developed the dose evaluation system to evaluate the radiation dose of employees at severe accident in a nuclear power plant. This system has features, which are (1) the dose rate of any evaluation point can be evaluated, (2) the dose rate at any time can be evaluated in consideration of the change in the radioactive source, (3) the dose rate map in the plant can be displayed (4) the dose along the access route when moving can be evaluated, and it is possible to use it for examination of the accident management guideline on the dose side etc.. To upgrade the dose evaluation function of this system, the improvements had been done which were introduction of the dose rate conversion coefficient and addition of the access route edit function. By introducing the dose rate conversion coefficient, the calculation time of the dose rate map in the plant was shortened at about 20 seconds, and a new function to evaluate time-dependent dose rate of any evaluation point was added. By adding the access route edit function, it became possible to re-calculate the dose easily at the route change. (author)

An Adaptive QoS Routing Solution for MANET Based Multimedia Communications in Emergency Cases

Science.gov (United States)

Ramrekha, Tipu Arvind; Politis, Christos

The Mobile Ad hoc Networks (MANET) is a wireless network deprived of any fixed central authoritative routing entity. It relies entirely on collaborating nodes forwarding packets from source to destination. This paper describes the design, implementation and performance evaluation of CHAMELEON, an adaptive Quality of Service (QoS) routing solution, with improved delay and jitter performances, enabling multimedia communication for MANETs in extreme emergency situations such as forest fire and terrorist attacks as defined in the PEACE project. CHAMELEON is designed to adapt its routing behaviour according to the size of a MANET. The reactive Ad Hoc on-Demand Distance Vector Routing (AODV) and proactive Optimized Link State Routing (OLSR) protocols are deemed appropriate for CHAMELEON through their performance evaluation in terms of delay and jitter for different MANET sizes in a building fire emergency scenario. CHAMELEON is then implemented in NS-2 and evaluated similarly. The paper concludes with a summary of findings so far and intended future work.

Simplified Models for Dark Matter Searches at the LHC

CERN Document Server

Abdallah, Jalal; Arbey, Alexandre; Ashkenazi, Adi; Belyaev, Alexander; Berger, Joshua; Boehm, Celine; Boveia, Antonio; Brennan, Amelia; Brooke, Jim; Buchmueller, Oliver; Buckley, Matthew; Busoni, Giorgio; Calibbi, Lorenzo; Chauhan, Sushil; Daci, Nadir; Davies, Gavin; De Bruyn, Isabelle; de Jong, Paul; De Roeck, Albert; de Vries, Kees; del Re, Daniele; De Simone, Andrea; Di Simone, Andrea; Doglioni, Caterina; Dolan, Matthew; Dreiner, Herbi K.; Ellis, John; Eno, Sarah; Etzion, Erez; Fairbairn, Malcolm; Feldstein, Brian; Flaecher, Henning; Feng, Eric; Fox, Patrick; Genest, Marie-Hélène; Gouskos, Loukas; Gramling, Johanna; Haisch, Ulrich; Harnik, Roni; Hibbs, Anthony; Hoh, Siewyan; Hopkins, Walter; Ippolito, Valerio; Jacques, Thomas; Kahlhoefer, Felix; Khoze, Valentin V.; Kirk, Russell; Korn, Andreas; Kotov, Khristian; Kunori, Shuichi; Landsberg, Greg; Liem, Sebastian; Lin, Tongyan; Lowette, Steven; Lucas, Robyn; Malgeri, Luca; Malik, Sarah; McCabe, Christopher; Mete, Alaettin Serhan; Morgante, Enrico; Mrenna, Stephen; Nakahama, Yu; Newbold, Dave; Nordstrom, Karl; Pani, Priscilla; Papucci, Michele; Pataraia, Sophio; Penning, Bjoern; Pinna, Deborah; Polesello, Giacomo; Racco, Davide; Re, Emanuele; Riotto, Antonio Walter; Rizzo, Thomas; Salek, David; Sarkar, Subir; Schramm, Steven; Skubic, Patrick; Slone, Oren; Smirnov, Juri; Soreq, Yotam; Sumner, Timothy; Tait, Tim M.P.; Thomas, Marc; Tomalin, Ian; Tunnell, Christopher; Vichi, Alessandro; Volansky, Tomer; Weiner, Neal; West, Stephen M.; Wielers, Monika; Worm, Steven; Yavin, Itay; Zaldivar, Bryan; Zhou, Ning; Zurek, Kathryn

2015-01-01

This document outlines a set of simplified models for dark matter and its interactions with Standard Model particles. It is intended to summarize the main characteristics that these simplified models have when applied to dark matter searches at the LHC, and to provide a number of useful expressions for reference. The list of models includes both s-channel and t-channel scenarios. For s-channel, spin-0 and spin-1 mediation is discussed, and also realizations where the Higgs particle provides a portal between the dark and visible sectors. The guiding principles underpinning the proposed simplified models are spelled out, and some suggestions for implementation are presented.

Simplified models for dark matter searches at the LHC

Energy Technology Data Exchange (ETDEWEB)

Abdallah, Jalal; Araujo, Henrique; Arbey, Alexandre; Ashkenazi, Adi; Belyaev, Alexander; Berger, Joshua; Boehm, Celine; Boveia, Antonio; Brennan, Amelia; Brooke, Jim; Buchmueller, Oliver; Buckley, Matthew; Busoni, Giorgio; Calibbi, Lorenzo; Chauhan, Sushil; Daci, Nadir; Davies, Gavin; De Bruyn, Isabelle; De Jong, Paul; De Roeck, Albert; de Vries, Kees; Del Re, Daniele; De Simone, Andrea; Di Simone, Andrea; Doglioni, Caterina; Dolan, Matthew; Dreiner, Herbi K.; Ellis, John; Eno, Sarah; Etzion, Erez; Fairbairn, Malcolm; Feldstein, Brian; Flaecher, Henning; Feng, Eric; Fox, Patrick; Genest, Marie-Hélène; Gouskos, Loukas; Gramling, Johanna; Haisch, Ulrich; Harnik, Roni; Hibbs, Anthony; Hoh, Siewyan; Hopkins, Walter; Ippolito, Valerio; Jacques, Thomas; Kahlhoefer, Felix; Khoze, Valentin V.; Kirk, Russell; Korn, Andreas; Kotov, Khristian; Kunori, Shuichi; Landsberg, Greg; Liem, Sebastian; Lin, Tongyan; Lowette, Steven; Lucas, Robyn; Malgeri, Luca; Malik, Sarah; McCabe, Christopher; Mete, Alaettin Serhan; Morgante, Enrico; Mrenna, Stephen; Nakahama, Yu; Newbold, Dave; Nordstrom, Karl; Pani, Priscilla; Papucci, Michele; Pataraia, Sophio; Penning, Bjoern; Pinna, Deborah; Polesello, Giacomo; Racco, Davide; Re, Emanuele; Riotto, Antonio Walter; Rizzo, Thomas; Salek, David; Sarkar, Subir; Schramm, Steven; Skubic, Patrick; Slone, Oren; Smirnov, Juri; Soreq, Yotam; Sumner, Timothy; Tait, Tim M. P.; Thomas, Marc; Tomalin, Ian; Tunnell, Christopher; Vichi, Alessandro; Volansky, Tomer; Weiner, Neal; West, Stephen M.; Wielers, Monika; Worm, Steven; Yavin, Itay; Zaldivar, Bryan; Zhou, Ning; Zurek, Kathryn

2015-09-01

This document a outlines a set of simplified models for dark matter and its interactions with Standard Model particles. It is intended to summarize the main characteristics that these simplified models have when applied to dark matter searches at the LHC, and to provide a number of useful expressions for reference. The list of models includes both s-channel and t-channel scenarios. For s-channel, spin-0 and spin-1 mediations are discussed, and also realizations where the Higgs particle provides a portal between the dark and visible sectors. The guiding principles underpinning the proposed simplified models are spelled out, and some suggestions for implementation are presented.

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.

20 CFR 404.241 - 1977 simplified old-start method.

Science.gov (United States)

2010-04-01

... 20 Employees' Benefits 2 2010-04-01 2010-04-01 false 1977 simplified old-start method. 404.241... DISABILITY INSURANCE (1950- ) Computing Primary Insurance Amounts Old-Start Method of Computing Primary Insurance Amounts § 404.241 1977 simplified old-start method. (a) Who is qualified. To qualify for the old...

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

Effective ANT based Routing Algorithm for Data Replication in MANETs

Directory of Open Access Journals (Sweden)

N.J. Nithya Nandhini

2013-12-01

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

Route Instruction Mechanism for Mobile Users Leveraging Distributed Wireless Resources

Science.gov (United States)

Kakehi, Takeshi; Shinkuma, Ryoichi; Murase, Tutomu; Motoyoshi, Gen; Yamori, Kyoko; Takahashi, Tatsuro

The market growths of smart-phones and thin clients have been significantly increasing communication traffic in mobile networks. To handle the increased traffic, network operators should consider how to leverage distributed wireless resources such as distributed spots of wireless local access networks. In this paper, we consider the system where multiple moving users share distributed wireless access points on their traveling routes between their start and goal points and formulate as an optimization problem. Then, we come up with three algorithms as a solution for the problem. The key idea here is ‘longcut route instruction’, in which users are instructed to choose a traveling route where less congested access points are available; even if the moving distance increases, the throughput for users in the system would improve. In this paper, we define the gain function. Moreover, we analyze the basic characteristics of the system using as a simple model as possible.

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.

Joint optimization of physical layer parameters and routing in wireless mesh networks

KAUST Repository

Tobagi, Fouad A.

2010-06-01

used by routing is higher. Among all data rates, one particular data rate results in the best network performance at the corresponding optimum ED threshold. Finally, we find that adjusting the transmit power downwards for shorter links results in an improvement of about 15%, while adjusting the data rate upward on shorter links results in a rather modest improvement. ©2010 IEEE.

Joint optimization of physical layer parameters and routing in wireless mesh networks

KAUST Repository

Tobagi, Fouad A.; Hira, Mukesh M.

2010-01-01

used by routing is higher. Among all data rates, one particular data rate results in the best network performance at the corresponding optimum ED threshold. Finally, we find that adjusting the transmit power downwards for shorter links results in an improvement of about 15%, while adjusting the data rate upward on shorter links results in a rather modest improvement. ©2010 IEEE.

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

GRAdient Cost Establishment (GRACE for an Energy-Aware Routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Noor M. Khan

2009-01-01

Full Text Available In Wireless Sensor Network (WSN, the nodes have limitations in terms of energy-constraint, unreliable links, and frequent topology change. In this paper we propose an energy-aware routing protocol, that outperforms the existing ones with an enhanced network lifetime and more reliable data delivery. Major issues in the design of a routing strategy in wireless sensor networks are to make efficient use of energy and to increase reliability in data delivery. The proposed approach reduces both energy consumption and communication-bandwidth requirements and prolongs the lifetime of the wireless sensor network. Using both analysis and extensive simulations, we show that the proposed dynamic routing helps achieve the desired system performance under dynamically changing network conditions. The proposed algorithm is compared with one of the best existing routing algorithms, GRAB. Moreover, a modification in GRAB is proposed which not only improves its performance but also prolongs its lifetime.

A Simplified Technique of Percutaneous Hepatic Artery Port-Catheter Insertion for the Treatment of Advanced Hepatocellular Carcinoma with Portal Vein Invasion

Energy Technology Data Exchange (ETDEWEB)

Choi, Sun Young [Hallym University Sacred Heart Hospital, Anyang (Korea, Republic of); Kim, Ah Hyun; Lee, Do Yun; Lee, Kwang Hun; Won, Jong Yun [Yonsei University College of Medicine, Severance Hospital, Seoul (Korea, Republic of); Kim, Kyung Ah [Inje University Ilsan Paik Hospital, Ilsan (Korea, Republic of)

2010-12-15

We assessed the outcomes of a simplified technique for the percutaneous placement of a hepatic artery port-catheter system for chemotherapy infusion in advanced hepatocellular carcinoma with portal vein invasion. From February 2003 to February 2008, percutaneous hepatic artery port-catheter insertion was performed in 122 patients who had hepatocellular carcinoma with portal vein invasion. The arterial access route was the common femoral artery. The tip of the catheter was wedged into the right gastroepiploic artery without an additional fixation device. A side hole was positioned at the distal common hepatic artery to allow the delivery of chemotherapeutic agents into the hepatic arteries. Coil embolization was performed only to redistribute to the hepatic arteries or to prevent the inadvertent delivery of chemotherapeutic agents into extrahepatic arteries. The port chamber was created at either the supra-inguinal or infra-inguinal region. Technical success was achieved in all patients. Proper positioning of the side hole was checked before each scheduled chemotherapy session by port angiography. Catheter-related complications occurred in 19 patients (16%). Revision was achieved in 15 of 18 patients (83%). This simplified method demonstrates excellent technical feasibility, an acceptable range of complications, and is hence recommended for the management of advanced hepatocellular carcinoma with portal vein thrombosis

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.

Green Routing Fuel Saving Opportunity Assessment: A Case Study on California Large-Scale Real-World Travel Data: Preprint

Energy Technology Data Exchange (ETDEWEB)

Zhu, Lei; Holden, Jacob; Gonder, Jeff; Wood, Eric

2017-07-13

New technologies, such as connected and automated vehicles, have attracted more and more researchers for improving the energy efficiency and environmental impact of current transportation systems. The green routing strategy instructs a vehicle to select the most fuel-efficient route before the vehicle departs. It benefits the current transportation system with fuel saving opportunity through identifying the greenest route. This paper introduces an evaluation framework for estimating benefits of green routing based on large-scale, real-world travel data. The framework has the capability to quantify fuel savings by estimating the fuel consumption of actual routes and comparing to routes procured by navigation systems. A route-based fuel consumption estimation model, considering road traffic conditions, functional class, and road grade is proposed and used in the framework. An experiment using a large-scale data set from the California Household Travel Survey global positioning system trajectory data base indicates that 31% of actual routes have fuel savings potential with a cumulative estimated fuel savings of 12%.

Thermally Activated Delayed Fluorescence in Polymers: A New Route toward Highly Efficient Solution Processable OLEDs.

Science.gov (United States)

Nikolaenko, Andrey E; Cass, Michael; Bourcet, Florence; Mohamad, David; Roberts, Matthew

2015-11-25

Efficient intermonomer thermally activated delayed fluorescence is demonstrated for the first time, opening a new route to achieving high-efficiency solution processable polymer light-emitting device materials. External quantum efficiency (EQE) of up to 10% is achieved in a simple fully solution-processed device structure, and routes for further EQE improvement identified. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

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.

Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics

DEFF Research Database (Denmark)

Scholz, Jan Carsten; Greiner, Martin

2011-01-01

The transport capacity of Internet-like communication networks and hence their efficiency may be improved by a factor of 5–10 through the use of highly optimized routing metrics, as demonstrated previously. The numerical determination of such routing metrics can be computationally demanding...... to an extent that prohibits both investigation of and application to very large networks. In an attempt to find a numerically less expensive way of constructing a metric with a comparable performance increase, we propose a local, self-organizing iteration scheme and find two surprisingly simple and efficient...... metrics. The new metrics have negligible computational cost and result in an approximately 5-fold performance increase, providing distinguished competitiveness with the computationally costly counterparts. They are applicable to very large networks and easy to implement in today's Internet routing...

Communication: A simplified coupled-cluster Lagrangian for polarizable embedding.

Science.gov (United States)

Krause, Katharina; Klopper, Wim

2016-01-28

A simplified coupled-cluster Lagrangian, which is linear in the Lagrangian multipliers, is proposed for the coupled-cluster treatment of a quantum mechanical system in a polarizable environment. In the simplified approach, the amplitude equations are decoupled from the Lagrangian multipliers and the energy obtained from the projected coupled-cluster equation corresponds to a stationary point of the Lagrangian.

Communication: A simplified coupled-cluster Lagrangian for polarizable embedding

International Nuclear Information System (INIS)

Krause, Katharina; Klopper, Wim

2016-01-01

A simplified coupled-cluster Lagrangian, which is linear in the Lagrangian multipliers, is proposed for the coupled-cluster treatment of a quantum mechanical system in a polarizable environment. In the simplified approach, the amplitude equations are decoupled from the Lagrangian multipliers and the energy obtained from the projected coupled-cluster equation corresponds to a stationary point of the Lagrangian

Development of technologies on innovative-simplified nuclear power plant using high-efficiency steam injectors. (2) Analysis of heat balance of innovative-simplified nuclear power plant

International Nuclear Information System (INIS)

Goto, Shoji; Ohmori, Shuichi; Mori, Mitchitsugu

2004-01-01

It is possible to established simplified systems and reduced space and equipments using high-efficiency Steam Injector (SI) instead of low-pressure feed water heaters in Nuclear Power Plant (NPP). The SI works as a heat exchanger through direct contact between feedwater from condenser and extracted steam from turbine. It can get a higher pressure than supplied steam pressure, so it can reduce the feedwater pumps. The maintenance and reliability are still higher because SI has no movable parts. This paper describes the analysis of the heat balance and plant efficiency of this Innovative-Simplified NPP with high-efficiency SI. The plant efficiency is compared with the electric power of 1100MWe class original BWR system and the Innovative-Simplified BWR system with SI. The SI model is adapted into the heat balance simulator with a simplified model. The results show plant efficiencies of the Innovated-Simplified BWR system are almost equal to the original BWR one. The present research is one of the projects that are carried out by Tokyo Electric Power Company, Toshiba Corporation, and six Universities in Japan, funded from the Institute of Applied Energy (IAE) of Japan as the national public research-funded program. (author)

Distribution Route Planning of Clean Coal Based on Nearest Insertion Method

Science.gov (United States)

Wang, Yunrui

2018-01-01

Clean coal technology has made some achievements for several ten years, but the research in its distribution field is very small, the distribution efficiency would directly affect the comprehensive development of clean coal technology, it is the key to improve the efficiency of distribution by planning distribution route rationally. The object of this paper was a clean coal distribution system which be built in a county. Through the surveying of the customer demand and distribution route, distribution vehicle in previous years, it was found that the vehicle deployment was only distributed by experiences, and the number of vehicles which used each day changed, this resulted a waste of transport process and an increase in energy consumption. Thus, the mathematical model was established here in order to aim at shortest path as objective function, and the distribution route was re-planned by using nearest-insertion method which been improved. The results showed that the transportation distance saved 37 km and the number of vehicles used had also been decreased from the past average of 5 to fixed 4 every day, as well the real loading of vehicles increased by 16.25% while the current distribution volume staying same. It realized the efficient distribution of clean coal, achieved the purpose of saving energy and reducing consumption.

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

Analog integrated circuit design automation placement, routing and parasitic extraction techniques

CERN Document Server

Martins, Ricardo; Horta, Nuno

2017-01-01

This book introduces readers to a variety of tools for analog layout design automation. After discussing the placement and routing problem in electronic design automation (EDA), the authors overview a variety of automatic layout generation tools, as well as the most recent advances in analog layout-aware circuit sizing. The discussion includes different methods for automatic placement (a template-based Placer and an optimization-based Placer), a fully-automatic Router and an empirical-based Parasitic Extractor. The concepts and algorithms of all the modules are thoroughly described, enabling readers to reproduce the methodologies, improve the quality of their designs, or use them as starting point for a new tool. All the methods described are applied to practical examples for a 130nm design process, as well as placement and routing benchmark sets. Introduces readers to hierarchical combination of Pareto fronts of placements; Presents electromigration-aware routing with multilayer multiport terminal structures...

The Effect of a Simplified English Language Dictionary on a Reading Test. LEP Projects Report 1.

Science.gov (United States)

Albus, Deb; Bielinski, John; Thurlow, Martha; Liu, Kristin

This study was conducted to examine whether using a monolingual, simplified English dictionary as an accommodation on a reading test with limited-English-proficient (LEP) Hmong students improved test performance. Hmong students were chosen because they are often not literate in their first language. For these students, bilingual dictionaries are…

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

Boron nitride nanoparticle enhanced prepregs: A novel route for manufacturing aerospace structural composite laminate

Energy Technology Data Exchange (ETDEWEB)

Kelkar, Ajit D., E-mail: kelkar@ncat.edu [Joint School of Nanoscience and Nanoengineering, North Carolina Agricultural and Technical State University, Greensboro, NC, 27401 (United States); Tian, Qiong [Joint School of Nanoscience and Nanoengineering, North Carolina Agricultural and Technical State University, Greensboro, NC, 27401 (United States); School of Science, Xi' an Jiaotong University, Xi' an, 710049 (China); Yu, Demei [School of Science, Xi' an Jiaotong University, Xi' an, 710049 (China); Zhang, Lifeng, E-mail: lzhang@ncat.edu [Joint School of Nanoscience and Nanoengineering, North Carolina Agricultural and Technical State University, Greensboro, NC, 27401 (United States)

2016-06-15

Boron nitride nanoparticles (BNNPs) were surface functionalized and subsequently applied to surface of fiberglass prepregs to fabricate hybrid BNNPs/fiberglass/epoxy composite laminate. A systematic and comparative study on BNNPs functionalization routes and their effects on morphology, mechanical property and thermal conductivity of final BNNPs enhanced composite laminates was performed. The functionalized BNNPs were characterized by Fourier-transform infrared spectroscopy (FT-IR), thermogravimetric analysis (TGA), and scanning electron microscopy (SEM). The composite laminates with surface functionalized BNNPs demonstrated improvement in tensile and flexural strength and modulus as well as in thermal conductivity compared to the composite laminate with pristine BNNPs while physically functionalized BNNPs outperformed chemically functionalized BNNPs in all cases. SEM images indicated better compatibility and dispersion of BNNPs in epoxy matrix following either of functionalization route. BNNPs bear great radiation-shielding capability. This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials. - Highlights: • BNNPs were surface functionalized and applied onto fiberglass prepreg. • The BNNPs enhanced prepreg was employed to make hybrid BNNPs/fiberglass/epoxy composite laminate. • The hybrid laminate presented significant improvement in mechanical strength and thermal conductivity. • This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials.

Boron nitride nanoparticle enhanced prepregs: A novel route for manufacturing aerospace structural composite laminate

International Nuclear Information System (INIS)

Kelkar, Ajit D.; Tian, Qiong; Yu, Demei; Zhang, Lifeng

2016-01-01

Boron nitride nanoparticles (BNNPs) were surface functionalized and subsequently applied to surface of fiberglass prepregs to fabricate hybrid BNNPs/fiberglass/epoxy composite laminate. A systematic and comparative study on BNNPs functionalization routes and their effects on morphology, mechanical property and thermal conductivity of final BNNPs enhanced composite laminates was performed. The functionalized BNNPs were characterized by Fourier-transform infrared spectroscopy (FT-IR), thermogravimetric analysis (TGA), and scanning electron microscopy (SEM). The composite laminates with surface functionalized BNNPs demonstrated improvement in tensile and flexural strength and modulus as well as in thermal conductivity compared to the composite laminate with pristine BNNPs while physically functionalized BNNPs outperformed chemically functionalized BNNPs in all cases. SEM images indicated better compatibility and dispersion of BNNPs in epoxy matrix following either of functionalization route. BNNPs bear great radiation-shielding capability. This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials. - Highlights: • BNNPs were surface functionalized and applied onto fiberglass prepreg. • The BNNPs enhanced prepreg was employed to make hybrid BNNPs/fiberglass/epoxy composite laminate. • The hybrid laminate presented significant improvement in mechanical strength and thermal conductivity. • This investigation revealed a novel and industrially feasible route to incorporate BNNPs in aerospace structural materials.

Discrete Particle Swarm Optimization Routing Protocol for Wireless Sensor Networks with Multiple Mobile Sinks.

Science.gov (United States)

Yang, Jin; Liu, Fagui; Cao, Jianneng; Wang, Liangming

2016-07-14

Mobile sinks can achieve load-balancing and energy-consumption balancing across the wireless sensor networks (WSNs). However, the frequent change of the paths between source nodes and the sinks caused by sink mobility introduces significant overhead in terms of energy and packet delays. To enhance network performance of WSNs with mobile sinks (MWSNs), we present an efficient routing strategy, which is formulated as an optimization problem and employs the particle swarm optimization algorithm (PSO) to build the optimal routing paths. However, the conventional PSO is insufficient to solve discrete routing optimization problems. Therefore, a novel greedy discrete particle swarm optimization with memory (GMDPSO) is put forward to address this problem. In the GMDPSO, particle's position and velocity of traditional PSO are redefined under discrete MWSNs scenario. Particle updating rule is also reconsidered based on the subnetwork topology of MWSNs. Besides, by improving the greedy forwarding routing, a greedy search strategy is designed to drive particles to find a better position quickly. Furthermore, searching history is memorized to accelerate convergence. Simulation results demonstrate that our new protocol significantly improves the robustness and adapts to rapid topological changes with multiple mobile sinks, while efficiently reducing the communication overhead and the energy consumption.

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model

Directory of Open Access Journals (Sweden)

Yi Yang

2014-01-01

Full Text Available This paper mainly focuses on routing in two-dimensional mesh networks. We propose a novel faulty block model, which is cracky rectangular block, for fault-tolerant adaptive routing. All the faulty nodes and faulty links are surrounded in this type of block, which is a convex structure, in order to avoid routing livelock. Additionally, the model constructs the interior spanning forest for each block in order to keep in touch with the nodes inside of each block. The procedure for block construction is dynamically and totally distributed. The construction algorithm is simple and ease of implementation. And this is a fully adaptive block which will dynamically adjust its scale in accordance with the situation of networks, either the fault emergence or the fault recovery, without shutdown of the system. Based on this model, we also develop a distributed fault-tolerant routing algorithm. Then we give the formal proof for this algorithm to guarantee that messages will always reach their destinations if and only if the destination nodes keep connecting with these mesh networks. So the new model and routing algorithm maximize the availability of the nodes in networks. This is a noticeable overall improvement of fault tolerability of the system.

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

Stochastic time-dependent vehicle routing problem: Mathematical models and ant colony algorithm

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

Full Text Available This article addresses the stochastic time-dependent vehicle routing problem. Two mathematical models named robust optimal schedule time model and minimum expected schedule time model are proposed for stochastic time-dependent vehicle routing problem, which can guarantee delivery within the time windows of customers. The robust optimal schedule time model only requires the variation range of link travel time, which can be conveniently derived from historical traffic data. In addition, the robust optimal schedule time model based on robust optimization method can be converted into a time-dependent vehicle routing problem. Moreover, an ant colony optimization algorithm is designed to solve stochastic time-dependent vehicle routing problem. As the improvements in initial solution and transition probability, ant colony optimization algorithm has a good performance in convergence. Through computational instances and Monte Carlo simulation tests, robust optimal schedule time model is proved to be better than minimum expected schedule time model in computational efficiency and coping with the travel time fluctuations. Therefore, robust optimal schedule time model is applicable in real road network.

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,

Optical chirp z-transform processor with a simplified architecture.

Science.gov (United States)

Ngo, Nam Quoc

2014-12-29

Using a simplified chirp z-transform (CZT) algorithm based on the discrete-time convolution method, this paper presents the synthesis of a simplified architecture of a reconfigurable optical chirp z-transform (OCZT) processor based on the silica-based planar lightwave circuit (PLC) technology. In the simplified architecture of the reconfigurable OCZT, the required number of optical components is small and there are no waveguide crossings which make fabrication easy. The design of a novel type of optical discrete Fourier transform (ODFT) processor as a special case of the synthesized OCZT is then presented to demonstrate its effectiveness. The designed ODFT can be potentially used as an optical demultiplexer at the receiver of an optical fiber orthogonal frequency division multiplexing (OFDM) transmission system.

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

Directory of Open Access Journals (Sweden)

Bendaoud Zakaria

2014-12-01

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

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

Quality-of-Service Routing Using Path and Power Aware Techniques in Mobile Ad Hoc Networks

Directory of Open Access Journals (Sweden)

R. Asokan

2008-01-01

Full Text Available Mobile ad hoc network (MANET is a collection of wireless mobile hosts dynamically forming a temporary network without the aid of any existing established infrastructure. Quality of service (QoS is a set of service requirements that needs to be met by the network while transporting a packet stream from a source to its destination. QoS support MANETs is a challenging task due to the dynamic topology and limited resources. The main objective of this paper is to enhance the QoS routing for MANET using temporally ordered routing algorithm (TORA with self-healing and optimized routing techniques (SHORT. SHORT improves routing optimality by monitoring routing paths continuously and redirecting the path whenever a shortcut path is available. In this paper, the performance comparison of TORA and TORA with SHORT has been analyzed using network simulator for various parameters. TORA with SHORT enhances performance of TORA in terms of throughput, packet loss, end-to-end delay, and energy.

Wavelength converter placement for different RWA algorithms in wavelength-routed all-optical networks

Science.gov (United States)

Chu, Xiaowen; Li, Bo; Chlamtac, Imrich

2002-07-01

Sparse wavelength conversion and appropriate routing and wavelength assignment (RWA) algorithms are the two key factors in improving the blocking performance in wavelength-routed all-optical networks. It has been shown that the optimal placement of a limited number of wavelength converters in an arbitrary mesh network is an NP complete problem. There have been various heuristic algorithms proposed in the literature, in which most of them assume that a static routing and random wavelength assignment RWA algorithm is employed. However, the existing work shows that fixed-alternate routing and dynamic routing RWA algorithms can achieve much better blocking performance. Our study in this paper further demonstrates that the wavelength converter placement and RWA algorithms are closely related in the sense that a well designed wavelength converter placement mechanism for a particular RWA algorithm might not work well with a different RWA algorithm. Therefore, the wavelength converter placement and the RWA have to be considered jointly. The objective of this paper is to investigate the wavelength converter placement problem under fixed-alternate routing algorithm and least-loaded routing algorithm. Under the fixed-alternate routing algorithm, we propose a heuristic algorithm called Minimum Blocking Probability First (MBPF) algorithm for wavelength converter placement. Under the least-loaded routing algorithm, we propose a heuristic converter placement algorithm called Weighted Maximum Segment Length (WMSL) algorithm. The objective of the converter placement algorithm is to minimize the overall blocking probability. Extensive simulation studies have been carried out over three typical mesh networks, including the 14-node NSFNET, 19-node EON and 38-node CTNET. We observe that the proposed algorithms not only outperform existing wavelength converter placement algorithms by a large margin, but they also can achieve almost the same performance comparing with full wavelength

Simplified distributed parameters BWR dynamic model for transient and stability analysis

International Nuclear Information System (INIS)

Espinosa-Paredes, Gilberto; Nunez-Carrera, Alejandro; Vazquez-Rodriguez, Alejandro

2006-01-01

This paper describes a simplified model to perform transient and linear stability analysis for a typical boiling water reactor (BWR). The simplified transient model was based in lumped and distributed parameters approximations, which includes vessel dome and the downcomer, recirculation loops, neutron process, fuel pin temperature distribution, lower and upper plenums reactor core and pressure and level controls. The stability was determined by studying the linearized versions of the equations representing the BWR system in the frequency domain. Numerical examples are used to illustrate the wide application of the simplified BWR model. We concluded that this simplified model describes properly the dynamic of a BWR and can be used for safety analysis or as a first approach in the design of an advanced BWR

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.

Simplified Perovskite Solar Cell with 4.1% Efficiency Employing Inorganic CsPbBr3 as Light Absorber.

Science.gov (United States)

Duan, Jialong; Zhao, Yuanyuan; He, Benlin; Tang, Qunwei

2018-04-17

Perovskite solar cells with cost-effectiveness, high power conversion efficiency, and improved stability are promising solutions to the energy crisis and environmental pollution. However, a wide-bandgap inorganic-semiconductor electron-transporting layer such as TiO 2 can harvest ultraviolet light to photodegrade perovskite halides, and the high cost of a state-of-the-art hole-transporting layer is an economic burden for commercialization. Here, the building of a simplified cesium lead bromide (CsPbBr 3 ) perovskite solar cell with fluorine-doped tin oxide (FTO)/CsPbBr 3 /carbon architecture by a multistep solution-processed deposition technology is demonstrated, achieving an efficiency as high as 4.1% and improved stability upon interfacial modification by graphene quantum dots and CsPbBrI 2 quantum dots. This work provides new opportunities of building next-generation solar cells with significantly simplified processes and reduced production costs. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Simplified elastoplastic fatigue analysis

International Nuclear Information System (INIS)

Autrusson, B.; Acker, D.; Hoffmann, A.

1987-01-01

Oligocyclic fatigue behaviour is a function of the local strain range. The design codes ASME section III, RCC-M, Code Case N47, RCC-MR, and the Guide issued by PNC propose simplified methods to evaluate the local strain range. After having briefly described these simplified methods, we tested them by comparing the results of experimental strains with those predicted by these rules. The experiments conducted for this study involved perforated plates under tensile stress, notched or reinforced beams under four-point bending stress, grooved specimens under tensile-compressive stress, and embedded grooved beams under bending stress. They display a relative conservatism depending on each case. The evaluation of the strains of rather inaccurate and sometimes lacks conservatism. So far, the proposal is to use the finite element codes with a simple model. The isotropic model with the cyclic consolidation curve offers a good representation of the real equivalent strain. There is obviously no question of representing the cycles and the entire loading history, but merely of calculating the maximum variation in elastoplastic equivalent deformations with a constant-rate loading. The results presented testify to the good prediction of the strains with this model. The maximum equivalent strain will be employed to evaluate fatigue damage

Development of technologies on innovative-simplified nuclear power plant using high-efficiency steam injectors (2) analysis of heat balance of innovative-simplified nuclear power plant

International Nuclear Information System (INIS)

Goto, S.; Ohmori, S.; Mori, M.

2005-01-01

It is possible to establish simplified system with reduced space and total equipment weight using high-efficiency Steam Injector (SI) instead of low-pressure feedwater heaters in Nuclear Power Plant (NPP)(1)-(6). The SI works as a heat exchanger through direct contact between feedwater from the condensers and extracted steam from the turbines. It can get a higher pressure than supplied steam pressure, so it can reduce the feedwater pumps. The maintenance and reliability are still higher because SI has no movable parts. This paper describes the analysis of the heat balance and plant efficiency of this Innovative- Simplified NPP with high-efficiency SI. The plant efficiency is compared with the electric power of 1100MWe-class BWR system and the Innovative- Simplified BWR system with SI. The SI model is adapted into the heat balance simulator with a simplified model. The results show plant efficiencies of the Innovated-Simplified BWR system are almost equal to the original BWR one. The present research is one of the projects that are carried out by Tokyo Electric Power Company, Toshiba Corporation, and six Universities in Japan, funded from the Institute of Applied Energy (IAE) of Japan as the national public research-funded program. (authors)

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

A Smart Collaborative Routing Protocol for Reliable Data Diffusion in IoT Scenarios.

Science.gov (United States)

Ai, Zheng-Yang; Zhou, Yu-Tong; Song, Fei

2018-06-13

It is knotty for current routing protocols to meet the needs of reliable data diffusion during the Internet of Things (IoT) deployments. Due to the random placement, limited resources and unattended features of existing sensor nodes, the wireless transmissions are easily exposed to unauthorized users, which becomes a vulnerable area for various malicious attacks, such as wormhole and Sybil attacks. However, the scheme based on geographic location is a suitable candidate to defend against them. This paper is inspired to propose a smart collaborative routing protocol, Geographic energy aware routing and Inspecting Node (GIN), for guaranteeing the reliability of data exchanging. The proposed protocol integrates the directed diffusion routing, Greedy Perimeter Stateless Routing (GPSR), and the inspecting node mechanism. We first discuss current wireless routing protocols from three diverse perspectives (improving transmission rate, shortening transmission range and reducing transmission consumption). Then, the details of GIN, including the model establishment and implementation processes, are presented by means of the theoretical analysis. Through leveraging the game theory, the inspecting node is elected to monitor the network behaviors. Thirdly, we evaluate the network performances, in terms of transmission delay, packet loss ratio, and throughput, between GIN and three traditional schemes (i.e., Flooding, GPSR, and GEAR). The simulation results illustrate that the proposed protocol is able to outperform the others.

Particle Swarm Optimization and harmony search based clustering and routing in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Veena Anand

2017-01-01

Full Text Available Wireless Sensor Networks (WSN has the disadvantage of limited and non-rechargeable energy resource in WSN creates a challenge and led to development of various clustering and routing algorithms. The paper proposes an approach for improving network lifetime by using Particle swarm optimization based clustering and Harmony Search based routing in WSN. So in this paper, global optimal cluster head are selected and Gateway nodes are introduced to decrease the energy consumption of the CH while sending aggregated data to the Base station (BS. Next, the harmony search algorithm based Local Search strategy finds best routing path for gateway nodes to the Base Station. Finally, the proposed algorithm is presented.

Simplified Chua's attractor via bridging a diode pair

Directory of Open Access Journals (Sweden)

Quan Xu

2015-04-01

Full Text Available In this paper, a simplified Chua's circuit is realised by bridging a diode pair between a passive LC (inductance and capacitance in parallel connection - LC oscillator and an active RC (resistance and capacitance in parallel connection - RC filter. The dynamical behaviours of the circuit are investigated by numerical simulations and verified by experimental measurements. It is found that the simplified Chua's circuit generates Chua's attractors similarly and demonstrates complex non-linear phenomena including coexisting bifurcation modes and coexisting attractors in particular.

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.

A Novel Load Balancing Scheme for Multipath Routing Protocol in MANET

Directory of Open Access Journals (Sweden)

Kokilamani Mounagurusamy

2016-09-01

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

Windows 10 simplified

CERN Document Server

McFedries, Paul

2015-01-01

Learn Windows 10 quickly and painlessly with this beginner's guide Windows 10 Simplified is your absolute beginner's guide to the ins and outs of Windows. Fully updated to cover Windows 10, this highly visual guide covers all the new features in addition to the basics, giving you a one-stop resource for complete Windows 10 mastery. Every page features step-by-step screen shots and plain-English instructions that walk you through everything you need to know, no matter how new you are to Windows. You'll master the basics as you learn how to navigate the user interface, work with files, create

Office 2013 simplified

CERN Document Server

Marmel, Elaine

2013-01-01

A basic introduction to learn Office 2013 quickly, easily, and in full color Office 2013 has new features and tools to master, and whether you're upgrading from an earlier version or using the Office applications for the first time, you'll appreciate this simplified approach. Offering a clear, visual style of learning, this book provides you with concise, step-by-step instructions and full-color screen shots that walk you through the applications in the Microsoft Office 2013 suite: Word, Excel, PowerPoint, Outlook, and Publisher.Shows you how to tackle dozens of Office 2013

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.

Waste Collection Vehicle Routing Problem: Literature Review

OpenAIRE

Hui Han; Eva Ponce Cueto

2015-01-01

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

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

A novel power efficient location-based cooperative routing with transmission power-upper-limit for wireless sensor networks.

Science.gov (United States)

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-05-15

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate.

A Novel Power Efficient Location-Based Cooperative Routing with Transmission Power-Upper-Limit for Wireless Sensor Networks

Science.gov (United States)

Shi, Juanfei; Calveras, Anna; Cheng, Ye; Liu, Kai

2013-01-01

The extensive usage of wireless sensor networks (WSNs) has led to the development of many power- and energy-efficient routing protocols. Cooperative routing in WSNs can improve performance in these types of networks. In this paper we discuss the existing proposals and we propose a routing algorithm for wireless sensor networks called Power Efficient Location-based Cooperative Routing with Transmission Power-upper-limit (PELCR-TP). The algorithm is based on the principle of minimum link power and aims to take advantage of nodes cooperation to make the link work well in WSNs with a low transmission power. In the proposed scheme, with a determined transmission power upper limit, nodes find the most appropriate next nodes and single-relay nodes with the proposed algorithm. Moreover, this proposal subtly avoids non-working nodes, because we add a Bad nodes Avoidance Strategy (BAS). Simulation results show that the proposed algorithm with BAS can significantly improve the performance in reducing the overall link power, enhancing the transmission success rate and decreasing the retransmission rate. PMID:23676625

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

Directory of Open Access Journals (Sweden)

Lin Zhang

2017-03-01

Full Text Available With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR. This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service.

A Multi-Attribute Pheromone Ant Secure Routing Algorithm Based on Reputation Value for Sensor Networks

Science.gov (United States)

Zhang, Lin; Yin, Na; Fu, Xiong; Lin, Qiaomin; Wang, Ruchuan

2017-01-01

With the development of wireless sensor networks, certain network problems have become more prominent, such as limited node resources, low data transmission security, and short network life cycles. To solve these problems effectively, it is important to design an efficient and trusted secure routing algorithm for wireless sensor networks. Traditional ant-colony optimization algorithms exhibit only local convergence, without considering the residual energy of the nodes and many other problems. This paper introduces a multi-attribute pheromone ant secure routing algorithm based on reputation value (MPASR). This algorithm can reduce the energy consumption of a network and improve the reliability of the nodes’ reputations by filtering nodes with higher coincidence rates and improving the method used to update the nodes’ communication behaviors. At the same time, the node reputation value, the residual node energy and the transmission delay are combined to formulate a synthetic pheromone that is used in the formula for calculating the random proportion rule in traditional ant-colony optimization to select the optimal data transmission path. Simulation results show that the improved algorithm can increase both the security of data transmission and the quality of routing service. PMID:28282894

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

Modeling and Tool Wear in Routing of CFRP

International Nuclear Information System (INIS)

Iliescu, D.; Fernandez, A.; Gutierrez-Orrantia, M. E.; Lopez de Lacalle, L. N.; Girot, F.

2011-01-01

This paper presents the prediction and evaluation of feed force in routing of carbon composite material. In order to extend tool life and improve quality of the machined surface, a better understanding of uncoated and coated tool behaviors is required. This work describes (1) the optimization of the geometry of multiple teeth tools minimizing the tool wear and the feed force, (2) the optimization of tool coating and (3) the development of a phenomenological model between the feed force, the routing parameters and the tool wear. The experimental results indicate that the feed rate, the cutting speed and the tool wear are the most significant factors affecting the feed force. In the case of multiple teeth tools, a particular geometry with 14 teeth right helix right cut and 11 teeth left helix right cut gives the best results. A thick AlTiN coating or a diamond coating can dramatically improve the tool life while minimizing the axial force, roughness and delamination. A wear model has then been developed based on an abrasive behavior of the tool. The model links the feed rate to the tool geometry parameters (tool diameter), to the process parameters (feed rate, cutting speed and depth of cut) and to the wear. The model presented has been verified by experimental tests.

User habits and multimodal route planning

Directory of Open Access Journals (Sweden)

Géza Katona

2017-10-01

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

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

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

2001-01-01

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

A branch-and-cut algorithm for the vehicle routing problem with multiple use of vehicles

Directory of Open Access Journals (Sweden)

İsmail Karaoğlan

2015-06-01

Full Text Available This paper addresses the vehicle routing problem with multiple use of vehicles (VRPMUV, an important variant of the classic vehicle routing problem (VRP. Unlike the classical VRP, vehicles are allowed to use more than one route in the VRPMUV. We propose a branch-and-cut algorithm for solving the VRPMUV. The proposed algorithm includes several valid inequalities from the literature for the purpose of improving its lower bounds, and a heuristic algorithm based on simulated annealing and a mixed integer programming-based intensification procedure for obtaining the upper bounds. The algorithm is evaluated in terms of the test problems derived from the literature. The computational results which follow show that, if there were 120 customers on the route (in the simulation, the problem would be solved optimally in a reasonable amount of time.

Joint Channel Assignment and Routing in Multiradio Multichannel Wireless Mesh Networks: Design Considerations and Approaches

Directory of Open Access Journals (Sweden)

Omar M. Zakaria

2016-01-01

Full Text Available Multiradio wireless mesh network is a promising architecture that improves the network capacity by exploiting multiple radio channels concurrently. Channel assignment and routing are underlying challenges in multiradio architectures since both determine the traffic distribution over links and channels. The interdependency between channel assignments and routing promotes toward the joint solutions for efficient configurations. This paper presents an in-depth review of the joint approaches of channel assignment and routing in multiradio wireless mesh networks. First, the key design issues, modeling, and approaches are identified and discussed. Second, existing algorithms for joint channel assignment and routing are presented and classified based on the channel assignment types. Furthermore, the set of reconfiguration algorithms to adapt the network traffic dynamics is also discussed. Finally, the paper presents some multiradio practical implementations and test-beds and points out the future research directions.

Walk, ride and learn: students' discovery of nature and other evironmental elements on their routes to school

Science.gov (United States)

Whitney Knollenberg; Jeamok Kwon; Christine. Vogt

2010-01-01

America's youth face epidemic levels of childhood obesity and are suffering from a lack of exposure to the outdoors. The Safe Routes to School Program, sponsored by the U.S. Department of Transportation, National Highway Traffic Safety Administration, aims to improve access to safe routes to school for elementary and junior high school children. As a required...

Predictive routing for autonomous mobility-on-demand systems with ride-sharing

NARCIS (Netherlands)

Alonso Mora, J.; Wallar, Alex; Rus, Daniela; Bicchi, A.; Maciejewski, T.

2017-01-01

Ride-sharing, or carpooling, systems with autonomous vehicles will provide efficient and reliable urban mobility on demand. In this work we present a method for dynamic vehicle routing that leverages historical data to improve the performance of a network of self-driving taxis. In particular, we

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

Significance, progress and prospects for research in simplified cultivation technologies for rice in China.

Science.gov (United States)

Huang, M; Ibrahim, Md; Xia, B; Zou, Y

2011-08-01

Simplified cultivation technologies for rice have become increasingly attractive in recent years in China because of their social, economical and environmental benefits. To date, several simplified cultivation technologies, such as conventional tillage and seedling throwing (CTST), conventional tillage and direct seeding (CTDS), no-tillage and seedling throwing (NTST), no-tillage and direct seeding (NTDS) and no-tillage and transplanting (NTTP), have been developed in China. Most studies have shown that rice grown under each of these simplified cultivation technologies can produce a grain yield equal to or higher than traditional cultivation (conventional tillage and transplanting). Studies that have described the influences of agronomic practices on yield formation of rice under simplified cultivation have demonstrated that optimizing agronomy practices would increase the efficiencies of simplified cultivation systems. Further research is needed to optimize the management strategies for CTST, CTDS and NTST rice which have developed quickly in recent years, to strengthen basic research for those simplified cultivation technologies that are rarely used at present (such as NTTP and NTDS), to select and breed cultivars suitable for simplified cultivation and to compare the practicability and effectiveness of different simplified cultivation technologies in different rice production regions.

A simplified ingestion procedure for esophageal capsule endoscopy: initial evaluation in healthy volunteers.

Science.gov (United States)

Gralnek, I M; Rabinovitz, R; Afik, D; Eliakim, R

2006-09-01

Initial studies on esophageal capsule endoscopy (PillCam ESO) reported excellent sensitivity and specificity, but these were followed by mixed results in several subsequent studies, probably due to deviations from the recommended ingestion protocol and the inconvenience of capsule ingestion in the supine position. The aim of this study was therefore to test a simplified ingestion procedure (SIP) for PillCam ESO. Using a cross-over study design, the SIP was prospectively compared with the original ingestion procedure for PillCam ESO in 24 healthy volunteers (15 men, nine women; mean age 44, range 27 - 70) and evaluated for: bubbles/saliva interference at the Z-line, Z-line circumferential visualization (quadrants), and convenience and ease of the ingestion procedure. All Rapid 4 videos were reviewed in a randomized manner and read by an experienced PillCam ESO reader blinded to the ingestion procedure used. It was found that the SIP significantly improved visualization in comparison with the original ingestion procedure, with less interference due to bubbles/saliva observed at the gastroesophageal junction ( P = 0.002) and improved visualization of the Z-line ( P = 0.025). Although the esophageal transit time was significantly faster with the SIP (3 : 45 min vs. 0 : 38 min; P = 0.0001), there were no differences in the number of Z-line frames/images captured. This new, simplified ingestion procedure for PillCam ESO provides significantly improved visualization of the Z-line in healthy volunteers. The overall test characteristics of PillCam ESO using SIP should be tested in patients with esophageal disease.

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

Energy Technology Data Exchange (ETDEWEB)

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

2011-08-15

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

The Dynamic Multi-Period Vehicle Routing Problem

DEFF Research Database (Denmark)

Wen, Min; Cordeau, Jean-Francois; Laporte, Gilbert

This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives are to minim......This paper considers the Dynamic Multi-Period Vehicle Routing Problem which deals with the distribution of orders from a depot to a set of customers over a multi-period time horizon. Customer orders and their feasible service periods are dynamically revealed over time. The objectives...... are to minimize total travel costs and customer waiting, and to balance the daily workload over the planning horizon. This problem originates from a large distributor operating in Sweden. It is modeled as a mixed integer linear program, and solved by means of a three-phase heuristic that works over a rolling...... planning horizon. The multi-objective aspect of the problem is handled through a scalar technique approach. Computational results show that our solutions improve upon those of the Swedish distributor....

SMOG@ctbp: simplified deployment of structure-based models in GROMACS.

Science.gov (United States)

Noel, Jeffrey K; Whitford, Paul C; Sanbonmatsu, Karissa Y; Onuchic, José N

2010-07-01

Molecular dynamics simulations with coarse-grained and/or simplified Hamiltonians are an effective means of capturing the functionally important long-time and large-length scale motions of proteins and RNAs. Structure-based Hamiltonians, simplified models developed from the energy landscape theory of protein folding, have become a standard tool for investigating biomolecular dynamics. SMOG@ctbp is an effort to simplify the use of structure-based models. The purpose of the web server is two fold. First, the web tool simplifies the process of implementing a well-characterized structure-based model on a state-of-the-art, open source, molecular dynamics package, GROMACS. Second, the tutorial-like format helps speed the learning curve of those unfamiliar with molecular dynamics. A web tool user is able to upload any multi-chain biomolecular system consisting of standard RNA, DNA and amino acids in PDB format and receive as output all files necessary to implement the model in GROMACS. Both C(alpha) and all-atom versions of the model are available. SMOG@ctbp resides at http://smog.ucsd.edu.

A Game Theory-Based Obstacle Avoidance Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Shujun Bi

2011-09-01

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

Variable neighborhood search to solve the vehicle routing problem for hazardous materials transportation.

Science.gov (United States)

Bula, Gustavo Alfredo; Prodhon, Caroline; Gonzalez, Fabio Augusto; Afsar, H Murat; Velasco, Nubia

2017-02-15

This work focuses on the Heterogeneous Fleet Vehicle Routing problem (HFVRP) in the context of hazardous materials (HazMat) transportation. The objective is to determine a set of routes that minimizes the total expected routing risk. This is a nonlinear function, and it depends on the vehicle load and the population exposed when an incident occurs. Thus, a piecewise linear approximation is used to estimate it. For solving the problem, a variant of the Variable Neighborhood Search (VNS) algorithm is employed. To improve its performance, a post-optimization procedure is implemented via a Set Partitioning (SP) problem. The SP is solved on a pool of routes obtained from executions of the local search procedure embedded on the VNS. The algorithm is tested on two sets of HFVRP instances based on literature with up to 100 nodes, these instances are modified to include vehicle and arc risk parameters. The results are competitive in terms of computational efficiency and quality attested by a comparison with Mixed Integer Linear Programming (MILP) previously proposed. Copyright © 2016 Elsevier B.V. All rights reserved.

Integrability and solvability of the simplified two-qubit Rabi model

International Nuclear Information System (INIS)

Peng Jie; Ren Zhongzhou; Guo Guangjie; Ju Guoxing

2012-01-01

The simplified two-qubit Rabi model is proposed and its analytical solution is presented. There are no level crossings in the spectral graph of the model, which indicates that it is not integrable. The criterion of integrability for the Rabi model proposed by Braak (2011 Phys. Rev. Lett. 107 100401) is also used for the simplified two-qubit Rabi model and the same conclusion, consistent with what the spectral graph shows, can be drawn, which indicates that the criterion remains valid when applied to the two-qubit case. The simplified two-qubit Rabi model is another example of a non-integrable but exactly solvable system except for the generalized Rabi model. (paper)

Manufacturing routes for stainless steel first wall panels

International Nuclear Information System (INIS)

Bucci, Ph.; Federzoni, L.; Le Marois, G.; Lorenzetto, P.

2001-01-01

Hot isostatic pressing (HIP) techniques are being considered in the European Home Team as one of the fabrication routes to produce ITER-FEAT primary first wall panels (PFWP). To demonstrate the potential and the availability of such techniques, material development, innovative mock-up fabrications and numerical modeling for the production of near-net shape components are currently been studied by CEA/CEREM in collaboration with the EFDA-CSU Garching. The aim of this work is to investigate the manufacturing feasibility of advanced PFWP concepts, with reduced pitch between FW cooling channels and reduced material thickness between the FW cooling channels and the front surface, in order to improve the thermal fatigue performance of these concepts. In order to select the best fabrication route, two different manufacturing methods based on the HIP process are being considered. The first one consists in manufacturing of the first wall panel by a HIP forming technique. Mock-ups are made of a serpentine tube expanded into a proper matrix. 2-D computer modeling has been performed to estimate the serpentine deformation. The second manufacturing route is based on the powder HIP technique. Mock-ups have been made of a serpentine embedded into SS powder. In both cases, the objective was to obtain the minimum pitch between the stainless steel (SS) tubes and between the SS tubes and the front face

A Dynamic Optimization Method of Indoor Fire Evacuation Route Based on Real-time Situation Awareness

Directory of Open Access Journals (Sweden)

DING Yulin

2016-12-01

Full Text Available How to provide safe and effective evacuation routes is an important safeguard to correctly guide evacuation and reduce the casualties during the fire situation rapidly evolving in complex indoor environment. The traditional static path finding method is difficult to adjust the path adaptively according to the changing fire situation, which lead to the evacuation decision-making blindness and hysteresis. This paper proposes a dynamic method which can dynamically optimize the indoor evacuation routes based on the real-time situation awareness. According to the real-time perception of fire situation parameters and the changing indoor environment information, the evacuation route is optimized dynamically. The integrated representation of multisource indoor fire monitoring sensor observations oriented fire emergency evacuation is presented at first, real-time fire threat situation information inside building is then extracted from the observation data of multi-source sensors, which is used to constrain the dynamical optimization of the topology of the evacuation route. Finally, the simulation experiments prove that this method can improve the accuracy and efficiency of indoor evacuation routing.

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.

Novel routes to nanodispersed semiconductors

International Nuclear Information System (INIS)

Green, M.A.

1999-01-01

Novel synthetic routes to nanodispersed compound semiconductors using organometallic precursors have been developed. The quantum dots have been studied by optical absorption spectroscopy, photoluminescence spectroscopy, transmission electron microscopy, high resolution transmission electron microscopy, infra red spectroscopy and nuclear magnetic resonance. Polar Lewis base solvents such as tri-n-octylphosphine oxide and 4-ethylpyridine were utilized as both passivating agent and dispersing medium. In the the search for new solvent systems and passivating agents, and investigation was also made into the use of dimethyl sulfoxide as a reaction solvent and capping agent in the preparation of nanocrystalline CdS. Existing routes using metal alkyls and silylated precursors in hot TOPO were improved by substituting the metal alkyl with an metal alkyl adduct. Cadmium monothiocarbamate and a related precursor, cadmium thioacetate were investigated as possible single source precursors to nanometer sized CdS. The thermolysis of diorganophosphides in the Lewis bases coordinating solvent (4-ethylpridine) has been investigated, including studies of decompositon mechanisms, and quantum dots of Cd 3 P 2 , Zn 3 P 2 , Inp and GaP have been prepared. The synthesis of InAs using the metal chloride and an aminoarsenide precursor in 4-ethylpridine has also been developed. A simple method for the organization of III-V materials into glass like aggregates has been described. (author)

ADAPTIVE CLUSTER BASED ROUTING PROTOCOL WITH ANT COLONY OPTIMIZATION FOR MOBILE AD-HOC NETWORK IN DISASTER AREA

Directory of Open Access Journals (Sweden)

Enrico Budianto

2012-07-01

Full Text Available In post-disaster rehabilitation efforts, the availability of telecommunication facilities takes important role. However, the process to improve telecommunication facilities in disaster area is risky if it is done by humans. Therefore, a network method that can work efficiently, effectively, and capable to reach the widest possible area is needed. This research introduces a cluster-based routing protocol named Adaptive Cluster Based Routing Protocol (ACBRP equipped by Ant Colony Optimization method, and its implementation in a simulator developed by author. After data analysis and statistical tests, it can be concluded that routing protocol ACBRP performs better than AODV and DSR routing protocol. Pada upaya rehabilitasi pascabencana, ketersediaan fasilitas telekomunikasi memiliki peranan yang sangat penting. Namun, proses untuk memperbaiki fasilitas telekomunikasi di daerah bencana memiliki resiko jika dilakukan oleh manusia. Oleh karena itu, metode jaringan yang dapat bekerja secara efisien, efektif, dan mampu mencapai area seluas mungkin diperlukan. Penelitian ini memperkenalkan sebuah protokol routing berbasis klaster bernama Adaptive Cluster Based Routing Protocol (ACBRP, yang dilengkapi dengan metode Ant Colony Optimization, dan diimplementasikan pada simulator yang dikembangkan penulis. Setelah data dianalisis dan dilakukan uji statistik, disimpulkan bahwa protokol routing ACBRP beroperasi lebih baik daripada protokol routing AODV maupun DSR.

The study for installing noise barrier on highway route no.9

Directory of Open Access Journals (Sweden)

Jiradecha Chaddanai

2018-01-01

Full Text Available Highway Route No. 9 is a Bangkok bypass motorway that aims to alleviate traffic congestion in greater Bangkok areas. Presently, it is found a rapid expansion of new communities residing along both side of Highway No. 9. To lessen the noise level, Department of Highways installed the noise barrier on the sensitive locations. However, people from communities living on both sides of highway still demand some additional noise pollution improvement. To improve the efficiency of using noise barriers and to promote environmental and social quality for the people on the sensitive communities along the highway route, the Department of Highways, therefore, designs a new technique for installing noise barrier on the sensitive areas, i.e. education institutions, temple, residential area. In addition, the mathematic model is applied to 12 selected locations of sensitive areas for monitoring the effectiveness of the new installation technique. The mathematic model is used for predict the future noise level after installation of noise barrier in year 2037. The results confirm that the appropriate height and width of noise barrier can improve the comfortable of the people on the sensitive area.

Simplifying massive planar subdivisions

DEFF Research Database (Denmark)

Arge, Lars; Truelsen, Jakob; Yang, Jungwoo

2014-01-01

We present the first I/O- and practically-efficient algorithm for simplifying a planar subdivision, such that no point is moved more than a given distance εxy and such that neighbor relations between faces (homotopy) are preserved. Under some practically realistic assumptions, our algorithm uses ....... For example, for the contour map simplification problem it is significantly faster than the previous algorithm, while obtaining approximately the same simplification factor. Read More: http://epubs.siam.org/doi/abs/10.1137/1.9781611973198.3...

UTILITY OF SIMPLIFIED LABANOTATION

Directory of Open Access Journals (Sweden)

Maria del Pilar Naranjo

2016-02-01

Full Text Available After using simplified Labanotation as a didactic tool for some years, the author can conclude that it accomplishes at least three main functions: efficiency of rehearsing time, social recognition and broadening of the choreographic consciousness of the dancer. The doubts of the dancing community about the issue of ‘to write or not to write’ are highly determined by the contexts and their own choreographic evolution, but the utility of Labanotation, as a tool for knowledge, is undeniable.

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.

Using Mobility to Enhance the Routing Process in the MIS System

Directory of Open Access Journals (Sweden)

Elkoutbi Mohammed

2009-10-01

Full Text Available In this paper, we introduce the original Mobile Intelligent System (MIS in embedded FPGA architecture. This node will allow the construction of autonomous mobile network units which can move in unknowns, inaccessible or hostile environnement for human being, in order to collect data by various sensors and transmits them by routing to a unit of distant process. In the sake of improving the performance of routing unit, we propose a measure of mobility. Each node measure its own mobility in the network, based on the change of the links state in his neighboring. This measure of mobility has no unit, and it is calculated by quantification in regular time intervals.

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.

Approaching system equilibrium with accurate or not accurate feedback information in a two-route system

Science.gov (United States)

Zhao, Xiao-mei; Xie, Dong-fan; Li, Qi

2015-02-01

With the development of intelligent transport system, advanced information feedback strategies have been developed to reduce traffic congestion and enhance the capacity. However, previous strategies provide accurate information to travelers and our simulation results show that accurate information brings negative effects, especially in delay case. Because travelers prefer to the best condition route with accurate information, and delayed information cannot reflect current traffic condition but past. Then travelers make wrong routing decisions, causing the decrease of the capacity and the increase of oscillations and the system deviating from the equilibrium. To avoid the negative effect, bounded rationality is taken into account by introducing a boundedly rational threshold BR. When difference between two routes is less than the BR, routes have equal probability to be chosen. The bounded rationality is helpful to improve the efficiency in terms of capacity, oscillation and the gap deviating from the system equilibrium.

Baseline requirements of the proposed action for the Transportation Management Division routing models

International Nuclear Information System (INIS)

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

1995-02-01

The potential impacts associated with the transportation of hazardous materials are important to shippers, carriers, and the general public. This is particularly true for shipments of radioactive material. The shippers are primarily concerned with safety, security, efficiency, and equipment requirements. The carriers are concerned with the potential impact that radioactive shipments may have on their operations--particularly if such materials are involved in an accident. The general public has also expressed concerns regarding the safety of transporting radioactive and other hazardous materials through their communities. Because transportation routes are a central concern in hazardous material transport, the prediction of likely routes is the first step toward resolution of these issues. In response to these routing needs, several models have been developed over the past fifteen years at Oak Ridge National Laboratory (ORNL). The HIGHWAY routing model is used to predict routes for truck transportation, the INTERLINE routing model is used to predict both rail and barge routes, and the AIRPORT locator model is used to determine airports with specified criteria near a specific location. As part of the ongoing improvement of the US Department of Energy's (DOE) Environmental Management Transportation Management Division's (EM-261) computer systems and development efforts, a Baseline Requirements Assessment Session on the HIGHWAY, INTERLINE, and AIRPORT models was held at ORNL on April 27, 1994. The purpose of this meeting was to discuss the existing capabilities of the models and data bases and to review enhancements of the models and data bases to expand their usefulness. The results of the Baseline Requirements Assessment Section will be discussed in this report. The discussions pertaining to the different models are contained in separate sections

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

Maglev guideway route alignment and right-of-way requirements

Science.gov (United States)

Carlton, S.; Andriola, T.

1992-12-01

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

Preparation of SmBiO{sub 3} buffer layer on YSZ substrate by an improved chemical solution deposition route

Energy Technology Data Exchange (ETDEWEB)

Zhu, Xiaolei [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); Pu, Minghua, E-mail: mhpu@home.swjtu.edu.cn [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); Zhao, Yong [Key Laboratory of Advanced Technologies of Materials (Ministry of Education of China), Superconductivity and New Energy R& D Center, Mail Stop 165#, Southwest Jiaotong University, Chengdu, Sichuan 610031 (China); School of Materials Science and Engineering, University of New South Wale, Sydney, NSW 2052 (Australia)

2016-12-15

Highlights: • The proper conditions for SBO growth are 794 °C for 60 min in flowing Ar gas, the temperature of epitaxial growth is relatively low. • The total time by SSD technique for organic solvent removing, salts decomposition and layer growth is not up to 2 h, which are much less than that needed for traditional CSD of over 10 h. • SBO layer on YSZ prepared by SSD technique are suitable for the growth of YBCO, The results may be the usable reference for continuous preparation of SBO buffer layer on IBAD-YSZ/Ni-based alloy tapes. - Abstract: A quick route for chemical solution deposition (CSD) has been developed to prepare SmBiO{sub 3} (SBO) layers on yttria stabilized zirconia (YSZ) substrates rapidly by using of solid state decomposition (SSD) technique. The proper conditions for volatilization of lactic acid, which as solvent in precursor coated layer, and SBO growth are 115°C for 30 min and 794°C for 60 min in flowing Ar gas. The coated layers are amorphous structure of mixture oxides and quasi-crystal structure of SBO before and after growth, respectively. The total time by this quick CSD route for organic solvent volatilization, salts decomposed and layer growth is not up to 2 h, which are much less than that needed for traditional CSD of over 10 h. SBO layer is directly epitaxial growth on YSZ substrate without any lattice rotation. SBO layer prepared by this quick route as well as that by traditional route are suitable for the growth of YBCO. The superconducting transition temperature and critical current density of the coated YBCO layer on SBO/YSZ obtained by this quick route are up to 90 K and 1.66 MA/cm{sup 2}. These results may be the usable reference for continuous preparation of SBO buffer layer on IBAD-YSZ/Ni-based alloy tapes.

A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows

Directory of Open Access Journals (Sweden)

Jose Bernal

2017-10-01

Full Text Available Purpose: We consider a real case study of a vehicle routing problem with a heterogeneous fleet and time windows (HFVRPTW for a franchise company bottling Coca-Cola products in Colombia. This study aims to determine the routes to be performed to fulfill the demand of the customers by using a heterogeneous fleet and considering soft time windows. The objective is to minimize the distance traveled by the performed routes. Design/methodology/approach: We propose a two-phase heuristic algorithm. In the proposed approach, after an initial phase (first phase, a granular tabu search is applied during the improvement phase (second phase. Two additional procedures are considered to help that the algorithm could escape from local optimum, given that during a given number of iterations there has been no improvement. Findings: Computational experiments on real instances show that the proposed algorithm is able to obtain high-quality solutions within a short computing time compared to the results found by the software that the company currently uses to plan the daily routes. Originality/value: We propose a novel metaheuristic algorithm for solving a real routing problem by considering heterogeneous fleet and time windows. The efficiency of the proposed approach has been tested on real instances, and the computational experiments shown its applicability and performance for solving NP-Hard Problems related with routing problems with similar characteristics. The proposed algorithm was able to improve some of the current solutions applied by the company by reducing the route length and the number of vehicles.

Reliable Adaptive Data Aggregation Route Strategy for a Trade-off between Energy and Lifetime in WSNs

Directory of Open Access Journals (Sweden)

Wenzhong Guo

2014-09-01

Full Text Available Mobile security is one of the most fundamental problems in Wireless Sensor Networks (WSNs. The data transmission path will be compromised for some disabled nodes. To construct a secure and reliable network, designing an adaptive route strategy which optimizes energy consumption and network lifetime of the aggregation cost is of great importance. In this paper, we address the reliable data aggregation route problem for WSNs. Firstly, to ensure nodes work properly, we propose a data aggregation route algorithm which improves the energy efficiency in the WSN. The construction process achieved through discrete particle swarm optimization (DPSO saves node energy costs. Then, to balance the network load and establish a reliable network, an adaptive route algorithm with the minimal energy and the maximum lifetime is proposed. Since it is a non-linear constrained multi-objective optimization problem, in this paper we propose a DPSO with the multi-objective fitness function combined with the phenotype sharing function and penalty function to find available routes. Experimental results show that compared with other tree routing algorithms our algorithm can effectively reduce energy consumption and trade off energy consumption and network lifetime.

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.

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

Science.gov (United States)

Liu, Mianfang; Xiong, Shengwu; Li, Bixiang

2016-05-01

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

Simplified models of mixed dark matter

International Nuclear Information System (INIS)

Cheung, Clifford; Sanford, David

2014-01-01

We explore simplified models of mixed dark matter (DM), defined here to be a stable relic composed of a singlet and an electroweak charged state. Our setup describes a broad spectrum of thermal DM candidates that can naturally accommodate the observed DM abundance but are subject to substantial constraints from current and upcoming direct detection experiments. We identify ''blind spots'' at which the DM-Higgs coupling is identically zero, thus nullifying direct detection constraints on spin independent scattering. Furthermore, we characterize the fine-tuning in mixing angles, i.e. well-tempering, required for thermal freeze-out to accommodate the observed abundance. Present and projected limits from LUX and XENON1T force many thermal relic models into blind spot tuning, well-tempering, or both. This simplified model framework generalizes bino-Higgsino DM in the MSSM, singlino-Higgsino DM in the NMSSM, and scalar DM candidates that appear in models of extended Higgs sectors

A simplified dynamic method for field capacity estimation and its parameter analysis

Institute of Scientific and Technical Information of China (English)

Zhen-tao CONG; Hua-fang LÜ; Guang-heng NI

2014-01-01

This paper presents a simplified dynamic method based on the definition of field capacity. Two soil hydraulic characteristics models, the Brooks-Corey (BC) model and the van Genuchten (vG) model, and four soil data groups were used in this study. The relative drainage rate, which is a unique parameter and independent of the soil type in the simplified dynamic method, was analyzed using the pressure-based method with a matric potential of−1/3 bar and the flux-based method with a drainage flux of 0.005 cm/d. As a result, the relative drainage rate of the simplified dynamic method was determined to be 3% per day. This was verified by the similar field capacity results estimated with the three methods for most soils suitable for cultivating plants. In addition, the drainage time calculated with the simplified dynamic method was two to three days, which agrees with the classical definition of field capacity. We recommend the simplified dynamic method with a relative drainage rate of 3% per day due to its simple application and clearly physically-based concept.

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

GTDM: A DTN Routing on Noncooperative Game Theory in a City Environment

Directory of Open Access Journals (Sweden)

Wenzao Li

2015-01-01

Full Text Available The performance of delay tolerant networks (DTNs can be influenced by movement model in different application environments. The existing routing algorithms of DTNs do not meet the current city environments due to the large differences in node densities, social characteristics, and limited energy. The key indicators of DTNs such as success delivery ratio, average delivery latency, network lifetime, and network overhead ratio can influence the performances of civil DTNs applications. Aiming to improve the key indicators of DTNs in city environments, this paper presents a fixed sink station based structure and a more proper routing algorithm named Game Theory Based Decision Making (GTDM. GTDM shows decision-making process for neighborhood selection and packet delivering strategy which is based on the noncooperative game theory method and city environment characteristics. GTDM performance is evaluated using numerical simulations under Working Day Movement (WDM model and the results suggested that GTDM outperforms other traditional DTNs routing approaches, such as Epidemic and Prophet algorithms.

An Opportunistic Routing for Data Forwarding Based on Vehicle Mobility Association in Vehicular Ad Hoc Networks

Directory of Open Access Journals (Sweden)

Leilei Wang

2017-11-01

Full Text Available Vehicular ad hoc networks (VANETs have emerged as a new powerful technology for data transmission between vehicles. Efficient data transmission accompanied with low data delay plays an important role in selecting the ideal data forwarding path in VANETs. This paper proposes a new opportunity routing protocol for data forwarding based on vehicle mobility association (OVMA. With assistance from the vehicle mobility association, data can be forwarded without passing through many extra intermediate nodes. Besides, each vehicle carries the only replica information to record its associated vehicle information, so the routing decision can adapt to the vehicle densities. Simulation results show that the OVMA protocol can extend the network lifetime, improve the performance of data delivery ratio, and reduce the data delay and routing overhead when compared to the other well-known routing protocols.

A simplified approach to evaluating severe accident source term for PWR

International Nuclear Information System (INIS)

Huang, Gaofeng; Tong, Lili; Cao, Xuewu

2014-01-01

Highlights: • Traditional source term evaluation approaches have been studied. • A simplified approach of source term evaluation for 600 MW PWR is studied. • Five release categories are established. - Abstract: For early design of NPPs, no specific severe accident source term evaluation was considered. Some general source terms have been used for some NPPs. In order to implement a best estimate, a special source term evaluation should be implemented for an NPP. Traditional source term evaluation approaches (mechanism approach and parametric approach) have some difficulties associated with their implementation. The traditional approaches are not consistent with cost-benefit assessment. A simplified approach for evaluating severe accident source term for PWR is studied. For the simplified approach, a simplified containment event tree is established. According to representative cases selection, weighted coefficient evaluation, computation of representative source term cases and weighted computation, five containment release categories are established, including containment bypass, containment isolation failure, containment early failure, containment late failure and intact containment

A simplified technique for nasoendotracheal tube immobilization.

OpenAIRE

Berardo, N.; Leban, S. G.; Williams, F. A.

1989-01-01

A simplified technique for immobilization of a nasoendotracheal tube is described in which a wide strap of open cell, hypoallergenic, foam-backed fabric is secured to the patient's head with a Velcro fastener.

A Territorial cohesion through cultural tourism: the case of the Umayyad Route

Directory of Open Access Journals (Sweden)

Isabel María Torres Martínez

2017-05-01

Full Text Available Cultural tourism has the potential to create multiple positive impacts from the socio-cultural point of view; if properly managed. The strengthening of cultural identity and the rescue of tangible and intangible cultural heritage are some examples. A study by the European Commission and the Council of Europe highlighted the potential of cultural routes for the generation of small businesses, intercultural dialogue and the promotion of the image of Europe in general. In the last decade, numerous projects and, in particular, European funds have been devoted to the creation of themed-tourism products and cultural routes. This is the case of the Umayyad Route, which has been rescued through a project funded by the European Union with the aim of improving Mediterranean territorial cohesion through the creation of the transnational cultural tourism itinerary. It is led by the Public Andalusian Foundation El legado andalusí and it has a network of partners in seven countries in the Mediterranean basin: Spain, Portugal, Italy, Tunisia, Egypt, Lebanon and Jordan. Through interviews with the coordinating entity and the managers of the national routes, this article analyses how the Umayyad Route is contributing to the enhancement of the rich legacy of the Umayyad dynasty in its expansion along the Mediterranean and to being a bridge of collaboration between the East and the West. It also describes the problems and challenges to overcome for the promotion of shared heritage and for the understanding between cultures and territories. 

A simplified model exploration research of new anisotropic diffuse radiation model

International Nuclear Information System (INIS)

Yao, Wanxiang; Li, Zhengrong; Wang, Xiao; Zhao, Qun; Zhang, Zhigang; Lin, Lin

2016-01-01

Graphical abstract: The specific process of measured diffuse radiation data. - Highlights: • Simplified diffuse radiation model is extremely important for solar radiation simulation and energy simulation. • A new simplified anisotropic diffuse radiation model (NSADR model) is proposed. • The accuracy of existing models and NSADR model is compared based on the measured values. • The accuracy of the NSADR model is higher than that of the existing models, and suitable for calculating diffuse radiation. - Abstract: More accurate new anisotropic diffuse radiation model (NADR model) has been proposed, but the parameters and calculation process of NADR model used in the process are complex. So it is difficult to widely used in the simulation software and engineering calculation. Based on analysis of the diffuse radiation model and measured diffuse radiation data, this paper put forward three hypotheses: (1) diffuse radiation from sky horizontal region is concentrated in a very thin layer which is close to the line source; (2) diffuse radiation from circumsolar region is concentrated in the point of the sun; (3) diffuse radiation from orthogonal region is concentrated in the point located at 90 degree angles with the Sun. Based on these hypotheses, NADR model is simplified to a new simplified anisotropic diffuse radiation model (NSADR model). Then the accuracy of NADR model and its simplified model (NSADR model) are compared with existing models based on the measured values, and the result shows that Perez model and its simplified model are relatively accurate among existing models. However, the accuracy of these two models is lower than the NADR model and NSADR model due to neglect the influence of the orthogonal diffuse radiation. The accuracy of the NSADR model is higher than that of the existing models, meanwhile, another advantage is that the NSADR model simplifies the process of solution parameters and calculation. Therefore it is more suitable for

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)

CP Methods for Scheduling and Routing with Time-Dependent Task Costs

DEFF Research Database (Denmark)

Tierney, Kevin; Kelareva, Elena; Kilby, Philip

2013-01-01

a cost function, and Mixed Integer Programming (MIP) are often used for solving such problems. However, Constraint Programming (CP), particularly with Lazy Clause Genera- tion (LCG), has been found to be faster than MIP for some scheduling problems with time-varying action costs. In this paper, we...... compare CP and LCG against a solve-and-improve approach for two recently introduced problems in maritime logistics with time-varying action costs: the Liner Shipping Fleet Repositioning Problem (LSFRP) and the Bulk Port Cargo Throughput Optimisation Problem (BPCTOP). We present a novel CP model...... for the LSFRP, which is faster than all previous methods and outperforms a simplified automated planning model without time-varying costs. We show that a LCG solver is faster for solving the BPCTOP than a standard finite domain CP solver with a simplified model. We find that CP and LCG are effective methods...

Simplified compact containment BWR plant

International Nuclear Information System (INIS)

Heki, H.; Nakamaru, M.; Tsutagawa, M.; Hiraiwa, K.; Arai, K.; Hida, T.

2004-01-01

The reactor concept considered in this paper has a small power output, a compact containment and a simplified BWR configuration with comprehensive safety features. The Compact Containment Boiling Water Reactor (CCR), which is being developed with matured BWR technologies together with innovative systems/components, is expected to prove attractive in the world energy markets due to its flexibility in regard to both energy demands and site conditions, its high potential for reducing investment risk and its safety features facilitating public acceptance. The flexibility is achieved by CCR's small power output of 300 MWe class and capability of long operating cycle (refueling intervals). CCR is expected to be attractive from view point of investment due to its simplification/innovation in design such as natural circulation core cooling with the bottom located short core, internal upper entry control rod drives (CRDs) with ring-type dryers and simplified ECCS system with high pressure containment concept. The natural circulation core eliminates recirculation pumps and the maintenance of such pumps. The internal upper entry CRDs reduce the height of the reactor vessel (RPV) and consequently reduce the height of the primary containment vessel (PCV). The safety features mainly consist of large water inventory above the core without large penetration below the top of the core, passive cooling system by isolation condenser (IC), passive auto catalytic recombiner and in-vessel retention (IVR) capability. The large inventory increases the system response time in the case of design-base accidents, including loss of coolant accidents. The IC suppresses PCV pressure by steam condensation without any AC power. The recombiner decreases hydrogen concentration in the PCV in the case of a severe accident. Cooling the molten core inside the RPV if the core should be damaged by loss of core coolability could attain the IVR. The feasibility of CCR safety system has been confirmed by LOCA

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.

Towards the next generation of simplified Dark Matter models

CERN Document Server

Albert, Andreas

This White Paper is an input to the ongoing discussion about the extension and refinement of simplified Dark Matter (DM) models. Based on two concrete examples, we show how existing simplified DM models (SDMM) can be extended to provide a more accurate and comprehensive framework to interpret and characterise collider searches. In the first example we extend the canonical SDMM with a scalar mediator to include mixing with the Higgs boson. We show that this approach not only provides a better description of the underlying kinematic properties that a complete model would possess, but also offers the option of using this more realistic class of scalar mixing models to compare and combine consistently searches based on different experimental signatures. The second example outlines how a new physics signal observed in a visible channel can be connected to DM by extending a simplified model including effective couplings. This discovery scenario uses the recently observed excess in the high-mass diphoton searches of...

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

移动Ad Hoc网络路由协议综述%A Survey of Routing Protocols for Mobile Ad Hoc Networks

Institute of Scientific and Technical Information of China (English)

张顺亮; 叶澄清; 李方敏

2003-01-01

A review of current research about routing protocols for mobile Ad Hoc networks is made. Based on classifying of them, the characteristic, the strength and the weakness of these protocols are evaluated respectively. Then some crucial strategies to improve the existing routing protocols are proposed. Besides, a frame of new routing protocol for Ad Hoc networks is put forward. Finally, open issues that still need investigation are listed.

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

48 CFR 2953.102 - Quotation for Simplified Acquisitions DL 1-2078.

Science.gov (United States)

2010-10-01

... 48 Federal Acquisition Regulations System 7 2010-10-01 2010-10-01 false Quotation for Simplified Acquisitions DL 1-2078. 2953.102 Section 2953.102 Federal Acquisition Regulations System DEPARTMENT OF LABOR CLAUSE AND FORMS FORMS General 2953.102 Quotation for Simplified Acquisitions DL 1-2078. The following...

Intraarterial route increases the risk of cerebral lesions after mesenchymal cell administration in animal model of ischemia

Science.gov (United States)

Argibay, Bárbara; Trekker, Jesse; Himmelreich, Uwe; Beiras, Andrés; Topete, Antonio; Taboada, Pablo; Pérez-Mato, María; Vieites-Prado, Alba; Iglesias-Rey, Ramón; Rivas, José; Planas, Anna M.; Sobrino, Tomás; Castillo, José; Campos, Francisco

2017-01-01

Mesenchymal stem cells (MSCs) are a promising clinical therapy for ischemic stroke. However, critical parameters, such as the most effective administration route, remain unclear. Intravenous (i.v.) and intraarterial (i.a.) delivery routes have yielded varied outcomes across studies, potentially due to the unknown MSCs distribution. We investigated whether MSCs reached the brain following i.a. or i.v. administration after transient cerebral ischemia in rats, and evaluated the therapeutic effects of both routes. MSCs were labeled with dextran-coated superparamagnetic nanoparticles for magnetic resonance imaging (MRI) cell tracking, transmission electron microscopy and immunohistological analysis. MSCs were found in the brain following i.a. but not i.v. administration. However, the i.a. route increased the risk of cerebral lesions and did not improve functional recovery. The i.v. delivery is safe but MCS do not reach the brain tissue, implying that treatment benefits observed for this route are not attributable to brain MCS engrafting after stroke.

The Numerical Welding Simulation - Developments and Validation of Simplified and Bead Lumping Methods

International Nuclear Information System (INIS)

Baup, Olivier

2001-01-01

The aim of this work was to study the TIG multipass welding process on stainless steel, by means of numerical methods and then to work out simplified and bead lumping methods in order to reduce adjusting and realisation times of these calculations. A simulation was used as reference for the validation of these methods; after the presentation of the test series having led to the option choices of this calculation (2D generalised plane strains, elastoplastic model with an isotropic hardening, hardening restoration due to high temperatures), various simplifications were tried on a plate geometry. These simplifications related various modelling points with a correct plastic flow representation in the plate. The use of a reduced number of thermal fields characterising the bead deposit and a low number of tensile curves allow to obtain interesting results, decreasing significantly the Computing times. In addition various lumping bead methods have been studied and concerning both the shape and the thermic of the macro-deposits. The macro-deposit shapes studied are in 'L', or in layer or they represent two beads one on top of the other. Among these three methods, only those using a few number of lumping beads gave bad results since thermo-mechanical history was deeply modified near and inside the weld. Thereafter, simplified methods have been applied to a tubular geometry. On this new geometry, experimental measurements were made during welding, which allow a validation of the reference calculation. Simplified and reference calculations gave approximately the same stress fields as found on plate geometry. Finally, in the last part of this document a procedure for automatic data setting permitting to reduce significantly the calculation phase preparation is presented. It has been applied to the calculation of thick pipe welding in 90 beads; the results are compared with a simplified simulation realised by Framatome and with experimental measurements. A bead by

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

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

Development and validation of a simplified titration method for monitoring volatile fatty acids in anaerobic digestion.

Science.gov (United States)

Sun, Hao; Guo, Jianbin; Wu, Shubiao; Liu, Fang; Dong, Renjie

2017-09-01

The volatile fatty acids (VFAs) concentration has been considered as one of the most sensitive process performance indicators in anaerobic digestion (AD) process. However, the accurate determination of VFAs concentration in AD processes normally requires advanced equipment and complex pretreatment procedures. A simplified method with fewer sample pretreatment procedures and improved accuracy is greatly needed, particularly for on-site application. This report outlines improvements to the Nordmann method, one of the most popular titrations used for VFA monitoring. The influence of ion and solid interfering subsystems in titrated samples on results accuracy was discussed. The total solid content in titrated samples was the main factor affecting accuracy in VFA monitoring. Moreover, a high linear correlation was established between the total solids contents and VFA measurement differences between the traditional Nordmann equation and gas chromatography (GC). Accordingly, a simplified titration method was developed and validated using a semi-continuous experiment of chicken manure anaerobic digestion with various organic loading rates. The good fitting of the results obtained by this method in comparison with GC results strongly supported the potential application of this method to VFA monitoring. Copyright © 2017. Published by Elsevier Ltd.

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