Cost effectiveness of the stream-gaging program in northeastern California

USGS Publications Warehouse

Hoffard, S.H.; Pearce, V.F.; Tasker, Gary D.; Doyle, W.H.

1984-01-01

Results are documented of a study of the cost effectiveness of the stream-gaging program in northeastern California. Data uses and funding sources were identified for the 127 continuous stream gages currently being operated in the study area. One stream gage was found to have insufficient data use to warrant cooperative Federal funding. Flow-routing and multiple-regression models were used to simulate flows at selected gaging stations. The models may be sufficiently accurate to replace two of the stations. The average standard error of estimate of streamflow records is 12.9 percent. This overall level of accuracy could be reduced to 12.0 percent using computer-recommended service routes and visit frequencies. (USGS)

Mind, Machine, and Creativity: An Artist's Perspective.

PubMed

Sundararajan, Louise

2014-06-01

Harold Cohen is a renowned painter who has developed a computer program, AARON, to create art. While AARON has been hailed as one of the most creative AI programs, Cohen consistently rejects the claims of machine creativity. Questioning the possibility for AI to model human creativity, Cohen suggests in so many words that the human mind takes a different route to creativity, a route that privileges the relational, rather than the computational, dimension of cognition. This unique perspective on the tangled web of mind, machine, and creativity is explored by an application of three relational models of the mind to an analysis of Cohen's talks and writings, which are available on his website: www.aaronshome.com.

Mind, Machine, and Creativity: An Artist's Perspective

PubMed Central

Sundararajan, Louise

2014-01-01

Harold Cohen is a renowned painter who has developed a computer program, AARON, to create art. While AARON has been hailed as one of the most creative AI programs, Cohen consistently rejects the claims of machine creativity. Questioning the possibility for AI to model human creativity, Cohen suggests in so many words that the human mind takes a different route to creativity, a route that privileges the relational, rather than the computational, dimension of cognition. This unique perspective on the tangled web of mind, machine, and creativity is explored by an application of three relational models of the mind to an analysis of Cohen's talks and writings, which are available on his website: www.aaronshome.com. PMID:25541564

The use of three-parameter rating table lookup programs, RDRAT and PARM3, in hydraulic flow models

USGS Publications Warehouse

Sanders, C.L.

1995-01-01

Subroutines RDRAT and PARM3 enable computer programs such as the BRANCH open-channel unsteady-flow model to route flows through or over combinations of critical-flow sections, culverts, bridges, road- overflow sections, fixed spillways, and(or) dams. The subroutines also obstruct upstream flow to simulate operation of flapper-type tide gates. A multiplier can be applied by date and time to simulate varying numbers of tide gates being open or alternative construction scenarios for multiple culverts. The subroutines use three-parameter (headwater, tailwater, and discharge) rating table lookup methods. These tables may be manually prepared using other programs that do step-backwater computations or compute flow through bridges and culverts or over dams. The subroutine, therefore, precludes the necessity of incorporating considerable hydraulic computational code into the client program, and provides complete flexibility for users of the model for routing flow through almost any affixed structure or combination of structures. The subroutines are written in Fortran 77 language, and have minimal exchange of information with the BRANCH model or other possible client programs. The report documents the interpolation methodology, data input requirements, and software.

Freight Transportation Energy Use : Volume 2. Methodology and Program Documentation.

DOT National Transportation Integrated Search

1978-07-01

The structure and logic of the transportation network model component of the TSC Freight Energy Model are presented. The model assigns given origin-destination commodity flows to specific transport modes and routes, thereby determining the traffic lo...

Collectively loading programs in a multiple program multiple data environment

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

Aho, Michael E.; Attinella, John E.; Gooding, Thomas M.

Techniques are disclosed for loading programs efficiently in a parallel computing system. In one embodiment, nodes of the parallel computing system receive a load description file which indicates, for each program of a multiple program multiple data (MPMD) job, nodes which are to load the program. The nodes determine, using collective operations, a total number of programs to load and a number of programs to load in parallel. The nodes further generate a class route for each program to be loaded in parallel, where the class route generated for a particular program includes only those nodes on which the programmore » needs to be loaded. For each class route, a node is selected using a collective operation to be a load leader which accesses a file system to load the program associated with a class route and broadcasts the program via the class route to other nodes which require the program.« less

The Time Window Vehicle Routing Problem Considering Closed Route

NASA Astrophysics Data System (ADS)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

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

Developing tolled-route demand estimation capabilities for Texas : opportunities for enhancement of existing models.

DOT National Transportation Integrated Search

2014-08-01

The travel demand models developed and applied by the Transportation Planning and Programming Division : (TPP) of the Texas Department of Transportation (TxDOT) are daily three-step models (i.e., trip generation, trip : distribution, and traffic assi...

Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

PubMed Central

Sun, Yan; Lang, Maoxiang; Wang, Danzhu

2016-01-01

The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

Modeling anuran detection and site occupancy on North American Amphibian Monitoring Program (NAAMP) routes in Maryland

USGS Publications Warehouse

Weir, L.A.; Royle, J. Andrew; Nanjappa, P.; Jung, R.E.

2005-01-01

One of the most fundamental problems in monitoring animal populations is that of imperfect detection. Although imperfect detection can be modeled, studies examining patterns in occurrence often ignore detection and thus fail to properly partition variation in detection from that of occurrence. In this study, we used anuran calling survey data collected on North American Amphibian Monitoring Program routes in eastern Maryland to investigate factors that influence detection probability and site occupancy for 10 anuran species. In 2002, 17 calling survey routes in eastern Maryland were surveyed to collect environmental and species data nine or more times. To analyze these data, we developed models incorporating detection probability and site occupancy. The results suggest that, for more than half of the 10 species, detection probabilities vary most with season (i.e., day-of-year), air temperature, time, and moon illumination, whereas site occupancy may vary by the amount of palustrine forested wetland habitat. Our results suggest anuran calling surveys should document air temperature, time of night, moon illumination, observer skill, and habitat change over time, as these factors can be important to model-adjusted estimates of site occupancy. Our study represents the first formal modeling effort aimed at developing an analytic assessment framework for NAAMP calling survey data.

Key issues and technical route of cyber physical distribution system

NASA Astrophysics Data System (ADS)

Zheng, P. X.; Chen, B.; Zheng, L. J.; Zhang, G. L.; Fan, Y. L.; Pei, T.

2017-01-01

Relying on the National High Technology Research and Development Program, this paper introduced the key issues in Cyber Physical Distribution System (CPDS), mainly includes: composite modelling method and interaction mechanism, system planning method, security defence technology, distributed control theory. Then on this basis, the corresponding technical route is proposed, and a more detailed research framework along with main schemes to be adopted is also presented.

Modifications of the U.S. Geological Survey modular, finite-difference, ground-water flow model to read and write geographic information system files

USGS Publications Warehouse

Orzol, Leonard L.; McGrath, Timothy S.

1992-01-01

This report documents modifications to the U.S. Geological Survey modular, three-dimensional, finite-difference, ground-water flow model, commonly called MODFLOW, so that it can read and write files used by a geographic information system (GIS). The modified model program is called MODFLOWARC. Simulation programs such as MODFLOW generally require large amounts of input data and produce large amounts of output data. Viewing data graphically, generating head contours, and creating or editing model data arrays such as hydraulic conductivity are examples of tasks that currently are performed either by the use of independent software packages or by tedious manual editing, manipulating, and transferring data. Programs such as GIS programs are commonly used to facilitate preparation of the model input data and analyze model output data; however, auxiliary programs are frequently required to translate data between programs. Data translations are required when different programs use different data formats. Thus, the user might use GIS techniques to create model input data, run a translation program to convert input data into a format compatible with the ground-water flow model, run the model, run a translation program to convert the model output into the correct format for GIS, and use GIS to display and analyze this output. MODFLOWARC, avoids the two translation steps and transfers data directly to and from the ground-water-flow model. This report documents the design and use of MODFLOWARC and includes instructions for data input/output of the Basic, Block-centered flow, River, Recharge, Well, Drain, Evapotranspiration, General-head boundary, and Streamflow-routing packages. The modification to MODFLOW and the Streamflow-Routing package was minimized. Flow charts and computer-program code describe the modifications to the original computer codes for each of these packages. Appendix A contains a discussion on the operation of MODFLOWARC using a sample problem.

Software for Simulating Air Traffic

NASA Technical Reports Server (NTRS)

Sridhar, Banavar; Bilimoria, Karl; Grabbe, Shon; Chatterji, Gano; Sheth, Kapil; Mulfinger, Daniel

2006-01-01

Future Air Traffic Management Concepts Evaluation Tool (FACET) is a system of software for performing computational simulations for evaluating advanced concepts of advanced air-traffic management. FACET includes a program that generates a graphical user interface plus programs and databases that implement computational models of weather, airspace, airports, navigation aids, aircraft performance, and aircraft trajectories. Examples of concepts studied by use of FACET include aircraft self-separation for free flight; prediction of air-traffic-controller workload; decision support for direct routing; integration of spacecraft-launch operations into the U.S. national airspace system; and traffic- flow-management using rerouting, metering, and ground delays. Aircraft can be modeled as flying along either flight-plan routes or great-circle routes as they climb, cruise, and descend according to their individual performance models. The FACET software is modular and is written in the Java and C programming languages. The architecture of FACET strikes a balance between flexibility and fidelity; as a consequence, FACET can be used to model systemwide airspace operations over the contiguous U.S., involving as many as 10,000 aircraft, all on a single desktop or laptop computer running any of a variety of operating systems. Two notable applications of FACET include: (1) reroute conformance monitoring algorithms that have been implemented in one of the Federal Aviation Administration s nationally deployed, real-time, operational systems; and (2) the licensing and integration of FACET with the commercially available Flight Explorer, which is an Internet- based, real-time flight-tracking system.

Constraint-Based Routing Models for the Transport of Radioactive Materials

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

Peterson, Steven K

2015-01-01

The Department of Energy (DOE) has a historic programmatic interest in the safe and secure routing, tracking, and transportation risk analysis of radiological materials in the United States. In order to address these program goals, DOE has funded the development of several tools and related systems designed to provide insight to planners and other professionals handling radioactive materials shipments. These systems include the WebTRAGIS (Transportation Routing Analysis Geographic Information System) platform. WebTRAGIS is a browser-based routing application developed at Oak Ridge National Laboratory (ORNL) focused primarily on the safe transport of spent nuclear fuel from US nuclear reactors via railway,more » highway, or waterway. It is also used for the transport planning of low-level radiological waste to depositories such as the Waste Isolation Pilot Plant (WIPP) facility. One particular feature of WebTRAGIS is its coupling with high-resolution population data from ORNL s LandScan project. This allows users to obtain highly accurate population count and density information for use in route planning and risk analysis. To perform the routing and risk analysis WebTRAGIS incorporates a basic routing model methodology, with the additional application of various constraints designed to mimic US Department of Transportation (DOT), DOE, and Nuclear Regulatory Commission (NRC) regulations. Aside from the routing models available in WebTRAGIS, the system relies on detailed or specialized modal networks for the route solutions. These include a highly detailed network model of the US railroad system, the inland and coastal waterways, and a specialized highway network that focuses on the US interstate system and the designated hazardous materials and Highway Route Controlled Quantity (HRCQ) -designated roadways. The route constraints in WebTRAGIS rely upon a series of attributes assigned to the various components of the different modal networks. Routes are determined via a constrained shortest-path Dijkstra algorithm that has an assigned impedance factor. The route constraints modify the various impedance weights to bias or prefer particular network characteristics as desired by the user. Both the basic route model and the constrained impedance function calculations are determined by a series of network characteristics and shipment types. The study examines solutions under various constraints modeled by WebTRAGIS including possible routes from select shut-down reactor sites in the US to specific locations in the US. For purposes of illustration, the designated destinations are Oak Ridge National Laboratory in Tennessee and the Savannah River Site in South Carolina. To the degree that routes express sameness or variety under constraints serves to illustrate either a) the determinism of particular transport modes by either configuration or regulatory compliance, and/or b) the variety of constrained routes that are regulation compliant but may not be operationally feasible.« less

A Best Practices Model for Preparation of Rural Special Education Teachers.

ERIC Educational Resources Information Center

Cegelka, Patricia A.; Alvarado, Jose Luis

2000-01-01

A district-university partnership program provides an alternative route to teacher certification for noncredentialed special education teachers working in a rural California desert region. The program features locally available courses, on-campus summer courses, an alternative internship credential, collaborative structure, a coach-of-coaches…

Minimum Energy Routing through Interactive Techniques (MERIT) modeling

NASA Technical Reports Server (NTRS)

Wylie, Donald P.

1988-01-01

The MERIT program is designed to demonstrate the feasibility of fuel savings by airlines through improved route selection using wind observations from their own fleet. After a discussion of weather and aircraft data, manually correcting wind fields, automatic corrections to wind fields, and short-range prediction models, it is concluded that improvements in wind information are possible if a system is developed for analyzing wind observations and correcting the forecasts made by the major models. One data handling system, McIDAS, can easily collect and display wind observations and model forecasts. Changing the wind forecasts beyond the time of the most recent observations is more difficult; an Australian Mesoscale Model was tested with promising but not definitive results.

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

PubMed Central

Yu, Hao; Solvang, Wei Deng

2016-01-01

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

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

PubMed

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.

Routing UAVs to Co-Optimize Mission Effectiveness and Network Performance with Dynamic Programming

DTIC Science & Technology

2011-03-01

Heuristics on Hexagonal Connected Dominating Sets to Model Routing Dissemination," in Communication Theory, Reliability, and Quality of Service (CTRQ...24] Matthew Capt. USAF Compton, Improving the Quality of Service and Security of Military Networks with a Network Tasking Order Process, 2010. [25...Wesley, 2006. [32] James Haught, "Adaptive Quality of Service Engine with Dynamic Queue Control," Air Force Institute of Technology, Wright

Improved routing strategy based on gravitational field theory

NASA Astrophysics Data System (ADS)

Song, Hai-Quan; Guo, Jin

2015-10-01

Routing and path selection are crucial for many communication and logistic applications. We study the interaction between nodes and packets and establish a simple model for describing the attraction of the node to the packet in transmission process by using the gravitational field theory, considering the real and potential congestion of the nodes. On the basis of this model, we propose a gravitational field routing strategy that considers the attractions of all of the nodes on the travel path to the packet. In order to illustrate the efficiency of proposed routing algorithm, we introduce the order parameter to measure the throughput of the network by the critical value of phase transition from a free flow phase to a congested phase, and study the distribution of betweenness centrality and traffic jam. Simulations show that, compared with the shortest path routing strategy, the gravitational field routing strategy considerably enhances the throughput of the network and balances the traffic load, and nearly all of the nodes are used efficiently. Project supported by the Technology and Development Research Project of China Railway Corporation (Grant No. 2012X007-D) and the Key Program of Technology and Development Research Foundation of China Railway Corporation (Grant No. 2012X003-A).

Communications network design and costing model programmers manual

NASA Technical Reports Server (NTRS)

Logan, K. P.; Somes, S. S.; Clark, C. A.

1983-01-01

Otpimization algorithms and techniques used in the communications network design and costing model for least cost route and least cost network problems are examined from the programmer's point of view. All system program modules, the data structures within the model, and the files which make up the data base are described.

SHEDS-Multimedia Model Version 3 (a) Technical Manual; (b) User Guide; and (c) Executable File to Launch SAS Program and Install Model

EPA Science Inventory

Reliable models for assessing human exposures are important for understanding health risks from chemicals. The Stochastic Human Exposure and Dose Simulation model for multimedia, multi-route/pathway chemicals (SHEDS-Multimedia), developed by EPA’s Office of Research and Developm...

User's manual for BRI-STARS (BRIdge Stream Tube model for Alluvial River Simulation)

DOT National Transportation Integrated Search

1998-07-01

There is a need for a generalized water and sediment-routing computer model for solving complicated river engineering problems with limited data and resources. This program should have the following capabilities: to compute hydraulic parameters for o...

The integrated model for solving the single-period deterministic inventory routing problem

NASA Astrophysics Data System (ADS)

Rahim, Mohd Kamarul Irwan Abdul; Abidin, Rahimi; Iteng, Rosman; Lamsali, Hendrik

2016-08-01

This paper discusses the problem of efficiently managing inventory and routing problems in a two-level supply chain system. Vendor Managed Inventory (VMI) policy is an integrating decisions between a supplier and his customers. We assumed that the demand at each customer is stationary and the warehouse is implementing a VMI. The objective of this paper is to minimize the inventory and the transportation costs of the customers for a two-level supply chain. The problem is to determine the delivery quantities, delivery times and routes to the customers for the single-period deterministic inventory routing problem (SP-DIRP) system. As a result, a linear mixed-integer program is developed for the solutions of the SP-DIRP problem.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

PubMed

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

Guidelines for Calculating and Routing a Dam-Break Flood.

DTIC Science & Technology

1977-01-01

flow, Teton Dam . 20. ABSTRACT (Continue an reverse aide If necessary and Identify by block number) This report described procedures necessary to calculate...and route a dam -break flood using an existing generalized unsteady open channel flow model. The recent Teton Dam event was reconstituted to test the...methodology may be obtained from The Hydrologic Engineering Center. The computer program was applied to the Teton Dam data set to demonstrate the level of

Comparison of three artificial intelligence techniques for discharge routing

NASA Astrophysics Data System (ADS)

Khatibi, Rahman; Ghorbani, Mohammad Ali; Kashani, Mahsa Hasanpour; Kisi, Ozgur

2011-06-01

SummaryThe inter-comparison of three artificial intelligence (AI) techniques are presented using the results of river flow/stage timeseries, that are otherwise handled by traditional discharge routing techniques. These models comprise Artificial Neural Network (ANN), Adaptive Nero-Fuzzy Inference System (ANFIS) and Genetic Programming (GP), which are for discharge routing of Kizilirmak River, Turkey. The daily mean river discharge data with a period between 1999 and 2003 were used for training and testing the models. The comparison includes both visual and parametric approaches using such statistic as Coefficient of Correlation (CC), Mean Absolute Error (MAE) and Mean Square Relative Error (MSRE), as well as a basic scoring system. Overall, the results indicate that ANN and ANFIS have mixed fortunes in discharge routing, and both have different abilities in capturing and reproducing some of the observed information. However, the performance of GP displays a better edge over the other two modelling approaches in most of the respects. Attention is given to the information contents of recorded timeseries in terms of their peak values and timings, where one performance measure may capture some of the information contents but be ineffective in others. Thus, this makes a case for compiling knowledge base for various modelling techniques.

Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

NASA Technical Reports Server (NTRS)

Ng, Hok K.; Grabbe, Shon; Mukherjee, Avijit

2010-01-01

The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

PubMed Central

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme. PMID:26690571

Alternative Routes to Teacher Certification.

ERIC Educational Resources Information Center

Smith-Davis, Judy

This literature review examines alternative routes to teacher certification and presents alternative certification regulations and policies for 19 states. Three categories of nontraditional personnel preparation programs are noted: nontraditional recruitment programs, retraining programs, and alternative certification programs. A definition of…

A Two-Echelon Cooperated Routing Problem for a Ground Vehicle and Its Carried Unmanned Aerial Vehicle.

PubMed

Luo, Zhihao; Liu, Zhong; Shi, Jianmai

2017-05-17

In this paper, a two-echelon cooperated routing problem for the ground vehicle (GV) and its carried unmanned aerial vehicle (UAV) is investigated, where the GV travels on the road network and its UAV travels in areas beyond the road to visit a number of targets unreached by the GV. In contrast to the classical two-echelon routing problem, the UAV has to launch and land on the GV frequently to change or charge its battery while the GV is moving on the road network. A new 0-1 integer programming model is developed to formulate the problem, where the constraints on the spatial and temporal cooperation of GV and UAV routes are included. Two heuristics are proposed to solve the model: the first heuristic (H1) constructs a complete tour for all targets and splits it by GV routes, while the second heuristic (H2) constructs the GV tour and assigns UAV flights to it. Random instances with six different sizes (25-200 targets, 12-80 rendezvous nodes) are used to test the algorithms. Computational results show that H1 performs slightly better than H2, while H2 uses less time and is more stable.

A Novel Joint Problem of Routing, Scheduling, and Variable-Width Channel Allocation in WMNs

PubMed Central

Liu, Wan-Yu; Chou, Chun-Hung

2014-01-01

This paper investigates a novel joint problem of routing, scheduling, and channel allocation for single-radio multichannel wireless mesh networks in which multiple channel widths can be adjusted dynamically through a new software technology so that more concurrent transmissions and suppressed overlapping channel interference can be achieved. Although the previous works have studied this joint problem, their linear programming models for the problem were not incorporated with some delicate constraints. As a result, this paper first constructs a linear programming model with more practical concerns and then proposes a simulated annealing approach with a novel encoding mechanism, in which the configurations of multiple time slots are devised to characterize the dynamic transmission process. Experimental results show that our approach can find the same or similar solutions as the optimal solutions for smaller-scale problems and can efficiently find good-quality solutions for a variety of larger-scale problems. PMID:24982990

The cost-effectiveness of New York City's Safe Routes to School Program.

PubMed

Muennig, Peter A; Epstein, Michael; Li, Guohua; DiMaggio, Charles

2014-07-01

We evaluated the cost-effectiveness of a package of roadway modifications in New York City funded under the Safe Routes to School (SRTS) program. We used a Markov model to estimate long-term impacts of SRTS on injury reduction and the associated savings in medical costs, lifelong disability, and death. Model inputs included societal costs (in 2013 US dollars) and observed spatiotemporal changes in injury rates associated with New York City's implementation of SRTS relative to control intersections. Structural changes to roadways were assumed to last 50 years before further investment is required. Therefore, costs were discounted over 50 consecutive cohorts of modified roadway users under SRTS. SRTS was associated with an overall net societal benefit of $230 million and 2055 quality-adjusted life years gained in New York City. SRTS reduces injuries and saves money over the long run.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2017-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

NASA Astrophysics Data System (ADS)

Fazayeli, Saeed; Eydi, Alireza; Kamalabadi, Isa Nakhai

2018-07-01

Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-routing problem on multimodal transportation network. The introduced problem follows four objectives simultaneously which form main contribution of the paper; determining multimodal routes between supplier and distribution centers, locating mode changing facilities, locating distribution centers, and determining product delivery tours from the distribution centers to retailers. An integer linear programming is presented for the problem, and a genetic algorithm with a new chromosome structure proposed to solve the problem. Proposed chromosome structure consists of two different parts for multimodal transportation and location-routing parts of the model. Based on published data in the literature, two numerical cases with different sizes generated and solved. Also, different cost scenarios designed to better analyze model and algorithm performance. Results show that algorithm can effectively solve large-size problems within a reasonable time which GAMS software failed to reach an optimal solution even within much longer times.

Operations management in distribution networks within a smart city framework.

PubMed

Cerulli, Raffaele; Dameri, Renata Paola; Sciomachen, Anna

2017-02-20

This article studies a vehicle routing problem with environmental constraints that are motivated by the requirements for sustainable urban transport. The empirical research presents a fleet planning problem that takes into consideration both minimum cost vehicle routes and minimum pollution. The problem is formulated as a mixed integer linear programming model and experimentally validated using data collected from a real situation: a grocery company delivering goods ordered via e-channels to customers spread in the urban and metropolitan area of Genoa smart city. The proposed model is a variant of the vehicle routing problem tailored to include environmental issues and street limitations. Its novelty regards also the use of real data instances provided by the B2C grocery company. Managerial implications are the choice of both the routes and the number and type of vehicles. Results show that commercial distribution strategies achieve better results in term of both business and environmental performance, provided the smart mobility goals and constraints are included into the distribution model from the beginning. © The authors 2017. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

A Sharp methodology for VLSI layout

NASA Astrophysics Data System (ADS)

Bapat, Shekhar

1993-01-01

The layout problem for VLSI circuits is recognized as a very difficult problem and has been traditionally decomposed into the several seemingly independent sub-problems of placement, global routing, and detailed routing. Although this structure achieves a reduction in programming complexity, it is also typically accompanied by a reduction in solution quality. Most current placement research recognizes that the separation is artificial, and that the placement and routing problems should be solved ideally in tandem. We propose a new interconnection model, Sharp and an associated partitioning algorithm. The Sharp interconnection model uses a partitioning shape that roughly resembles the musical sharp 'number sign' and makes extensive use of pre-computed rectilinear Steiner trees. The model is designed to generate strategic routing information along with the partitioning results. Additionally, the Sharp model also generates estimates of the routing congestion. We also propose the Sharp layout heuristic that solves the layout problem in its entirety. The Sharp layout heuristic makes extensive use of the Sharp partitioning model. The use of precomputed Steiner tree forms enables the method to model accurately net characteristics. For example, the Steiner tree forms can model both the length of the net and more importantly its route. In fact, the tree forms are also appropriate for modeling the timing delays of nets. The Sharp heuristic works to minimize both the total layout area by minimizing total net length (thus reducing the total wiring area), and the congestion imbalances in the various channels (thus reducing the unused or wasted channel area). Our heuristic uses circuit element movements amongst the different partitioning blocks and selection of alternate minimal Steiner tree forms to achieve this goal. The objective function for the algorithm can be modified readily to include other important circuit constraints like propagation delays. The layout technique first computes a very high-level approximation of the layout solution (i.e., the positions of the circuit elements and the associated net routes). The approximate solution is alternately refined, objective function. The technique creates well defined sub-problems and offers intermediary steps that can be solved in parallel, as well as a parallel mechanism to merge the sub-problem solutions.

Alternative Route Programs for Certification in Special Education: Program Infrastructure Instructional Delivery, and Participant Characteristics

ERIC Educational Resources Information Center

Rosenberg, Michael S.; Boyer, K. Lynn; Sindelar, Paul T.; Misra, Sunil K.

2007-01-01

This study describes special education alternative route (AR) teacher preparation programs. The authors developed a national database of programs and collected information on program sponsorship, length and intensity, features, and participant demographics. Most of the 235 programs in the database were in states that had significant shortages of…

Incorporating location, routing, and inventory decisions in a bi-objective supply chain design problem with risk-pooling

NASA Astrophysics Data System (ADS)

Tavakkoli-Moghaddam, Reza; Forouzanfar, Fateme; Ebrahimnejad, Sadoullah

2013-07-01

This paper considers a single-sourcing network design problem for a three-level supply chain. For the first time, a novel mathematical model is presented considering risk-pooling, the inventory existence at distribution centers (DCs) under demand uncertainty, the existence of several alternatives to transport the product between facilities, and routing of vehicles from distribution centers to customer in a stochastic supply chain system, simultaneously. This problem is formulated as a bi-objective stochastic mixed-integer nonlinear programming model. The aim of this model is to determine the number of located distribution centers, their locations, and capacity levels, and allocating customers to distribution centers and distribution centers to suppliers. It also determines the inventory control decisions on the amount of ordered products and the amount of safety stocks at each opened DC, selecting a type of vehicle for transportation. Moreover, it determines routing decisions, such as determination of vehicles' routes starting from an opened distribution center to serve its allocated customers and returning to that distribution center. All are done in a way that the total system cost and the total transportation time are minimized. The Lingo software is used to solve the presented model. The computational results are illustrated in this paper.

Cost Effectiveness of Alternative Route Special Education Teacher Preparation

ERIC Educational Resources Information Center

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

2012-01-01

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

A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce

NASA Astrophysics Data System (ADS)

Xia, Chao; Sheng, Ying; Jiang, Zhong-Zhong; Tan, Chunqiao; Huang, Min; He, Yuanjian

2015-12-01

In this paper, a novel discrete differential evolution (DDE) algorithm is proposed to solve the vehicle routing problems (VRP) in B2C e-commerce, in which VRP is modeled by the incomplete graph based on the actual urban road system. First, a variant of classical VRP is described and a mathematical programming model for the variant is given. Second, the DDE is presented, where individuals are represented as the sequential encoding scheme, and a novel reparation operator is employed to repair the infeasible solutions. Furthermore, a FLOYD operator for dealing with the shortest route is embedded in the proposed DDE. Finally, an extensive computational study is carried out in comparison with the predatory search algorithm and genetic algorithm, and the results show that the proposed DDE is an effective algorithm for VRP in B2C e-commerce.

An epidemiological model of virus transmission in salmonid fishes of the Columbia River Basin

USGS Publications Warehouse

Ferguson, Paige F. B.; Breyta, Rachel; Brito, Ilana L.; Kurath, Gael; LaDeau, Shannon L.

2018-01-01

We have developed a dynamic epidemiological model informed by records of viral presence and genotypes to evaluate potential transmission routes maintaining a viral pathogen in economically and culturally important anadromous fish populations. In the Columbia River Basin, infectious hematopoietic necrosis virus (IHNV) causes severe disease, predominantly in juvenile steelhead trout (Oncorhynchus mykiss) and less frequently in Chinook salmon (O. tshawytscha). Mortality events following IHNV infection can be devastating for individual hatchery programs. Despite reports of high local mortality and extensive surveillance efforts, there are questions about how viral transmission is maintained. Modeling this system offers important insights into disease transmission in natural aquatic systems, as well as about the data requirements for generating accurate estimates about transmission routes and infection probabilities. We simulated six scenarios in which testing rates and the relative importance of different transmission routes varied. The simulations demonstrated that the model accurately identified routes of transmission and inferred infection probabilities accurately when there was testing of all cohort-sites. When testing records were incomplete, the model accurately inferred which transmission routes exposed particular cohort-sites but generated biased infection probabilities given exposure. After validating the model and generating guidelines for result interpretation, we applied the model to data from 14 annual cohorts (2000–2013) at 24 focal sites in a sub-region of the Columbia River Basin, the lower Columbia River (LCR), to quantify the relative importance of potential transmission routes in this focal sub-region. We demonstrate that exposure to IHNV via the return migration of adult fish is an important route for maintaining IHNV in the LCR sub-region, and the probability of infection following this exposure was relatively high at 0.16. Although only 1% of cohort-sites experienced self-exposure by infected juvenile fish, this transmission route had the greatest probability of infection (0.22). Increased testing and/or determining whether transmission can occur from cohort-sites without testing records (e.g., determining there was no testing record because there were no fish at the cohort-site) are expected to improve inference about infection probabilities. Increased use of secure water supplies and continued use of biosecurity protocols may reduce IHNV transmission from adult fish and juvenile fish within the site, respectively, to juvenile salmonids at hatcheries. Models and conclusions from this study are potentially relevant to understanding the relative importance of transmission routes for other important aquatic pathogens in salmonids, including the agents of bacterial kidney disease and coldwater disease, and the basic approach may be useful for other pathogens and hosts in other geographic regions.

Optimal traffic resource allocation and management.

DOT National Transportation Integrated Search

2010-05-01

"In this paper, we address the problem of determining the patrol routes of state troopers for maximum coverage of : highway spots with high frequencies of crashes (hot spots). We develop a mixed integer linear programming model : for this problem und...

Field-Based Internship Models for Alternative Certification of Science and Mathematics Teachers: Views of Interns, Mentors, and University Educators

ERIC Educational Resources Information Center

Arbaugh, Fran; Abell, Sandra; Lannin, John; Volkmann, Mark; Boone, William

2007-01-01

In response to shortages of science and mathematics teachers in the U.S., many states have promoted alternative routes to certification in which individuals with non-education undergraduate degrees can become certificated in shorter timeframes than in traditional programs. One consideration in designing alternative programs is how to arrange…

Improvements in Routing for Packet-Switched Networks

DTIC Science & Technology

1975-02-18

PROGRAM FOR COMPUTER SIMULATION . . 90 B.l Flow Diagram of Adaptive Routine 90 B.2 Progiam ARPSIM 93 B.3 Explanation of Variables...equa. 90 APPENDIX B ADAPTIVE ROUTING PROGRAM FOR COMPUTER SIMULA HON The computer simulation for adaptive routing was initially run on a DDP-24 small...TRANSMIT OVER AVAILABLE LINKS MESSAGES IN QUEUE COMPUTE Ni NUMBER OF ARRIVALS AT EACH NODE i AT TIME T Fig. Bla - Flow Diagram of Program Routine 92

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

NASA Technical Reports Server (NTRS)

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

2016-01-01

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

Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

NASA Astrophysics Data System (ADS)

Bombelli, Alessandro

Due to a soaring air travel growth in the last decades, air traffic management has become increasingly challenging. As a consequence, planning tools are being devised to help human decision-makers achieve a better management of air traffic. Planning tools are divided into two categories, strategic and tactical. Strategic planning generally addresses a larger planning domain and is performed days to hours in advance. Tactical planning is more localized and is performed hours to minutes in advance. An aggregate route model for strategic air traffic flow management is presented. It is an Eulerian model, describing the flow between cells of unidirectional point-to-point routes. Aggregate routes are created from flight trajectory data based on similarity measures. Spatial similarity is determined using the Frechet distance. The aggregate routes approximate actual well-traveled traffic patterns. By specifying the model resolution, an appropriate balance between model accuracy and model dimension can be achieved. For a particular planning horizon, during which weather is expected to restrict the flow, a procedure for designing airborne reroutes and augmenting the traffic flow model is developed. The dynamics of the traffic flow on the resulting network take the form of a discrete-time, linear time-invariant system. The traffic flow controls are ground holding, pre-departure rerouting and airborne rerouting. Strategic planning--determining how the controls should be used to modify the future traffic flow when local capacity violations are anticipated--is posed as an integer programming problem of minimizing a weighted sum of flight delays subject to control and capacity constraints. Several tests indicate the effectiveness of the modeling and strategic planning approach. In the final, most challenging, test, strategic planning is demonstrated for the six western-most Centers of the 22-Center national airspace. The planning time horizon is four hours long, and there is weather predicted that causes significant delays to the scheduled flights. Airborne reroute options are computed and added to the route model, and it is shown that the predicted delays can be significantly reduced. The test results also indicate the computational feasibility of the approach for a planning problem of this size.

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

PubMed

Haikal, Amira Y; Badawy, M; Ali, Hesham A

2014-01-01

Increasing efficiency and quality demands of modern Internet technologies drive today's network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature.

Towards Internet QoS Provisioning Based on Generic Distributed QoS Adaptive Routing Engine

PubMed Central

Haikal, Amira Y.; Badawy, M.; Ali, Hesham A.

2014-01-01

Increasing efficiency and quality demands of modern Internet technologies drive today's network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can be built. DQARE architecture is furnished with three relevant traffic control schemes, namely, service differentiation, QoS routing, and traffic engineering. The main objective of this paper is to (i) provide a general configuration guideline for service differentiation, (ii) formalize the theoretical properties of different QoS routing algorithms and then introduce a QoS routing algorithm (QOPRA) based on dynamic programming technique, and (iii) propose QoS multipath forwarding (QMPF) model for paths diversity exploitation. NS2-based simulations proved the DQARE superiority in terms of delay, packet delivery ratio, throughput, and control overhead. Moreover, extensive simulations are used to compare the proposed QOPRA algorithm and QMPF model with their counterparts in the literature. PMID:25309955

A Two-Echelon Cooperated Routing Problem for a Ground Vehicle and Its Carried Unmanned Aerial Vehicle

PubMed Central

Luo, Zhihao; Liu, Zhong; Shi, Jianmai

2017-01-01

In this paper, a two-echelon cooperated routing problem for the ground vehicle (GV) and its carried unmanned aerial vehicle (UAV) is investigated, where the GV travels on the road network and its UAV travels in areas beyond the road to visit a number of targets unreached by the GV. In contrast to the classical two-echelon routing problem, the UAV has to launch and land on the GV frequently to change or charge its battery while the GV is moving on the road network. A new 0–1 integer programming model is developed to formulate the problem, where the constraints on the spatial and temporal cooperation of GV and UAV routes are included. Two heuristics are proposed to solve the model: the first heuristic (H1) constructs a complete tour for all targets and splits it by GV routes, while the second heuristic (H2) constructs the GV tour and assigns UAV flights to it. Random instances with six different sizes (25–200 targets, 12–80 rendezvous nodes) are used to test the algorithms. Computational results show that H1 performs slightly better than H2, while H2 uses less time and is more stable. PMID:28513552

Evaluation of the safety benefits of legacy safe routes to school programs

DOT National Transportation Integrated Search

2008-08-01

This study first examined the feasibility of conducting a crash-based assessment of the safety effects of legacy Safe Routes to School : (SRTS) programs. These were SRTS programs operating before the passage of the Safe, Accountable, Flexible, Effici...

Implementation plan for safe routes to school program.

DOT National Transportation Integrated Search

2009-08-01

Section 1404 of the Safe, Accountable, Flexible, and Efficient Transportation Equity Act: A Legacy for Users (SAFETEA-LU, Public Law 109-59) establishes a national Safe Routes to School (SRTS) Program. The purpose of the program is to encourage K-8 s...

Operational modeling system with dynamic-wave routing

USGS Publications Warehouse

Ishii, A.L.; Charlton, T.J.; Ortel, T.W.; Vonnahme, C.C.; ,

1998-01-01

A near real-time streamflow-simulation system utilizing continuous-simulation rainfall-runoff generation with dynamic-wave routing is being developed by the U.S. Geological Survey in cooperation with the Du Page County Department of Environmental Concerns for a 24-kilometer reach of Salt Creek in Du Page County, Illinois. This system is needed in order to more effectively manage the Elmhurst Quarry Flood Control Facility, an off-line stormwater diversion reservoir located along Salt Creek. Near real time simulation capabilities will enable the testing and evaluation of potential rainfall, diversion, and return-flow scenarios on water-surface elevations along Salt Creek before implementing diversions or return-flows. The climatological inputs for the continuous-simulation rainfall-runoff model, Hydrologic Simulation Program - FORTRAN (HSPF) are obtained by Internet access and from a network of radio-telemetered precipitation gages reporting to a base-station computer. The unit area runoff time series generated from HSPF are the input for the dynamic-wave routing model. Full Equations (FEQ). The Generation and Analysis of Model Simulation Scenarios (GENSCN) interface is used as a pre- and post-processor for managing input data and displaying and managing simulation results. The GENSCN interface includes a variety of graphical and analytical tools for evaluation and quick visualization of the results of operational scenario simulations and thereby makes it possible to obtain the full benefit of the fully distributed dynamic routing results.

Validity of surveys to assess safe routes to school programs

USDA-ARS?s Scientific Manuscript database

Safe Routes to School programs are designed to make walking and bicycling to school safe and accessible for children. These programs promote children's physical activity and show promise for obesity prevention. However, there are few validated surveys to measure important outcomes such as student tr...

a New Multimodal Multi-Criteria Route Planning Model by Integrating a Fuzzy-Ahp Weighting Method and a Simulated Annealing Algorithm

NASA Astrophysics Data System (ADS)

Ghaderi, F.; Pahlavani, P.

2015-12-01

A multimodal multi-criteria route planning (MMRP) system provides an optimal multimodal route from an origin point to a destination point considering two or more criteria in a way this route can be a combination of public and private transportation modes. In this paper, the simulate annealing (SA) and the fuzzy analytical hierarchy process (fuzzy AHP) were combined in order to find this route. In this regard, firstly, the effective criteria that are significant for users in their trip were determined. Then the weight of each criterion was calculated using the fuzzy AHP weighting method. The most important characteristic of this weighting method is the use of fuzzy numbers that aids the users to consider their uncertainty in pairwise comparison of criteria. After determining the criteria weights, the proposed SA algorithm were used for determining an optimal route from an origin to a destination. One of the most important problems in a meta-heuristic algorithm is trapping in local minima. In this study, five transportation modes, including subway, bus rapid transit (BRT), taxi, walking, and bus were considered for moving between nodes. Also, the fare, the time, the user's bother, and the length of the path were considered as effective criteria for solving the problem. The proposed model was implemented in an area in centre of Tehran in a GUI MATLAB programming language. The results showed a high efficiency and speed of the proposed algorithm that support our analyses.

The quality of service in passenger transport terminals

NASA Astrophysics Data System (ADS)

Oprea, C.; Roşca, E.; Popa, M.; Ilie, A.; Dinu, O.; Roşca, M.

2016-11-01

The quality of service in transport terminals is differently perceived by engineers, economists, transport operators and sociologists. The traveler's perception is nevertheless decisive. The quality of service is well connected with the inside design of terminals, with the facilities in terminals and with the provided service standards. In order to provide a high level of service, the activities taking place in the public transport terminal and the maximum travelers flow size must be carefully analyzed and dimensioned. The purpose of modelling is to find the best route for each traveler from origin (entrance) to destination (exit) through all the intermediate service points, taking into consideration the instant network conditions. In developing the model we consider the walking, the waiting and the serving time. Using a simulation program written in ARENA we determine the waiting time. For validation, the model is used to evaluate the performance level in Bucharest Basarab station. By comparing the total walking distance for the possible routes and the utility function that describes the utility of all activities from entrance to exit we can find the optimal route.

User's Guide for Computer Program that Routes Signal Traces

NASA Technical Reports Server (NTRS)

Hedgley, David R., Jr.

2000-01-01

This disk contains both a FORTRAN computer program and the corresponding user's guide that facilitates both its incorporation into your system and its utility. The computer program represents an efficient algorithm that routes signal traces on layers of a printed circuit with both through-pins and surface mounts. The computer program included is an implementation of the ideas presented in the theoretical paper titled "A Formal Algorithm for Routing Signal Traces on a Printed Circuit Board", NASA TP-3639 published in 1996. The computer program in the "connects" file can be read with a FORTRAN compiler and readily integrated into software unique to each particular environment where it might be used.

[Integration of the functional signal of intraoperative EMG of the facial nerve in to navigation model for surgery of the petrous bone].

PubMed

Strauss, G; Strauss, M; Lüders, C; Stopp, S; Shi, J; Dietz, A; Lüth, T

2008-10-01

PROBLEM DEFINITION: The goal of this work is the integration of the information of the intraoperative EMG monitoring of the facial nerve into the radiological data of the petrous bone. The following hypotheses are to be examined: (I) the N. VII can be determined intraoperatively with a high reliability by the stimulation-probe. A computer program is able to discriminate true-positive EMG signals from false-positive artifacts. (II) The course of the facial nerve can be registered in a three-dimensional area by EMG signals at a nerve model in the lab test. The individual items of the nerve can be combined into a route model. The route model can be integrated into the data of digital volume tomography (DVT). (I) Intraoperative EMG signals of the facial nerve were classified at 128 measurements by an automatic software. The results were correlated with the actual intraoperative situation. (II) The nerve phantom was designed and a DVT data set was provided. Phantom was registered with a navigation system (Karl Storz NPU, Tuttlingen, Germany). The stimulation probe of the EMG-system was tracked by the navigation system. The navigation system was extended by a processing unit (MiMed, Technische Universität München, Germany). Thus the classified EMG parameters of the facial route can be received, processed and be generated to a model of the facial nerve route. The operability was examined at 120 (10 x 12) measuring points. The evaluation of the examined algorithm for classification EMG-signals of the facial nerve resulted as correct in all measuring events. In all 10 attempts it succeeded to visualize the nerve route as three-dimensional model. The different sizes of the individual measuring points reflect the appropriate values of Istim and UEMG correctly. This work proves the feasibility of an automatic classification of an intraoperative EMG signal of the facial nerve by a processing unit. Furthermore the work shows the feasibility of tracking of the position of the stimulation probe and its integration into amodel of the route of the facial nerve (e. g. DVT). The rediability, with which the position of the nerve can be seized by the stimulation probe, is also included into the resulting route model.

Adaptive powertrain control for plugin hybrid electric vehicles

DOEpatents

Kedar-Dongarkar, Gurunath; Weslati, Feisel

2013-10-15

A powertrain control system for a plugin hybrid electric vehicle. The system comprises an adaptive charge sustaining controller; at least one internal data source connected to the adaptive charge sustaining controller; and a memory connected to the adaptive charge sustaining controller for storing data generated by the at least one internal data source. The adaptive charge sustaining controller is operable to select an operating mode of the vehicle's powertrain along a given route based on programming generated from data stored in the memory associated with that route. Further described is a method of adaptively controlling operation of a plugin hybrid electric vehicle powertrain comprising identifying a route being traveled, activating stored adaptive charge sustaining mode programming for the identified route and controlling operation of the powertrain along the identified route by selecting from a plurality of operational modes based on the stored adaptive charge sustaining mode programming.

A graph-theoretic method to quantify the airline route authority

NASA Technical Reports Server (NTRS)

Chan, Y.

1979-01-01

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

Certification Requirements and Teacher Quality: A Comparison of Alternative Routes to Teaching. Working Paper 64

ERIC Educational Resources Information Center

Sass, Tim R.

2011-01-01

Traditionally, states have required individuals complete a program of study in a university-based teacher preparation program in order to be licensed to teach. In recent years, however, various "alternative certification" programs have been developed and the number of teachers obtaining teaching certificates through routes other than…

Nonword Reading: Comparing Dual-Route Cascaded and Connectionist Dual-Process Models with Human Data

ERIC Educational Resources Information Center

Pritchard, Stephen C.; Coltheart, Max; Palethorpe, Sallyanne; Castles, Anne

2012-01-01

Two prominent dual-route computational models of reading aloud are the dual-route cascaded (DRC) model, and the connectionist dual-process plus (CDP+) model. While sharing similarly designed lexical routes, the two models differ greatly in their respective nonlexical route architecture, such that they often differ on nonword pronunciation. Neither…

The PR2D (Place, Route in 2-Dimensions) automatic layout computer program handbook

NASA Technical Reports Server (NTRS)

Edge, T. M.

1978-01-01

Place, Route in 2-Dimensions is a standard cell automatic layout computer program for generating large scale integrated/metal oxide semiconductor arrays. The program was utilized successfully for a number of years in both government and private sectors but until now was undocumented. The compilation, loading, and execution of the program on a Sigma V CP-V operating system is described.

Multi-vehicle mobility allowance shuttle transit (MAST) system : an analytical model to select the fleet size and a scheduling heuristic.

DOT National Transportation Integrated Search

2012-06-01

The mobility allowance shuttle transit (MAST) system is a hybrid transit system in which vehicles are : allowed to deviate from a fixed route to serve flexible demand. A mixed integer programming (MIP) : formulation for the static scheduling problem ...

Enhanced Vehicle Beddown Approximations for the Improved Theater Distribution Model

DTIC Science & Technology

2014-03-27

processed utilizing a heuristic routing and scheduling procedure the authors called the Airlift Planning Algorithm ( APA ). The linear programming model...LINGO 13 environment. The model is then solved by LINGO 13 and solution data is passed back to the Excel environment in a readable format . All original...DSS is relatively unchanged when solutions to the ITDM are referenced for comparison testing. Readers are encouraged to see Appendix I for ITDM VBA

The route to a national health policy lies through the states.

PubMed Central

Silver, G. A.

1991-01-01

National health program legislation has been becalmed in the Congress for almost 80 years. Despite periodic cries of "crisis," legislation never emerges from committee. Periodically, campaigns have been mounted without success. Tactical efforts to circumvent direct action by legislating bits and pieces of related programs, Medicare and Medicaid, health maintenance organization support, and pre-budgeting, have complicated operation of the medical care system and stimulated intractable cost inflation. For the first 150 years of American history, responsibility for public health and welfare legislation rested with the states. Most public health policies originated in a state or a few states and then later became national legislation. The state efforts were, in effect, natural experiments. After the Depression and the flood of funding from the federal government in subsequent years, the states faded as innovators. It is proposed that funding a few state models to restimulate state initiative in this regard will provide a more effective route to a national health program. PMID:1814058

Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery

DTIC Science & Technology

2015-03-26

benefit by no longer having to allocate resources to inventory management . When the inventory routing problem is solved , three key decisions are made at...industries rely on the transportation and manage – ment of goods. To aid in understanding the formulation and techniques for solving the military inventory...Using Approximate Dynamic Programming to Solve the Military Inventory Routing Problem with Direct Delivery THESIS MARCH 2015 Rebekah S. McKenna

Time Dependent Heterogeneous Vehicle Routing Problem for Catering Service Delivery Problem

NASA Astrophysics Data System (ADS)

Azis, Zainal; Mawengkang, Herman

2017-09-01

The heterogeneous vehicle routing problem (HVRP) is a variant of vehicle routing problem (VRP) which describes various types of vehicles with different capacity to serve a set of customers with known geographical locations. This paper considers the optimal service deliveries of meals of a catering company located in Medan City, Indonesia. Due to the road condition as well as traffic, it is necessary for the company to use different type of vehicle to fulfill customers demand in time. The HVRP incorporates time dependency of travel times on the particular time of the day. The objective is to minimize the sum of the costs of travelling and elapsed time over the planning horizon. The problem can be modeled as a linear mixed integer program and we address a feasible neighbourhood search approach to solve the problem.

Comparisons and Evaluation of Hall Thruster Models

DTIC Science & Technology

2002-03-20

COVERED (FROM - TO) 20-04-2001 to 20-04-2002 4. TITLE AND SUBTITLE comparisons and Evaluation of Hall Thruster Models Unclassified 5a. CONTRACT NUMBER...TITLE AND SUBTITLE Comparisons and Evaluation of Hall Thruster Models 5c. PROGRAM ELEMENT NUMBER 5d. PROJECT NUMBER 5d. TASK NUMBER 6. AUTHOR(S...evaluation of Hall thruster models G. J. M. Hagelaar, J. Bareilles, L. Garrigues, and J.-P. Boeuf CPAT, Bâtiment 3R2, Université Paul Sabatier 118 Route

Cloud encounter statistics in the 28.5-43.5 KFT altitude region from four years of GASP observations

NASA Technical Reports Server (NTRS)

Jasperson, W. H.; Nastrom, G. D.; Davis, R. E.; Holdeman, J. D.

1983-01-01

The results of an analysis of cloud encounter measurements taken at aircraft flight altitudes as part of the Global Atmospheric Sampling Program are summarized. The results can be used in estimating the probability of cloud encounter and in assessing the economic feasibility of laminar flow control aircraft along particular routes. The data presented clearly show the tropical circulation and its seasonal migration; characteristics of the mid-latitude regime, such as the large-scale traveling cyclones in the winter and increased convective activity in the summer, can be isolated in the data. The cloud encounter statistics are shown to be consistent with the mid-latitude cyclone model. A model for TIC (time-in-clouds), a cloud encounter statistic, is presented for several common airline routes.

Coordinated platooning with multiple speeds

DOE PAGES

Luo, Fengqiao; Larson, Jeffrey; Munson, Todd

2018-03-22

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on themore » time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.« less

Coordinated platooning with multiple speeds

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

Luo, Fengqiao; Larson, Jeffrey; Munson, Todd

In a platoon, vehicles travel one after another with small intervehicle distances; trailing vehicles in a platoon save fuel because they experience less aerodynamic drag. This work presents a coordinated platooning model with multiple speed options that integrates scheduling, routing, speed selection, and platoon formation/dissolution in a mixed-integer linear program that minimizes the total fuel consumed by a set of vehicles while traveling between their respective origins and destinations. The performance of this model is numerically tested on a grid network and the Chicago-area highway network. We find that the fuel-savings factor of a multivehicle system significantly depends on themore » time each vehicle is allowed to stay in the network; this time affects vehicles’ available speed choices, possible routes, and the amount of time for coordinating platoon formation. For problem instances with a large number of vehicles, we propose and test a heuristic decomposed approach that applies a clustering algorithm to partition the set of vehicles and then routes each group separately. When the set of vehicles is large and the available computational time is small, the decomposed approach finds significantly better solutions than does the full model.« less

How Induction Programs Affect the Decision of Alternate Route Urban Teachers to Remain Teaching

ERIC Educational Resources Information Center

LoCascio, Steven J.; Smeaton, Patricia S.; Waters, Faith H.

2016-01-01

This mixed-methods study analyzes the induction programs for alternate route beginning teachers in low socioeconomic, urban schools. The researcher surveyed 53 teachers at the end of their first year and conducted six in-depth follow-up interviews. The study found that half the teachers did not receive an induction program congruent with state…

Evaluation of the Corridor Safety Improvement Program : phase 1 final report.

DOT National Transportation Integrated Search

1997-09-01

This project is an analysis of Oregon's Corridor Safety Improvement Programs implemented on Oregon Route 22 and Oregon Route 34. Improvements were : made along each corridor in 1993. : The project used a mail-out survey to determine the level of awar...

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

NASA Technical Reports Server (NTRS)

Arneson, Heather M.; Dousse, Nicholas; Langbort, Cedric

2014-01-01

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

Route monitoring program FY 1994

DOT National Transportation Integrated Search

1994-12-01

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

User's guide for a general purpose dam-break flood simulation model (K-634)

USGS Publications Warehouse

Land, Larry F.

1981-01-01

An existing computer program for simulating dam-break floods for forecast purposes has been modified with an emphasis on general purpose applications. The original model was formulated, developed and documented by the National Weather Service. This model is based on the complete flow equations and uses a nonlinear implicit finite-difference numerical method. The first phase of the simulation routes a flood wave through the reservoir and computes an outflow hydrograph which is the sum of the flow through the dam 's structures and the gradually developing breach. The second phase routes this outflow hydrograph through the stream which may be nonprismatic and have segments with subcritical or supercritical flow. The results are discharge and stage hydrographs at the dam as well as all of the computational nodes in the channel. From these hydrographs, peak discharge and stage profiles are tabulated. (USGS)

Mixed Integer Programming Model and Incremental Optimization for Delivery and Storage Planning Using Truck Terminals

NASA Astrophysics Data System (ADS)

Sakakibara, Kazutoshi; Tian, Yajie; Nishikawa, Ikuko

We discuss the planning of transportation by trucks over a multi-day period. Each truck collects loads from suppliers and delivers them to assembly plants or a truck terminal. By exploiting the truck terminal as a temporal storage, we aim to increase the load ratio of each truck and to minimize the lead time for transportation. In this paper, we show a mixed integer programming model which represents each product explicitly, and discuss the decomposition of the problem into a problem of delivery and storage, and a problem of vehicle routing. Based on this model, we propose a relax-and-fix type heuristic in which decision variables are fixed one by one by mathematical programming techniques such as branch-and-bound methods.

Optimization of OSPF Routing in IP Networks

NASA Astrophysics Data System (ADS)

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

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

Cloud-based large-scale air traffic flow optimization

NASA Astrophysics Data System (ADS)

Cao, Yi

The ever-increasing traffic demand makes the efficient use of airspace an imperative mission, and this paper presents an effort in response to this call. Firstly, a new aggregate model, called Link Transmission Model (LTM), is proposed, which models the nationwide traffic as a network of flight routes identified by origin-destination pairs. The traversal time of a flight route is assumed to be the mode of distribution of historical flight records, and the mode is estimated by using Kernel Density Estimation. As this simplification abstracts away physical trajectory details, the complexity of modeling is drastically decreased, resulting in efficient traffic forecasting. The predicative capability of LTM is validated against recorded traffic data. Secondly, a nationwide traffic flow optimization problem with airport and en route capacity constraints is formulated based on LTM. The optimization problem aims at alleviating traffic congestions with minimal global delays. This problem is intractable due to millions of variables. A dual decomposition method is applied to decompose the large-scale problem such that the subproblems are solvable. However, the whole problem is still computational expensive to solve since each subproblem is an smaller integer programming problem that pursues integer solutions. Solving an integer programing problem is known to be far more time-consuming than solving its linear relaxation. In addition, sequential execution on a standalone computer leads to linear runtime increase when the problem size increases. To address the computational efficiency problem, a parallel computing framework is designed which accommodates concurrent executions via multithreading programming. The multithreaded version is compared with its monolithic version to show decreased runtime. Finally, an open-source cloud computing framework, Hadoop MapReduce, is employed for better scalability and reliability. This framework is an "off-the-shelf" parallel computing model that can be used for both offline historical traffic data analysis and online traffic flow optimization. It provides an efficient and robust platform for easy deployment and implementation. A small cloud consisting of five workstations was configured and used to demonstrate the advantages of cloud computing in dealing with large-scale parallelizable traffic problems.

Baseband processor development for the Advanced Communications Satellite Program

NASA Technical Reports Server (NTRS)

Moat, D.; Sabourin, D.; Stilwell, J.; Mccallister, R.; Borota, M.

1982-01-01

An onboard-baseband-processor concept for a satellite-switched time-division-multiple-access (SS-TDMA) communication system was developed for NASA Lewis Research Center. The baseband processor routes and controls traffic on an individual message basis while providing significant advantages in improved link margins and system flexibility. Key technology developments required to prove the flight readiness of the baseband-processor design are being verified in a baseband-processor proof-of-concept model. These technology developments include serial MSK modems, Clos-type baseband routing switch, a single-chip CMOS maximum-likelihood convolutional decoder, and custom LSL implementation of high-speed, low-power ECL building blocks.

Indoor 3D Route Modeling Based On Estate Spatial Data

NASA Astrophysics Data System (ADS)

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

2014-04-01

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

A Conceptual Approach for Optimising Bus Stop Spacing

NASA Astrophysics Data System (ADS)

Johar, Amita; Jain, S. S.; Garg, P. k.

2017-06-01

An efficient public transportation system is essential of any country. The growth, development and shape of the urban areas are mainly due to availability of good transportation (Shah et al. in Inst Town Plan India J 5(3):50-59, 1). In developing countries, like India, travel by local bus in a city is very common. The accidents, congestion, pollution and appropriate location of bus stops are the major problems arising in metropolitan cities. Among all the metropolitan cities in India, Delhi has highest percentage of growth of population and vehicles. Therefore, it is important to adopt efficient and effective ways to improve mobility in different metropolitan cities in order to overcome the problem and to reduce the number of private vehicles on the road. The primary objective of this paper is to present a methodology for developing a model for optimum bus stop spacing (OBSS). It describes the evaluation of existing urban bus route, data collection, development of model for optimizing urban bus route and application of model. In this work, the bus passenger generalized cost method is used to optimize the spacing between bus stops. For the development of model, a computer program is required to be written. The applicability of the model has been evaluated by taking the data of urban bus route of Delhi Transport Corporation (DTC) in Excel sheet in first phase. Later on, it is proposed to develop a programming in C++ language. The developed model is expected to be useful to transport planner for rational design of the spacing of bus stops to save travel time and to generalize operating cost. After analysis it is found that spacing between the bus stop comes out to be between 250 and 500 m. The Proposed Spacing of bus stops is done considering the points that they don't come nearer to metro/rail station, entry or exit of flyover and near traffic signal.

KREAM: Korean Radiation Exposure Assessment Model for Aviation Route Dose

NASA Astrophysics Data System (ADS)

Hwang, J.; Dokgo, K.; Choi, E. J.; Kim, K. C.; Kim, H. P.; Cho, K. S. F.

2014-12-01

Since Korean Air has begun to use the polar route from Seoul/ICN airport to New York/JFK airport on August 2006, there are explosive needs for the estimation and prediction against cosmic radiation exposure for Korean aircrew and passengers in South Korea from public. To keep pace with those needs of public, Korean government made the law on safety standards and managements of cosmic radiation for the flight attendants and the pilots in 2013. And we have begun to develop our own Korean Radiation Exposure Assessment Model (KREAM) for aviation route dose since last year funded by Korea Meteorological Administration (KMA). GEANT4 model and NRLMSIS 00 model are used for calculation of the energetic particles' transport in the atmosphere and for obtaining the background atmospheric neutral densities depending on altitude. For prediction the radiation exposure in many routes depending on the various space weather effects, we constructed a database from pre-arranged simulations using all possible combinations of R, S, and G, which are the space weather effect scales provided by the National Oceanic and Atmospheric Administration (NOAA). To get the solar energetic particles' spectrum at the 100 km altitude which we set as a top of the atmospheric layers in the KREAM, we use ACE and GOES satellites' proton flux observations. We compare the results between KREAM and the other cosmic radiation estimation programs such as CARI-6M which is provided by the Federal Aviation Agency (FAA). We also validate KREAM's results by comparison with the measurement from Liulin-6K LET spectrometer onboard Korean commercial flights and Korean Air Force reconnaissance flights.

So many choices, so many ways to choose : how five state departments of transportation select safe routes to school for funding.

DOT National Transportation Integrated Search

2011-06-01

Safe Routes to School (SRTS) programs support children safely walking and biking to and from school. Each state Department of Transportation (DOT) awards federal grant money to proposal applications made by local SRTS programs. Because demand for fed...

An Optimization Model for the Selection of Bus-Only Lanes in a City.

PubMed

Chen, Qun

2015-01-01

The planning of urban bus-only lane networks is an important measure to improve bus service and bus priority. To determine the effective arrangement of bus-only lanes, a bi-level programming model for urban bus lane layout is developed in this study that considers accessibility and budget constraints. The goal of the upper-level model is to minimize the total travel time, and the lower-level model is a capacity-constrained traffic assignment model that describes the passenger flow assignment on bus lines, in which the priority sequence of the transfer times is reflected in the passengers' route-choice behaviors. Using the proposed bi-level programming model, optimal bus lines are selected from a set of candidate bus lines; thus, the corresponding bus lane network on which the selected bus lines run is determined. The solution method using a genetic algorithm in the bi-level programming model is developed, and two numerical examples are investigated to demonstrate the efficacy of the proposed model.

Integrated optimization of planetary rover layout and exploration routes

NASA Astrophysics Data System (ADS)

Lee, Dongoo; Ahn, Jaemyung

2018-01-01

This article introduces an optimization framework for the integrated design of a planetary surface rover and its exploration route that is applicable to the initial phase of a planetary exploration campaign composed of multiple surface missions. The scientific capability and the mobility of a rover are modelled as functions of the science weight fraction, a key parameter characterizing the rover. The proposed problem is formulated as a mixed-integer nonlinear program that maximizes the sum of profits obtained through a planetary surface exploration mission by simultaneously determining the science weight fraction of the rover, the sites to visit and their visiting sequences under resource consumption constraints imposed on each route and collectively on a mission. A solution procedure for the proposed problem composed of two loops (the outer loop and the inner loop) is developed. The results of test cases demonstrating the effectiveness of the proposed framework are presented.

Electric train energy consumption modeling

DOE PAGES

Wang, Jinghui; Rakha, Hesham A.

2017-05-01

For this paper we develop an electric train energy consumption modeling framework considering instantaneous regenerative braking efficiency in support of a rail simulation system. The model is calibrated with data from Portland, Oregon using an unconstrained non-linear optimization procedure, and validated using data from Chicago, Illinois by comparing model predictions against the National Transit Database (NTD) estimates. The results demonstrate that regenerative braking efficiency varies as an exponential function of the deceleration level, rather than an average constant as assumed in previous studies. The model predictions are demonstrated to be consistent with the NTD estimates, producing a predicted error ofmore » 1.87% and -2.31%. The paper demonstrates that energy recovery reduces the overall power consumption by 20% for the tested Chicago route. Furthermore, the paper demonstrates that the proposed modeling approach is able to capture energy consumption differences associated with train, route and operational parameters, and thus is applicable for project-level analysis. The model can be easily implemented in traffic simulation software, used in smartphone applications and eco-transit programs given its fast execution time and easy integration in complex frameworks.« less

Electric train energy consumption modeling

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

Wang, Jinghui; Rakha, Hesham A.

For this paper we develop an electric train energy consumption modeling framework considering instantaneous regenerative braking efficiency in support of a rail simulation system. The model is calibrated with data from Portland, Oregon using an unconstrained non-linear optimization procedure, and validated using data from Chicago, Illinois by comparing model predictions against the National Transit Database (NTD) estimates. The results demonstrate that regenerative braking efficiency varies as an exponential function of the deceleration level, rather than an average constant as assumed in previous studies. The model predictions are demonstrated to be consistent with the NTD estimates, producing a predicted error ofmore » 1.87% and -2.31%. The paper demonstrates that energy recovery reduces the overall power consumption by 20% for the tested Chicago route. Furthermore, the paper demonstrates that the proposed modeling approach is able to capture energy consumption differences associated with train, route and operational parameters, and thus is applicable for project-level analysis. The model can be easily implemented in traffic simulation software, used in smartphone applications and eco-transit programs given its fast execution time and easy integration in complex frameworks.« less

FACET: Future ATM Concepts Evaluation Tool

NASA Technical Reports Server (NTRS)

Bilmoria, Karl D.; Banavar, Sridhar; Chatterji, Gano B.; Sheth, Kapil S.; Grabbe, Shon

2000-01-01

FACET (Future ATM Concepts Evaluation Tool) is an Air Traffic Management research tool being developed at the NASA Ames Research Center. This paper describes the design, architecture and functionalities of FACET. The purpose of FACET is to provide E simulation environment for exploration, development and evaluation of advanced ATM concepts. Examples of these concepts include new ATM paradigms such as Distributed Air-Ground Traffic Management, airspace redesign and new Decision Support Tools (DSTs) for controllers working within the operational procedures of the existing air traffic control system. FACET is currently capable of modeling system-wide en route airspace operations over the contiguous United States. Airspace models (e.g., Center/sector boundaries, airways, locations of navigation aids and airports) are available from databases. A core capability of FACET is the modeling of aircraft trajectories. Using round-earth kinematic equations, aircraft can be flown along flight plan routes or great circle routes as they climb, cruise and descend according to their individual aircraft-type performance models. Performance parameters (e.g., climb/descent rates and speeds, cruise speeds) are obtained from data table lookups. Heading, airspeed and altitude-rate dynamics are also modeled. Additional functionalities will be added as necessary for specific applications. FACET software is written in Java and C programming languages. It is platform-independent, and can be run on a variety of computers. FACET has been designed with a modular software architecture to enable rapid integration of research prototype implementations of new ATM concepts. There are several advanced ATM concepts that are currently being implemented in FACET airborne separation assurance, dynamic density predictions, airspace redesign (re-sectorization), benefits of a controller DST for direct-routing, and the integration of commercial space transportation system operations into the U.S. National Airspace System (NAS).

A constrained multinomial Probit route choice model in the metro network: Formulation, estimation and application

PubMed Central

Zhang, Yongsheng; Wei, Heng; Zheng, Kangning

2017-01-01

Considering that metro network expansion brings us with more alternative routes, it is attractive to integrate the impacts of routes set and the interdependency among alternative routes on route choice probability into route choice modeling. Therefore, the formulation, estimation and application of a constrained multinomial probit (CMNP) route choice model in the metro network are carried out in this paper. The utility function is formulated as three components: the compensatory component is a function of influencing factors; the non-compensatory component measures the impacts of routes set on utility; following a multivariate normal distribution, the covariance of error component is structured into three parts, representing the correlation among routes, the transfer variance of route, and the unobserved variance respectively. Considering multidimensional integrals of the multivariate normal probability density function, the CMNP model is rewritten as Hierarchical Bayes formula and M-H sampling algorithm based Monte Carlo Markov Chain approach is constructed to estimate all parameters. Based on Guangzhou Metro data, reliable estimation results are gained. Furthermore, the proposed CMNP model also shows a good forecasting performance for the route choice probabilities calculation and a good application performance for transfer flow volume prediction. PMID:28591188

Applying an MVC Framework for The System Development Life Cycle with Waterfall Model Extended

NASA Astrophysics Data System (ADS)

Hardyanto, W.; Purwinarko, A.; Sujito, F.; Masturi; Alighiri, D.

2017-04-01

This paper describes the extension of the waterfall model using MVC architectural pattern for software development. The waterfall model is the based model of the most widely used in software development, yet there are still many problems in it. The general issue usually happens on data changes that cause the delays on the process itself. On the other hand, the security factor on the software as well as one of the major problems. This study uses PHP programming language for implementation. Although this model can be implemented in several programming languages with the same concept. This study is based on MVC architecture so that it can improve the performance of both software development and maintenance, especially concerning security, validation, database access, and routing.

Improving Transportation Services for the University of the Thai Chamber of Commerce: A Case Study on Solving the Mixed-Fleet Vehicle Routing Problem with Split Deliveries

NASA Astrophysics Data System (ADS)

Suthikarnnarunai, N.; Olinick, E.

2009-01-01

We present a case study on the application of techniques for solving the Vehicle Routing Problem (VRP) to improve the transportation service provided by the University of The Thai Chamber of Commerce to its staff. The problem is modeled as VRP with time windows, split deliveries, and a mixed fleet. An exact algorithm and a heuristic solution procedure are developed to solve the problem and implemented in the AMPL modeling language and CPLEX Integer Programming solver. Empirical results indicate that the heuristic can find relatively good solutions in a small fraction of the time required by the exact method. We also perform sensitivity analysis and find that a savings in outsourcing cost can be achieved with a small increase in vehicle capacity.

A Critical Analysis of a New Model for Occupational Therapy Education: Its Applicability for Other Occupations and Systems.

ERIC Educational Resources Information Center

National Committee on Employment of Youth, New York, NY.

The symposium report focuses on an upgrading program (designed by the Consortium for Occupational Therapy Education) to develop alternate routes to credentialled education and training, resulting in opening up occupational therapy career opportunities to young people. The consortium was composed of four New York State hospitals, two academic…

Joint Services Electronics Program.

DTIC Science & Technology

1993-03-05

Mary- land, June 1992. Interconnection Network Design Based on Packaging Considerations Professor Abhiram Ranade with M. T. Raghunath A central...characterized by our abstract models of packaging technology. JSEP Publications [1] M.T. Raghunath and Abhiram Ranade, "Customizing Interconnection...94720, January 1993. [21 M.T. Raghunath and Abhiram Ranade, "Fault-Tolerant Routing in Partitioned Butterfly Networks," submitted to the 1993

Evaluation of safe routes to school programs : qualitative and quantitative analysis of parental decision-making.

DOT National Transportation Integrated Search

2011-08-01

In the United States, walking to school declined from 42% of 5-18 year olds in 1969 to 16% in 20011. The US : Department of Transportation has responded to this dramatic decrease by funding the Safe Routes to School program : for $612 million in SAFE...

Safe Routes to School at Maybury Elementary School in Detroit

ERIC Educational Resources Information Center

Robert Wood Johnson Foundation, 2012

2012-01-01

In 2005, Congress passed legislation establishing the Safe Routes to School Program (SRTS). Since then, nearly all states and the District of Columbia have announced local or statewide SRTS activities, and thousands of schools have participated in the program. SRTS enables and encourages children to walk and bike to school by helping communities…

TRIGRS - A Fortran Program for Transient Rainfall Infiltration and Grid-Based Regional Slope-Stability Analysis, Version 2.0

USGS Publications Warehouse

Baum, Rex L.; Savage, William Z.; Godt, Jonathan W.

2008-01-01

The Transient Rainfall Infiltration and Grid-Based Regional Slope-Stability Model (TRIGRS) is a Fortran program designed for modeling the timing and distribution of shallow, rainfall-induced landslides. The program computes transient pore-pressure changes, and attendant changes in the factor of safety, due to rainfall infiltration. The program models rainfall infiltration, resulting from storms that have durations ranging from hours to a few days, using analytical solutions for partial differential equations that represent one-dimensional, vertical flow in isotropic, homogeneous materials for either saturated or unsaturated conditions. Use of step-function series allows the program to represent variable rainfall input, and a simple runoff routing model allows the user to divert excess water from impervious areas onto more permeable downslope areas. The TRIGRS program uses a simple infinite-slope model to compute factor of safety on a cell-by-cell basis. An approximate formula for effective stress in unsaturated materials aids computation of the factor of safety in unsaturated soils. Horizontal heterogeneity is accounted for by allowing material properties, rainfall, and other input values to vary from cell to cell. This command-line program is used in conjunction with geographic information system (GIS) software to prepare input grids and visualize model results.

Cost-effectiveness of the U.S. Geological Survey stream-gaging program in Indiana

USGS Publications Warehouse

Stewart, J.A.; Miller, R.L.; Butch, G.K.

1986-01-01

Analysis of the stream gaging program in Indiana was divided into three phases. The first phase involved collecting information concerning the data need and the funding source for each of the 173 surface water stations in Indiana. The second phase used alternate methods to produce streamflow records at selected sites. Statistical models were used to generate stream flow data for three gaging stations. In addition, flow routing models were used at two of the sites. Daily discharges produced from models did not meet the established accuracy criteria and, therefore, these methods should not replace stream gaging procedures at those gaging stations. The third phase of the study determined the uncertainty of the rating and the error at individual gaging stations, and optimized travel routes and frequency of visits to gaging stations. The annual budget, in 1983 dollars, for operating the stream gaging program in Indiana is $823,000. The average standard error of instantaneous discharge for all continuous record gaging stations is 25.3%. A budget of $800,000 could maintain this level of accuracy if stream gaging stations were visited according to phase III results. A minimum budget of $790,000 is required to operate the gaging network. At this budget, the average standard error of instantaneous discharge would be 27.7%. A maximum budget of $1 ,000,000 was simulated in the analysis and the average standard error of instantaneous discharge was reduced to 16.8%. (Author 's abstract)

Modelling parallel programs and multiprocessor architectures with AXE

NASA Technical Reports Server (NTRS)

Yan, Jerry C.; Fineman, Charles E.

1991-01-01

AXE, An Experimental Environment for Parallel Systems, was designed to model and simulate for parallel systems at the process level. It provides an integrated environment for specifying computation models, multiprocessor architectures, data collection, and performance visualization. AXE is being used at NASA-Ames for developing resource management strategies, parallel problem formulation, multiprocessor architectures, and operating system issues related to the High Performance Computing and Communications Program. AXE's simple, structured user-interface enables the user to model parallel programs and machines precisely and efficiently. Its quick turn-around time keeps the user interested and productive. AXE models multicomputers. The user may easily modify various architectural parameters including the number of sites, connection topologies, and overhead for operating system activities. Parallel computations in AXE are represented as collections of autonomous computing objects known as players. Their use and behavior is described. Performance data of the multiprocessor model can be observed on a color screen. These include CPU and message routing bottlenecks, and the dynamic status of the software.

Discovery of cryptophycin-1 and BCN-183577: examples of strategies and problems in the detection of antitumor activity in mice.

PubMed

Corbett, T H; Valeriote, F A; Demchik, L; Lowichik, N; Polin, L; Panchapor, C; Pugh, S; White, K; Kushner, J; Rake, J; Wentland, M; Golakoti, T; Hetzel, C; Ogino, J; Patterson, G; Moore, R

1997-01-01

Historically, many new anticancer agents were first detected in a prescreen; usually consisting of a molecular/biochemical target or a cellular cytotoxicity assay. The agent then progressed to in vivo evaluation against transplanted human or mouse tumors. If the investigator had a large drug supply and ample resources, multiple tests were possible, with variations in tumor models, tumor and drug routes, dose-decrements, dose-schedules, number of groups, etc. However, in most large programs involving several hundred in vivo tests yearly, resource limitations and drug supply limitations have usually dictated a single trial. Under such restrictive conditions, we have implemented a flexible in vivo testing protocol. With this strategy, the tumor model is dictated by in vitro cellular sensitivity; drug route by water solubility (with water soluble agents injected intravenously); dosage decrement by drug supply, dose-schedule by toxicities encountered, etc. In this flexible design, many treatment parameters can be changed during the course of treatment (e.g., dose and schedule). The discovery of two active agents are presented (Cryptophycin-1, and Thioxanthone BCN 183577). Both were discovered by the intravenous route of administration. Both would have been missed if they were tested intraperitoneally, the usual drug route used in discovery protocols. It is also likely that they would have been missed with an easy to execute fixed protocol design, even if injected i.v.

Energy-efficient routing, modulation and spectrum allocation in elastic optical networks

NASA Astrophysics Data System (ADS)

Tan, Yanxia; Gu, Rentao; Ji, Yuefeng

2017-07-01

With tremendous growth in bandwidth demand, energy consumption problem in elastic optical networks (EONs) becomes a hot topic with wide concern. The sliceable bandwidth-variable transponder in EON, which can transmit/receive multiple optical flows, was recently proposed to improve a transponder's flexibility and save energy. In this paper, energy-efficient routing, modulation and spectrum allocation (EE-RMSA) in EONs with sliceable bandwidth-variable transponder is studied. To decrease the energy consumption, we develop a Mixed Integer Linear Programming (MILP) model with corresponding EE-RMSA algorithm for EONs. The MILP model jointly considers the modulation format and optical grooming in the process of routing and spectrum allocation with the objective of minimizing the energy consumption. With the help of genetic operators, the EE-RMSA algorithm iteratively optimizes the feasible routing path, modulation format and spectrum resources solutions by explore the whole search space. In order to save energy, the optical-layer grooming strategy is designed to transmit the lightpath requests. Finally, simulation results verify that the proposed scheme is able to reduce the energy consumption of the network while maintaining the blocking probability (BP) performance compare with the existing First-Fit-KSP algorithm, Iterative Flipping algorithm and EAMGSP algorithm especially in large network topology. Our results also demonstrate that the proposed EE-RMSA algorithm achieves almost the same performance as MILP on an 8-node network.

mRM - multiscale Routing Model for Land Surface and Hydrologic Models

NASA Astrophysics Data System (ADS)

Cuntz, M.; Thober, S.; Mai, J.; Samaniego, L. E.; Gochis, D. J.; Kumar, R.

2015-12-01

Routing streamflow through a river network is a basic step within any distributed hydrologic model. It integrates the generated runoff and allows comparison with observed discharge at the outlet of a catchment. The Muskingum routing is a textbook river routing scheme that has been implemented in Earth System Models (e.g., WRF-HYDRO), stand-alone routing schemes (e.g., RAPID), and hydrologic models (e.g., the mesoscale Hydrologic Model). Most implementations suffer from a high computational demand because the spatial routing resolution is fixed to that of the elevation model irrespective of the hydrologic modeling resolution. This is because the model parameters are scale-dependent and cannot be used at other resolutions without re-estimation. Here, we present the multiscale Routing Model (mRM) that allows for a flexible choice of the routing resolution. mRM exploits the Multiscale Parameter Regionalization (MPR) included in the open-source mesoscale Hydrologic Model (mHM, www.ufz.de/mhm) that relates model parameters to physiographic properties and allows to estimate scale-independent model parameters. mRM is currently coupled to mHM and is presented here as stand-alone Free and Open Source Software (FOSS). The mRM source code is highly modular and provides a subroutine for internal re-use in any land surface scheme. mRM is coupled in this work to the state-of-the-art land surface model Noah-MP. Simulation results using mRM are compared with those available in WRF-HYDRO for the Red River during the period 1990-2000. mRM allows to increase the routing resolution from 100m to more than 10km without deteriorating the model performance. Therefore, it speeds up model calculation by reducing the contribution of routing to total runtime from over 80% to less than 5% in the case of WRF-HYDRO. mRM thus makes discharge data available to land surface modeling with only little extra calculations.

Solving a bi-objective mathematical model for location-routing problem with time windows in multi-echelon reverse logistics using metaheuristic procedure

NASA Astrophysics Data System (ADS)

Ghezavati, V. R.; Beigi, M.

2016-12-01

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among established facilities and existing demand points. In this paper, the location-routing problem with time window (LRPTW) and homogeneous fleet type and designing a multi-echelon, and capacitated reverse logistics network, are considered which may arise in many real-life situations in logistics management. Our proposed RL network consists of hybrid collection/inspection centers, recovery centers and disposal centers. Here, we present a new bi-objective mathematical programming (BOMP) for LRPTW in reverse logistic. Since this type of problem is NP-hard, the non-dominated sorting genetic algorithm II (NSGA-II) is proposed to obtain the Pareto frontier for the given problem. Several numerical examples are presented to illustrate the effectiveness of the proposed model and algorithm. Also, the present work is an effort to effectively implement the ɛ-constraint method in GAMS software for producing the Pareto-optimal solutions in a BOMP. The results of the proposed algorithm have been compared with the ɛ-constraint method. The computational results show that the ɛ-constraint method is able to solve small-size instances to optimality within reasonable computing times, and for medium-to-large-sized problems, the proposed NSGA-II works better than the ɛ-constraint.

A Space-Time Network-Based Modeling Framework for Dynamic Unmanned Aerial Vehicle Routing in Traffic Incident Monitoring Applications

PubMed Central

Zhang, Jisheng; Jia, Limin; Niu, Shuyun; Zhang, Fan; Tong, Lu; Zhou, Xuesong

2015-01-01

It is essential for transportation management centers to equip and manage a network of fixed and mobile sensors in order to quickly detect traffic incidents and further monitor the related impact areas, especially for high-impact accidents with dramatic traffic congestion propagation. As emerging small Unmanned Aerial Vehicles (UAVs) start to have a more flexible regulation environment, it is critically important to fully explore the potential for of using UAVs for monitoring recurring and non-recurring traffic conditions and special events on transportation networks. This paper presents a space-time network- based modeling framework for integrated fixed and mobile sensor networks, in order to provide a rapid and systematic road traffic monitoring mechanism. By constructing a discretized space-time network to characterize not only the speed for UAVs but also the time-sensitive impact areas of traffic congestion, we formulate the problem as a linear integer programming model to minimize the detection delay cost and operational cost, subject to feasible flying route constraints. A Lagrangian relaxation solution framework is developed to decompose the original complex problem into a series of computationally efficient time-dependent and least cost path finding sub-problems. Several examples are used to demonstrate the results of proposed models in UAVs’ route planning for small and medium-scale networks. PMID:26076404

Using Trust to Establish a Secure Routing Model in Cognitive Radio Network.

PubMed

Zhang, Guanghua; Chen, Zhenguo; Tian, Liqin; Zhang, Dongwen

2015-01-01

Specific to the selective forwarding attack on routing in cognitive radio network, this paper proposes a trust-based secure routing model. Through monitoring nodes' forwarding behaviors, trusts of nodes are constructed to identify malicious nodes. In consideration of that routing selection-based model must be closely collaborative with spectrum allocation, a route request piggybacking available spectrum opportunities is sent to non-malicious nodes. In the routing decision phase, nodes' trusts are used to construct available path trusts and delay measurement is combined for making routing decisions. At the same time, according to the trust classification, different responses are made specific to their service requests. By adopting stricter punishment on malicious behaviors from non-trusted nodes, the cooperation of nodes in routing can be stimulated. Simulation results and analysis indicate that this model has good performance in network throughput and end-to-end delay under the selective forwarding attack.

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

NASA Technical Reports Server (NTRS)

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

2013-01-01

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

Attitudes on en route air traffic control training and work : a comparison of recruits initially trained at the FAA Academy and recruits initially trained at assigned centers.

DOT National Transportation Integrated Search

1975-05-01

In this comparison, questionnaires concerning aspects of training-related and work-related attitudes were sent to 225 ATC trainees who represented groups of attritions and retentions in two En Route training programs; viz, programs that provided basi...

Electronic Router

NASA Technical Reports Server (NTRS)

Crusan, Jason

2005-01-01

Electronic Router (E-Router) is an application program for routing documents among the cognizant individuals in a government agency or other organization. E-Router supplants a prior 14 NASA Tech Briefs, May 2005 system in which paper documents were routed physically in packages by use of paper slips, packages could be lost, routing times were unacceptably long, tracking of packages was difficult, and there was a need for much photocopying. E-Router enables a user to create a digital package to be routed. Input accepted by E-Router includes the title of the package, the person(s) to whom the package is to be routed, attached files, and comments to reviewers. Electronic mail is used to notify reviewers of needed actions. The creator of the package can, at any time, see the status of the package in the routing structure. At the end of the routing process, E-Router keeps a record of the package and of approvals and/or concurrences of the reviewers. There are commercial programs that perform the general functions of E-Router, but they are more complicated. E-Router is Web-based, easy to use, and does not require the installation or use of client software.

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

PubMed Central

2014-01-01

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

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

PubMed

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

2014-02-14

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

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

NASA Astrophysics Data System (ADS)

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.

Impact of flow routing on catchment area calculations, slope estimates, and numerical simulations of landscape development

NASA Astrophysics Data System (ADS)

Shelef, Eitan; Hilley, George E.

2013-12-01

Flow routing across real or modeled topography determines the modeled discharge and wetness index and thus plays a central role in predicting surface lowering rate, runoff generation, likelihood of slope failure, and transition from hillslope to channel forming processes. In this contribution, we compare commonly used flow-routing rules as well as a new routing rule, to commonly used benchmarks. We also compare results for different routing rules using Airborne Laser Swath Mapping (ALSM) topography to explore the impact of different flow-routing schemes on inferring the generation of saturation overland flow and the transition between hillslope to channel forming processes, as well as on location of saturation overland flow. Finally, we examined the impact of flow-routing and slope-calculation rules on modeled topography produced by Geomorphic Transport Law (GTL)-based simulations. We found that different rules produce substantive differences in the structure of the modeled topography and flow patterns over ALSM data. Our results highlight the impact of flow-routing and slope-calculation rules on modeled topography, as well as on calculated geomorphic metrics across real landscapes. As such, studies that use a variety of routing rules to analyze and simulate topography are necessary to determine those aspects that most strongly depend on a chosen routing rule.

On Deployment of Multiple Base Stations for Energy-Efficient Communication in Wireless Sensor Networks

DOE PAGES

Lin, Yunyue; Wu, Qishi; Cai, Xiaoshan; ...

2010-01-01

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which critically affects network lifetime. We generalize and solve the problem of deploying multiple base stations to maximize network lifetime in terms of two different metrics under one-hop and multihop communication models. In the one-hop communication model, the sensors far away from base stations always deplete their energy much faster than others. We propose an optimal solution and a heuristic approach based on the minimal enclosing circle algorithm to deploy a base station at the geometric center of each cluster. In themore » multihop communication model, both base station location and data routing mechanism need to be considered in maximizing network lifetime. We propose an iterative algorithm based on rigorous mathematical derivations and use linear programming to compute the optimal routing paths for data transmission. Simulation results show the distinguished performance of the proposed deployment algorithms in maximizing network lifetime.« less

Buffalo Metropolitan Area, New York Water Resources Management. Interim Report on Feasibility of Flood Management. Appendices.

DTIC Science & Technology

1983-07-01

storage areas were taken into account during the flood routings. AI.36 The computer program REVPULS, developed for this report, reverse Modified Puls...routed the hydrograph at Batavia through the storage upstream of the LVRR embankment. Subtracting this reverse -routed hydrograph from the combined...segments to form a more accurate reconstitution. The hydrographs upstream of Batavia were derived by reverse -routing and prorating by drainage area. Table

Study on multimodal transport route under low carbon background

NASA Astrophysics Data System (ADS)

Liu, Lele; Liu, Jie

2018-06-01

Low-carbon environmental protection is the focus of attention around the world, scientists are constantly researching on production of carbon emissions and living carbon emissions. However, there is little literature about multimodal transportation based on carbon emission at home and abroad. Firstly, this paper introduces the theory of multimodal transportation, the multimodal transport models that didn't consider carbon emissions and consider carbon emissions are analyzed. On this basis, a multi-objective programming 0-1 programming model with minimum total transportation cost and minimum total carbon emission is proposed. The idea of weight is applied to Ideal point method for solving problem, multi-objective programming is transformed into a single objective function. The optimal solution of carbon emission to transportation cost under different weights is determined by a single objective function with variable weights. Based on the model and algorithm, an example is given and the results are analyzed.

Optimization of municipal waste collection scheduling and routing using vehicle assignment problem (case study of Surabaya city waste collection)

NASA Astrophysics Data System (ADS)

Ramdhani, M. N.; Baihaqi, I.; Siswanto, N.

2018-04-01

Waste collection and disposal become a major problem for many metropolitan cities. Growing population, limited vehicles, and increased road traffic make the waste transportation become more complex. Waste collection involves some key considerations, such as vehicle assignment, vehicle routes, and vehicle scheduling. In the scheduling process, each vehicle has a scheduled departure that serve each route. Therefore, vehicle’s assignments should consider the time required to finish one assigment on that route. The objective of this study is to minimize the number of vehicles needed to serve all routes by developing a mathematical model which uses assignment problem approach. The first step is to generated possible routes from the existing routes, followed by vehicle assignments for those certain routes. The result of the model shows fewer vehicles required to perform waste collection asa well as the the number of journeys that the vehicle to collect the waste to the landfill. The comparison of existing conditions with the model result indicates that the latter’s has better condition than the existing condition because each vehicle with certain route has an equal workload, all the result’s model has the maximum of two journeys for each route.

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

PubMed Central

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

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

NASA Astrophysics Data System (ADS)

Zhang, Xiaoning; Li, Lemin; Wang, Sheng

2006-09-01

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

Exploring bikeability in a metropolitan setting: stimulating and hindering factors in commuting route environments

PubMed Central

2012-01-01

Background Route environments may influence people's active commuting positively and thereby contribute to public health. Assessments of route environments are, however, needed in order to better understand the possible relationship between active commuting and the route environment. The aim of this study was, therefore, to assess the potential associations between perceptions of whether the route environment on the whole hinders or stimulates bicycle commuting and perceptions of environmental factors. Methods The Active Commuting Route Environment Scale (ACRES) was used for the assessment of bicycle commuters' perceptions of their route environments in the inner urban parts of Greater Stockholm, Sweden. Bicycle commuters (n = 827) were recruited by advertisements in newspapers. Simultaneous multiple regression analyses were used to assess the relation between predictor variables (such as levels of exhaust fumes, noise, traffic speed, traffic congestion and greenery) and the outcome variable (hindering - stimulating route environments). Two models were run, (Model 1) without and (Model 2) with the item traffic: unsafe or safe included as a predictor. Results Overall, about 40% of the variance of hindering - stimulating route environments was explained by the environmental predictors in our models (Model 1, R2 = 0.415, and Model 2, R 2= 0.435). The regression equation for Model 1 was: y = 8.53 + 0.33 ugly or beautiful + 0.14 greenery + (-0.14) course of the route + (-0.13) exhaust fumes + (-0.09) congestion: all types of vehicles (p ≤ 0.019). The regression equation for Model 2 was y = 6.55 + 0.31 ugly or beautiful + 0.16 traffic: unsafe or safe + (-0.13) exhaust fumes + 0.12 greenery + (-0.12) course of the route (p ≤ 0.001). Conclusions The main results indicate that beautiful, green and safe route environments seem to be, independently of each other, stimulating factors for bicycle commuting in inner urban areas. On the other hand, exhaust fumes, traffic congestion and low 'directness' of the route seem to be hindering factors. Furthermore, the overall results illustrate the complexity of a research area at the beginning of exploration. PMID:22401492

A Study of SATP Scores and Principals' Perceptions for Traditional and Alternate Routes to Teacher Certification

ERIC Educational Resources Information Center

Moore, Eddie Eugene

2012-01-01

This study explores the differences between traditional and alternate route certification by focusing on the achievement of students who have been instructed by teachers from each program. In addition, this study identifies the strengths and weaknesses of teachers from each certification route through surveys and interviews with principals in the…

Supporting new science teachers in pursuing socially just science education

NASA Astrophysics Data System (ADS)

Ruggirello, Rachel; Flohr, Linda

2017-10-01

This forum explores contradictions that arose within the partnership between Teach for America (TFA) and a university teacher education program. TFA is an alternate route teacher preparation program that places individuals into K-12 classrooms in low-income school districts after participating in an intense summer training program and provides them with ongoing support. This forum is a conversation about the challenges we faced as new science teachers in the TFA program and in the Peace Corps program. We both entered the teaching field with science degrees and very little formal education in science education. In these programs we worked in a community very different from the one we had experienced as students. These experiences allow us to address many of the issues that were discussed in the original paper, namely teaching in an unfamiliar community amid challenges that many teachers face in the first few years of teaching. We consider how these challenges may be amplified for teachers who come to teaching through an alternate route and may not have as much pedagogical training as a more traditional teacher education program provides. The forum expands on the ideas presented in the original paper to consider the importance of perspectives on socially just science education. There is often a disconnect between what is taught in teacher education programs and what teachers actually experience in urban classrooms and this can be amplified when the training received through alternate route provides a different framework as well. This forum urges universities and alternate route programs to continue to find ways to authentically partner using practical strategies that bring together the philosophies and goals of all stakeholders in order to better prepare teachers to partner with their students to achieve their science learning goals.

Modelling a flows in supply chain with analytical models: Case of a chemical industry

NASA Astrophysics Data System (ADS)

Benhida, Khalid; Azougagh, Yassine; Elfezazi, Said

2016-02-01

This study is interested on the modelling of the logistics flows in a supply chain composed on a production sites and a logistics platform. The contribution of this research is to develop an analytical model (integrated linear programming model), based on a case study of a real company operating in the phosphate field, considering a various constraints in this supply chain to resolve the planning problems for a better decision-making. The objectives of this model is to determine and define the optimal quantities of different products to route, to and from the various entities in the supply chain studied.

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

USGS Publications Warehouse

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

2016-01-01

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

Manycast routing, modulation level and spectrum assignment over elastic optical networks

NASA Astrophysics Data System (ADS)

Luo, Xiao; Zhao, Yang; Chen, Xue; Wang, Lei; Zhang, Min; Zhang, Jie; Ji, Yuefeng; Wang, Huitao; Wang, Taili

2017-07-01

Manycast is a point to multi-point transmission framework that requires a subset of destination nodes successfully reached. It is particularly applicable for dealing with large amounts of data simultaneously in bandwidth-hungry, dynamic and cloud-based applications. As rapid increasing of traffics in these applications, the elastic optical networks (EONs) may be relied on to achieve high throughput manycast. In terms of finer spectrum granularity, the EONs could reach flexible accessing to network spectrum and efficient providing exact spectrum resource to demands. In this paper, we focus on the manycast routing, modulation level and spectrum assignment (MA-RMLSA) problem in EONs. Both EONs planning with static manycast traffic and EONs provisioning with dynamic manycast traffic are investigated. An integer linear programming (ILP) model is formulated to derive MA-RMLSA problem in static manycast scenario. Then corresponding heuristic algorithm called manycast routing, modulation level and spectrum assignment genetic algorithm (MA-RMLSA-GA) is proposed to adapt for both static and dynamic manycast scenarios. The MA-RMLSA-GA optimizes MA-RMLSA problem in destination nodes selection, routing light-tree constitution, modulation level allocation and spectrum resource assignment jointly, to achieve an effective improvement in network performance. Simulation results reveal that MA-RMLSA strategies offered by MA-RMLSA-GA have slightly disparity from the optimal solutions provided by ILP model in static scenario. Moreover, the results demonstrate that MA-RMLSA-GA realizes a highly efficient MA-RMLSA strategy with the lowest blocking probability in dynamic scenario compared with benchmark algorithms.

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

PubMed

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

2018-01-01

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

A Functional Near-Infrared Spectroscopy Study of Lexical Decision Task Supports the Dual Route Model and the Phonological Deficit Theory of Dyslexia

ERIC Educational Resources Information Center

Sela, Itamar; Izzetoglu, Meltem; Izzetoglu, Kurtulus; Onaral, Banu

2014-01-01

The dual route model (DRM) of reading suggests two routes of reading development: the phonological and the orthographic routes. It was proposed that although the two routes are active in the process of reading; the first is more involved at the initial stages of reading acquisition, whereas the latter needs more reading training to mature. A…

A decentralized software bus based on IP multicas ting

NASA Technical Reports Server (NTRS)

Callahan, John R.; Montgomery, Todd

1995-01-01

We describe decentralized reconfigurable implementation of a conference management system based on the low-level Internet Protocol (IP) multicasting protocol. IP multicasting allows low-cost, world-wide, two-way transmission of data between large numbers of conferencing participants through the Multicasting Backbone (MBone). Each conference is structured as a software bus -- a messaging system that provides a run-time interconnection model that acts as a separate agent (i.e., the bus) for routing, queuing, and delivering messages between distributed programs. Unlike the client-server interconnection model, the software bus model provides a level of indirection that enhances the flexibility and reconfigurability of a distributed system. Current software bus implementations like POLYLITH, however, rely on a centralized bus process and point-to-point protocols (i.e., TCP/IP) to route, queue, and deliver messages. We implement a software bus called the MULTIBUS that relies on a separate process only for routing and uses a reliable IP multicasting protocol for delivery of messages. The use of multicasting means that interconnections are independent of IP machine addresses. This approach allows reconfiguration of bus participants during system execution without notifying other participants of new IP addresses. The use of IP multicasting also permits an economy of scale in the number of participants. We describe the MULITIBUS protocol elements and show how our implementation performs better than centralized bus implementations.

A memory structure adapted simulated annealing algorithm for a green vehicle routing problem.

PubMed

Küçükoğlu, İlker; Ene, Seval; Aksoy, Aslı; Öztürk, Nursel

2015-03-01

Currently, reduction of carbon dioxide (CO2) emissions and fuel consumption has become a critical environmental problem and has attracted the attention of both academia and the industrial sector. Government regulations and customer demands are making environmental responsibility an increasingly important factor in overall supply chain operations. Within these operations, transportation has the most hazardous effects on the environment, i.e., CO2 emissions, fuel consumption, noise and toxic effects on the ecosystem. This study aims to construct vehicle routes with time windows that minimize the total fuel consumption and CO2 emissions. The green vehicle routing problem with time windows (G-VRPTW) is formulated using a mixed integer linear programming model. A memory structure adapted simulated annealing (MSA-SA) meta-heuristic algorithm is constructed due to the high complexity of the proposed problem and long solution times for practical applications. The proposed models are integrated with a fuel consumption and CO2 emissions calculation algorithm that considers the vehicle technical specifications, vehicle load, and transportation distance in a green supply chain environment. The proposed models are validated using well-known instances with different numbers of customers. The computational results indicate that the MSA-SA heuristic is capable of obtaining good G-VRPTW solutions within a reasonable amount of time by providing reductions in fuel consumption and CO2 emissions.

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

NASA Astrophysics Data System (ADS)

Mazi, K.; Koussis, A. D.

2010-09-01

This work presents a method for reverse routing of flood waves in open channels, which is an inverse problem of the signal identification type. Inflow determination from outflow measurements is useful in hydrologic forensics and in optimal reservoir control, but has been seldom studied. Such problems are ill posed and their solution is sensitive to small perturbations present in the data, or to any related uncertainty. Therefore the major difficulty in solving this inverse problem consists in controlling the amplification of errors that inevitably befall flow measurements, from which the inflow signal is to be determined. The lag-and-route model offers a convenient framework for reverse routing, because not only is formal deconvolution not required, but also reverse routing is through a single linear reservoir. In addition, this inversion degenerates to calculating the intermediate inflow (prior to the lag step) simply as the sum of the outflow and of its time derivative multiplied by the reservoir’s time constant. The remaining time shifting (lag) of the intermediate, reversed flow presents no complications, as pure translation causes no error amplification. Note that reverse routing with the inverted Muskingum scheme (Koussis et al., submitted to the 12th Plinius Conference) fails when that scheme is specialised to the Kalinin-Miljukov model (linear reservoirs in series). The principal functioning of the reverse routing procedure was verified first with perfect field data (outflow hydrograph generated by forward routing of a known inflow hydrograph). The field data were then seeded with random error. To smooth the oscillations caused by the imperfect (measured) outflow data, we applied a multipoint Savitzky-Golay low-pass filter. The combination of reverse routing and filtering achieved an effective recovery of the inflow signal extremely efficiently. Specifically, we compared the reverse routing results of the inverted lag-and-route model and of the inverted Kalinin-Miljukov model. The latter applies the lag-and-route model’s single-reservoir inversion scheme sequentially to its cascade of linear reservoirs, the number of which is related to the stream's hydromorphology. For this purpose, we used the example of Bruen & Dooge (2007), who back-routed flow hydrographs in a 100-km long prismatic channel using a scheme for the reverse solution of the St. Venant equations of flood wave motion. The lag-and-route reverse routing model recovered the inflow hydrograph with comparable accuracy to that of the multi-reservoir, inverted Kalinin-Miljukov model, both performing as well as the box-scheme for reverse routing with the St. Venant equations. In conclusion, the success in the regaining of the inflow signal by the devised single-reservoir reverse routing procedure, with multipoint low-pass filtering, can be attributed to its simple computational structure that endows it with remarkable robustness and exceptional efficiency.

Extended experience benefits spatial mental model development with route but not survey descriptions.

PubMed

Brunyé, Tad T; Taylor, Holly A

2008-02-01

Spatial descriptions symbolically represent environmental information through language and are written in two primary perspectives: survey, analogous to viewing a map, and route, analogous to navigation. Readers of survey or route descriptions form abstracted perspective flexible representations of the described environment, or spatial mental models. The present two experiments investigated the maintenance of perspective in spatial mental models as a function of description perspective and experience (operationalized through repetition), and as reflected in self-paced reading times. Experiment 1 involved studying survey and route descriptions either once or three times, then completing map drawing and true/false statement verification. Results demonstrated that spatial mental models are readily formed with survey descriptions, but require relatively more experience with route descriptions; further, some limited evidence suggests perspective dependence in spatial mental models, even following extended experience. Experiment 2 measured self-paced reading during three successive description presentations. Average reading times over the three presentations reduced more for survey relative to route descriptions, and there was no evidence for perspective specificity in resulting spatial mental models. This supports Experiment 1 findings demonstrating the relatively time-consuming nature of acquiring spatial mental models from route, but not survey descriptions. Results are discussed with regard to developmental, discourse processing, and spatial mental model theory.

Over the Pole: A Fuel Efficiency Analysis of Employing Joint Base Elmendorf-Richardson for Polar Route Utilization

DTIC Science & Technology

2014-06-13

helping me with research, as well as Lt Col Adam Reiman for the use of his modeling software. Both were critical components to help complete this... Reiman , 2013) ............................................ 17 Figure 7: Route Analyzer Secondary Airfields ( Reiman , 2013...Transit Center (Nichol, 2013). AFIT Route Analyzer Model The AFIT Route Analyzer was created by AFIT PhD student Lt Col Adam Reiman . The model was

Distributed Application of the Unified Noah LSM with Hydrologic Flow Routing on an Appalachian Headwater Basin

NASA Astrophysics Data System (ADS)

Garcia, M.; Kumar, S.; Gochis, D.; Yates, D.; McHenry, J.; Burnet, T.; Coats, C.; Condrey, J.

2006-05-01

Collaboration between scientists at UMBC-GEST and NASA-GSFC, the NCAR Research Applications Laboratory (RAL), and Baron Advanced Meteorological Services (BAMS), has produced a modeling framework for the application of traditional land surface models (LSMs) in a distributed hydrologic system which can be used for diagnosis and prediction of routed stream discharge hydrographs. This collaboration is oriented on near-term system implementation across Romania for flood and flash-flood analyses and forecasting as part of the World Bank-funded Destructive Waters Abatement (DESWAT) program. Meteorological forcing from surface observations, model analyses and numerical forecasts are employed in the NASA-GSFC Land Information System (LIS) to drive the Unified Noah LSM with Noah-Distributed components, stream network delineation and routing schemes original to this work. The Unified Noah LSM is the outgrowth of a joint modeling effort between several research partners including NCAR, the NOAA National Center for Environmental Prediction (NCEP), and the Air Force Weather Agency (AFWA). At NCAR, hydrologically-oriented extensions to the Noah LSM have been developed for LSM applications in a distributed domain in order to address the lateral redistribution of soil moisture by surface and subsurface flow processes. These advancements have been integrated into the NASA-GSFC Land Information System (LIS) and coupled with an original framework for hydraulic channel network definition and specification, linkages with the Noah-Distributed overland and subsurface flow framework, and distributed cell- to-cell (or link-node) hydraulic routing. This poster presents an overview of the system components and their organization, as well as results of the first U.S. case study performed with this system under various configurations. The case study simulated precipitation events over a headwater basin in the southern Appalachian Mountains in October 2005 following the landfall of Tropical Storm Tammy in South Carolina. These events followed on a long dry period in the region, lending to the demonstration of watershed response to strong precipitation forcing under nearly ideal and easily-specified initial conditions. The results presented here will compare simulated versus observed streamflow conditions at various locations in the test watershed using a selection of routing methods.

Multi-criteria, personalized route planning using quantifier-guided ordered weighted averaging operators

NASA Astrophysics Data System (ADS)

Nadi, S.; Delavar, M. R.

2011-06-01

This paper presents a generic model for using different decision strategies in multi-criteria, personalized route planning. Some researchers have considered user preferences in navigation systems. However, these prior studies typically employed a high tradeoff decision strategy, which used a weighted linear aggregation rule, and neglected other decision strategies. The proposed model integrates a pairwise comparison method and quantifier-guided ordered weighted averaging (OWA) aggregation operators to form a personalized route planning method that incorporates different decision strategies. The model can be used to calculate the impedance of each link regarding user preferences in terms of the route criteria, criteria importance and the selected decision strategy. Regarding the decision strategy, the calculated impedance lies between aggregations that use a logical "and" (which requires all the criteria to be satisfied) and a logical "or" (which requires at least one criterion to be satisfied). The calculated impedance also includes taking the average of the criteria scores. The model results in multiple alternative routes, which apply different decision strategies and provide users with the flexibility to select one of them en-route based on the real world situation. The model also defines the robust personalized route under different decision strategies. The influence of different decision strategies on the results are investigated in an illustrative example. This model is implemented in a web-based geographical information system (GIS) for Isfahan in Iran and verified in a tourist routing scenario. The results demonstrated, in real world situations, the validity of the route planning carried out in the model.

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Cash transportation vehicle routing and scheduling under stochastic travel times

NASA Astrophysics Data System (ADS)

Yan, Shangyao; Wang, Sin-Siang; Chang, Yu-Hsuan

2014-03-01

Stochastic disturbances occurring in real-world operations could have a significant influence on the planned routing and scheduling results of cash transportation vehicles. In this study, a time-space network flow technique is utilized to construct a cash transportation vehicle routing and scheduling model incorporating stochastic travel times. In addition, to help security carriers to formulate more flexible routes and schedules, a concept of the similarity of time and space for vehicle routing and scheduling is incorporated into the model. The test results show that the model could be useful for security carriers in actual practice.

Weather Avoidance Using Route Optimization as a Decision Aid: An AWIN Topical Study. Phase 1

NASA Technical Reports Server (NTRS)

1998-01-01

The aviation community is faced with reducing the fatal aircraft accident rate by 80 percent within 10 years. This must be achieved even with ever increasing, traffic and a changing National Airspace System. This is not just an altruistic goal, but a real necessity, if our growing level of commerce is to continue. Honeywell Technology Center's topical study, "Weather Avoidance Using Route Optimization as a Decision Aid", addresses these pressing needs. The goal of this program is to use route optimization and user interface technologies to develop a prototype decision aid for dispatchers and pilots. This decision aid will suggest possible diversions through single or multiple weather hazards and present weather information with a human-centered design. At the conclusion of the program, we will have a laptop prototype decision aid that will be used to demonstrate concepts to industry for integration into commercialized products for dispatchers and/or pilots. With weather a factor in 30% of aircraft accidents, our program will prevent accidents by strategically avoiding weather hazards in flight. By supplying more relevant weather information in a human-centered format along with the tools to generate flight plans around weather, aircraft exposure to weather hazards can be reduced. Our program directly addresses the NASA's five year investment areas of Strategic Weather Information and Weather Operations (simulation/hazard characterization and crew/dispatch/ATChazard monitoring, display, and decision support) (NASA Aeronautics Safety Investment Strategy: Weather Investment Recommendations, April 15, 1997). This program is comprised of two phases, Phase I concluded December 31, 1998. This first phase defined weather data requirements, lateral routing algorithms, an conceptual displays for a user-centered design. Phase II runs from January 1999 through September 1999. The second phase integrates vertical routing into the lateral optimizer and combines the user interface into a prototype software testbed. Phase II concludes with a dispatcher and pilot evaluation of the route optimizer decision aid. This document describes work completed in Phase I in contract with NASA Langley August 1998 - December 1998. This report includes: (1) Discuss how weather hazards were identified in partnership with experts, and how weather hazards were prioritized; (2) Static representations of display layouts for integrated planning function (3) Cost function for the 2D route optimizer; (4) Discussion of the method for obtaining, access to raw data of, and the results of the flight deck user information requirements definition; (5) Itemized display format requirements identified for representing weather hazards in a route planning aid.

A workstation-based evaluation of a far-field route planner for helicopters

NASA Technical Reports Server (NTRS)

Warner, David N., Jr.; Moran, Francis J.

1991-01-01

Helicopter flight missions at very low, nap of the Earth, altitudes place a heavy workload on the pilot. To aid in reducing this workload, Ames Research Center has been investigating various types of automated route planners. As part of an automated preflight mission planner, a route planner algorithm aids in selecting the overall (far-field) route to be flown. During the mission, the route planner can be used to replan a new route in case of unexpected threats or change in mission requirements. An evaluation of a candidate route planning algorithm, based on dynamic programming techniques is described. This algorithm meets most of the requirements for route planning, both preflight and during the mission. In general, the requirements are to minimize the distance and/or fuel and the deviation from a flight time schedule, and must be flyable within the constraints of available fuel and time.

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

Treesearch

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

Modeling highway travel time distribution with conditional probability models

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

Oliveira Neto, Francisco Moraes; Chin, Shih-Miao; Hwang, Ho-Ling

ABSTRACT Under the sponsorship of the Federal Highway Administration's Office of Freight Management and Operations, the American Transportation Research Institute (ATRI) has developed performance measures through the Freight Performance Measures (FPM) initiative. Under this program, travel speed information is derived from data collected using wireless based global positioning systems. These telemetric data systems are subscribed and used by trucking industry as an operations management tool. More than one telemetric operator submits their data dumps to ATRI on a regular basis. Each data transmission contains truck location, its travel time, and a clock time/date stamp. Data from the FPM program providesmore » a unique opportunity for studying the upstream-downstream speed distributions at different locations, as well as different time of the day and day of the week. This research is focused on the stochastic nature of successive link travel speed data on the continental United States Interstates network. Specifically, a method to estimate route probability distributions of travel time is proposed. This method uses the concepts of convolution of probability distributions and bivariate, link-to-link, conditional probability to estimate the expected distributions for the route travel time. Major contribution of this study is the consideration of speed correlation between upstream and downstream contiguous Interstate segments through conditional probability. The established conditional probability distributions, between successive segments, can be used to provide travel time reliability measures. This study also suggests an adaptive method for calculating and updating route travel time distribution as new data or information is added. This methodology can be useful to estimate performance measures as required by the recent Moving Ahead for Progress in the 21st Century Act (MAP 21).« less

A heterogeneous fleet vehicle routing model for solving the LPG distribution problem: A case study

NASA Astrophysics Data System (ADS)

Onut, S.; Kamber, M. R.; Altay, G.

2014-03-01

Vehicle Routing Problem (VRP) is an important management problem in the field of distribution and logistics. In VRPs, routes from a distribution point to geographically distributed points are designed with minimum cost and considering customer demands. All points should be visited only once and by one vehicle in one route. Total demand in one route should not exceed the capacity of the vehicle that assigned to that route. VRPs are varied due to real life constraints related to vehicle types, number of depots, transportation conditions and time periods, etc. Heterogeneous fleet vehicle routing problem is a kind of VRP that vehicles have different capacity and costs. There are two types of vehicles in our problem. In this study, it is used the real world data and obtained from a company that operates in LPG sector in Turkey. An optimization model is established for planning daily routes and assigned vehicles. The model is solved by GAMS and optimal solution is found in a reasonable time.

Do People Use the Shortest Path? An Empirical Test of Wardrop’s First Principle

PubMed Central

Zhu, Shanjiang; Levinson, David

2015-01-01

Most recent route choice models, following either the random utility maximization or rule-based paradigm, require explicit enumeration of feasible routes. The quality of model estimation and prediction is sensitive to the appropriateness of the consideration set. However, few empirical studies of revealed route characteristics have been reported in the literature. This study evaluates the widely applied shortest path assumption by evaluating routes followed by residents of the Minneapolis—St. Paul metropolitan area. Accurate Global Positioning System (GPS) and Geographic Information System (GIS) data were employed to reveal routes people used over an eight to thirteen week period. Most people did not choose the shortest path. Using three weeks of that data, we find that current route choice set generation algorithms do not reveal the majority of paths that individuals took. Findings from this study may guide future efforts in building better route choice models. PMID:26267756

Progress report on daily flow-routing simulation for the Carson River, California and Nevada

USGS Publications Warehouse

Hess, G.W.

1996-01-01

A physically based flow-routing model using Hydrological Simulation Program-FORTRAN (HSPF) was constructed for modeling streamflow in the Carson River at daily time intervals as part of the Truckee-Carson Program of the U.S. Geological Survey (USGS). Daily streamflow data for water years 1978-92 for the mainstem river, tributaries, and irrigation ditches from the East Fork Carson River near Markleeville and West Fork Carson River at Woodfords down to the mainstem Carson River at Fort Churchill upstream from Lahontan Reservoir were obtained from several agencies and were compiled into a comprehensive data base. No previous physically based flow-routing model of the Carson River has incorporated multi-agency streamflow data into a single data base and simulated flow at a daily time interval. Where streamflow data were unavailable or incomplete, hydrologic techniques were used to estimate some flows. For modeling purposes, the Carson River was divided into six segments, which correspond to those used in the Alpine Decree that governs water rights along the river. Hydraulic characteristics were defined for 48 individual stream reaches based on cross-sectional survey data obtained from field surveys and previous studies. Simulation results from the model were compared with available observed and estimated streamflow data. Model testing demonstrated that hydraulic characteristics of the Carson River are adequately represented in the models for a range of flow regimes. Differences between simulated and observed streamflow result mostly from inadequate data characterizing inflow and outflow from the river. Because irrigation return flows are largely unknown, irrigation return flow percentages were used as a calibration parameter to minimize differences between observed and simulated streamflows. Observed and simulated streamflow were compared for daily periods for the full modeled length of the Carson River and for two major subreaches modeled with more detailed input data. Hydrographs and statistics presented in this report describe these differences. A sensitivity analysis of four estimated components of the hydrologic system evaluated which components were significant in the model. Estimated ungaged tributary streamflow is not a significant component of the model during low runoff, but is significant during high runoff. The sensitivity analysis indicates that changes in the estimated irrigation diversion and estimated return flow creates a noticeable change in the statistics. The modeling for this study is preliminary. Results of the model are constrained by current availability and accuracy of observed hydrologic data. Several inflows and outflows of the Carson River are not described by time-series data and therefore are not represented in the model.

Blood Far Forward - A Whole Blood Research and Training Program for Austere Environments

DTIC Science & Technology

2013-01-01

crisis situation should be avoided.39 The training program thus includes blood transfusion through the sternal intraosseous route. To date, 158 blood...collections have been performed by soldiers and medics, and more than 100 retransfusions have been performed intravenously and 58 intraosseously in...healthy volunteers. The transfusion time through the sternal intraosseous route of 1 unit of whole blood (by gravity only) varies between 8 minutes 30

Snow as building material for construction of technological along-the-route roads of main pipelines

NASA Astrophysics Data System (ADS)

Merdanov, S. M.; Egorov, A. L.; Kostyrchenko, V. A.; Madyarov, T. M.

2018-05-01

The article deals with the process of compacting snow in a closed volume with the use of vacuum processing for the construction of technological along-the-route roads of main pipelines. The relevance of the chosen study is substantiated; methods and designs for snow compaction are considered. The publication activity and defenses of doctoral and candidate dissertations on the research subject are analyzed. Patent analysis of existing methods and equipment for snow compaction with indication of their disadvantages is carried out. A design calculation was carried out using computer programs in which a strength calculation was performed to identify the most stressed places in the construction of a vibrating hydraulic tyre-type roller. A 3D model of the experimental setup was developed.

3D Building Evacuation Route Modelling and Visualization

NASA Astrophysics Data System (ADS)

Chan, W.; Armenakis, C.

2014-11-01

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

Pathway Tools version 19.0 update: software for pathway/genome informatics and systems biology

PubMed Central

Latendresse, Mario; Paley, Suzanne M.; Krummenacker, Markus; Ong, Quang D.; Billington, Richard; Kothari, Anamika; Weaver, Daniel; Lee, Thomas; Subhraveti, Pallavi; Spaulding, Aaron; Fulcher, Carol; Keseler, Ingrid M.; Caspi, Ron

2016-01-01

Pathway Tools is a bioinformatics software environment with a broad set of capabilities. The software provides genome-informatics tools such as a genome browser, sequence alignments, a genome-variant analyzer and comparative-genomics operations. It offers metabolic-informatics tools, such as metabolic reconstruction, quantitative metabolic modeling, prediction of reaction atom mappings and metabolic route search. Pathway Tools also provides regulatory-informatics tools, such as the ability to represent and visualize a wide range of regulatory interactions. This article outlines the advances in Pathway Tools in the past 5 years. Major additions include components for metabolic modeling, metabolic route search, computation of atom mappings and estimation of compound Gibbs free energies of formation; addition of editors for signaling pathways, for genome sequences and for cellular architecture; storage of gene essentiality data and phenotype data; display of multiple alignments, and of signaling and electron-transport pathways; and development of Python and web-services application programming interfaces. Scientists around the world have created more than 9800 Pathway/Genome Databases by using Pathway Tools, many of which are curated databases for important model organisms. PMID:26454094

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

NASA Astrophysics Data System (ADS)

Mannarini, G.; Pinardi, N.; Coppini, G.; Oddo, P.; Iafrati, A.

2015-09-01

A new numerical model for the on-demand computation of optimal ship routes based on sea-state forecasts has been developed. The model, named VISIR (discoVerIng Safe and effIcient Routes) is designed to support decision-makers when planning a marine voyage. The first version of the system, VISIR-I, considers medium and small motor vessels with lengths of up to a few tens of meters and a displacement hull. The model is made up of three components: the route optimization algorithm, the mechanical model of the ship, and the environmental fields. The optimization algorithm is based on a graph-search method with time-dependent edge weights. The algorithm is also able to compute a voluntary ship speed reduction. The ship model accounts for calm water and added wave resistance by making use of just the principal particulars of the vessel as input parameters. The system also checks the optimal route for parametric roll, pure loss of stability, and surfriding/broaching-to hazard conditions. Significant wave height, wave spectrum peak period, and wave direction forecast fields are employed as an input. Examples of VISIR-I routes in the Mediterranean Sea are provided. The optimal route may be longer in terms of miles sailed and yet it is faster and safer than the geodetic route between the same departure and arrival locations. Route diversions result from the safety constraints and the fact that the algorithm takes into account the full temporal evolution and spatial variability of the environmental fields.

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

PubMed

Santos, Andrés; Manzano, Gema

2010-04-14

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

A Driving Cycle Detection Approach Using Map Service API

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

Zhu, Lei; Gonder, Jeffrey D

Following advancements in smartphone and portable global positioning system (GPS) data collection, wearable GPS data have realized extensive use in transportation surveys and studies. The task of detecting driving cycles (driving or car-mode trajectory segments) from wearable GPS data has been the subject of much research. Specifically, distinguishing driving cycles from other motorized trips (such as taking a bus) is the main research problem in this paper. Many mode detection methods only focus on raw GPS speed data while some studies apply additional information, such as geographic information system (GIS) data, to obtain better detection performance. Procuring and maintaining dedicatedmore » road GIS data are costly and not trivial, whereas the technical maturity and broad use of map service application program interface (API) queries offers opportunities for mode detection tasks. The proposed driving cycle detection method takes advantage of map service APIs to obtain high-quality car-mode API route information and uses a trajectory segmentation algorithm to find the best-matched API route. The car-mode API route data combined with the actual route information, including the actual mode information, are used to train a logistic regression machine learning model, which estimates car modes and non-car modes with probability rates. The experimental results show promise for the proposed method's ability to detect vehicle mode accurately.« less

Planning Safe Routes to School.

ERIC Educational Resources Information Center

Appleyard, Bruce S.

2003-01-01

Describes "Safe Routes to School" efforts in the United States and other countries to make walking and biking to school the transportation of choice. Offers a plan of action for formulating and carrying out such a program and information on funding sources. (EV)

Optimizing integrated airport surface and terminal airspace operations under uncertainty

NASA Astrophysics Data System (ADS)

Bosson, Christabelle S.

In airports and surrounding terminal airspaces, the integration of surface, arrival and departure scheduling and routing have the potential to improve the operations efficiency. Moreover, because both the airport surface and the terminal airspace are often altered by random perturbations, the consideration of uncertainty in flight schedules is crucial to improve the design of robust flight schedules. Previous research mainly focused on independently solving arrival scheduling problems, departure scheduling problems and surface management scheduling problems and most of the developed models are deterministic. This dissertation presents an alternate method to model the integrated operations by using a machine job-shop scheduling formulation. A multistage stochastic programming approach is chosen to formulate the problem in the presence of uncertainty and candidate solutions are obtained by solving sample average approximation problems with finite sample size. The developed mixed-integer-linear-programming algorithm-based scheduler is capable of computing optimal aircraft schedules and routings that reflect the integration of air and ground operations. The assembled methodology is applied to a Los Angeles case study. To show the benefits of integrated operations over First-Come-First-Served, a preliminary proof-of-concept is conducted for a set of fourteen aircraft evolving under deterministic conditions in a model of the Los Angeles International Airport surface and surrounding terminal areas. Using historical data, a representative 30-minute traffic schedule and aircraft mix scenario is constructed. The results of the Los Angeles application show that the integration of air and ground operations and the use of a time-based separation strategy enable both significant surface and air time savings. The solution computed by the optimization provides a more efficient routing and scheduling than the First-Come-First-Served solution. Additionally, a data driven analysis is performed for the Los Angeles environment and probabilistic distributions of pertinent uncertainty sources are obtained. A sensitivity analysis is then carried out to assess the methodology performance and find optimal sampling parameters. Finally, simulations of increasing traffic density in the presence of uncertainty are conducted first for integrated arrivals and departures, then for integrated surface and air operations. To compare the optimization results and show the benefits of integrated operations, two aircraft separation methods are implemented that offer different routing options. The simulations of integrated air operations and the simulations of integrated air and surface operations demonstrate that significant traveling time savings, both total and individual surface and air times, can be obtained when more direct routes are allowed to be traveled even in the presence of uncertainty. The resulting routings induce however extra take off delay for departing flights. As a consequence, some flights cannot meet their initial assigned runway slot which engenders runway position shifting when comparing resulting runway sequences computed under both deterministic and stochastic conditions. The optimization is able to compute an optimal runway schedule that represents an optimal balance between total schedule delays and total travel times.

Timing and effect of a safe routes to school program on child pedestrian injury risk during school travel hours: Bayesian changepoint and difference-in-differences analysis.

PubMed

DiMaggio, Charles; Chen, Qixuan; Muennig, Peter A; Li, Guohua

2014-12-01

In 2005, the US Congress allocated $612 million for a national Safe Routes to School (SRTS) program to encourage walking and bicycling to schools. We evaluated the effectiveness of a SRTS in controlling pedestrian injuries among school-age children. Bayesian changepoint analysis was applied to model the quarterly counts of pedestrian injuries among 5- to 19-year old children in New York City between 2001 and 2010 during school-travel hours in census tracts with and without SRTS. Overdispersed Poisson model was used to estimate difference-in-differences in injury risk between census tracts with and without SRTS following the changepoint. In SRTS-intervention census tracts, a change point in the quarterly counts of injuries was identified in the second quarter of 2008, which was consistent with the timing of the implementation of SRTS interventions. In census tracts with SRTS interventions, the estimated quarterly rates of pedestrian injury per 10,000 population among school-age children during school-travel hours were 3.47 (95% Credible Interval [CrI] 2.67, 4.39) prior to the changepoint, and 0.74 (95% CrI 0.30, 1.50) after the changepoint. There was no change in the average number of quarterly injuries in non-SRTS census tracts. Overdispersed Poisson modeling revealed that SRTS implementation was associated with a 44% reduction (95% Confidence Interval [CI] 87% decrease to 130% increase) in school-age pedestrian injury risk during school-travel hours. Bayesian changepoint analysis of quarterly counts of school-age pedestrian injuries successfully identified the timing of SRTS intervention in New York City. Implementation of the SRTS program in New York City appears to be effective in reducing school-age pedestrian injuries during school-travel hours.

An optimization model for the US Air-Traffic System

NASA Technical Reports Server (NTRS)

Mulvey, J. M.

1986-01-01

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

The safe routes to school program in California: an update.

PubMed

Chaufan, Claudia; Yeh, Jarmin; Fox, Patrick

2012-06-01

Despite efforts to combat increasing rates of childhood obesity, the problem is worsening. Safe Routes to School (SRTS), an international movement motivated by the childhood obesity epidemic, seeks to increase the number of children actively commuting (walking or biking) to school by funding projects that remove barriers preventing them from doing so. We summarize the evaluation of the first phase of an ongoing SRTS program in California and discuss ways to enhance data collection.

The Safe Routes to School Program in California: An Update

PubMed Central

Chaufan, Claudia; Fox, Patrick

2012-01-01

Despite efforts to combat increasing rates of childhood obesity, the problem is worsening. Safe Routes to School (SRTS), an international movement motivated by the childhood obesity epidemic, seeks to increase the number of children actively commuting (walking or biking) to school by funding projects that remove barriers preventing them from doing so. We summarize the evaluation of the first phase of an ongoing SRTS program in California and discuss ways to enhance data collection. PMID:22515862

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

EPA Science Inventory

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

Remotely Sensed Based Lake/Reservoir Routing in Congo River Basin

NASA Astrophysics Data System (ADS)

Raoufi, R.; Beighley, E.; Lee, H.

2017-12-01

Lake and reservoir dynamics can influence local to regional water cycles but are often not well represented in hydrologic models. One challenge that limits their inclusion in models is the need for detailed storage-discharge behavior that can be further complicated in reservoirs where specific operation rules are employed. Here, the Hillslope River Routing (HRR) model is combined with a remotely sensed based Reservoir Routing (RR) method and applied to the Congo River Basin. Given that topographic data are often continuous over the entire terrestrial surface (i.e., does not differentiate between land and open water), the HRR-RR model integrates topographic derived river networks and catchment boundaries (e.g., HydroSHEDs) with water boundary extents (e.g., Global Lakes and Wetlands Database) to develop the computational framework. The catchments bordering lakes and reservoirs are partitioned into water and land portions, where representative flowpath characteristics are determined and vertical water balance and lateral routings is performed separately on each partition based on applicable process models (e.g., open water evaporation vs. evapotranspiration). To enable reservoir routing, remotely sensed water surface elevations and extents are combined to determine the storage change time series. Based on the available time series, representative storage change patterns are determined. Lake/reservoir routing is performed by combining inflows from the HRR-RR model and the representative storage change patterns to determine outflows. In this study, a suite of storage change patterns derived from remotely sensed measurements are determined representative patterns for wet, dry and average conditions. The HRR-RR model dynamically selects and uses the optimal storage change pattern for the routing process based on these hydrologic conditions. The HRR-RR model results are presented to highlight the importance of lake attenuation/routing in the Congo Basin.

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

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

On the preventive management of sediment-related sewer blockages: a combined maintenance and routing optimization approach.

PubMed

Fontecha, John E; Akhavan-Tabatabaei, Raha; Duque, Daniel; Medaglia, Andrés L; Torres, María N; Rodríguez, Juan Pablo

In this work we tackle the problem of planning and scheduling preventive maintenance (PM) of sediment-related sewer blockages in a set of geographically distributed sites that are subject to non-deterministic failures. To solve the problem, we extend a combined maintenance and routing (CMR) optimization approach which is a procedure based on two components: (a) first a maintenance model is used to determine the optimal time to perform PM operations for each site and second (b) a mixed integer program-based split procedure is proposed to route a set of crews (e.g., sewer cleaners, vehicles equipped with winches or rods and dump trucks) in order to perform PM operations at a near-optimal minimum expected cost. We applied the proposed CMR optimization approach to two (out of five) operative zones in the city of Bogotá (Colombia), where more than 100 maintenance operations per zone must be scheduled on a weekly basis. Comparing the CMR against the current maintenance plan, we obtained more than 50% of cost savings in 90% of the sites.

A Heuristic Route Selection Model for Low Level Aircraft Flight Through Defended Terrain.

DTIC Science & Technology

1980-05-01

IICEN(I9J),vJ= 1q3 )vI~lvhl-I) WRITE(7,902) (DETLCU ).I11NLOW) WRITE (79902) (CETHI (I) ,I=1 Nt1I) WRITE(79901) (FROM(I),I1, 9IC) WRITE(79901) ((TOC IJ) ,J...the Army ATTN: DAMO-RQ, LTC G. Ax 1 Washington, DC 20310 Joint Services Electro Optical Guidance Weapons Countermeasures Test Program ATTN: DRXDE- TD 1

Portable data flow in UNIX

NASA Astrophysics Data System (ADS)

Fox, R.; Molen, A. Vander; Hannuschke, S.

1994-02-01

We describe the dataflow of a nuclear physics data acquisition system. The system features a high speed active routing subsystem which allows an arbitrary number of data producers to contribute data to the system. Data are then routed to an arbitrary number of data consumers. Low overhead route-by-reference mechanisms are used to allow high rate operations. The system has been ported to a variety of UNIX systems. Timings are given for the routing component of the system on several systems. Finally, we give an example of a set of programs which can be added to the system to produce a complete data acquisition system.

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

NASA Astrophysics Data System (ADS)

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

2016-05-01

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

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

USGS Publications Warehouse

Mehl, Steffen W.; Hill, Mary C.

2011-01-01

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

Safe routes to school (SRTS) statewide mobility assessment study : phase I report.

DOT National Transportation Integrated Search

2010-01-01

This report presents the results of phase one of a two phase study designed to support state-level management of the Federal Highway Administration Safe Routes to School (SRTS) program. The study aims to achieve three objectives: (1) identify and use...

Experiences with serial and parallel algorithms for channel routing using simulated annealing

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1988-01-01

Two algorithms for channel routing using simulated annealing are presented. Simulated annealing is an optimization methodology which allows the solution process to back up out of local minima that may be encountered by inappropriate selections. By properly controlling the annealing process, it is very likely that the optimal solution to an NP-complete problem such as channel routing may be found. The algorithm presented proposes very relaxed restrictions on the types of allowable transformations, including overlapping nets. By freeing that restriction and controlling overlap situations with an appropriate cost function, the algorithm becomes very flexible and can be applied to many extensions of channel routing. The selection of the transformation utilizes a number of heuristics, still retaining the pseudorandom nature of simulated annealing. The algorithm was implemented as a serial program for a workstation, and a parallel program designed for a hypercube computer. The details of the serial implementation are presented, including many of the heuristics used and some of the resulting solutions.

The cost of simplifying air travel when modeling disease spread.

PubMed

Lessler, Justin; Kaufman, James H; Ford, Daniel A; Douglas, Judith V

2009-01-01

Air travel plays a key role in the spread of many pathogens. Modeling the long distance spread of infectious disease in these cases requires an air travel model. Highly detailed air transportation models can be over determined and computationally problematic. We compared the predictions of a simplified air transport model with those of a model of all routes and assessed the impact of differences on models of infectious disease. Using U.S. ticket data from 2007, we compared a simplified "pipe" model, in which individuals flow in and out of the air transport system based on the number of arrivals and departures from a given airport, to a fully saturated model where all routes are modeled individually. We also compared the pipe model to a "gravity" model where the probability of travel is scaled by physical distance; the gravity model did not differ significantly from the pipe model. The pipe model roughly approximated actual air travel, but tended to overestimate the number of trips between small airports and underestimate travel between major east and west coast airports. For most routes, the maximum number of false (or missed) introductions of disease is small (<1 per day) but for a few routes this rate is greatly underestimated by the pipe model. If our interest is in large scale regional and national effects of disease, the simplified pipe model may be adequate. If we are interested in specific effects of interventions on particular air routes or the time for the disease to reach a particular location, a more complex point-to-point model will be more accurate. For many problems a hybrid model that independently models some frequently traveled routes may be the best choice. Regardless of the model used, the effect of simplifications and sensitivity to errors in parameter estimation should be analyzed.

Optimisation of MSW collection routes for minimum fuel consumption using 3D GIS modelling.

PubMed

Tavares, G; Zsigraiova, Z; Semiao, V; Carvalho, M G

2009-03-01

Collection of municipal solid waste (MSW) may account for more than 70% of the total waste management budget, most of which is for fuel costs. It is therefore crucial to optimise the routing network used for waste collection and transportation. This paper proposes the use of geographical information systems (GIS) 3D route modelling software for waste collection and transportation, which adds one more degree of freedom to the system and allows driving routes to be optimised for minimum fuel consumption. The model takes into account the effects of road inclination and vehicle weight. It is applied to two different cases: routing waste collection vehicles in the city of Praia, the capital of Cape Verde, and routing the transport of waste from different municipalities of Santiago Island to an incineration plant. For the Praia city region, the 3D model that minimised fuel consumption yielded cost savings of 8% as compared with an approach that simply calculated the shortest 3D route. Remarkably, this was true despite the fact that the GIS-recommended fuel reduction route was actually 1.8% longer than the shortest possible travel distance. For the Santiago Island case, the difference was even more significant: a 12% fuel reduction for a similar total travel distance. These figures indicate the importance of considering both the relief of the terrain and fuel consumption in selecting a suitable cost function to optimise vehicle routing.

Behavior-dependent Routing: Responding to Anomalies with Automated Low-cost Measures

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

Oehmen, Christopher S.; Carroll, Thomas E.; Paulson, Patrick R.

2015-10-12

This is a conference paper submission describing research and software implementation of a cybersecurity concept that uses behavior models to trigger changes in routing of network traffic. As user behavior deviates more and more from baseline models, traffic is routed through more elevated layers of analysis and control.

An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to Solve the Split Delivery Vehicle Routing Problem

DTIC Science & Technology

2015-01-01

programming formulation of traveling salesman problems , Journal of the ACM, 7(4), 326-329. Montemanni, R., Gambardella, L. M., Rizzoli, A.E., Donati. A.V... salesman problem . BioSystem, 43(1), 73-81. Dror, M., Trudeau, P., 1989. Savings by split delivery routing. Transportation Science, 23, 141- 145. Dror, M...An Ant Colony Optimization and Hybrid Metaheuristics Algorithm to solve the Split Delivery Vehicle Routing Problem Authors: Gautham Rajappa

Implications of reduced involvement in en route air traffic control.

DOT National Transportation Integrated Search

1999-08-01

The expansion of the National Route Program will allow airlines to be more flexible in filing and amending flight plans. This may : result in a change in the role of the air traffic control specialist from direct control to a position with more monit...

Promoting safe walking and biking to school: the Marin County success story.

PubMed

Staunton, Catherine E; Hubsmith, Deb; Kallins, Wendi

2003-09-01

Walking and biking to school can be an important part of a healthy lifestyle, yet most US children do not start their day with these activities. The Safe Routes to School Program in Marin County, California, is working to promote walking and biking to school. Using a multipronged approach, the program identifies and creates safe routes to schools and invites communitywide involvement. By its second year, the program was serving 4665 students in 15 schools. Participating public schools reported an increase in school trips made by walking (64%), biking (114%), and carpooling (91%) and a decrease in trips by private vehicles carrying only one student (39%).

Concurrent airline fleet allocation and aircraft design with profit modeling for multiple airlines

NASA Astrophysics Data System (ADS)

Govindaraju, Parithi

A "System of Systems" (SoS) approach is particularly beneficial in analyzing complex large scale systems comprised of numerous independent systems -- each capable of independent operations in their own right -- that when brought in conjunction offer capabilities and performance beyond the constituents of the individual systems. The variable resource allocation problem is a type of SoS problem, which includes the allocation of "yet-to-be-designed" systems in addition to existing resources and systems. The methodology presented here expands upon earlier work that demonstrated a decomposition approach that sought to simultaneously design a new aircraft and allocate this new aircraft along with existing aircraft in an effort to meet passenger demand at minimum fleet level operating cost for a single airline. The result of this describes important characteristics of the new aircraft. The ticket price model developed and implemented here enables analysis of the system using profit maximization studies instead of cost minimization. A multiobjective problem formulation has been implemented to determine characteristics of a new aircraft that maximizes the profit of multiple airlines to recognize the fact that aircraft manufacturers sell their aircraft to multiple customers and seldom design aircraft customized to a single airline's operations. The route network characteristics of two simple airlines serve as the example problem for the initial studies. The resulting problem formulation is a mixed-integer nonlinear programming problem, which is typically difficult to solve. A sequential decomposition strategy is applied as a solution methodology by segregating the allocation (integer programming) and aircraft design (non-linear programming) subspaces. After solving a simple problem considering two airlines, the decomposition approach is then applied to two larger airline route networks representing actual airline operations in the year 2005. The decomposition strategy serves as a promising technique for future detailed analyses. Results from the profit maximization studies favor a smaller aircraft in terms of passenger capacity due to its higher yield generation capability on shorter routes while results from the cost minimization studies favor a larger aircraft due to its lower direct operating cost per seat mile.

Iconic memory-based omnidirectional route panorama navigation.

PubMed

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

2005-01-01

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

A Physically Based Runoff Routing Model for Land Surface and Earth System Models

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

Li, Hongyi; Wigmosta, Mark S.; Wu, Huan

2013-06-13

A new physically based runoff routing model, called the Model for Scale Adaptive River Transport (MOSART), has been developed to be applicable across local, regional, and global scales. Within each spatial unit, surface runoff is first routed across hillslopes and then discharged along with subsurface runoff into a ‘‘tributary subnetwork’’ before entering the main channel. The spatial units are thus linked via routing through the main channel network, which is constructed in a scale-consistent way across different spatial resolutions. All model parameters are physically based, and only a small subset requires calibration.MOSART has been applied to the Columbia River basinmore » at 1/ 168, 1/ 88, 1/ 48, and 1/ 28 spatial resolutions and was evaluated using naturalized or observed streamflow at a number of gauge stations. MOSART is compared to two other routing models widely used with land surface models, the River Transport Model (RTM) in the Community Land Model (CLM) and the Lohmann routing model, included as a postprocessor in the Variable Infiltration Capacity (VIC) model package, yielding consistent performance at multiple resolutions. MOSART is further evaluated using the channel velocities derived from field measurements or a hydraulic model at various locations and is shown to be capable of producing the seasonal variation and magnitude of channel velocities reasonably well at different resolutions. Moreover, the impacts of spatial resolution on model simulations are systematically examined at local and regional scales. Finally, the limitations ofMOSART and future directions for improvements are discussed.« less

Crossed and Locked Quotes in a Multi-Market Simulation

PubMed Central

Todd, Andrew; Beling, Peter; Scherer, William

2016-01-01

Financial markets are often fragmented, introducing the possibility that quotes in identical securities may become crossed or locked. There are a number of theoretical explanations for the existence of crossed and locked quotes, including competition, simultaneous actions, inattentiveness, fee structure and market access. In this paper, we perform a simulation experiment designed to examine the effect of simple order routing procedures on the properties of a fragmented market consisting of a single security trading in two independent limit order books. The quotes in the two markets are connected solely by the routing decision of the market participants. We report on the health of the consolidated market as measured by the duration of crossed and locked states, as well as the spread and the volatility of transaction prices in the consolidated market. We aim to quantify exactly how the prevalence of order routing among a population of market participants affects properties of the consolidated market. Our model contributes to the zero-intelligence literature by treating order routing as an experimental variable. Additionally, we introduce a parsimonious heuristic for limit order routing, allowing us to study the effects of both market order routing and limit order routing. Our model refines intuition for the sometimes subtle relationships between the prevalence of order routing and various market measures. Our model also provides a benchmark for more complex agent-based models. PMID:26959416

Crossed and Locked Quotes in a Multi-Market Simulation.

PubMed

Todd, Andrew; Beling, Peter; Scherer, William

2016-01-01

Financial markets are often fragmented, introducing the possibility that quotes in identical securities may become crossed or locked. There are a number of theoretical explanations for the existence of crossed and locked quotes, including competition, simultaneous actions, inattentiveness, fee structure and market access. In this paper, we perform a simulation experiment designed to examine the effect of simple order routing procedures on the properties of a fragmented market consisting of a single security trading in two independent limit order books. The quotes in the two markets are connected solely by the routing decision of the market participants. We report on the health of the consolidated market as measured by the duration of crossed and locked states, as well as the spread and the volatility of transaction prices in the consolidated market. We aim to quantify exactly how the prevalence of order routing among a population of market participants affects properties of the consolidated market. Our model contributes to the zero-intelligence literature by treating order routing as an experimental variable. Additionally, we introduce a parsimonious heuristic for limit order routing, allowing us to study the effects of both market order routing and limit order routing. Our model refines intuition for the sometimes subtle relationships between the prevalence of order routing and various market measures. Our model also provides a benchmark for more complex agent-based models.

Factors affecting route selection and survival of steelhead kelts at Snake River dams in 2012 and 2013

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

Harnish, Ryan A.; Colotelo, Alison H. A.; Li, Xinya

2015-03-31

In 2012 and 2013, Pacific Northwest National Laboratory (PNNL) conducted a study that summarized the passage route proportions and route-specific survival rates of steelhead kelts that passed through Federal Columbia River Power System (FCRPS) dams. To accomplish this, a total of 811 steelhead kelts were tagged with Juvenile Salmon Acoustic Telemetry System (JSATS) transmitters. Acoustic receivers, both autonomous and cabled, were deployed throughout the FCRPS to monitor the downstream movements of tagged kelts. Kelts were also tagged with passive integrated transponder tags to monitor passage through juvenile bypass systems (JBS) and detect returning fish. The current study evaluated data collectedmore » in 2012 and 2013 to identify environmental, temporal, operational, individual, and behavioral variables that were related to forebay residence time, route of passage, and survival of steelhead kelts at FCRPS dams on the Snake River. Multiple approaches, including 3-D tracking, bivariate and multivariable regression modeling, and decision tree analyses were used to identify the environmental, temporal, operational, individual, and behavioral variables that had the greatest effect on forebay residence time, route of passage, and route-specific and overall dam passage survival probabilities for tagged kelts at Lower Granite (LGR), Little Goose (LGS), and Lower Monumental (LMN) dams. In general, kelt behavior and discharge appeared to work independently to affect forebay residence times. Kelt behavior, primarily approach location, migration depth, and “searching” activities in the forebay, was found to have the greatest influence on their route of passage. The condition of kelts was the single most important factor affecting their survival. The information gathered in this study may be used by dam operators and fisheries managers to identify potential management actions to improve in-river survival of kelts or collection methods for kelt reconditioning programs to aid the recovery of Snake River steelhead populations.« less

Trajectory-adaptive route choice models : specification, choice set generation, and estimation.

DOT National Transportation Integrated Search

2013-03-01

The objective of the research is to investigate adaptive route choice behavior using individuallevel route choice data from GPS (Global Positioning System) observations in a real-life : network, where a traveler could revise the route choice based up...

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

PubMed

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

2017-05-22

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

Application of the AMPLE cluster-and-truncate approach to NMR structures for molecular replacement

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

Bibby, Jaclyn; Keegan, Ronan M.; Mayans, Olga

2013-11-01

Processing of NMR structures for molecular replacement by AMPLE works well. AMPLE is a program developed for clustering and truncating ab initio protein structure predictions into search models for molecular replacement. Here, it is shown that its core cluster-and-truncate methods also work well for processing NMR ensembles into search models. Rosetta remodelling helps to extend success to NMR structures bearing low sequence identity or high structural divergence from the target protein. Potential future routes to improved performance are considered and practical, general guidelines on using AMPLE are provided.

An aggregate method to calibrate the reference point of cumulative prospect theory-based route choice model for urban transit network

NASA Astrophysics Data System (ADS)

Zhang, Yufeng; Long, Man; Luo, Sida; Bao, Yu; Shen, Hanxia

2015-12-01

Transit route choice model is the key technology of public transit systems planning and management. Traditional route choice models are mostly based on expected utility theory which has an evident shortcoming that it cannot accurately portray travelers' subjective route choice behavior for their risk preferences are not taken into consideration. Cumulative prospect theory (CPT), a brand new theory, can be used to describe travelers' decision-making process under the condition of uncertainty of transit supply and risk preferences of multi-type travelers. The method to calibrate the reference point, a key parameter to CPT-based transit route choice model, determines the precision of the model to a great extent. In this paper, a new method is put forward to obtain the value of reference point which combines theoretical calculation and field investigation results. Comparing the proposed method with traditional method, it shows that the new method can promote the quality of CPT-based model by improving the accuracy in simulating travelers' route choice behaviors based on transit trip investigation from Nanjing City, China. The proposed method is of great significance to logical transit planning and management, and to some extent makes up the defect that obtaining the reference point is solely based on qualitative analysis.

76 FR 6957 - FTA Fiscal Year 2011 Apportionments, Allocations, and Program Information

Federal Register 2010, 2011, 2012, 2013, 2014

2011-02-08

.... 5336(b), FTA used 60 percent of the directional route miles attributable to the Alaska Railroad... to 49 U.S.C. 5336(b), FTA uses 60 percent of the directional route miles attributable to the Alaska...: notifying eligible local entities of funding availability; developing project selection criteria...

Procedures for Empirical Determination of En-Route Criterion Levels.

ERIC Educational Resources Information Center

Moncrief, Michael H.

En-route Criterion Levels (ECLs) are defined as decision rules for predicting pupil readiness to advance through an instructional sequence. This study investigated the validity of present ELCs in an individualized mathematics program and tested procedures for empirically determining optimal ECLs. Retest scores and subsequent progress were…

75 FR 81721 - Debit Card Interchange Fees and Routing

Federal Register 2010, 2011, 2012, 2013, 2014

2010-12-28

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

Analyzing the evolutionary mechanisms of the Air Transportation System-of-Systems using network theory and machine learning algorithms

NASA Astrophysics Data System (ADS)

Kotegawa, Tatsuya

Complexity in the Air Transportation System (ATS) arises from the intermingling of many independent physical resources, operational paradigms, and stakeholder interests, as well as the dynamic variation of these interactions over time. Currently, trade-offs and cost benefit analyses of new ATS concepts are carried out on system-wide evaluation simulations driven by air traffic forecasts that assume fixed airline routes. However, this does not well reflect reality as airlines regularly add and remove routes. A airline service route network evolution model that projects route addition and removal was created and combined with state-of-the-art air traffic forecast methods to better reflect the dynamic properties of the ATS in system-wide simulations. Guided by a system-of-systems framework, network theory metrics and machine learning algorithms were applied to develop the route network evolution models based on patterns extracted from historical data. Constructing the route addition section of the model posed the greatest challenge due to the large pool of new link candidates compared to the actual number of routes historically added to the network. Of the models explored, algorithms based on logistic regression, random forests, and support vector machines showed best route addition and removal forecast accuracies at approximately 20% and 40%, respectively, when validated with historical data. The combination of network evolution models and a system-wide evaluation tool quantified the impact of airline route network evolution on air traffic delay. The expected delay minutes when considering network evolution increased approximately 5% for a forecasted schedule on 3/19/2020. Performance trade-off studies between several airline route network topologies from the perspectives of passenger travel efficiency, fuel burn, and robustness were also conducted to provide bounds that could serve as targets for ATS transformation efforts. The series of analysis revealed that high robustness is achievable only in exchange of lower passenger travel and fuel burn efficiency. However, increase in the network density can mitigate this trade-off.

78 FR 7476 - Airport Improvement Program

Federal Register 2010, 2011, 2012, 2013, 2014

2013-02-01

... of Airport Planning and Programming, Financial Assistance Division has updated and significantly.... San Martin, Manager, Airports Financial Assistance Division, Office of Airport Planning and... Airports, Airport Planning and Programming, Routing Symbol APP-501, 800 Independence Avenue SW., Room 619...

Portable data flow in UNIX

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

Fox, R.; Molen, A.V.; Hannuschke, S.

1994-02-01

The authors describe the data flow of a nuclear physics data acquisition system. The system features a high speed active routing subsystem which allows an arbitrary number of data producers to contribute data to the system. Data are then routed to an arbitrary number of data consumers. Low overhead route-by-reference mechanisms are used to allow high rate operations. The system has been ported to a variety of UNIX[trademark] systems. Timings are given for the routing component of the system on several systems. Finally, they give an example of a set of programs which can be added to the system tomore » produce a complete data acquisition system.« less

The Future of Air Traffic Management

NASA Technical Reports Server (NTRS)

Denery, Dallas G.; Erzberger, Heinz; Edwards, Thomas A. (Technical Monitor)

1998-01-01

A system for the control of terminal area traffic to improve productivity, referred to as the Center-TRACON Automation System (CTAS), is being developed at NASA's Ames Research Center under a joint program with the FAA. CTAS consists of a set of integrated tools that provide computer-generated advisories for en-route and terminal area controllers. The premise behind the design of CTAS has been that successful planning of traffic requires accurate trajectory prediction. Data bases consisting of representative aircraft performance models, airline preferred operational procedures and a three dimensional wind model support the trajectory prediction. The research effort has been the design of a set of automation tools that make use of this trajectory prediction capability to assist controllers in overall management of traffic. The first tool, the Traffic Management Advisor (TMA), provides the overall flow management between the en route and terminal areas. A second tool, the Final Approach Spacing Tool (FAST) provides terminal area controllers with sequence and runway advisories to allow optimal use of the runways. The TMA and FAST are now being used in daily operations at Dallas/Ft. Worth airport. Additional activities include the development of several other tools. These include: 1) the En Route Descent Advisor that assist the en route controller in issuing conflict free descents and ascents; 2) the extension of FAST to include speed and heading advisories and the Expedite Departure Path (EDP) that assists the terminal controller in management of departures; and 3) the Collaborative Arrival Planner (CAP) that will assist the airlines in operational decision making. The purpose of this presentation is to review the CTAS concept and to present the results of recent field tests. The paper will first discuss the overall concept and then discuss the status of the individual tools.

Using Map Service API for Driving Cycle Detection for Wearable GPS Data: Preprint

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

Zhu, Lei; Gonder, Jeffrey D

Following advancements in smartphone and portable global positioning system (GPS) data collection, wearable GPS data have realized extensive use in transportation surveys and studies. The task of detecting driving cycles (driving or car-mode trajectory segments) from wearable GPS data has been the subject of much research. Specifically, distinguishing driving cycles from other motorized trips (such as taking a bus) is the main research problem in this paper. Many mode detection methods only focus on raw GPS speed data while some studies apply additional information, such as geographic information system (GIS) data, to obtain better detection performance. Procuring and maintaining dedicatedmore » road GIS data are costly and not trivial, whereas the technical maturity and broad use of map service application program interface (API) queries offers opportunities for mode detection tasks. The proposed driving cycle detection method takes advantage of map service APIs to obtain high-quality car-mode API route information and uses a trajectory segmentation algorithm to find the best-matched API route. The car-mode API route data combined with the actual route information, including the actual mode information, are used to train a logistic regression machine learning model, which estimates car modes and non-car modes with probability rates. The experimental results show promise for the proposed method's ability to detect vehicle mode accurately.« less

Development of a cross-section based stream package for MODFLOW

NASA Astrophysics Data System (ADS)

Ou, G.; Chen, X.; Irmak, A.

2012-12-01

Accurate simulation of stream-aquifer interactions for wide rivers using the streamflow routing package in MODFLOW is very challenging. To better represent a wide river spanning over multiple model grid cells, a Cross-Section based streamflow Routing (CSR) package is developed and incorporated into MODFLOW to simulate the interaction between streams and aquifers. In the CSR package, a stream segment is represented as a four-point polygon instead of a polyline which is traditionally used in streamflow routing simulation. Each stream segment is composed of upstream and downstream cross-sections. A cross-section consists of a number of streambed points possessing coordinates, streambed thicknesses and streambed hydraulic conductivities to describe the streambed geometry and hydraulic properties. The left and right end points are used to determine the locations of the stream segments. According to the cross-section geometry and hydraulic properties, CSR calculates the new stream stage at the cross-section using the Brent's method to solve the Manning's Equation. A module is developed to automatically compute the area of the stream segment polygon on each intersected MODFLOW grid cell as the upstream and downstream stages change. The stream stage and streambed hydraulic properties of model grids are interpolated based on the streambed points. Streambed leakage is computed as a function of streambed conductance and difference between the groundwater level and stream stage. The Muskingum-Cunge flow routing scheme with variable parameters is used to simulate the streamflow as the groundwater (discharge or recharge) contributes as lateral flows. An example is used to illustrate the capabilities of the CSR package. The result shows that the CSR is applicable to describing the spatial and temporal variation in the interaction between streams and aquifers. The input data become simple due to that the internal program automatically interpolates the cross-section data to each model grid cell.

Nonlinear relative-proportion-based route adjustment process for day-to-day traffic dynamics: modeling, equilibrium and stability analysis

NASA Astrophysics Data System (ADS)

Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang; Li, Geng

2016-11-01

Travelers' route adjustment behaviors in a congested road traffic network are acknowledged as a dynamic game process between them. Existing Proportional-Switch Adjustment Process (PSAP) models have been extensively investigated to characterize travelers' route choice behaviors; PSAP has concise structure and intuitive behavior rule. Unfortunately most of which have some limitations, i.e., the flow over adjustment problem for the discrete PSAP model, the absolute cost differences route adjustment problem, etc. This paper proposes a relative-Proportion-based Route Adjustment Process (rePRAP) maintains the advantages of PSAP and overcomes these limitations. The rePRAP describes the situation that travelers on higher cost route switch to those with lower cost at the rate that is unilaterally depended on the relative cost differences between higher cost route and its alternatives. It is verified to be consistent with the principle of the rational behavior adjustment process. The equivalence among user equilibrium, stationary path flow pattern and stationary link flow pattern is established, which can be applied to judge whether a given network traffic flow has reached UE or not by detecting the stationary or non-stationary state of link flow pattern. The stability theorem is proved by the Lyapunov function approach. A simple example is tested to demonstrate the effectiveness of the rePRAP model.

The QKD network: model and routing scheme

NASA Astrophysics Data System (ADS)

Yang, Chao; Zhang, Hongqi; Su, Jinhai

2017-11-01

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

Pathway Tools version 19.0 update: software for pathway/genome informatics and systems biology.

PubMed

Karp, Peter D; Latendresse, Mario; Paley, Suzanne M; Krummenacker, Markus; Ong, Quang D; Billington, Richard; Kothari, Anamika; Weaver, Daniel; Lee, Thomas; Subhraveti, Pallavi; Spaulding, Aaron; Fulcher, Carol; Keseler, Ingrid M; Caspi, Ron

2016-09-01

Pathway Tools is a bioinformatics software environment with a broad set of capabilities. The software provides genome-informatics tools such as a genome browser, sequence alignments, a genome-variant analyzer and comparative-genomics operations. It offers metabolic-informatics tools, such as metabolic reconstruction, quantitative metabolic modeling, prediction of reaction atom mappings and metabolic route search. Pathway Tools also provides regulatory-informatics tools, such as the ability to represent and visualize a wide range of regulatory interactions. This article outlines the advances in Pathway Tools in the past 5 years. Major additions include components for metabolic modeling, metabolic route search, computation of atom mappings and estimation of compound Gibbs free energies of formation; addition of editors for signaling pathways, for genome sequences and for cellular architecture; storage of gene essentiality data and phenotype data; display of multiple alignments, and of signaling and electron-transport pathways; and development of Python and web-services application programming interfaces. Scientists around the world have created more than 9800 Pathway/Genome Databases by using Pathway Tools, many of which are curated databases for important model organisms. © The Author 2015. Published by Oxford University Press. For Permissions, please email: journals.permissions@oup.com.

Simulation modeling of route guidance concept

DOT National Transportation Integrated Search

1997-01-01

The methodology of a simulation model developed at the University of New South Wales, Australia, for the evaluation of performance of Dynamic Route Guidance Systems (DRGS) is described. The microscopic simulation model adopts the event update simulat...

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Broadening Participation of Women and Underrepresented Minorities in STEM through a Hybrid Online Transfer Program

PubMed Central

Drew, Jennifer C.; Galindo-Gonzalez, Sebastian; Ardissone, Alexandria N.; Triplett, Eric W.

2016-01-01

The Microbiology and Cell Science (MCS) Department at the University of Florida (UF) developed a new model of a 2 + 2 program that uses a hybrid online approach to bring its science, technology, engineering, and mathematics (STEM) curriculum to students. In this paradigm, 2-year graduates transfer as online students into the Distance Education in MCS (DE MCS) bachelor of science program. The program has broadened access to STEM with a steadily increasing enrollment that does not draw students away from existing on-campus programs. Notably, half of the DE MCS students are from underrepresented minority (URM) backgrounds and two-thirds are women, which represents a greater level of diversity than the corresponding on-campus cohort and the entire university. Additionally, the DE MCS cohort has comparable retention and academic performance compared with the on-campus transfer cohort. Of those who have earned a BS through the DE MCS program, 71% are women and 61% are URM. Overall, these data demonstrate that the hybrid online approach is successful in increasing diversity and provides another viable route in the myriad of STEM pathways. As the first of its kind in a STEM field, the DE MCS program serves as a model for programs seeking to broaden their reach. PMID:27587859

Do dual-route models accurately predict reading and spelling performance in individuals with acquired alexia and agraphia?

PubMed

Rapcsak, Steven Z; Henry, Maya L; Teague, Sommer L; Carnahan, Susan D; Beeson, Pélagie M

2007-06-18

Coltheart and co-workers [Castles, A., Bates, T. C., & Coltheart, M. (2006). John Marshall and the developmental dyslexias. Aphasiology, 20, 871-892; Coltheart, M., Rastle, K., Perry, C., Langdon, R., & Ziegler, J. (2001). DRC: A dual route cascaded model of visual word recognition and reading aloud. Psychological Review, 108, 204-256] have demonstrated that an equation derived from dual-route theory accurately predicts reading performance in young normal readers and in children with reading impairment due to developmental dyslexia or stroke. In this paper, we present evidence that the dual-route equation and a related multiple regression model also accurately predict both reading and spelling performance in adult neurological patients with acquired alexia and agraphia. These findings provide empirical support for dual-route theories of written language processing.

Modeling municipal solid waste collection: A generalized vehicle routing model with multiple transfer stations, gather sites and inhomogeneous vehicles in time windows.

PubMed

Son, Le Hoang; Louati, Amal

2016-06-01

Municipal Solid Waste (MSW) collection is a necessary process in any municipality resulting in the quality-of-life, economic aspects and urban structuralization. The intrinsic nature of MSW collection relates to the development of effective vehicle routing models that optimize the total traveling distances of vehicles, the environmental emission and the investment costs. In this article, we propose a generalized vehicle routing model including multiple transfer stations, gather sites and inhomogeneous vehicles in time windows for MSW collection. It takes into account traveling in one-way routes, the number of vehicles per m(2) and waiting time at traffic stops for reduction of operational time. The proposed model could be used for scenarios having similar node structures and vehicles' characteristics. A case study at Danang city, Vietnam is given to illustrate the applicability of this model. The experimental results have clearly shown that the new model reduces both total traveling distances and operational hours of vehicles in comparison with those of practical scenarios. Optimal routes of vehicles on streets and markets at Danang are given. Those results are significant to practitioners and local policy makers. Copyright © 2016 Elsevier Ltd. All rights reserved.

Promoting Safe Walking and Biking to School: The Marin County Success Story

PubMed Central

Staunton, Catherine E.; Hubsmith, Deb; Kallins, Wendi

2003-01-01

Walking and biking to school can be an important part of a healthy lifestyle, yet most US children do not start their day with these activities. The Safe Routes to School Program in Marin County, California, is working to promote walking and biking to school. Using a multipronged approach, the program identifies and creates safe routes to schools and invites communitywide involvement. By its second year, the program was serving 4665 students in 15 schools. Participating public schools reported an increase in school trips made by walking (64%), biking (114%), and carpooling (91%) and a decrease in trips by private vehicles carrying only one student (39%). PMID:12948957

RCA: A route city attraction model for air passengers

NASA Astrophysics Data System (ADS)

Huang, Feihu; Xiong, Xi; Peng, Jian; Guo, Bing; Tong, Bo

2018-02-01

Human movement pattern is a research hotspot of social computing and has practical values in various fields, such as traffic planning. Previous studies mainly focus on the travel activities of human beings on the ground rather than those in the air. In this paper, we use the reservation records of air passengers to explore air passengers' movement characteristics. After analyzing the effect of the route-trip length on the throughput, we find that most passengers eventually return to their original departure city and that the mobility of air passengers is not related to the route length. Based on these characteristics, we present a route city attraction (RCA) model, in which GDP or population is considered for the calculation of the attraction. The sub models of our RCA model show the better prediction performance of throughput than the radiation model and the gravity model.

Draft Cognitive Skills Training Program for En-Route Air Traffic Controllers.

ERIC Educational Resources Information Center

Redding, Richard E.

This document begins with a discussion of the cognitive task analysis (CTA) that was commissioned by the Federal Aviation Administration to identify the cognitive skills-related training needs of en-route air traffic controllers. Concluding the introductory section are a brief list of recommendations regarding the design of a training program…

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

ERIC Educational Resources Information Center

Stoddart, Trish; Floden, Robert E.

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

Multi-objective route planning for dangerous goods using compromise programming

NASA Astrophysics Data System (ADS)

Li, Rongrong; Leung, Yee

2011-09-01

The transportation of dangerous goods (DG) can significantly affect the human and natural environment if accidents occur during the transportation process. Hong Kong is a large city with high population density and narrow streets. Due to the land constraints, vehicles carrying DG inevitably have to pass through densely populated areas or their vicinities. Therefore, safe DG transportation is of paramount importance. There is thus an urgent need to review and improve the way trucks carrying DG are being routed on the road networks. Routing of such vehicles should consider not only the operating cost, but also the safety of travelers in the network, the population potentially exposed, and the possible damage inflicted to the surrounding properties and facilities in the event of a DG incident. This research develops a novel methodology for the determination of optimal routes for DG transportation under conflicting objectives by means of the compromise programming approach. With the support of geographical information system (GIS), a case study is carried out for the transportation of DG in the road network of Hong Kong. The experimental results confirm the effectiveness of the proposed approach.

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

DOT National Transportation Integrated Search

1975-03-01

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

Predicting when biliary excretion of parent drug is a major route of elimination in humans.

PubMed

Hosey, Chelsea M; Broccatelli, Fabio; Benet, Leslie Z

2014-09-01

Biliary excretion is an important route of elimination for many drugs, yet measuring the extent of biliary elimination is difficult, invasive, and variable. Biliary elimination has been quantified for few drugs with a limited number of subjects, who are often diseased patients. An accurate prediction of which drugs or new molecular entities are significantly eliminated in the bile may predict potential drug-drug interactions, pharmacokinetics, and toxicities. The Biopharmaceutics Drug Disposition Classification System (BDDCS) characterizes significant routes of drug elimination, identifies potential transporter effects, and is useful in understanding drug-drug interactions. Class 1 and 2 drugs are primarily eliminated in humans via metabolism and will not exhibit significant biliary excretion of parent compound. In contrast, class 3 and 4 drugs are primarily excreted unchanged in the urine or bile. Here, we characterize the significant elimination route of 105 orally administered class 3 and 4 drugs. We introduce and validate a novel model, predicting significant biliary elimination using a simple classification scheme. The model is accurate for 83% of 30 drugs collected after model development. The model corroborates the observation that biliarily eliminated drugs have high molecular weights, while demonstrating the necessity of considering route of administration and extent of metabolism when predicting biliary excretion. Interestingly, a predictor of potential metabolism significantly improves predictions of major elimination routes of poorly metabolized drugs. This model successfully predicts the major elimination route for poorly permeable/poorly metabolized drugs and may be applied prior to human dosing.

Update on a Pharmacokinetic-Centric Alternative Tier II Program for MMT—Part I: Program Implementation and Lessons Learned

PubMed Central

Dorman, David C.; Andersen, Melvin E.; Roper, Jerry M.; Taylor, Michael D.

2012-01-01

Concerns have been raised regarding environmental manganese exposure since high exposures have been associated with neurological disorders. The USA Environmental Protection Agency most recent human health risk assessment of inhaled manganese conducted in 1993 identified specific areas of uncertainty regarding manganese pharmacokinetics. This led to the development of a test rule under the USA Clean Air Act that required the generation of pharmacokinetic information on the inorganic manganese combustion products of the organometallic fuel additive methylcyclopentadienyl manganese tricarbonyl (MMT). The Alternative Tier 2 testing program for MMT, described in this paper, has yielded substantial pharmacokinetic data and has enabled the generation of physiologically based pharmacokinetic (PBPK) models for manganese. These models are capable of predicting tissue manganese concentrations across a variety of dose routes, levels, and durations while accounting for factors such as age, gender, and reproductive status, enabling the consideration of tissue dosimetry in future risk assessments. PMID:22545047

A Family of ACO Routing Protocols for Mobile Ad Hoc Networks

PubMed Central

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

2017-01-01

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

Developing an approach to effectively use super ensemble experiments for the projection of hydrological extremes under climate change

NASA Astrophysics Data System (ADS)

Watanabe, S.; Kim, H.; Utsumi, N.

2017-12-01

This study aims to develop a new approach which projects hydrology under climate change using super ensemble experiments. The use of multiple ensemble is essential for the estimation of extreme, which is a major issue in the impact assessment of climate change. Hence, the super ensemble experiments are recently conducted by some research programs. While it is necessary to use multiple ensemble, the multiple calculations of hydrological simulation for each output of ensemble simulations needs considerable calculation costs. To effectively use the super ensemble experiments, we adopt a strategy to use runoff projected by climate models directly. The general approach of hydrological projection is to conduct hydrological model simulations which include land-surface and river routing process using atmospheric boundary conditions projected by climate models as inputs. This study, on the other hand, simulates only river routing model using runoff projected by climate models. In general, the climate model output is systematically biased so that a preprocessing which corrects such bias is necessary for impact assessments. Various bias correction methods have been proposed, but, to the best of our knowledge, no method has proposed for variables other than surface meteorology. Here, we newly propose a method for utilizing the projected future runoff directly. The developed method estimates and corrects the bias based on the pseudo-observation which is a result of retrospective offline simulation. We show an application of this approach to the super ensemble experiments conducted under the program of Half a degree Additional warming, Prognosis and Projected Impacts (HAPPI). More than 400 ensemble experiments from multiple climate models are available. The results of the validation using historical simulations by HAPPI indicates that the output of this approach can effectively reproduce retrospective runoff variability. Likewise, the bias of runoff from super ensemble climate projections is corrected, and the impact of climate change on hydrologic extremes is assessed in a cost-efficient way.

Gray-box reservoir routing to compute flow propagation in operational forecasting and decision support systems

NASA Astrophysics Data System (ADS)

Russano, Euan; Schwanenberg, Dirk; Alvarado Montero, Rodolfo

2017-04-01

Operational forecasting and decision support systems for flood mitigation and the daily management of water resources require computationally efficient flow routing models. If backwater effects do not play an important role, a hydrological routing approach is often a pragmatic choice. It offers a reasonable accuracy at low computational costs in comparison to a more detailed hydraulic model. This work presents a nonlinear reservoir routing scheme as well as its implementation for the flow propagation between the hydro reservoir Três Marias and a downstream inundation-affected city Pirapora in Brazil. We refer to the model as a gray-box approach due to the identification of the parameter k by a data-driven approach for each reservoir of the cascade, instead of using estimates based on physical characteristics. The model reproduces the discharge at the gauge Pirapora, using 15 reservoirs in the cascade. The obtained results are compared with the ones obtained from the full-hydrodynamic model SOBEK. Results show a relatively good performance for the validation period, with a RMSE of 139.48 for the gray-box model, while the full-hydrodynamic model shows a RMSE of 136.67. The simulation time for a period of several years for the full-hydrodynamic took approximately 64s, while the gray-box model only required about 0.50s. This provides a significant speedup of the computation by only a little trade-off in accuracy, pointing at the potential of the simple approach in the context of time-critical, operational applications. Key-words: flow routing, reservoir routing, gray-box model

Evidence for the involvement of a nonlexical route in the repetition of familiar words: A comparison of single and dual route models of auditory repetition.

PubMed

Hanley, J Richard; Dell, Gary S; Kay, Janice; Baron, Rachel

2004-03-01

In this paper, we attempt to simulate the picture naming and auditory repetition performance of two patients reported by Hanley, Kay, and Edwards (2002), who were matched for picture naming score but who differed significantly in their ability to repeat familiar words. In Experiment 1, we demonstrate that the model of naming and repetition put forward by Foygel and Dell (2000) is better able to accommodate this pattern of performance than the model put forward by Dell, Schwartz, Martin, Saffran, and Gagnon (1997). Nevertheless, Foygel and Dell's model underpredicted the repetition performance of both patients. In Experiment 2, we attempt to simulate their performance using a new dual route model of repetition in which Foygel and Dell's model is augmented by an additional nonlexical repetition pathway. The new model provided a more accurate fit to the real-word repetition performance of both patients. It is argued that the results provide support for dual route models of auditory repetition.

Roman and early-medieval routes in north-western Europe: modelling national and international frequent-travel zones in the Netherlands using a multi-proxy approach.

NASA Astrophysics Data System (ADS)

van Lanen, Rowin J.; Jansma, Esther

2016-04-01

The end of the Roman period in many parts of north-western Europe coincided with severe population decline and collapsing trade routes. To what extent the long-distance transport routes changed from Roman to early-medieval periods and what their exact nature was, is generally unknown. Only few historical sources are available for this period, and archaeological records complex. Traditionally, research on the long-distance exchange of goods therefore generally has focussed on the spatial analyses of archaeologically recognizable goods (e.g. jewellery, religious artefacts). Although these endeavours greatly increase our understanding of long-distance trade networks, they probably in itself do not represent the full spectrum of common exchange networks and transport routes. By using a dendroarchaeological approach we were able to analyse long-distance transport routes of imported timber in the Roman and early-medieval Netherlands. By combining the provenance of exogenous timbers with data on modelled Roman and early-medieval route networks, we were able to reconstruct: (a) Roman and early-medieval trade networks in structural timbers, (b) changing transport routes in structural timbers and (c) model spatially shifting frequent-travel zones in the research area.

A new approach on auxiliary vehicle assignment in capacitated location routing problem

NASA Astrophysics Data System (ADS)

Bashiri, Mahdi; Rasoulinejad, Zeinab; Fallahzade, Ehsan

2016-03-01

The location routing problem (LRP) considers locating depots and vehicle routing decisions simultaneously. In classic LRP the number of customers in each route depends on the capacity of the vehicle. In this paper a capacitated LRP model with auxiliary vehicle assignment is presented in which the length of each route is not restricted by main vehicle capacity. Two kinds of vehicles are considered: main vehicles with higher capacity and fixed cost and auxiliary vehicles with lower capacity and fixed cost. The auxiliary vehicles can be added to the transportation system as an alternative strategy to cover the capacity limitations and they are just used to transfer goods from depots to vehicles and cannot serve the customers by themselves. To show the applicability of the proposed model, some numerical examples derived from the well-known instances are used. Moreover the model has been solved by some meta-heuristics for large sized instances. The results show the efficiency of the proposed model and the solution approach, considering the classic model and the exact solution approach, respectively.

Model of a Frame of Dynamic Routing and Its Equilibrium

NASA Astrophysics Data System (ADS)

Zhang, Shu; Yuan, Yuan; Xu, Jian

Dynamic routing algorithm based on the shortest path principle is criticized due to the oscillation induced by such routing scheme. In the present work, we propose the model of TCP/RED algorithm by a new frame of dynamic routing, based on the measurement of occupation ratio of router buffer for different links, which only requires the information of the queue size at the buffer of the router, to stabilize the system. We classify several types of equilibrium and employ the numerical method to study the stability of the steady state. Our numerical results show that the careful selection of the parameters characterizing the dynamic routing algorithm can stabilize the system in some cases.

Osm-Oriented Method of Multimodal Route Planning

NASA Astrophysics Data System (ADS)

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

2015-07-01

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

War and peace: morphemes and full forms in a noninteractive activation parallel dual-route model.

PubMed

Baayen, H; Schreuder, R

This article introduces a computational tool for modeling the process of morphological segmentation in visual and auditory word recognition in the framework of a parallel dual-route model. Copyright 1999 Academic Press.

Evaluation of Fast-Time Wake Vortex Models using Wake Encounter Flight Test Data

NASA Technical Reports Server (NTRS)

Ahmad, Nashat N.; VanValkenburg, Randal L.; Bowles, Roland L.; Limon Duparcmeur, Fanny M.; Gloudesman, Thijs; van Lochem, Sander; Ras, Eelco

2014-01-01

This paper describes a methodology for the integration and evaluation of fast-time wake models with flight data. The National Aeronautics and Space Administration conducted detailed flight tests in 1995 and 1997 under the Aircraft Vortex Spacing System Program to characterize wake vortex decay and wake encounter dynamics. In this study, data collected during Flight 705 were used to evaluate NASA's fast-time wake transport and decay models. Deterministic and Monte-Carlo simulations were conducted to define wake hazard bounds behind the wake generator. The methodology described in this paper can be used for further validation of fast-time wake models using en-route flight data, and for determining wake turbulence constraints in the design of air traffic management concepts.

Criticality in conserved dynamical systems: experimental observation vs. exact properties.

PubMed

Marković, Dimitrije; Gros, Claudius; Schuelein, André

2013-03-01

Conserved dynamical systems are generally considered to be critical. We study a class of critical routing models, equivalent to random maps, which can be solved rigorously in the thermodynamic limit. The information flow is conserved for these routing models and governed by cyclic attractors. We consider two classes of information flow, Markovian routing without memory and vertex routing involving a one-step routing memory. Investigating the respective cycle length distributions for complete graphs, we find log corrections to power-law scaling for the mean cycle length, as a function of the number of vertices, and a sub-polynomial growth for the overall number of cycles. When observing experimentally a real-world dynamical system one normally samples stochastically its phase space. The number and the length of the attractors are then weighted by the size of their respective basins of attraction. This situation is equivalent, for theory studies, to "on the fly" generation of the dynamical transition probabilities. For the case of vertex routing models, we find in this case power law scaling for the weighted average length of attractors, for both conserved routing models. These results show that the critical dynamical systems are generically not scale-invariant but may show power-law scaling when sampled stochastically. It is hence important to distinguish between intrinsic properties of a critical dynamical system and its behavior that one would observe when randomly probing its phase space.

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

EPA Science Inventory

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

Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes

PubMed Central

Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

2015-01-01

Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes. PMID:26294903

Dynamic Bus Travel Time Prediction Models on Road with Multiple Bus Routes.

PubMed

Bai, Cong; Peng, Zhong-Ren; Lu, Qing-Chang; Sun, Jian

2015-01-01

Accurate and real-time travel time information for buses can help passengers better plan their trips and minimize waiting times. A dynamic travel time prediction model for buses addressing the cases on road with multiple bus routes is proposed in this paper, based on support vector machines (SVMs) and Kalman filtering-based algorithm. In the proposed model, the well-trained SVM model predicts the baseline bus travel times from the historical bus trip data; the Kalman filtering-based dynamic algorithm can adjust bus travel times with the latest bus operation information and the estimated baseline travel times. The performance of the proposed dynamic model is validated with the real-world data on road with multiple bus routes in Shenzhen, China. The results show that the proposed dynamic model is feasible and applicable for bus travel time prediction and has the best prediction performance among all the five models proposed in the study in terms of prediction accuracy on road with multiple bus routes.

Spatial modelling for tsunami evacuation route in Parangtritis Village

NASA Astrophysics Data System (ADS)

Juniansah, A.; Tyas, B. I.; Tama, G. C.; Febriani, K. R.; Farda, N. M.

2018-04-01

Tsunami is a series of huge sea waves that commonly occurs because of the oceanic plate movement or tectonic activity under the sea. As a sudden hazard, the tsunami has damaged many people over the years. Parangtritis village is one of high tsunami hazard risk area in Indonesia which needs an effective tsunami risk reduction. This study aims are modelling a tsunami susceptibility map, existing assembly points evaluation, and suggesting effective evacuation routes. The susceptibility map was created using ALOS PALSAR DEM and surface roughness coefficient. The method of tsunami modelling employed inundation model developed by Berryman (2006). The results are used to determine new assembly points based on the Sentinel 2A imagery and to determine the most effective evacuation route by using network analyst. This model can be used to create detailed scale of evacuation route, but unrepresentative for assembly point that far from road network.

Parallel algorithms for placement and routing in VLSI design. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Brouwer, Randall Jay

1991-01-01

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

PubMed

Cacchiani, V; Hemmelmayr, V C; Tricoire, F

2014-01-30

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems.

A set-covering based heuristic algorithm for the periodic vehicle routing problem

PubMed Central

Cacchiani, V.; Hemmelmayr, V.C.; Tricoire, F.

2014-01-01

We present a hybrid optimization algorithm for mixed-integer linear programming, embedding both heuristic and exact components. In order to validate it we use the periodic vehicle routing problem (PVRP) as a case study. This problem consists of determining a set of minimum cost routes for each day of a given planning horizon, with the constraints that each customer must be visited a required number of times (chosen among a set of valid day combinations), must receive every time the required quantity of product, and that the number of routes per day (each respecting the capacity of the vehicle) does not exceed the total number of available vehicles. This is a generalization of the well-known vehicle routing problem (VRP). Our algorithm is based on the linear programming (LP) relaxation of a set-covering-like integer linear programming formulation of the problem, with additional constraints. The LP-relaxation is solved by column generation, where columns are generated heuristically by an iterated local search algorithm. The whole solution method takes advantage of the LP-solution and applies techniques of fixing and releasing of the columns as a local search, making use of a tabu list to avoid cycling. We show the results of the proposed algorithm on benchmark instances from the literature and compare them to the state-of-the-art algorithms, showing the effectiveness of our approach in producing good quality solutions. In addition, we report the results on realistic instances of the PVRP introduced in Pacheco et al. (2011)  [24] and on benchmark instances of the periodic traveling salesman problem (PTSP), showing the efficacy of the proposed algorithm on these as well. Finally, we report the new best known solutions found for all the tested problems. PMID:24748696

77 FR 23300 - Self-Regulatory Organizations; BATS Y-Exchange, Inc.; Order Approving a Proposed Rule Change To...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-04-18

...-Regulatory Organizations; BATS Y-Exchange, Inc.; Order Approving a Proposed Rule Change To Amend BATS Y-Exchange, Inc. Rule 2.12 to Make Permanent the Pilot Program That Permits BATS Y-Exchange, Inc. To Receive Inbound Routes of Equities Orders Through BATS Trading, Inc., BATS Y-Exchange's Routing Broker-Dealer...

Alternative Routes to Teacher Professional Identity: Exploring the Conflated Sub-Identities of Teach for America Corps Members

ERIC Educational Resources Information Center

Thomas, Matthew A. M.; Mockler, Nicole

2018-01-01

Research on the development of professional identity for teachers who enter the profession through alternative routes is still in its infancy. In contrast to their peers who complete traditional initial teacher education programs, these teachers are exposed to different conditions and constraints that produce a range of sub-identities previously…

A Mixed-Methods Study of Alternate-Route Teachers' Effect on Student Learning

ERIC Educational Resources Information Center

Spearman, Cassandra Faye

2017-01-01

Due to teacher shortages at the study site, teaching positions in the state that is the focus of this study are filled by alternate route (AR) teachers, who earned bachelor degrees in the fields that were not related to education and received teacher certification through alternative teacher education programs. Because there is limited information…

75 FR 39149 - Establishment of Low Altitude Area Navigation Route (T-284); Houston, TX

Federal Register 2010, 2011, 2012, 2013, 2014

2010-07-08

... of Houston Area Air Traffic System (HAATS) Project, Phase 3C, program actions, the route is pending..., 2010. The Director of the Federal Register approves this incorporation by reference action under 1 CFR part 51, subject to the annual revision of FAA Order 7400.9 and publication of conforming amendments...

Adoption of Safe Routes to School in Canadian and the United States Contexts: Best Practices and Recommendations

ERIC Educational Resources Information Center

Macridis, Soultana; García Bengoechea, Enrique

2015-01-01

Background: Declines in physical activity (PA) in children and youth have contributed to increases in childhood overweight and obesity. The Safe Routes to School (SRTS) program was developed to promote school active transportation (AT) and reverse the trend. Methods: Adopting concepts of a realist approach, this article seeks to understand…

Educational Opportunity and Alternative Certification: New Evidence and New Questions. Policy Brief Number 1

ERIC Educational Resources Information Center

Darling-Hammond, Linda

2009-01-01

Recent findings from a Mathematica study comparing the performance of teachers prepared via alternative and traditional routes have been interpreted to suggest that policymakers and practitioners should expand the use of fast-entry alternative routes and seek teachers trained through such programs, as they presumably perform as well in the…

An Alternate Route to Policy Influence: How Evaluations Affect D.A.R.E.

ERIC Educational Resources Information Center

Weiss, Carol Hirschon; Murphy-Graham, Erin; Birkeland, Sarah

2005-01-01

Investigators of the influence of evaluations on policy decisions have noted three main routes to influence: instrumental, conceptual, and political/symbolic. This study, an inquiry into the effect of evaluations of the Drug Abuse Resistance Education (D.A.R.E.) program, found a fourth main way that evaluations exert an influence: imposed use. The…

EXPOSURE RELATED DOSE ESTIMATING MODEL (ERDEM)

EPA Science Inventory

ERDEM is a physiologically-based pharmacokinetic (PBPK) model with a graphical user interface (GUI) front end. Such a mathematical model was needed to make reliable estimates of the chemical dose to organs of animals or humans because of uncertainties of making route-to route, lo...

Robust Dynamic Multi-objective Vehicle Routing Optimization Method.

PubMed

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

2017-03-21

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

Application of the MacCormack scheme to overland flow routing for high-spatial resolution distributed hydrological model

NASA Astrophysics Data System (ADS)

Zhang, Ling; Nan, Zhuotong; Liang, Xu; Xu, Yi; Hernández, Felipe; Li, Lianxia

2018-03-01

Although process-based distributed hydrological models (PDHMs) are evolving rapidly over the last few decades, their extensive applications are still challenged by the computational expenses. This study attempted, for the first time, to apply the numerically efficient MacCormack algorithm to overland flow routing in a representative high-spatial resolution PDHM, i.e., the distributed hydrology-soil-vegetation model (DHSVM), in order to improve its computational efficiency. The analytical verification indicates that both the semi and full versions of the MacCormack schemes exhibit robust numerical stability and are more computationally efficient than the conventional explicit linear scheme. The full-version outperforms the semi-version in terms of simulation accuracy when a same time step is adopted. The semi-MacCormack scheme was implemented into DHSVM (version 3.1.2) to solve the kinematic wave equations for overland flow routing. The performance and practicality of the enhanced DHSVM-MacCormack model was assessed by performing two groups of modeling experiments in the Mercer Creek watershed, a small urban catchment near Bellevue, Washington. The experiments show that DHSVM-MacCormack can considerably improve the computational efficiency without compromising the simulation accuracy of the original DHSVM model. More specifically, with the same computational environment and model settings, the computational time required by DHSVM-MacCormack can be reduced to several dozen minutes for a simulation period of three months (in contrast with one day and a half by the original DHSVM model) without noticeable sacrifice of the accuracy. The MacCormack scheme proves to be applicable to overland flow routing in DHSVM, which implies that it can be coupled into other PHDMs for watershed routing to either significantly improve their computational efficiency or to make the kinematic wave routing for high resolution modeling computational feasible.

Evaluating environmental modeling and sampling data with biomarker data to identify sources and routes of exposure

NASA Astrophysics Data System (ADS)

Shin, Hyeong-Moo; McKone, Thomas E.; Bennett, Deborah H.

2013-04-01

Exposure to environmental chemicals results from multiple sources, environmental media, and exposure routes. Ideally, modeled exposures should be compared to biomonitoring data. This study compares the magnitude and variation of modeled polycyclic aromatic hydrocarbons (PAHs) exposures resulting from emissions to outdoor and indoor air and estimated exposure inferred from biomarker levels. Outdoor emissions result in both inhalation and food-based exposures. We modeled PAH intake doses using U.S. EPA's 2002 National Air Toxics Assessment (NATA) county-level emissions data for outdoor inhalation, the CalTOX model for food ingestion (based on NATA emissions), and indoor air concentrations from field studies for indoor inhalation. We then compared the modeled intake with the measured urine levels of hydroxy-PAH metabolites from the 2001-2002 National Health and Nutrition Examination Survey (NHANES) survey as quantifiable human intake of PAH parent-compounds. Lognormal probability plots of modeled intakes and estimated intakes inferred from biomarkers suggest that a primary route of exposure to naphthalene, fluorene, and phenanthrene for the U.S. population is likely inhalation from indoor sources. For benzo(a)pyrene, the predominant exposure route is likely from food ingestion resulting from multi-pathway transport and bioaccumulation due to outdoor emissions. Multiple routes of exposure are important for pyrene. We also considered the sensitivity of the predicted exposure to the proportion of the total naphthalene production volume emitted to the indoor environment. The comparison of PAH biomarkers with exposure variability estimated from models and sample data for various exposure pathways supports that both indoor and outdoor models are needed to capture the sources and routes of exposure to environmental contaminants.

ROUTE-SPECIFIC DOSIMETRY

EPA Science Inventory

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

A Hydrologic Routing Model Based on Geomorphological Characteristics of the River Network

NASA Astrophysics Data System (ADS)

Krajewski, W. F.; Quintero, F.; Ghimire, G.; Rojas, M.

2017-12-01

The Iowa Flood Center (IFC) provides streamflow forecasts for about 2000 locations in Iowa using a real-time distributed hydrologic model, forced with radar and raingage rainfall information. The model structure is based on ordinary differential equations that represent the flow of water from the hillslopes to the channels of the river network. The formulation of the routing of water across the rivers constitutes a fundamental aspect of the model, because this component is mostly responsible for providing estimates of the time-to-peak and peak magnitude. The routing model structure of the system is based on the scaling properties of river velocity with the discharge and drainage area of the channel, which can be written in terms of a power-law function. This study examines how this scaling relation is connected to the Horton-Strahler order of the channel network. This evaluation represents a step forward towards formulating model structures that are based on characteristics that are invariant across spatial scales. We proposed a routing model for every different Horton orders of the network, by adjusting a power-law function to available observations of velocity and discharge provided by USGS. The models were implemented into the Hillslope-Link Model (HLM) of the IFC for offline evaluation. Model simulations were compared to discharge observations to assess their performance, and compared to simulations obtained with other hydrologic routing schemes, to determine if the new formulation improves performance of the model.

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

A decision support model to understand route choice decisions and siting of facilities in emergency evacuation.

DOT National Transportation Integrated Search

2013-10-01

In this research, we present the results of a behavior model to capture different routing strategies executed by evacuees : during hurricane evacuation by using a randomparameter logitbased modeling approach. To the best of our knowledge, : thi...

HEATPLOT: a temperature distribution plotting program for heating

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

Elrod, D.C.; Turner, W.D.

1977-07-01

HEATPLOT is a temperature distribution plotting program that may be used with HEATING5, a generalized heat conduction code. HEATPLOT is capable of drawing temperature contours (isotherms), temperature-time profiles, and temperature-distance profiles from the current HEATING5 temperature distribution or from temperature changes relative to the initial temperature distribution. Contour plots may be made for two- or three-dimensional models. Temperature-time profiles and temperature-distance profiles may be made for one-, two-, and three-dimensional models. HEATPLOT is an IBM 360/370 computer code which uses the DISSPLA plotting package. Plots may be created on the CALCOMP pen-and-ink, and CALCOMP cathode ray tube (CRT), or themore » EAI pen-and-ink plotters. Printer plots may be produced or a compressed data set that may be routed to any of the available plotters may be made.« less

Dense Suspension Splash

NASA Astrophysics Data System (ADS)

Zhang, Wendy; Dodge, Kevin M.; Peters, Ivo R.; Ellowitz, Jake; Klein Schaarsberg, Martin H.; Jaeger, Heinrich M.

2014-03-01

Upon impact onto a solid surface at several meters-per-second, a dense suspension plug splashes by ejecting liquid-coated particles. We study the mechanism for splash formation using experiments and a numerical model. In the model, the dense suspension is idealized as a collection of cohesionless, rigid grains with finite surface roughness. The grains also experience lubrication drag as they approach, collide inelastically and rebound away from each other. Simulations using this model reproduce the measured momentum distribution of ejected particles. They also provide direct evidence supporting the conclusion from earlier experiments that inelastic collisions, rather than viscous drag, dominate when the suspension contains macroscopic particles immersed in a low-viscosity solvent such as water. Finally, the simulations reveal two distinct routes for splash formation: a particle can be ejected by a single high momentum-change collision. More surprisingly, a succession of small momentum-change collisions can accumulate to eject a particle outwards. Supported by NSF through its MRSEC program (DMR-0820054) and fluid dynamics program (CBET-1336489).

School-based travel : a mobility assessment

DOT National Transportation Integrated Search

2011-02-01

This project contributes to developing a technical infrastructure to support the Safe Routes to School (SRTS) Program, : specifically to monitor its growth and to evaluate its effectiveness. Since its inception in 2005, the SRTS program : mandated by...

New optimization model for routing and spectrum assignment with nodes insecurity

NASA Astrophysics Data System (ADS)

Xuan, Hejun; Wang, Yuping; Xu, Zhanqi; Hao, Shanshan; Wang, Xiaoli

2017-04-01

By adopting the orthogonal frequency division multiplexing technology, elastic optical networks can provide the flexible and variable bandwidth allocation to each connection request and get higher spectrum utilization. The routing and spectrum assignment problem in elastic optical network is a well-known NP-hard problem. In addition, information security has received worldwide attention. We combine these two problems to investigate the routing and spectrum assignment problem with the guaranteed security in elastic optical network, and establish a new optimization model to minimize the maximum index of the used frequency slots, which is used to determine an optimal routing and spectrum assignment schemes. To solve the model effectively, a hybrid genetic algorithm framework integrating a heuristic algorithm into a genetic algorithm is proposed. The heuristic algorithm is first used to sort the connection requests and then the genetic algorithm is designed to look for an optimal routing and spectrum assignment scheme. In the genetic algorithm, tailor-made crossover, mutation and local search operators are designed. Moreover, simulation experiments are conducted with three heuristic strategies, and the experimental results indicate that the effectiveness of the proposed model and algorithm framework.

Subtypes of Developmental Dyslexia: Testing the Predictions of the Dual-Route and Connectionist Frameworks

ERIC Educational Resources Information Center

Peterson, Robin L.; Pennington, Bruce F.; Olson, Richard K.

2013-01-01

We investigated the phonological and surface subtypes of developmental dyslexia in light of competing predictions made by two computational models of single word reading, the Dual-Route Cascaded Model (DRC; Coltheart, Rastle, Perry, Langdon, & Ziegler, 2001) and Harm and Seidenberg's connectionist model (HS model; Harm & Seidenberg, 1999). The…

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

NASA Astrophysics Data System (ADS)

Nagatani, Takashi; Naito, Yuichi

2011-11-01

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

New Routes To Transfer. The Advisor. November 2001

ERIC Educational Resources Information Center

British Columbia Council on Admissions and Transfer, 2001

2001-01-01

The Advisor provides important information or "system alerts," in user-friendly format and language, on issues and changes affecting admissions and transfer. This document outlines new transfer possibilities in academic arts and science programs, and business diploma programs -- the two largest programs offered by the colleges,…

Teacher Education Accreditation Council Brochure

ERIC Educational Resources Information Center

Teacher Education Accreditation Council, 2009

2009-01-01

The Teacher Education Accreditation Council (TEAC), founded in 1997, is dedicated to improving academic degree programs for professional educators--those who teach and lead in schools, pre-K through grade 12. TEAC accredits undergraduate and graduate programs, including alternate route programs, based on (1) the evidence they have that they…

Modeling an enhanced ridesharing system with meet points and time windows

PubMed Central

Li, Xin; Hu, Sangen; Deng, Kai

2018-01-01

With the rising of e-hailing services in urban areas, ride sharing is becoming a common mode of transportation. This paper presents a mathematical model to design an enhanced ridesharing system with meet points and users’ preferable time windows. The introduction of meet points allows ridesharing operators to trade off the benefits of saving en-route delays and the cost of additional walking for some passengers to be collectively picked up or dropped off. This extension to the traditional door-to-door ridesharing problem brings more operation flexibility in urban areas (where potential requests may be densely distributed in neighborhood), and thus could achieve better system performance in terms of reducing the total travel time and increasing the served passengers. We design and implement a Tabu-based meta-heuristic algorithm to solve the proposed mixed integer linear program (MILP). To evaluate the validation and effectiveness of the proposed model and solution algorithm, several scenarios are designed and also resolved to optimality by CPLEX. Results demonstrate that (i) detailed route plan associated with passenger assignment to meet points can be obtained with en-route delay savings; (ii) as compared to CPLEX, the meta-heuristic algorithm bears the advantage of higher computation efficiency and produces good quality solutions with 8%~15% difference from the global optima; and (iii) introducing meet points to ridesharing system saves the total travel time by 2.7%-3.8% for small-scale ridesharing systems. More benefits are expected for ridesharing systems with large size of fleet. This study provides a new tool to efficiently operate the ridesharing system, particularly when the ride sharing vehicles are in short supply during peak hours. Traffic congestion mitigation will also be expected. PMID:29715302

Siting and Routing Assessment for Solid Waste Management Under Uncertainty Using the Grey Mini-Max Regret Criterion

NASA Astrophysics Data System (ADS)

Chang, Ni-Bin; Davila, Eric

2006-10-01

Solid waste management (SWM) is at the forefront of environmental concerns in the Lower Rio Grande Valley (LRGV), South Texas. The complexity in SWM drives area decision makers to look for innovative and forward-looking solutions to address various waste management options. In decision analysis, it is not uncommon for decision makers to go by an option that may minimize the maximum regret when some determinant factors are vague, ambiguous, or unclear. This article presents an innovative optimization model using the grey mini-max regret (GMMR) integer programming algorithm to outline an optimal regional coordination of solid waste routing and possible landfill/incinerator construction under an uncertain environment. The LRGV is an ideal location to apply the GMMR model for SWM planning because of its constant urban expansion, dwindling landfill space, and insufficient data availability signifying the planning uncertainty combined with vagueness in decision-making. The results give local decision makers hedged sets of options that consider various forms of systematic and event-based uncertainty. By extending the dimension of decision-making, this may lead to identifying a variety of beneficial solutions with efficient waste routing and facility siting for the time frame of 2005 through 2010 in LRGV. The results show the ability of the GMMR model to open insightful scenario planning that can handle situational and data-driven uncertainty in a way that was previously unavailable. Research findings also indicate that the large capital investment of incineration facilities makes such an option less competitive among municipal options for landfills. It is evident that the investment from a municipal standpoint is out of the question, but possible public-private partnerships may alleviate this obstacle.

Methanol Synthesis from CO2 Hydrogenation over a Pd4/In2O3 Model Catalyst: A Combined DFT and Kinetic Study

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

Ye, Jingyun; Liu, Changjun; Mei, Donghai

2014-08-01

Methanol synthesis from CO2 hydrogenation on Pd4/In2O3 has been investigated using density functional theory (DFT) and microkinetic modeling. In this study, three possible routes in the reaction network of CO2 + H2 → CH3OH + H2O have been examined. Our DFT results show that the HCOO route competes with the RWGS route whereas a high activation barrier kinetically blocks the HCOOH route. DFT results also suggest that H2COO* + H* ↔ H2CO* +OH* and cis-COOH* + H* ↔CO* + H2O* are the rate limiting steps in the HCOO route and the RWGS route, respectively. Microkinetic modeling results demonstrate that themore » HCOO route is the dominant reaction route for methanol synthesis from CO2 hydrogenation. We found that the activation of H adatom on the small Pd cluster and the presence of H2O on the In2O3 substrate play important roles in promoting the methanol synthesis. The hydroxyl adsorbed at the interface of Pd4/In2O3 induces the transformation of the supported Pd4 cluster from a butterfly structure into a tetrahedron structure. This important structure change not only indicates the dynamical nature of the supported nanoparticle catalyst structure during the reaction but also shifts the final hydrogenation step from H2COH to CH3O.« less

An agenda-based routing protocol in delay tolerant mobile sensor networks.

PubMed

Wang, Xiao-Min; Zhu, Jin-Qi; Liu, Ming; Gong, Hai-Gang

2010-01-01

Routing in delay tolerant mobile sensor networks (DTMSNs) is challenging due to the networks' intermittent connectivity. Most existing routing protocols for DTMSNs use simplistic random mobility models for algorithm design and performance evaluation. In the real world, however, due to the unique characteristics of human mobility, currently existing random mobility models may not work well in environments where mobile sensor units are carried (such as DTMSNs). Taking a person's social activities into consideration, in this paper, we seek to improve DTMSN routing in terms of social structure and propose an agenda based routing protocol (ARP). In ARP, humans are classified based on their agendas and data transmission is made according to sensor nodes' transmission rankings. The effectiveness of ARP is demonstrated through comprehensive simulation studies.

Coordinated Platoon Routing in a Metropolitan Network

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

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

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

Selfish Routing

DTIC Science & Technology

2002-05-01

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

TEAC's Accreditation Process at a Glance, 2009-2011

ERIC Educational Resources Information Center

Teacher Education Accreditation Council, 2011

2011-01-01

The Teacher Education Accreditation Council (TEAC), founded in 1997, is dedicated to improving academic degree programs for professional educators--those who teach and lead in schools, pre-K through grade 12. TEAC accredits undergraduate and graduate programs, including alternate route programs, based on (1) the evidence they have that they…

78 FR 47487 - Notice of Proposed Buy America Waiver

Federal Register 2010, 2011, 2012, 2013, 2014

2013-08-05

... (NFRMPO). NFRMPO is in the process of procuring vehicles for its vanpool program, ``VanGo.'' In accordance... Organization (NFRMPO). NFRMPO operates a vanpool (``VanGo'') program, which has 75 vans with routes connecting, among others, Fort Collins, Loveland, Greeley, Denver, and Boulder, Colorado. The VanGo program carries...

Evaluating the Effectiveness of Traditional and Alternative Principal Preparation Programs

ERIC Educational Resources Information Center

Pannell, Summer; Peltier-Glaze, Bernnell M.; Haynes, Ingrid; Davis, Delilah; Skelton, Carrie

2015-01-01

This study sought to determine the effectiveness on increasing student achievement of principals trained in a traditional principal preparation program and those trained in an alternate route principal preparation program within the same Mississippi university. Sixty-six Mississippi principals and assistant principals participated in the study. Of…

Cost-effectiveness of an influenza vaccination program offering intramuscular and intradermal vaccines versus intramuscular vaccine alone for elderly.

PubMed

Leung, Man-Kit; You, Joyce H S

2016-05-11

Intradermal (ID) injection is an alternative route for influenza vaccine administration in elderly with potential improvement of vaccine coverage. This study aimed to investigate the cost-effectiveness of an influenza vaccination program offering ID vaccine to elderly who had declined intramuscular (IM) vaccine from the perspective of Hong Kong public healthcare provider. A decision analytic model was used to simulate outcomes of two programs: IM vaccine alone (IM program), and IM or ID vaccine (IM/ID program) in a hypothetic cohort of elderly aged 65 years. Outcome measures included influenza-related direct medical cost, infection rate, mortality rate, quality-adjusted life years (QALYs) loss, and incremental cost per QALY saved (ICER). Model inputs were derived from literature. Sensitivity analyses evaluated the impact of uncertainty of model variables. In base-case analysis, the IM/ID program was more costly (USD52.82 versus USD47.59 per individual to whom vaccine was offered) with lower influenza infection rate (8.71% versus 9.65%), mortality rate (0.021% versus 0.024%) and QALYs loss (0.00336 versus 0.00372) than the IM program. ICER of IM/ID program was USD14,528 per QALY saved. One-way sensitivity analysis found ICER of IM/ID program to exceed willingness-to-pay threshold (USD39,933) when probability of influenza infection in unvaccinated elderly decreased from 10.6% to 5.4%. In 10,000 Monte Carlo simulations of elderly populations of Hong Kong, the IM/ID program was the preferred option in 94.7% of time. An influenza vaccination program offering ID vaccine to elderly who had declined IM vaccine appears to be a highly cost-effective option. Copyright © 2016 Elsevier Ltd. All rights reserved.

Robustness of airline route networks

NASA Astrophysics Data System (ADS)

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

2016-03-01

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

Expression of HLA Class II Molecules in Humanized NOD.Rag1KO.IL2RgcKO Mice is Critical for Development and Function of Human T and B Cells

DTIC Science & Technology

2011-05-17

HSC-infused DRAG and control mice were immunized with 1 flocculation unit of TT vaccine ( Sanofi Pasteur) by the intramuscular route, and the titers... Vaccine Program, Naval Medical Research Center/Walter Reed Army Institute of Research, Silver Spring, Maryland, United States of America, 2 Department...human vaccines prior to clinical trials. However, current humanized mouse models show sub-optimal human T cell reconstitution and limited ability to

Reflections on modern macroeconomics: Can we travel along a safer road?

NASA Astrophysics Data System (ADS)

Gaffeo, E.; Catalano, M.; Clementi, F.; Delli Gatti, D.; Gallegati, M.; Russo, A.

2007-08-01

In this paper we sketch some reflections on the pitfalls and inconsistencies of the research program-currently dominant among the profession-aimed at providing microfoundations to macroeconomics along a Walrasian perspective. We argue that such a methodological approach constitutes an unsatisfactory answer to a well-posed research question, and that alternative promising routes have been long mapped out but only recently explored. In particular, we discuss a recent agent-based, truly non-Walrasian macroeconomic model, and we use it to envisage new challenges for future research.

Seismic hazard assessment of Oregon highway truck routes.

DOT National Transportation Integrated Search

2012-06-01

This research project developed a seismic risk assessment model along the major truck routes in Oregon. The study had adopted federally : developed software tools called Risk for Earthquake Damage to Roadway Systems (REDARS2) and HAZUS-MH. The model ...

Initial Process and Expected Outcomes for Preliminary Identification of Routes to Yucca Mountain, Nevada

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

Thrower, A.; Best, R.; Finewood, L.

2008-07-01

The Department of Energy's (DOE's) Office of Civilian Radioactive Waste Management (OCRWM) is responsible for developing and implementing a safe, secure and efficient transportation system to ship spent nuclear fuel (SNF) and high-level radioactive waste (HLW) from commercial and DOE sites to the proposed Yucca Mountain repository. The Office of Logistics Management (OLM) within OCRWM has begun to work with stakeholders to identify preliminary national suites of highway and rail routes that could be used for future shipments OLM is striving to develop a planning-basis set of routes that will support long-lead time logistical analyses (i.e., five or more yearsmore » before shipment). The results will represent a starting point for discussions between DOE and corridor jurisdictions, and for shipping arrangements between DOE and carriers. This fulfills a recommendation of the National Academy of Sciences report on SNF and HLW transportation that 'DOE should identify and make public its suite of preferred highway and rail routes for transporting spent fuel and high level waste to a federal repository as soon as practicable to support State, Tribal and local planning, especially for emergency responder preparedness'. OLM encourages and supports participation of program stakeholders in a process to identify suites of national routes. The principal objective is to identify preliminary suites of national routes that reflect responsible consideration of the interests of a broad cross-section of stakeholders. This will facilitate transportation planning activities to help meet program goals, including providing an advanced planning framework for State and Tribal authorities; supporting a pilot program for providing funding under Section 180(c) of the Nuclear Waste Policy Act; allowing sufficient time for security and operational reviews in advance of shipments to Yucca Mountain; and supporting utility planning and readiness for transportation operations. Concepts for routing and routing criteria have been considered by several state regional groups supported by cooperative agreements with OLM. OCRWM is also working with other Federal agencies, transportation service providers and others involved in the transportation industry to ensure the criteria are consistent with operating practices and regulations. These coordination efforts will ensure the experience, knowledge, and expertise of those involved are considered in the process to identify the preliminary national suites of routes. This paper describes the current process and timeline for preliminary identification and analyses of routes. In conclusion: The path toward developing a safe, secure, and efficient transportation system for shipments of SNF and HLW to Yucca Mountain will require the participation of many interested parties. Real cooperative planning is sometimes challenging, and requires a commitment from all involved parties to act in good faith and to employ their best efforts in developing mutually beneficial solutions. Identifying routes to the proposed repository at Yucca Mountain, and engaging in planning and preparedness activities with affected jurisdictions and other stakeholders, will take time. OCRWM is committed to a cooperative approach that will ultimately enhance safety, security, efficiency and public confidence. (authors)« less

Strongyloides stercoralis-infected dogs as a model for human disseminated strongyloidiasis

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

Aikens, L.M.

1989-01-01

The route of migration of Strongyloides stercoralis third-stage infective larvae was explored in primary and autogenous infections in the dog. Larvae was radiolabeled by one of two means: (1) by culture of the free-living L3 stage in a nutrient medium, deficient in methionine, supplemented with ({sup 75}Se)Selenomethionine, and (2) by feeding of ({sup 75}Se)Selenomethionine-labeled bacteria to microbiverous L1 and L2 stages. Third-stage labeled larvae were then injected into 10-day-old pups either subcutaneously, to study primary migration, or into the distal ileum, to study autogenous migration. At intervals after infection pups were killed and whole body compressed organ autoradiography done onmore » individual tissues to determine organ-specific larval transit sites. Autoradiographic recoveries were analyzed in the context of a series of mathematical models designed to test migratory route hypotheses. Postulated routes of migration for primary infections included (1) the Null Hypothesis or Scramble Route in which larvae migrate to the intestines by any available route, (2) the Classical Pulmonary Route in which larvae migrate sequentially from skin, to blood, to lungs, to the trachea, esophagus and intestines, and (3) the Head Migration Route in which larvae move from caudal to cranial sites within the skin and muscle before entering the intestines. Postulated routes for autoinfective migration reiterated 1 and 2 above. Least squares comparisons, of calculated models to observed autoradiographic distributions, led us to conclude that there was no reason to reject the simplest assumption that larvae move by any available route to the definitive site in both forms of migration. Sampling through tracheostomy sites in 14 pups for larval migrants confirmed this conclusion.« less

Contact Graph Routing

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

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

Blocking and Blending: Different Assembly Models of Cyclodextrin and Sodium Caseinate at the Oil/Water Interface.

PubMed

Xu, Hua-Neng; Liu, Huan-Huan; Zhang, Lianfu

2015-08-25

The stability of cyclodextrin (CD)-based emulsions is attributed to the formation of a solid film of oil-CD complexes at the oil/water interface. However, competitive interactions between CDs and other components at the interface still need to be understood. Here we develop two different routes that allow the incorporation of a model protein (sodium caseinate, SC) into emulsions based on β-CD. One route is the components adsorbed simultaneously from a mixed solution to the oil/water interface (route I), and the other is SC was added to a previously established CD-stabilized interface (route II). The adsorption mechanism of β-CD modified by SC at the oil/water interface is investigated by rheological and optical methods. Strong sensitivity of the rheological behavior to the routes is indicated by both steady-state and small-deformation oscillatory experiments. Possible β-CD/SC interaction models at the interface are proposed. In route I, the protein, due to its higher affinity for the interface, adsorbs strongly at the interface with blocking of the adsorption of β-CD and formation of oil-CD complexes. In route II, the protein penetrates and blends into the preadsorbed layer of oil-CD complexes already formed at the interface. The revelation of interfacial assembly is expected to help better understand CD-based emulsions in natural systems and improve their designs in engineering applications.

Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time

PubMed Central

Avellar, Gustavo S. C.; Pereira, Guilherme A. S.; Pimenta, Luciano C. A.; Iscold, Paulo

2015-01-01

This paper presents a solution for the problem of minimum time coverage of ground areas using a group of unmanned air vehicles (UAVs) equipped with image sensors. The solution is divided into two parts: (i) the task modeling as a graph whose vertices are geographic coordinates determined in such a way that a single UAV would cover the area in minimum time; and (ii) the solution of a mixed integer linear programming problem, formulated according to the graph variables defined in the first part, to route the team of UAVs over the area. The main contribution of the proposed methodology, when compared with the traditional vehicle routing problem’s (VRP) solutions, is the fact that our method solves some practical problems only encountered during the execution of the task with actual UAVs. In this line, one of the main contributions of the paper is that the number of UAVs used to cover the area is automatically selected by solving the optimization problem. The number of UAVs is influenced by the vehicles’ maximum flight time and by the setup time, which is the time needed to prepare and launch a UAV. To illustrate the methodology, the paper presents experimental results obtained with two hand-launched, fixed-wing UAVs. PMID:26540055

Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time.

PubMed

Avellar, Gustavo S C; Pereira, Guilherme A S; Pimenta, Luciano C A; Iscold, Paulo

2015-11-02

This paper presents a solution for the problem of minimum time coverage of ground areas using a group of unmanned air vehicles (UAVs) equipped with image sensors. The solution is divided into two parts: (i) the task modeling as a graph whose vertices are geographic coordinates determined in such a way that a single UAV would cover the area in minimum time; and (ii) the solution of a mixed integer linear programming problem, formulated according to the graph variables defined in the first part, to route the team of UAVs over the area. The main contribution of the proposed methodology, when compared with the traditional vehicle routing problem's (VRP) solutions, is the fact that our method solves some practical problems only encountered during the execution of the task with actual UAVs. In this line, one of the main contributions of the paper is that the number of UAVs used to cover the area is automatically selected by solving the optimization problem. The number of UAVs is influenced by the vehicles' maximum flight time and by the setup time, which is the time needed to prepare and launch a UAV. To illustrate the methodology, the paper presents experimental results obtained with two hand-launched, fixed-wing UAVs.

An Alternative Avenue to Teacher Certification: A Cost Analysis of the Pathways to Teaching Careers Program.

ERIC Educational Resources Information Center

Rice, Jennifer King; Brent, Brian O.

2002-01-01

Analyzes cost effectiveness of the Pathways to Teaching Careers, a program that supports an alternative route to university-based teacher certification primarily for noncertified teachers, paraprofessionals, and Peace Corps volunteers. (PKP)

A theoretical study on reaction mechanisms and kinetics of thiophene hydrodesulfurization over MoS 2 catalysts

DOE PAGES

Jin, Qiu; Chen, Biaohua; Ren, Zhibo; ...

2018-02-10

In the present study, thiophene hydrodesulphurization (HDS) over the Mo-edge, the S-edge, and the Mo-S connection edge of MoS 2 catalyst with 50% sulfur coverage was studied using first-principles based microkinetic modeling. Two parallel HDS routes, i.e., direct desulfurization (DDS) and hydrogenation (HYD) were taken into account. It has been found that the major reaction route of thiophene HDS on the Mo- and the Mo-S edges is temperature dependent. In the low temperature range of 500–600 K, the HYD route is dominant, leading to the C 4H 8 formation. As the temperature increases, the DDS route becomes competitive with themore » HYD route. At the temperature above 650 K, the DDS route will be the dominant HDS reaction route on the Mo- and the Mo-S edges. The DDS route leading to the formation of C 4H 6 is the major thiophene HDS reaction route on the S-edge in the entire temperature range of 500–750 K. The microkinetic modeling results show the overall HDS activity on the S-edge is lower than it on the Mo- and the Mo-S edges. The Mo-S edge also provides a preferential reaction pathway, which facilitates 2-hydrothiophene migration from the Mo-edge to the S-edge, followed by remaining elementary steps with lower activation barriers in the DDS route.« less

A theoretical study on reaction mechanisms and kinetics of thiophene hydrodesulfurization over MoS 2 catalysts

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

Jin, Qiu; Chen, Biaohua; Ren, Zhibo

In the present study, thiophene hydrodesulphurization (HDS) over the Mo-edge, the S-edge, and the Mo-S connection edge of MoS 2 catalyst with 50% sulfur coverage was studied using first-principles based microkinetic modeling. Two parallel HDS routes, i.e., direct desulfurization (DDS) and hydrogenation (HYD) were taken into account. It has been found that the major reaction route of thiophene HDS on the Mo- and the Mo-S edges is temperature dependent. In the low temperature range of 500–600 K, the HYD route is dominant, leading to the C 4H 8 formation. As the temperature increases, the DDS route becomes competitive with themore » HYD route. At the temperature above 650 K, the DDS route will be the dominant HDS reaction route on the Mo- and the Mo-S edges. The DDS route leading to the formation of C 4H 6 is the major thiophene HDS reaction route on the S-edge in the entire temperature range of 500–750 K. The microkinetic modeling results show the overall HDS activity on the S-edge is lower than it on the Mo- and the Mo-S edges. The Mo-S edge also provides a preferential reaction pathway, which facilitates 2-hydrothiophene migration from the Mo-edge to the S-edge, followed by remaining elementary steps with lower activation barriers in the DDS route.« less

40 CFR 65.115 - Standards: Closed vent systems and control devices; or emissions routed to a fuel gas system or...

Code of Federal Regulations, 2010 CFR

2010-07-01

... 40 Protection of Environment 15 2010-07-01 2010-07-01 false Standards: Closed vent systems and control devices; or emissions routed to a fuel gas system or process. 65.115 Section 65.115 Protection of Environment ENVIRONMENTAL PROTECTION AGENCY (CONTINUED) AIR PROGRAMS (CONTINUED) CONSOLIDATED FEDERAL AIR RULE Equipment Leaks § 65.115 Standards:...

Route-choice modeling using GPS-based travel surveys.

DOT National Transportation Integrated Search

2013-06-01

The advent of GPS-based travel surveys offers an opportunity to develop empirically-rich route-choice models. However, the GPS traces must first be mapped to the roadway network, map-matching, to identify the network-links actually traversed. For thi...

Properties of Air Traffic Conflicts for Free and Structured Routing

NASA Technical Reports Server (NTRS)

Bilimoria, Karl D.; Lee, Hilda Q.

2001-01-01

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

76 FR 45603 - Agency Information Collection Activities: Comment Request for the North American Amphibian...

Federal Register 2010, 2011, 2012, 2013, 2014

2011-07-29

... Collection Activities: Comment Request for the North American Amphibian Monitoring Program (NAAMP) AGENCY: U... Monitoring Program (NAAMP). As required by the Paperwork Reduction Act (PRA) of 1995, and as part of our... assigned survey routes that are part of the North American Amphibian Monitoring Program. Volunteers use an...

Perspectives and Practices of Graduates of an Urban Teacher Residency Program

ERIC Educational Resources Information Center

Tricarico, Katie M.

2012-01-01

Many traditional university-based and alternative route teacher preparation programs have been developed to prepare new teachers to work in urban, high minority, and high-poverty classrooms. There is little literature that documents the outcomes of these programs designed specifically for urban environments or the practices of teachers who…

75 FR 20878 - Notice of Intent To Prepare a Supplemental Environmental Impact Statement: State Route 374 From...

Federal Register 2010, 2011, 2012, 2013, 2014

2010-04-21

.... FOR FURTHER INFORMATION CONTACT: Mr. Charles J. O'Neill, Planning and Program Management Team Leader.... SUPPLEMENTARY INFORMATION: The FHWA, in cooperation with the Tennessee Department of Transportation, will... apply to this proposed program.) Charles J. O'Neill, Planning and Program Management Team Leader...

Supporting New Science Teachers in Pursuing Socially Just Science Education

ERIC Educational Resources Information Center

Ruggirello, Rachel; Flohr, Linda

2018-01-01

This forum explores contradictions that arose within the partnership between Teach for America (TFA) and a university teacher education program. TFA is an alternate route teacher preparation program that places individuals into K-12 classrooms in low-income school districts after participating in an intense summer training program and provides…

A Single Chip VLSI Implementation of a QPSK/SQPSK Demodulator for a VSAT Receiver Station

NASA Technical Reports Server (NTRS)

Kwatra, S. C.; King, Brent

1995-01-01

This thesis presents a VLSI implementation of a QPSK/SQPSK demodulator. It is designed to be employed in a VSAT earth station that utilizes the FDMA/TDM link. A single chip architecture is used to enable this chip to be easily employed in the VSAT system. This demodulator contains lowpass filters, integrate and dump units, unique word detectors, a timing recovery unit, a phase recovery unit and a down conversion unit. The design stages start with a functional representation of the system by using the C programming language. Then it progresses into a register based representation using the VHDL language. The layout components are designed based on these VHDL models and simulated. Component generators are developed for the adder, multiplier, read-only memory and serial access memory in order to shorten the design time. These sub-components are then block routed to form the main components of the system. The main components are block routed to form the final demodulator.

The importance of thinking beyond the water-supply in cholera epidemics: A historical urban case-study.

PubMed

Phelps, Matthew D; Azman, Andrew S; Lewnard, Joseph A; Antillón, Marina; Simonsen, Lone; Andreasen, Viggo; Jensen, Peter K M; Pitzer, Virginia E

2017-11-01

Planning interventions to respond to cholera epidemics requires an understanding of the major transmission routes. Interrupting short-cycle (household, foodborne) transmission may require different approaches as compared long-cycle (environmentally-mediated/waterborne) transmission. However, differentiating the relative contribution of short- and long-cycle routes has remained difficult, and most cholera outbreak control efforts focus on interrupting long-cycle transmission. Here we use high-resolution epidemiological and municipal infrastructure data from a cholera outbreak in 1853 Copenhagen to explore the relative contribution of short- and long-cycle transmission routes during a major urban epidemic. We fit a spatially explicit time-series meta-population model to 6,552 physician-reported cholera cases from Copenhagen in 1853. We estimated the contribution of long-cycle waterborne transmission between neighborhoods using historical municipal water infrastructure data, fitting the force of infection from hydraulic flow, then comparing model performance. We found the epidemic was characterized by considerable transmission heterogeneity. Some neighborhoods acted as localized transmission hotspots, while other neighborhoods were less affected or important in driving the epidemic. We found little evidence to support long-cycle transmission between hydrologically-connected neighborhoods. Collectively, these findings suggest short-cycle transmission was significant. Spatially targeted cholera interventions, such as reactive vaccination or sanitation/hygiene campaigns in hotspot neighborhoods, would likely have been more effective in this epidemic than control measures aimed at interrupting long-cycle transmission, such as improving municipal water quality. We recommend public health planners consider programs aimed at interrupting short-cycle transmission as essential tools in the cholera control arsenal.

The importance of thinking beyond the water-supply in cholera epidemics: A historical urban case-study

PubMed Central

Azman, Andrew S.; Lewnard, Joseph A.; Antillón, Marina; Simonsen, Lone; Andreasen, Viggo; Jensen, Peter K. M.; Pitzer, Virginia E.

2017-01-01

Background Planning interventions to respond to cholera epidemics requires an understanding of the major transmission routes. Interrupting short-cycle (household, foodborne) transmission may require different approaches as compared long-cycle (environmentally-mediated/waterborne) transmission. However, differentiating the relative contribution of short- and long-cycle routes has remained difficult, and most cholera outbreak control efforts focus on interrupting long-cycle transmission. Here we use high-resolution epidemiological and municipal infrastructure data from a cholera outbreak in 1853 Copenhagen to explore the relative contribution of short- and long-cycle transmission routes during a major urban epidemic. Methodology/Principal findings We fit a spatially explicit time-series meta-population model to 6,552 physician-reported cholera cases from Copenhagen in 1853. We estimated the contribution of long-cycle waterborne transmission between neighborhoods using historical municipal water infrastructure data, fitting the force of infection from hydraulic flow, then comparing model performance. We found the epidemic was characterized by considerable transmission heterogeneity. Some neighborhoods acted as localized transmission hotspots, while other neighborhoods were less affected or important in driving the epidemic. We found little evidence to support long-cycle transmission between hydrologically-connected neighborhoods. Collectively, these findings suggest short-cycle transmission was significant. Conclusions/Significance Spatially targeted cholera interventions, such as reactive vaccination or sanitation/hygiene campaigns in hotspot neighborhoods, would likely have been more effective in this epidemic than control measures aimed at interrupting long-cycle transmission, such as improving municipal water quality. We recommend public health planners consider programs aimed at interrupting short-cycle transmission as essential tools in the cholera control arsenal. PMID:29176791

Overview of en route noise prediction using a integrated noise model

DOT National Transportation Integrated Search

2010-04-20

En route aircraft noise is often ignored in aircraft noise modeling because large amounts of noise attenuation due to long propagation distances between the aircraft and the receivers on the ground, reduced power in cruise flight compared to takeoff ...

Maritime dynamic traffic generator : Volume II. Electronic data processing program.

DOT National Transportation Integrated Search

1975-06-01

The processor program is designed to move 18,000 merchant vessels along standard routes to their destination and keep statistical records of the ports visited, the five degree squares passed through and the occurrence of casualties. This document pre...

Case Study of the Denver Regional Transportation District Eco Pass Program

DOT National Transportation Integrated Search

1993-11-01

This report documents the Denver Regional Transportation District (RTD) Eco Pass Program and evaluates its impacts. The Eco Pass is an annual, unlimited-use photo identification pass covering transportation on all RTD transit routes. Employers in the...

Route Prediction on Tracking Data to Location-Based Services

NASA Astrophysics Data System (ADS)

Petróczi, Attila István; Gáspár-Papanek, Csaba

Wireless networks have become so widespread, it is beneficial to determine the ability of cellular networks for localization. This property enables the development of location-based services, providing useful information. These services can be improved by route prediction under the condition of using simple algorithms, because of the limited capabilities of mobile stations. This study gives alternative solutions for this problem of route prediction based on a specific graph model. Our models provide the opportunity to reach our destinations with less effort.

Transport spatial model for the definition of green routes for city logistics centers

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

Pamučar, Dragan, E-mail: dpamucar@gmail.com; Gigović, Ljubomir, E-mail: gigoviclj@gmail.com; Ćirović, Goran, E-mail: cirovic@sezampro.rs

This paper presents a transport spatial decision support model (TSDSM) for carrying out the optimization of green routes for city logistics centers. The TSDSM model is based on the integration of the multi-criteria method of Weighted Linear Combination (WLC) and the modified Dijkstra algorithm within a geographic information system (GIS). The GIS is used for processing spatial data. The proposed model makes it possible to plan routes for green vehicles and maximize the positive effects on the environment, which can be seen in the reduction of harmful gas emissions and an increase in the air quality in highly populated areas.more » The scheduling of delivery vehicles is given as a problem of optimization in terms of the parameters of: the environment, health, use of space and logistics operating costs. Each of these input parameters was thoroughly examined and broken down in the GIS into criteria which further describe them. The model presented here takes into account the fact that logistics operators have a limited number of environmentally friendly (green) vehicles available. The TSDSM was tested on a network of roads with 127 links for the delivery of goods from the city logistics center to the user. The model supports any number of available environmentally friendly or environmentally unfriendly vehicles consistent with the size of the network and the transportation requirements. - Highlights: • Model for routing light delivery vehicles in urban areas. • Optimization of green routes for city logistics centers. • The proposed model maximizes the positive effects on the environment. • The model was tested on a real network.« less

Near real-time traffic routing

NASA Technical Reports Server (NTRS)

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

2012-01-01

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

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

PubMed

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

2017-03-01

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

I/O routing in a multidimensional torus network

DOEpatents

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

2017-02-07

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

I/O routing in a multidimensional torus network

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

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

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

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

NASA Technical Reports Server (NTRS)

Weir, Donald S.

1988-01-01

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

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds

PubMed Central

Zhang, Dezhi; Wang, Xin; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions. PMID:29466370

Service-Aware Clustering: An Energy-Efficient Model for the Internet-of-Things

PubMed Central

Bagula, Antoine; Abidoye, Ademola Philip; Zodi, Guy-Alain Lusilao

2015-01-01

Current generation wireless sensor routing algorithms and protocols have been designed based on a myopic routing approach, where the motes are assumed to have the same sensing and communication capabilities. Myopic routing is not a natural fit for the IoT, as it may lead to energy imbalance and subsequent short-lived sensor networks, routing the sensor readings over the most service-intensive sensor nodes, while leaving the least active nodes idle. This paper revisits the issue of energy efficiency in sensor networks to propose a clustering model where sensor devices’ service delivery is mapped into an energy awareness model, used to design a clustering algorithm that finds service-aware clustering (SAC) configurations in IoT settings. The performance evaluation reveals the relative energy efficiency of the proposed SAC algorithm compared to related routing algorithms in terms of energy consumption, the sensor nodes’ life span and its traffic engineering efficiency in terms of throughput and delay. These include the well-known low energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C) algorithms, as well as the most recent algorithms, such as DECSA and MOCRN. PMID:26703619

Joint optimization of green vehicle scheduling and routing problem with time-varying speeds.

PubMed

Zhang, Dezhi; Wang, Xin; Li, Shuangyan; Ni, Nan; Zhang, Zhuo

2018-01-01

Based on an analysis of the congestion effect and changes in the speed of vehicle flow during morning and evening peaks in a large- or medium-sized city, the piecewise function is used to capture the rules of the time-varying speed of vehicles, which are very important in modelling their fuel consumption and CO2 emission. A joint optimization model of the green vehicle scheduling and routing problem with time-varying speeds is presented in this study. Extra wages during nonworking periods and soft time-window constraints are considered. A heuristic algorithm based on the adaptive large neighborhood search algorithm is also presented. Finally, a numerical simulation example is provided to illustrate the optimization model and its algorithm. Results show that, (1) the shortest route is not necessarily the route that consumes the least energy, (2) the departure time influences the vehicle fuel consumption and CO2 emissions and the optimal departure time saves on fuel consumption and reduces CO2 emissions by up to 5.4%, and (3) extra driver wages have significant effects on routing and departure time slot decisions.

Service-Aware Clustering: An Energy-Efficient Model for the Internet-of-Things.

PubMed

Bagula, Antoine; Abidoye, Ademola Philip; Zodi, Guy-Alain Lusilao

2015-12-23

Current generation wireless sensor routing algorithms and protocols have been designed based on a myopic routing approach, where the motes are assumed to have the same sensing and communication capabilities. Myopic routing is not a natural fit for the IoT, as it may lead to energy imbalance and subsequent short-lived sensor networks, routing the sensor readings over the most service-intensive sensor nodes, while leaving the least active nodes idle. This paper revisits the issue of energy efficiency in sensor networks to propose a clustering model where sensor devices' service delivery is mapped into an energy awareness model, used to design a clustering algorithm that finds service-aware clustering (SAC) configurations in IoT settings. The performance evaluation reveals the relative energy efficiency of the proposed SAC algorithm compared to related routing algorithms in terms of energy consumption, the sensor nodes' life span and its traffic engineering efficiency in terms of throughput and delay. These include the well-known low energy adaptive clustering hierarchy (LEACH) and LEACH-centralized (LEACH-C) algorithms, as well as the most recent algorithms, such as DECSA and MOCRN.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Airspace Technology Demonstration 3 (ATD-3): Dynamic Weather Routes (DWR) Technology Transfer Document Summary Version 1.0

NASA Technical Reports Server (NTRS)

Sheth, Kapil; Wang, Easter Mayan Chan

2016-01-01

Airspace Technology Demonstration #3 (ATD-3) is part of NASA's Airspace Operations and Safety Program (AOSP) - specifically, its Airspace Technology Demonstrations (ATD) Project. ATD-3 is a multiyear research and development effort which proposes to develop and demonstrate automation technologies and operating concepts that enable air navigation service providers and airspace users to continuously assess weather, winds, traffic, and other information to identify, evaluate, and implement workable opportunities for flight plan route corrections that can result in significant flight time and fuel savings in en route airspace. In order to ensure that the products of this tech-transfer are relevant and useful, NASA has created strong partnerships with the FAA and key industry stakeholders. This summary document and accompanying technology artifacts satisfy the first of three Research Transition Products (RTPs) defined in the Applied Traffic Flow Management (ATFM) Research Transition Team (RTT) Plan. This transfer consists of NASA's legacy Dynamic Weather Routes (DWR) work for efficient routing for en-route weather avoidance. DWR is a ground-based trajectory automation system that continuously and automatically analyzes active airborne aircraft in en route airspace to identify opportunities for simple corrections to flight plan routes that can save significant flying time, at least five minutes wind-corrected, while avoiding weather and considering traffic conflicts, airspace sector congestion, special use airspace, and FAA routing restrictions. The key benefit of the DWR concept is to let automation continuously and automatically analyze active flights to find those where simple route corrections can save significant time and fuel. Operators are busy during weather events. It is more effective to let automation find the opportunities for high-value route corrections.

Assessing the risk of ships striking large whales in marine spatial planning.

PubMed

Redfern, J V; McKenna, M F; Moore, T J; Calambokidis, J; Deangelis, M L; Becker, E A; Barlow, J; Forney, K A; Fiedler, P C; Chivers, S J

2013-04-01

Marine spatial planning provides a comprehensive framework for managing multiple uses of the marine environment and has the potential to minimize environmental impacts and reduce conflicts among users. Spatially explicit assessments of the risks to key marine species from human activities are a requirement of marine spatial planning. We assessed the risk of ships striking humpback (Megaptera novaeangliae), blue (Balaenoptera musculus), and fin (Balaenoptera physalus) whales in alternative shipping routes derived from patterns of shipping traffic off Southern California (U.S.A.). Specifically, we developed whale-habitat models and assumed ship-strike risk for the alternative shipping routes was proportional to the number of whales predicted by the models to occur within each route. This definition of risk assumes all ships travel within a single route. We also calculated risk assuming ships travel via multiple routes. We estimated the potential for conflict between shipping and other uses (military training and fishing) due to overlap with the routes. We also estimated the overlap between shipping routes and protected areas. The route with the lowest risk for humpback whales had the highest risk for fin whales and vice versa. Risk to both species may be ameliorated by creating a new route south of the northern Channel Islands and spreading traffic between this new route and the existing route in the Santa Barbara Channel. Creating a longer route may reduce the overlap between shipping and other uses by concentrating shipping traffic. Blue whales are distributed more evenly across our study area than humpback and fin whales; thus, risk could not be ameliorated by concentrating shipping traffic in any of the routes we considered. Reducing ship-strike risk for blue whales may be necessary because our estimate of the potential number of strikes suggests that they are likely to exceed allowable levels of anthropogenic impacts established under U.S. laws. Conservation Biology © 2013 Society for Conservation Biology No claim to original US government works.

Packet Traffic Dynamics Near Onset of Congestion in Data Communication Network Model

NASA Astrophysics Data System (ADS)

Lawniczak, A. T.; Tang, X.

2006-05-01

The dominant technology of data communication networks is the Packet Switching Network (PSN). It is a complex technology organized as various hierarchical layers according to the International Standard Organization (ISO) Open Systems Interconnect (OSI) Reference Model. The Network Layer of the ISO OSI Reference Model is responsible for delivering packets from their sources to their destinations and for dealing with congestion if it arises in a network. Thus, we focus on this layer and present an abstraction of the Network Layer of the ISO OSI Reference Model. Using this abstraction we investigate how onset of traffic congestion is affected for various routing algorithms by changes in network connection topology. We study how aggregate measures of network performance depend on network connection topology and routing. We explore packets traffic spatio-temporal dynamics near the phase transition point from free flow to congestion for various network connection topologies and routing algorithms. We consider static and adaptive routings. We present selected simulation results.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections.

PubMed

Quwaider, Muhannad; Taghizadeh, Mahmoud; Biswas, Subir

2011-01-01

This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks ( WBAN ) with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay.

Modeling On-Body DTN Packet Routing Delay in the Presence of Postural Disconnections

PubMed Central

Quwaider, Muhannad; Taghizadeh, Mahmoud; Biswas, Subir

2014-01-01

This paper presents a stochastic modeling framework for store-and-forward packet routing in Wireless Body Area Networks (WBAN) with postural partitioning. A prototype WBANs has been constructed for experimentally characterizing and capturing on-body topology disconnections in the presence of ultrashort range radio links, unpredictable RF attenuation, and human postural mobility. Delay modeling techniques for evaluating single-copy on-body DTN routing protocols are then developed. End-to-end routing delay for a series of protocols including opportunistic, randomized, and two other mechanisms that capture multiscale topological localities in human postural movements have been evaluated. Performance of the analyzed protocols are then evaluated experimentally and via simulation to compare with the results obtained from the developed model. Finally, a mechanism for evaluating the topological importance of individual on-body sensor nodes is developed. It is shown that such information can be used for selectively reducing the on-body sensor-count without substantially sacrificing the packet delivery delay. PMID:25530749

Annual Report to Congress - Fiscal Year 2002, from the Strategic Environmental Research and Development Program

DTIC Science & Technology

2003-03-01

and Catabolic Enzymes Involved in Phytoremediation of the Nitro-Substituted Explosives TNT, RDX, and HMX . . . . . A-48 CU-1318 – Engineering Transgenic...1317 Identification of Metabolic Routes and Catabolic Enzymes Involved in Phytoremediation of the Nitro-Substituted Explosives TNT, RDX, and HMX...A A-48 PROJECT SUMMARY PROJECT TITLE & ID: Identification of Metabolic Routes and Catabolic Enzymes Involved in Phytoremediation of the Nitro

The critical role of the routing scheme in simulating peak river discharge in global hydrological models

NASA Astrophysics Data System (ADS)

Zhao, F.; Veldkamp, T.; Frieler, K.; Schewe, J.; Ostberg, S.; Willner, S. N.; Schauberger, B.; Gosling, S.; Mueller Schmied, H.; Portmann, F. T.; Leng, G.; Huang, M.; Liu, X.; Tang, Q.; Hanasaki, N.; Biemans, H.; Gerten, D.; Satoh, Y.; Pokhrel, Y. N.; Stacke, T.; Ciais, P.; Chang, J.; Ducharne, A.; Guimberteau, M.; Wada, Y.; Kim, H.; Yamazaki, D.

2017-12-01

Global hydrological models (GHMs) have been applied to assess global flood hazards, but their capacity to capture the timing and amplitude of peak river discharge—which is crucial in flood simulations—has traditionally not been the focus of examination. Here we evaluate to what degree the choice of river routing scheme affects simulations of peak discharge and may help to provide better agreement with observations. To this end we use runoff and discharge simulations of nine GHMs forced by observational climate data (1971-2010) within the ISIMIP2a project. The runoff simulations were used as input for the global river routing model CaMa-Flood. The simulated daily discharge was compared to the discharge generated by each GHM using its native river routing scheme. For each GHM both versions of simulated discharge were compared to monthly and daily discharge observations from 1701 GRDC stations as a benchmark. CaMa-Flood routing shows a general reduction of peak river discharge and a delay of about two to three weeks in its occurrence, likely induced by the buffering capacity of floodplain reservoirs. For a majority of river basins, discharge produced by CaMa-Flood resulted in a better agreement with observations. In particular, maximum daily discharge was adjusted, with a multi-model averaged reduction in bias over about 2/3 of the analysed basin area. The increase in agreement was obtained in both managed and near-natural basins. Overall, this study demonstrates the importance of routing scheme choice in peak discharge simulation, where CaMa-Flood routing accounts for floodplain storage and backwater effects that are not represented in most GHMs. Our study provides important hints that an explicit parameterisation of these processes may be essential in future impact studies.

Predicting the Operational Acceptability of Route Advisories

NASA Technical Reports Server (NTRS)

Evans, Antony; Lee, Paul

2017-01-01

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

Trade-off Assessment of Simplified Routing Models for Short-Term Hydropower Reservoir Optimization

NASA Astrophysics Data System (ADS)

Issao Kuwajima, Julio; Schwanenberg, Dirk; Alvardo Montero, Rodolfo; Mainardi Fan, Fernando; Assis dos Reis, Alberto

2014-05-01

Short-term reservoir optimization, also referred to as model predictive control, integrates model-based forecasts and optimization algorithms to meet multiple management objectives such as water supply, navigation, hydroelectricity generation, environmental obligations and flood protection. It is a valuable decision support tool to handle water-stress conditions or flooding events, and supports decision makers to minimize their impact. If the reservoir management includes downstream control, for example for mitigation flood damages in inundation areas downstream of the operated dam, the flow routing between the dam and the downstream inundation area is of major importance. The unsteady open channel flow in river reaches can be described by the one-dimensional Saint-Venant equations. However, owing to the mathematical complexity of those equations, some simplifications may be required to speed up the computation within the optimization procedure. Another strategy to limit the model runtime is a schematization on a course computational grid. In particular the last measure can introduce significant numerical diffusion into the solution. This is a major drawback, in particular if the reservoir release has steep gradients which we often find in hydropower reservoirs. In this work, four different routing models are assessed concerning their implementation in the predictive control of the Três Marias Reservoir located at the Upper River São Francisco in Brazil: i) a fully dynamic model using the software package SOBEK; ii) a semi-distributed rainfall-runoff model with Muskingum-Cunge routing for the flow reaches of interest, the MGB-IPH (Modelo Hidrológico de Grandes Bacias - Instituto de Pesquisas Hidráulicas); iii) a reservoir routing approach; and iv) a diffusive wave model. The last two models are implemented in the RTC-Tool toolbox. The overall model accuracy between the simplified models in RTC-Tools (iii, iv) and the more sophisticated SOBEK model (i) are comparable, and a lower performance was assessed for the MGB model (ii). Whereas the SOBEK model is able to propagate sharp discharge gradient downstream, the diffusive wave model is damping these gradients significantly due to the course spatial schematization. In the reservoir routing model, which is also schematized on a course grid, we counteract this drawback by modeling parts of the river reach by advection. This results in an excellent ratio between model accuracy / robustness and computational effort making it the approach of choice from the predictive control perspective.

Tracing regulatory routes in metabolism using generalised supply-demand analysis.

PubMed

Christensen, Carl D; Hofmeyr, Jan-Hendrik S; Rohwer, Johann M

2015-12-03

Generalised supply-demand analysis is a conceptual framework that views metabolism as a molecular economy. Metabolic pathways are partitioned into so-called supply and demand blocks that produce and consume a particular intermediate metabolite. By studying the response of these reaction blocks to perturbations in the concentration of the linking metabolite, different regulatory routes of interaction between the metabolite and its supply and demand blocks can be identified and their contribution quantified. These responses are mediated not only through direct substrate/product interactions, but also through allosteric effects. Here we subject previously published kinetic models of pyruvate metabolism in Lactococcus lactis and aspartate-derived amino acid synthesis in Arabidopsis thaliana to generalised supply-demand analysis. Multiple routes of regulation are brought about by different mechanisms in each model, leading to behavioural and regulatory patterns that are generally difficult to predict from simple inspection of the reaction networks depicting the models. In the pyruvate model the moiety-conserved cycles of ATP/ADP and NADH/NAD(+) allow otherwise independent metabolic branches to communicate. This causes the flux of one ATP-producing reaction block to increase in response to an increasing ATP/ADP ratio, while an NADH-consuming block flux decreases in response to an increasing NADH/NAD(+) ratio for certain ratio value ranges. In the aspartate model, aspartate semialdehyde can inhibit its supply block directly or by increasing the concentration of two amino acids (Lys and Thr) that occur as intermediates in demand blocks and act as allosteric inhibitors of isoenzymes in the supply block. These different routes of interaction from aspartate semialdehyde are each seen to contribute differently to the regulation of the aspartate semialdehyde supply block. Indirect routes of regulation between a metabolic intermediate and a reaction block that either produces or consumes this intermediate can play a much larger regulatory role than routes mediated through direct interactions. These indirect routes of regulation can also result in counter-intuitive metabolic behaviour. Performing generalised supply-demand analysis on two previously published models demonstrated the utility of this method as an entry point in the analysis of metabolic behaviour and the potential for obtaining novel results from previously analysed models by using new approaches.

Regionalization Study of Satellite based Hydrological Model (SHM) in Hydrologically Homogeneous River Basins of India

NASA Astrophysics Data System (ADS)

Kumari, Babita; Paul, Pranesh Kumar; Singh, Rajendra; Mishra, Ashok; Gupta, Praveen Kumar; Singh, Raghvendra P.

2017-04-01

A new semi-distributed conceptual hydrological model, namely Satellite based Hydrological Model (SHM), has been developed under 'PRACRITI-2' program of Space Application Centre (SAC), Ahmedabad for sustainable water resources management of India by using data from Indian Remote Sensing satellites. Entire India is divided into 5km x 5km grid cells and properties at the center of the cells are assumed to represent the property of the cells. SHM contains five modules namely surface water, forest, snow, groundwater and routing. Two empirical equations (SCS-CN and Hargreaves) and water balance method have been used in the surface water module; the forest module is based on the calculations of water balancing & dynamics of subsurface. 2-D Boussinesq equation is used for groundwater modelling which is solved using implicit finite-difference. The routing module follows a distributed routing approach which requires flow path and network with the key point of travel time estimation. The aim of this study is to evaluate the performance of SHM using regionalization technique which also checks the usefulness of a model in data scarce condition or for ungauged basins. However, homogeneity analysis is pre-requisite to regionalization. Similarity index (Φ) and hierarchical agglomerative cluster analysis are adopted to test the homogeneity in terms of physical attributes of three basins namely Brahmani (39,033 km km^2)), Baitarani (10,982 km km^2)) and Kangsabati (9,660 km km^2)) with respect to Subarnarekha (29,196 km km^2)) basin. The results of both homogeneity analysis show that Brahmani basin is the most homogeneous with respect to Subarnarekha river basin in terms of physical characteristics (land use land cover classes, soiltype and elevation). The calibration and validation of model parameters of Brahmani basin is in progress which are to be transferred into the SHM set up of Subarnarekha basin and results are to be compared with the results of calibrated and validated parameter set up of SHM of Subarnarekha basin to test the applicability of SHM in hydrologically homogeneous regions of India. Keywords: SHM, regionalization, homogeneity, donor catchment, similarity index, cluster analysis

Enhancing the Safety of Children in Foster Care and Family Support Programs: Automated Critical Incident Reporting

ERIC Educational Resources Information Center

Brenner, Eliot; Freundlich, Madelyn

2006-01-01

The Adoption and Safe Families Act of 1997 has made child safety an explicit focus in child welfare. The authors describe an automated critical incident reporting program designed for use in foster care and family-support programs. The program, which is based in Lotus Notes and uses e-mail to route incident reports from direct service staff to…

Entanglement-Gradient Routing for Quantum Networks.

PubMed

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

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

Familiar route loyalty implies visual pilotage in the homing pigeon

PubMed Central

Biro, Dora; Meade, Jessica; Guilford, Tim

2004-01-01

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

Molecular emission in chemically active protostellar outflows

NASA Astrophysics Data System (ADS)

Lefloch, B.

2011-12-01

Protostellar outflows play an important role in the dynamical and chemical evolution of cloud through shocks. The Herschel Space Observatory (HSO) brings new insight both on the molecular content and the physical conditions in protostellar shocks through high spectral and angular resolution studies of the emission of major gas cooling agents and hydrides. The Herschel/CHESS key-program is carrying out an in depth study of the prototypical shock region L1157-B1. Analysis of the line profiles detected allows to constrain the formation/destruction route of various molecular species, in relation with the predictions of MHD shock models. The Herschel/WISH key-program investigates the properties and origin of water emission in a broad sample of protostellar outflows and envelopes. Implications of the first results for future studies on mass-loss phenomena are discussed.

The Critical Role of the Routing Scheme in Simulating Peak River Discharge in Global Hydrological Models

NASA Technical Reports Server (NTRS)

Zhao, Fang; Veldkamp, Ted I. E.; Frieler, Katja; Schewe, Jacob; Ostberg, Sebastian; Willner, Sven; Schauberger, Bernhard; Gosling, Simon N.; Schmied, Hannes Muller; Portmann, Felix T.;

Moving from Traditional Teacher Education to a Field-Based Urban Teacher Education Program: One Program's Story of Reform

ERIC Educational Resources Information Center

Waddell, Jennifer; Vartuli, Sue

2015-01-01

In recent years, teacher education has been charged with reforming programs to better align curriculum, clinical practice, and accountability. The sense of urgency for reform has been heightened by competition from alternative routes to teaching that jump straight to practice, often criticized for foregoing essential knowledge and theory. This…

Characteristics and Program Decisions of Master's-Level Professional Athletic Training Students

ERIC Educational Resources Information Center

Ostrowski, Jennifer Lynn; Iadevaia, Cheree M.

2014-01-01

Context: The number of master's-level professional athletic training programs (MLPATPs) has grown by over 400% in the past 10 years; however, little is known about the characteristics of the students who enroll in these programs or why they select this route to certification. Objective: To describe, by exploring the characteristics of MLPATP…

Understanding Teacher Effectiveness: Providing Feedback to Teacher Preparation Programs. Data for Action 2014

ERIC Educational Resources Information Center

Data Quality Campaign, 2014

2014-01-01

State leaders are increasingly focused on improving college and university programs that prepare teachers as a route to a high-quality teacher workforce. This work requires significant data capacity to reliably and securely link teachers with their students' achievement and growth data with the state's teacher preparation programs. This fact sheet…

Selfish routing equilibrium in stochastic traffic network: A probability-dominant description.

PubMed

Zhang, Wenyi; He, Zhengbing; Guan, Wei; Ma, Rui

2017-01-01

This paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network. At PdUE, travel demands are only assigned to the most dominant routes in the same origin-destination pair. A probability-dominant rerouting dynamic model is proposed to explain the behavioral mechanism of PdUE. To facilitate applications, the logit formula of PdUE is developed, of which a well-designed route set is not indispensable and the equivalent varitional inequality formation is simple. Two routing strategies, i.e., the probability-dominant strategy (PDS) and the dominant probability strategy (DPS), are discussed through a hypothetical experiment. It is found that, whether out of insurance or striving for perfection, PDS is a better choice than DPS. For more general cases, the conducted numerical tests lead to the same conclusion. These imply that PdUE (rather than the conventional stochastic user equilibrium) is a desirable selfish routing equilibrium for a stochastic network, given that the probability distributions of travel time are available to travelers.

Selfish routing equilibrium in stochastic traffic network: A probability-dominant description

PubMed Central

Zhang, Wenyi; Guan, Wei; Ma, Rui

2017-01-01

This paper suggests a probability-dominant user equilibrium (PdUE) model to describe the selfish routing equilibrium in a stochastic traffic network. At PdUE, travel demands are only assigned to the most dominant routes in the same origin-destination pair. A probability-dominant rerouting dynamic model is proposed to explain the behavioral mechanism of PdUE. To facilitate applications, the logit formula of PdUE is developed, of which a well-designed route set is not indispensable and the equivalent varitional inequality formation is simple. Two routing strategies, i.e., the probability-dominant strategy (PDS) and the dominant probability strategy (DPS), are discussed through a hypothetical experiment. It is found that, whether out of insurance or striving for perfection, PDS is a better choice than DPS. For more general cases, the conducted numerical tests lead to the same conclusion. These imply that PdUE (rather than the conventional stochastic user equilibrium) is a desirable selfish routing equilibrium for a stochastic network, given that the probability distributions of travel time are available to travelers. PMID:28829834

Strategic parameter-driven routing models for multidestination traffic in telecommunication networks.

PubMed

Lee, Y; Tien, J M

2001-01-01

We present mathematical models that determine the optimal parameters for strategically routing multidestination traffic in an end-to-end network setting. Multidestination traffic refers to a traffic type that can be routed to any one of a multiple number of destinations. A growing number of communication services is based on multidestination routing. In this parameter-driven approach, a multidestination call is routed to one of the candidate destination nodes in accordance with predetermined decision parameters associated with each candidate node. We present three different approaches: (1) a link utilization (LU) approach, (2) a network cost (NC) approach, and (3) a combined parametric (CP) approach. The LU approach provides the solution that would result in an optimally balanced link utilization, whereas the NC approach provides the least expensive way to route traffic to destinations. The CP approach, on the other hand, provides multiple solutions that help leverage link utilization and cost. The LU approach has in fact been implemented by a long distance carrier resulting in a considerable efficiency improvement in its international direct services, as summarized.

Security-Oriented and Load-Balancing Wireless Data Routing Game in the Integration of Advanced Metering Infrastructure Network in Smart Grid

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

He, Fulin; Cao, Yang; Zhang, Jun Jason

Ensuring flexible and reliable data routing is indispensable for the integration of Advanced Metering Infrastructure (AMI) networks, we propose a secure-oriented and load-balancing wireless data routing scheme. A novel utility function is designed based on security routing scheme. Then, we model the interactive security-oriented routing strategy among meter data concentrators or smart grid meters as a mixed-strategy network formation game. Finally, such problem results in a stable probabilistic routing scheme with proposed distributed learning algorithm. One contributions is that we studied that different types of applications affect the routing selection strategy and the strategy tendency. Another contributions is that themore » chosen strategy of our mixed routing can adaptively to converge to a new mixed strategy Nash equilibrium (MSNE) during the learning process in the smart grid.« less

VISCOPLASTIC FLUID MODEL FOR DEBRIS FLOW ROUTING.

USGS Publications Warehouse

Chen, Cheng-lung

1986-01-01

This paper describes how a generalized viscoplastic fluid model, which was developed based on non-Newtonian fluid mechanics, can be successfully applied to routing a debris flow down a channel. The one-dimensional dynamic equations developed for unsteady clear-water flow can be used for debris flow routing if the flow parameters, such as the momentum (or energy) correction factor and the resistance coefficient, can be accurately evaluated. The writer's generalized viscoplastic fluid model can be used to express such flow parameters in terms of the rheological parameters for debris flow in wide channels. A preliminary analysis of the theoretical solutions reveals the importance of the flow behavior index and the so-called modified Froude number for uniformly progressive flow in snout profile modeling.

A channel dynamics model for real-time flood forecasting

USGS Publications Warehouse

Hoos, Anne B.; Koussis, Antonis D.; Beale, Guy O.

1989-01-01

A new channel dynamics scheme (alternative system predictor in real time (ASPIRE)), designed specifically for real-time river flow forecasting, is introduced to reduce uncertainty in the forecast. ASPIRE is a storage routing model that limits the influence of catchment model forecast errors to the downstream station closest to the catchment. Comparisons with the Muskingum routing scheme in field tests suggest that the ASPIRE scheme can provide more accurate forecasts, probably because discharge observations are used to a maximum advantage and routing reaches (and model errors in each reach) are uncoupled. Using ASPIRE in conjunction with the Kalman filter did not improve forecast accuracy relative to a deterministic updating procedure. Theoretical analysis suggests that this is due to a large process noise to measurement noise ratio.

Animal and human dose-response models for Brucella species.

PubMed

Teske, Sondra S; Huang, Yin; Tamrakar, Sushil B; Bartrand, Timothy A; Weir, Mark H; Haas, Charles N

2011-10-01

Human Brucellosis is one of the most common zoonotic diseases worldwide. Disease transmission often occurs through the handling of domestic livestock, as well as ingestion of unpasteurized milk and cheese, but can have enhanced infectivity if aerosolized. Because there is no human vaccine available, rising concerns about the threat of Brucellosis to human health and its inclusion in the Center for Disease Control's Category B Bioterrorism/Select Agent List make a better understanding of the dose-response relationship of this microbe necessary. Through an extensive peer-reviewed literature search, candidate dose-response data were appraised so as to surpass certain standards for quality. The statistical programming language, "R," was used to compute the maximum likelihood estimation to fit two models, the exponential and the approximate beta-Poisson (widely used for quantitative risk assessment) to dose-response data. Dose-response models were generated for prevalent species of Brucella: Br. suis, Br. melitensis, and Br. abortus. Dose-response models were created for aerosolized Br. suis exposure to guinea pigs from pooled studies. A parallel model for guinea pigs inoculated through both aerosol and subcutaneous routes with Br. melitensis showed that the median infectious dose corresponded to a 30 colony-forming units (CFU) dose of Br. suis, much less than the N(50) dose of about 94 CFU for Br. melitensis organisms. When Br. melitensis was tested subcutaneously on mice, the N(50) dose was higher, 1,840 CFU. A dose-response model was constructed from pooled data for mice, rhesus macaques, and humans inoculated through three routes (subcutaneously/aerosol/intradermally) with Br. melitensis. © 2011 Society for Risk Analysis.

Application of advection-diffusion routing model to flood wave propagation: A case study on Big Piney River, Missouri USA

Treesearch

Yang Yang; Theodore A. Endreny; David J. Nowak

2016-01-01

Flood wave propagation modeling is of critical importance to advancing water resources management and protecting human life and property. In this study, we investigated how the advection-diffusion routing model performed in flood wave propagation on a 16 km long downstream section of the Big Piney River, MO. Model performance was based on gaging station data at the...

Single-Layer Wire Routing.

DTIC Science & Technology

1987-08-01

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

Coastal Surveillance Baseline Model Development

DTIC Science & Technology

2015-02-27

In the current STK model, a set of areas was defined for two reasons: To provide visual assistance during ship and aircraft route planning; and To...RF), electro-optic (EO), infrared (IR), and visual Partially Met The free version of STK can only generate simple generic sensors RQ-04 The model...25 APPENDIX A PLATFORM OBJECT ROUTE PLANNING PROCEDURE ............. A-1 APPENDIX B STK INSTALLATION

Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

PubMed Central

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

2010-01-01

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

A computer program (HEVSIM) for heavy duty vehicle fuel economy and performance simulation

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

The Elaboration Likelihood Model: Implications for the Practice of School Psychology.

ERIC Educational Resources Information Center

Petty, Richard E.; Heesacker, Martin; Hughes, Jan N.

1997-01-01

Reviews a contemporary theory of attitude change, the Elaboration Likelihood Model (ELM) of persuasion, and addresses its relevance to school psychology. Claims that a key postulate of ELM is that attitude change results from thoughtful (central route) or nonthoughtful (peripheral route) processes. Illustrations of ELM's utility for school…

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

NASA Astrophysics Data System (ADS)

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

Cost effectiveness of the stream-gaging program in North Dakota

USGS Publications Warehouse

Ryan, Gerald L.

1989-01-01

This report documents results of a cost-effectiveness study of the stream-gaging program In North Dakota. It is part of a nationwide evaluation of the stream-gaging program of the U.S. Geological Survey.One phase of evaluating cost effectiveness is to identify less costly alternative methods of simulating streamflow records. Statistical or hydro logic flow-routing methods were used as alternative methods to simulate streamflow records for 21 combinations of gaging stations from the 94-gaging-station network. Accuracy of the alternative methods was sufficient to consider discontinuing only one gaging station.Operation of the gaging-station network was evaluated by using associated uncertainty in streamflow records. The evaluation was limited to the nonwinter operation of 29 gaging stations in eastern North Dakota. The current (1987) travel routes and measurement frequencies require a budget of about $248/000 and result in an average equivalent Gaussian spread in streamflow records of 16.5 percent. Changes in routes and measurement frequencies optimally could reduce the average equivalent Gaussian spread to 14.7 percent.Budgets evaluated ranged from $235,000 to $400,000. A $235,000 budget would increase the optimal average equivalent Gaussian spread from 14.7 to 20.4 percent, and a $400,000 budget could decrease it to 5.8 percent.

Population resizing on fitness improvement genetic algorithm to optimize promotion visit route based on android and google maps API

NASA Astrophysics Data System (ADS)

Listyorini, Tri; Muzid, Syafiul

2017-06-01

The promotion team of Muria Kudus University (UMK) has done annual promotion visit to several senior high schools in Indonesia. The visits were done to numbers of schools in Kudus, Jepara, Demak, Rembang and Purwodadi. To simplify the visit, each visit round is limited to 15 (fifteen) schools. However, the team frequently faces some obstacles during the visit, particularly in determining the route that they should take toward the targeted school. It is due to the long distance or the difficult route to reach the targeted school that leads to elongated travel duration and inefficient fuel cost. To solve these problems, the development of a certain application using heuristic genetic algorithm method based on the dynamic of population size or Population Resizing on Fitness lmprovement Genetic Algorithm (PRoFIGA), was done. This android-based application was developed to make the visit easier and to determine a shorter route for the team, hence, the visiting period will be effective and efficient. The result of this research was an android-based application to determine the shortest route by combining heuristic method and Google Maps Application Programming lnterface (API) that display the route options for the team.

Central East Pacific Flight Routing

NASA Technical Reports Server (NTRS)

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

2006-01-01

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

Surface science studies of ethene containing model interstellar ices

NASA Astrophysics Data System (ADS)

Puletti, F.; Whelan, M.; Brown, W. A.

2011-05-01

The formation of saturated hydrocarbons in the interstellar medium (ISM) is difficult to explain only by taking into account gas phase reactions. This is mostly due to the fact that carbonium ions only react with H_2 to make unsaturated hydrocarbons, and hence no viable route to saturated hydrocarbons has been postulated to date. It is therefore likely that saturation processes occur via surface reactions that take place on interstellar dust grains. One of the species of interest in this family of reactions is C_2H_4 (ethene) which is an intermediate in several molecular formation routes (e.g. C_2H_2 → C_2H_6). To help to understand some of the surface processes involving ethene, a study of ethene deposited on a dust grain analogue surface (highly oriented pyrolytic graphite) held under ultra-high vacuum at 20 K has been performed. The adsorption and desorption of ethene has been studied both in water-free and water-dominated model interstellar ices. A combination of temperature programmed desorption (TPD) and reflection absorption infrared spectroscopy (RAIRS) have been used to identify the adsorbed and trapped species and to determine the kinetics of the desorption processes. In all cases, ethene is found to physisorb on the carbonaceous surface. As expected water has a very strong influence on the desorption of ethene, as previously observed for other model interstellar ice systems.

Modelling aspects regarding the control in 13C isotope separation column

NASA Astrophysics Data System (ADS)

Boca, M. L.

2016-08-01

Carbon represents the fourth most abundant chemical element in the world, having two stable and one radioactive isotope. The 13Carbon isotopes, with a natural abundance of 1.1%, plays an important role in numerous applications, such as the study of human metabolism changes, molecular structure studies, non-invasive respiratory tests, Alzheimer tests, air pollution and global warming effects on plants [9] A manufacturing control system manages the internal logistics in a production system and determines the routings of product instances, the assignment of workers and components, the starting of the processes on not-yet-finished product instances. Manufacturing control does not control the manufacturing processes themselves, but has to cope with the consequences of the processing results (e.g. the routing of products to a repair station). In this research it was fulfilled some UML (Unified Modelling Language) diagrams for modelling the C13 Isotope Separation column, implement in STARUML program. Being a critical process and needing a good control and supervising, the critical parameters in the column, temperature and pressure was control using some PLC (Programmable logic controller) and it was made some graphic analyze for this to observe some critical situation than can affect the separation process. The main parameters that need to be control are: -The liquid nitrogen (N2) level in the condenser. -The electrical power supplied to the boiler. -The vacuum pressure.

River and Reservoir Operations Model, Truckee River basin, California and Nevada, 1998

USGS Publications Warehouse

Berris, Steven N.; Hess, Glen W.; Bohman, Larry R.

2001-01-01

The demand for all uses of water in the Truckee River Basin, California and Nevada, commonly is greater than can be supplied. Storage reservoirs in the system have a maximum effective total capacity equivalent to less than two years of average river flows, so longer-term droughts can result in substantial water-supply shortages for irrigation and municipal users and may stress fish and wildlife ecosystems. Title II of Public Law (P.L.) 101-618, the Truckee?Carson?Pyramid Lake Water Rights Settlement Act of 1990, provides a foundation for negotiating and developing operating criteria, known as the Truckee River Operating Agreement (TROA), to balance interstate and interbasin allocation of water rights among the many interests competing for water from the Truckee River. In addition to TROA, the Truckee River Water Quality Settlement Agreement (WQSA), signed in 1996, provides for acquisition of water rights to resolve water-quality problems during low flows along the Truckee River in Nevada. Efficient execution of many of the planning, management, or environmental assessment requirements of TROA and WQSA will require detailed water-resources data coupled with sound analytical tools. Analytical modeling tools constructed and evaluated with such data could help assess effects of alternative operational scenarios related to reservoir and river operations, water-rights transfers, and changes in irrigation practices. The Truckee?Carson Program of the U.S. Geological Survey, to support U.S. Department of the Interior implementation of P.L. 101-618, is developing a modeling system to support efficient water-resources planning, management, and allocation. The daily operations model documented herein is a part of the modeling system that includes a database management program, a graphical user interface program, and a program with modules that simulate river/reservoir operations and a variety of hydrologic processes. The operations module is capable of simulating lake/ reservoir and river operations including diversion of Truckee River water to the Truckee Canal for transport to the Carson River Basin. In addition to the operations and streamflow-routing modules, the modeling system is structured to allow integration of other modules, such as water-quality and precipitation-runoff modules. The USGS Truckee River Basin operations model was designed to provide simulations that allow comparison of the effects of alternative management practices or allocations on streamflow or reservoir storages in the Truckee River Basin over long periods of time. Because the model was not intended to reproduce historical streamflow or reservoir storage values, a traditional calibration that includes statistical comparisons of observed and simulated values would be problematic with this model and database. This report describes a chronology and background of decrees, agreements, and laws that affect Truckee River operational practices; the construction of the Truckee River daily operations model; the simulation of Truckee River Basin operations, both current and proposed under the draft TROA and WQSA; and suggested model improvements and limitations. The daily operations model uses Hydrological Simulation Program?FORTRAN (HSPF) to simulate flow-routing and reservoir and river operations. The operations model simulates reservoir and river operations that govern streamflow in the Truckee River from Lake Tahoe to Pyramid Lake, including diversions through the Truckee Canal to Lahontan Reservoir in the Carson River Basin. A general overview is provided of daily operations and their simulation. Supplemental information that documents the extremely complex operating rules simulated by the model is available.

Scientific and economic potential of the SEASAT Program. [satellite system for global oceanographic data

NASA Technical Reports Server (NTRS)

Mccandless, S. W.; Miller, B. P.

1974-01-01

The SEASAT satellite system is planned as a user-oriented system for timely monitoring of global ocean dynamics and mapping the global ocean geoid. The satellite instrumentation and modular concept are discussed. Operational data capabilities will include oceanographic data services, direct satellite read-out to users, and conversational retrieval and analysis of stored data. A case-study technique, generalized through physical and econometric modeling, indicates potential economic benefit from SEASAT to users in the following areas: ship routing, iceberg reconnaissance, arctic operations, Alaska pipeline ship link, and off-shore oil production.

Effect of Interactive River Routing on North Atlantic Overturning in a Simulation of the last Deglaciation

NASA Astrophysics Data System (ADS)

Mikolajewicz, Uwe; Ziemen, Florian; Kapsch, Marie; Meccia, Virna

2017-04-01

One of the major challenges in climate modeling is the simulation of glacial-interglacial transitions. A few models of intermediate complexity have been successful in simulating the last termination. Complex atmosphere-ocean general circulation models (AOGCMs) with prescribed ice sheets are able to yield realistic climate changes. Here we present results from our first attempt to simulate a substantial part of the last glacial cycle with an AOGCM coupled interactively with a state-of-the-art ice sheet model. The ECHAM5/MPIOM AOGCM is interactively coupled to the dynamical ice sheet model PISM and the dynamical vegetation model LPJ. The model is integrated from the late Glacial into the Holocene using insolation and greenhouse gas concentrations as transient forcing. To make the long simulations feasible, the atmosphere is accelerated by a factor of 10 relative to the other components using a periodical-synchronous coupling technique. The land sea mask remains fixed at the LGM state. River routing and surface elevation are calculated interactively. A mini-ensemble with different initial conditions is performed. Additionally, one fully synchronously simulation, without acceleration in the atmosphere, is run. In all simulations the northern hemisphere deglaciation starts between 18 and 17 kyr BP, consistent with the onset of global warming. The model produces Heinrich event like variability. These rapid ice discharge events have a strong impact on the North Atlantic meridional overturning circulation (NAMOC). The interactive river routing has a strong impact on the simulated NAMOC during the deglaciation. The retreat of the Laurentide Ice Sheet together with the depressed topography due to the former ice load leads to a redirection of the river routes.. In particular, the discharge route for runoff from the melting southwestern Laurentide shifts from the Gulf of Mexico to the Arctic. The consequence is a rapid reduction/suppression of the North Atlantic deep water (NADW) formation. When the Laurentide Ice Sheet retreats from the Hudson Strait, this becomes the new drainage route. Hence, fresh water is released into the Labrador Sea and is less effective in suppressing the deep water formation in the North Atlantic. As a consequence, the NADW formation recovers within a few decades. Our results show the potential importance of interactive river routing for rapid changes in NAMOC strength during the deglaciation.

Randomized shortest-path problems: two related models.

PubMed

Saerens, Marco; Achbany, Youssef; Fouss, François; Yen, Luh

2009-08-01

This letter addresses the problem of designing the transition probabilities of a finite Markov chain (the policy) in order to minimize the expected cost for reaching a destination node from a source node while maintaining a fixed level of entropy spread throughout the network (the exploration). It is motivated by the following scenario. Suppose you have to route agents through a network in some optimal way, for instance, by minimizing the total travel cost-nothing particular up to now-you could use a standard shortest-path algorithm. Suppose, however, that you want to avoid pure deterministic routing policies in order, for instance, to allow some continual exploration of the network, avoid congestion, or avoid complete predictability of your routing strategy. In other words, you want to introduce some randomness or unpredictability in the routing policy (i.e., the routing policy is randomized). This problem, which will be called the randomized shortest-path problem (RSP), is investigated in this work. The global level of randomness of the routing policy is quantified by the expected Shannon entropy spread throughout the network and is provided a priori by the designer. Then, necessary conditions to compute the optimal randomized policy-minimizing the expected routing cost-are derived. Iterating these necessary conditions, reminiscent of Bellman's value iteration equations, allows computing an optimal policy, that is, a set of transition probabilities in each node. Interestingly and surprisingly enough, this first model, while formulated in a totally different framework, is equivalent to Akamatsu's model ( 1996 ), appearing in transportation science, for a special choice of the entropy constraint. We therefore revisit Akamatsu's model by recasting it into a sum-over-paths statistical physics formalism allowing easy derivation of all the quantities of interest in an elegant, unified way. For instance, it is shown that the unique optimal policy can be obtained by solving a simple linear system of equations. This second model is therefore more convincing because of its computational efficiency and soundness. Finally, simulation results obtained on simple, illustrative examples show that the models behave as expected.

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

PubMed

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

2017-04-26

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

Two dimensional finite element modelling for dynamic water diffusion through stratum corneum.

PubMed

Xiao, Perry; Imhof, Robert E

2012-10-01

Solvents penetration through in vivo human stratum corneum (SC) has always been an interesting research area for trans-dermal drug delivery studies, and the importance of intercellular routes (diffuse in between corneocytes) and transcellular routes (diffuse through corneocytes) during diffusion is often debatable. In this paper, we have developed a two dimensional finite element model to simulate the dynamic water diffusion through the SC. It is based on the brick-and-mortar model, with brick represents corneocytes and mortar represents lipids, respectively. It simulates the dynamic water diffusion process through the SC from pre-defined initial conditions and boundary conditions. Although the simulation is based on water diffusions, the principles can also be applied to the diffusions of other topical applied substances. The simulation results show that both intercellular routes and transcellular routes are important for water diffusion. Although intercellular routes have higher flux rates, most of the water still diffuse through transcellular routes because of the high cross area ratio of corneocytes and lipids. The diffusion water flux, or trans-epidermal water loss (TEWL), is reversely proportional to corneocyte size, i.e. the larger the corneocyte size, the lower the TEWL, and vice versa. There is also an effect of the SC thickness, external air conditions and diffusion coefficients on the water diffusion through SC on the resulting TEWL. Copyright © 2012 Elsevier B.V. All rights reserved.

A hybrid nanomemristor/transistor logic circuit capable of self-programming

PubMed Central

Borghetti, Julien; Li, Zhiyong; Straznicky, Joseph; Li, Xuema; Ohlberg, Douglas A. A.; Wu, Wei; Stewart, Duncan R.; Williams, R. Stanley

2009-01-01

Memristor crossbars were fabricated at 40 nm half-pitch, using nanoimprint lithography on the same substrate with Si metal-oxide-semiconductor field effect transistor (MOS FET) arrays to form fully integrated hybrid memory resistor (memristor)/transistor circuits. The digitally configured memristor crossbars were used to perform logic functions, to serve as a routing fabric for interconnecting the FETs and as the target for storing information. As an illustrative demonstration, the compound Boolean logic operation (A AND B) OR (C AND D) was performed with kilohertz frequency inputs, using resistor-based logic in a memristor crossbar with FET inverter/amplifier outputs. By routing the output signal of a logic operation back onto a target memristor inside the array, the crossbar was conditionally configured by setting the state of a nonvolatile switch. Such conditional programming illuminates the way for a variety of self-programmed logic arrays, and for electronic synaptic computing. PMID:19171903

A hybrid nanomemristor/transistor logic circuit capable of self-programming.

PubMed

Borghetti, Julien; Li, Zhiyong; Straznicky, Joseph; Li, Xuema; Ohlberg, Douglas A A; Wu, Wei; Stewart, Duncan R; Williams, R Stanley

2009-02-10

Memristor crossbars were fabricated at 40 nm half-pitch, using nanoimprint lithography on the same substrate with Si metal-oxide-semiconductor field effect transistor (MOS FET) arrays to form fully integrated hybrid memory resistor (memristor)/transistor circuits. The digitally configured memristor crossbars were used to perform logic functions, to serve as a routing fabric for interconnecting the FETs and as the target for storing information. As an illustrative demonstration, the compound Boolean logic operation (A AND B) OR (C AND D) was performed with kilohertz frequency inputs, using resistor-based logic in a memristor crossbar with FET inverter/amplifier outputs. By routing the output signal of a logic operation back onto a target memristor inside the array, the crossbar was conditionally configured by setting the state of a nonvolatile switch. Such conditional programming illuminates the way for a variety of self-programmed logic arrays, and for electronic synaptic computing.

Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

Green-wave control of an unbalanced two-route traffic system with signals

NASA Astrophysics Data System (ADS)

Tobita, Kazuhiro; Nagatani, Takashi

2013-11-01

We introduce the preference parameter into the two-route dynamic model proposed by Wahle et al. The parameter represents the driver’s preference for the route choice. When the driver prefers a route, the traffic flow on route A does not balance with that on route B. We study the signal control for the unbalanced two-route traffic flow at the tour-time feedback strategy where the vehicles move ahead through a series of signals. The traffic signals are controlled by both cycle time and phase shift (offset time). We find that the mean tour time can be balanced by selecting the offset time successfully. We derive the relationship between the mean tour time and offset time (phase shift). Also, the dependences of the mean density and mean current on the offset time are derived.

DSN system performance test software

NASA Technical Reports Server (NTRS)

Martin, M.

1978-01-01

The system performance test software is currently being modified to include additional capabilities and enhancements. Additional software programs are currently being developed for the Command Store and Forward System and the Automatic Total Recall System. The test executive is the main program. It controls the input and output of the individual test programs by routing data blocks and operator directives to those programs. It also processes data block dump requests from the operator.

Short-Term Memory, Executive Control, and Children's Route Learning

ERIC Educational Resources Information Center

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

2012-01-01

The aim of this study was to investigate route-learning ability in 67 children aged 5 to 11 years and to relate route-learning performance to the components of Baddeley's model of working memory. Children carried out tasks that included measures of verbal and visuospatial short-term memory and executive control and also measures of verbal and…

Computer Program (VEHSIM) for Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. III

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

14 CFR 91.1417 - CAMP: Mechanical interruption summary report.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 2 2010-01-01 2010-01-01 false CAMP: Mechanical interruption summary... Ownership Operations Program Management § 91.1417 CAMP: Mechanical interruption summary report. Each program... route, caused by known or suspected mechanical difficulties or malfunctions that are not required to be...

Computer Program (VEHSIM) for Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. II

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Computer Program (VEHSIM) For Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. IV: Enhancements

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Acceleration of Advanced CN Antidote Agents for Mass Exposure Treatments: DMTS

DTIC Science & Technology

2014-12-01

Intraosseous Injection; Inhalational Delivery 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT 18. NUMBER OF PAGES 19a. NAME OF RESPONSIBLE...exposure models. We have administered antidotes via intramuscular injection, inhalation, and intraosseous routes. These animal models are all available...injection, inhalation, and intraosseous routes. These animal models are all available for ongoing testing of the novel candidate antidotes as was

Additional-singleton interference in efficient visual search: a common salience route for detection and compound tasks.

PubMed

Zehetleitner, Michael; Proulx, Michael J; Müller, Hermann J

2009-11-01

In efficient search for feature singleton targets, additional singletons (ASs) defined in a nontarget dimension are frequently found to interfere with performance. All search tasks that are processed via a spatial saliency map of the display would be predicted to be subject to such AS interference. In contrast, dual-route models, such as feature integration theory, assume that singletons are detected not via a saliency map, but via a nonspatial route that is immune to interference from cross-dimensional ASs. Consistent with this, a number of studies have reported absent interference effects in detection tasks. However, recent work suggests that the failure to find such effects may be due to the particular frequencies at which ASs were presented, as well as to their relative saliency. These two factors were examined in the present study. In contrast to previous reports, cross-dimensional ASs were found to slow detection (target-present and target-absent) responses, modulated by both their frequency of occurrence and saliency (relative to the target). These findings challenge dual-route models and support single-route models, such as dimension weighting and guided search.

Energy efficient motion control of the electric bus on route

NASA Astrophysics Data System (ADS)

Kotiev, G. O.; Butarovich, D. O.; Kositsyn, B. B.

2018-02-01

At present, the urgent problem is the reduction of energy costs of urban motor transport. The article proposes a method of solving this problem by developing an energy-efficient law governing the movement of an electric bus along a city route. To solve this problem, an algorithm is developed based on the dynamic programming method. The proposed method allows you to take into account the constraints imposed on the phase coordinates, control action, as well as on the time of the route. In the course of solving the problem, the model of rectilinear motion of an electric bus on a horizontal reference surface is considered, taking into account the assumptions that allow it to be adapted for the implementation of the method. For the formation of a control action in the equations of motion dynamics, an algorithm for changing the traction / braking torque on the wheels of an electric bus is considered, depending on the magnitude of the control parameter and the speed of motion. An optimal phase trajectory was obtained on a selected section of the road for the prototype of an electric bus. The article presents the comparison of simulation results obtained with the optimal energy efficient control law with the results obtained by a test driver. The comparison proved feasibility of the energy efficient control law for the automobile city electric transport.

USAF/SCEEE Summer Faculty Research Program (1979). Volume 2

DTIC Science & Technology

1979-12-01

Summer Faculty Research Program participants. The program designed to stimulate ’Ilk scientific and engineering interaction between university faculty...Prog., Dept. of Industrial Engineering Facility design and location theory University of Oklahoma and routing and distribution systems 202 W. Boyd...Theory & Assistant Professor of Management Adninistration, 1975 University of Akron S.ec aIty: Organization Design Akron, OH 44325 Assigned: AFBRMC

Route to Success: A Leader School's Youth Consultant Program. Linking Learning with Life.

ERIC Educational Resources Information Center

Kelley, Jennifer; Specter, Joanna; Young, Jamaal

This booklet explains how high schools can replicate the service learning youth consultant program that was originally formed at Spring Valley High School (SVHS) in Columbia, South Carolina, in 1996 to assume governance of SVHS's service learning program, which is called VikingServe. The booklet begins with an overview of VikingServe and a listing…

Walking school bus programs in U.S. public elementary schools.

PubMed

Turner, Lindsey; Chriqui, Jamie F; Chaloupka, Frank J

2013-07-01

Active transportation to school provides an important way for children to meet physical activity recommendations. The "walking school bus" (WSB) is a strategy whereby adults walk with a group of children to and from school along a fixed route. This study assessed whether school-organized WSB programs varied by school characteristics, district policies, and state laws. School data were gathered by mail-back surveys in nationally representative samples of U.S. public elementary schools during the 2008-2009 and 2009-2010 school years (n = 632 and 666, respectively). Corresponding district policies and state laws were obtained. Nationwide, 4.2% of schools organized a WSB program during 2008-2009, increasing to 6.2% by 2009-2010. Controlling for demographic covariates, schools were more likely to organize a WSB program where there was a strong district policy pertaining to safe active routes to school (OR = 2.14, P < .05), or a state law requiring crossing guards around schools (OR = 2.72, P < .05). WSB programs are not common but district policies and state laws are associated with an increased likelihood of elementary schools organizing these programs. Policymaking efforts may encourage schools to promote active transportation.

Critical factors for active transportation to school among low-income and minority students. Evidence from the 2001 National Household Travel Survey.

PubMed

McDonald, Noreen C

2008-04-01

Walking to school may be an important source of daily physical activity in children's lives, and government agencies are supporting programs to encourage walking to school (e.g., Safe Routes to School and the CDC's KidsWalk programs). However, little research has looked at differences in behavior across racial/ethnic and income groups. This cross-sectional study used data from the 2001 National Household Travel Survey to document rates of walking and biking to school among low-income and minority youth in the U.S. (N=14,553). Binary models of the decision to use active transport to school were developed to simultaneously adjust for trip, individual, household, and neighborhood correlates. All analyses were conducted in 2007. The data showed that low-income and minority groups, particularly blacks and Hispanics, use active travel modes to get to school at much higher rates than whites or higher-income students. However, racial variation in travel patterns is removed by controlling for household income, vehicle access, distance between home and school, and residential density. Active transportation to school may be an important strategy to increase and maintain physical activity levels for low-income and minority youth. Current policy interventions such as Safe Routes to School have the opportunity to provide benefits for low-income and minority students who are the most likely to walk to school.

Pathways of inhalation exposure to manganese in children living near a ferromanganese refinery: A structural equation modeling approach

EPA Science Inventory

Manganese (Mn) is both essential element and neurotoxicant. Exposure to Mn can occur from various sources and routes. Structural equation modeling was used to examine routes of exposure to Mn among children residing near a ferromanganese refinery in Marietta, Ohio. An inhalation ...

Development and Application of a Human PBPK Model for Bromodichloromethane (BDCM) to Investigate Impacts of Multi-Route Exposure

EPA Science Inventory

Due to its presence in water as a volatile disinfection byproduct, BDCM, which is mutagenic and a rodent carcinogen, poses a risk for exposure via multiple routes. We developed a refined human PBPK model for BDCM (including new chemical-specific human parameters) to evaluate the...

Simulation study of overtaking in pedestrian flow using floor field cellular automaton model

NASA Astrophysics Data System (ADS)

Fu, Zhijian; Xia, Liang; Yang, Hongtai; Liu, Xiaobo; Ma, Jian; Luo, Lin; Yang, Lizhong; Chen, Junmin

Properties of pedestrian may change along the moving path, for example, as a result of fatigue or injury, which has never been properly investigated in the past research. The paper attempts to study tactical overtaking in pedestrian flow. That is difficult to be modeled using a microscopic discrete model because of the complexity of the detailed overtaking behavior, and crossing/overlaps of pedestrian routes. Thus, a multi-velocity floor field cellular automaton model explaining the detailed psychical process of overtaking decision was proposed. Pedestrian can be either in normal state or in tactical overtaking state. Without tactical decision, pedestrians in normal state are driven by the floor field. Pedestrians make their tactical overtaking decisions by evaluating the walking environment around the overtaking route (the average velocity and density around the route, visual field of pedestrian) and obstructing conditions (the distance and velocity difference between the overtaking pedestrian and the obstructing pedestrian). The effects of tactical overtaking ratio, free velocity dispersion, and visual range on fundamental diagram, conflict density, and successful overtaking ratio were explored. Besides, the sensitivity analysis of the route factor relative intensity was performed.

The effect of dynamic scheduling and routing in a solid waste management system

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

Johansson, Ola M.

2006-07-01

Solid waste collection and hauling account for the greater part of the total cost in modern solid waste management systems. In a recent initiative, 3300 Swedish recycling containers have been fitted with level sensors and wireless communication equipment, thereby giving waste collection operators access to real-time information on the status of each container. In this study, analytical modeling and discrete-event simulation have been used to evaluate different scheduling and routing policies utilizing the real-time data. In addition to the general models developed, an empirical simulation study has been performed on the downtown recycling station system in Malmoe, Sweden. From themore » study, it can be concluded that dynamic scheduling and routing policies exist that have lower operating costs, shorter collection and hauling distances, and reduced labor hours compared to the static policy with fixed routes and pre-determined pick-up frequencies employed by many waste collection operators today. The results of the analytical model and the simulation models are coherent, and consistent with experiences of the waste collection operators.« less

Sea ice decline and 21st century trans-Arctic shipping routes

NASA Astrophysics Data System (ADS)

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

2016-09-01

The observed decline in Arctic sea ice is projected to continue, opening shorter trade routes across the Arctic Ocean, with potentially global economic implications. Here we quantify, using Coupled Model Intercomparison Project Phase 5 global climate model simulations calibrated to remove spatial biases, how projected sea ice loss might increase opportunities for Arctic transit shipping. By midcentury for standard open water vessels, the frequency of navigable periods doubles, with routes across the central Arctic becoming available. A sea ice-ship speed relationship is used to show that European routes to Asia typically become 10 days faster via the Arctic than alternatives by midcentury, and 13 days faster by late century, while North American routes become 4 days faster. Future greenhouse gas emissions have a larger impact by late century; the shipping season reaching 4-8 months in Representative Concentration Pathway (RCP)8.5 double that of RCP2.6, both with substantial interannual variability. Moderately, ice-strengthened vessels likely enable Arctic transits for 10-12 months by late century.

Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks.

PubMed

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.

Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks

PubMed Central

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

2017-01-01

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

The pharmacokinetics of intraosseous atropine in hypovolemic swine.

PubMed

Yost, Jonathan; Baldwin, Phillip; Bellenger, Sarah; Bradshaw, Freida; Causapin, Edna; Demotica, Richelle; Livingston, Michael; Lee, Cynthia; Gegel, Brian; Burgert, James; Claessens, Adam; Johnson, Don; Loughren, Michael

2015-01-01

Compare the pharmacokinetics of atropine administered via the intravenous (IV), intramuscular (IM), and intraosseous (IO) routes in a normovolemic and hypovolemic swine model. Prospective, between subjects, experimental study. Vivarium. Yorkshire-cross swine (N = 36). Atropine was administered via IV, IM, or IO routes to normovolemic and hypovolemic swine. Blood samples were drawn at regular intervals after atropine administration and analyzed for plasma atropine concentration. Pharmacokinetic parameters were obtained from modeling the plasma concentrations. Pharmacokinetic parameters, maximum concentration (Cmax) and time to maximum concentration (Tmax). The IV and IO groups in both the normovolemic and hypovolemic models reached peak plasma concentration immediately and had a very rapid distribution phase with no apparent absorption phase for the IO groups. Peak plasma concentration and time to reach peak concentration were both significantly lower for the IM groups. There was a significant increase in absorption time with IM administration in the hypovolemic model compared to the normovolemic model. The IO route is an effective method of administering atropine and is comparable to the IV route even under conditions of significant hemorrhage. Therapeutic levels of atropine may be delayed and possibly difficult to obtain via IM injection in the presence of hypovolemic shock.

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

NASA Astrophysics Data System (ADS)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

Strategic planning for disaster recovery with stochastic last mile distribution

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

Bent, Russell Whitford; Van Hentenryck, Pascal; Coffrin, Carleton

2010-01-01

This paper considers the single commodity allocation problem (SCAP) for disaster recovery, a fundamental problem faced by all populated areas. SCAPs are complex stochastic optimization problems that combine resource allocation, warehouse routing, and parallel fleet routing. Moreover, these problems must be solved under tight runtime constraints to be practical in real-world disaster situations. This paper formalizes the specification of SCAPs and introduces a novel multi-stage hybrid-optimization algorithm that utilizes the strengths of mixed integer programming, constraint programming, and large neighborhood search. The algorithm was validated on hurricane disaster scenarios generated by Los Alamos National Laboratory using state-of-the-art disaster simulation toolsmore » and is deployed to aid federal organizations in the US.« less

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

PubMed

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.

Summer nitrogenous nutrient transport and its fate in the Taiwan Strait: A coupled physical-biological modeling approach

NASA Astrophysics Data System (ADS)

Wang, Jia; Hong, Huasheng; Jiang, Yuwu; Chai, Fei; Yan, Xiao-Hai

2013-09-01

In order to understand the fate of nutrients in the Taiwan Strait during summer, we built a coupled physical-biological numerical ocean model, which can capture the basic hydrographic and biological features within the strait. The nutrient that we chose to model is dissolved inorganic nitrogen (DIN). The model includes individual reservoirs for nitrate (NO3) and ammonium (NH4). Both the observational evidence and model results show that NO3 in the strait originates primarily from the upwelling subsurface water in the northern South China Sea (SCS) that enters the strait via the eastern and western routes separated by the Taiwan Bank. The coupled physical and biological effects on the NO3 transport at these two routes are highlighted in the study. For the western route, the shallow topography and the coastal upwelling intensify the biological uptake of NO3 in the whole water column. Consequently, the nitrogenous contribution by this route is mainly in form of the particulate organic nitrogen (PON). In contrast, NO3 is transported conservatively below the nitricline at the deep eastern route, contributing the whole NO3 supply in the TWS. The model estimates the fluxes of DIN and PON into the TWS, from the northern SCS, are 1.8 and 4 kmol s-1, respectively. Over half (˜1 kmol s-1) of the DIN is synthesized into PON by the phytoplankton in the strait. Overall, this study estimates the physical and biological effects on the nutrient transport in the TWS during summer.

Computer Program (HEVSIM) for Heavy Duty Vehicle Fuel Economy and Performance Simulation. Volume I: Description and Analysis

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

Learning to Teach through Teaching and Being Taught.

ERIC Educational Resources Information Center

Jordell, Karl Oyvind

1991-01-01

Preliminary assessments were made of decentralized and part-time teacher education programs, which represent alternate routes to teacher certification, to stimulate the supply of teachers in northern Norway. These first- and second-generation programs are being accepted, despite problems with multiple demands on students and supervision of teacher…

Carpool and buspool matching guide. Fourth edition

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

Pratsch, L.

1975-01-01

The operation and management of numerous successful carpool, buspool, and vanpool programs throughout the U.S. are discussed. The matching of the time and location requirements of the riders with vehicle availability and routing is described. The guide for data collection procedures and computer programs for carpool matching is presented. (LCL)

A computer program (HEVSIM) for heavy duty vehicle fuel economy and performance simulation : Volume II: Users' Manual

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

A computer program (VEHSIM) for vehicle fuel economy and performance simulation (automobiles and light trucks). Volume 3. Glossary and listings

DOT National Transportation Integrated Search

1981-01-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Bike Skills Training in PE Is Fun, Keeps Kids Safe

ERIC Educational Resources Information Center

Wallace, Judi Lawson; Sutton, Nancy P.

2015-01-01

Incorporating bike skills into the elementary- and middle-school physical education curriculum encourages students to be physically active in a fun way while also learning bike safety skills. Winston-Salem's (NC) Safe Routes to School program demonstrates how collaboration with the public schools' health and physical education program can…

Shopping for Jobs: Mall Internship Program Opens Doors for HVAC Students.

ERIC Educational Resources Information Center

Nolot, Terry

1995-01-01

Ivy Tech State College uses River Falls, a shopping mall, as an enormous heating, ventilation, and air conditioning laboratory. Students spend Saturdays working with full-time technicians getting invaluable training and experience. Students see the program as a professional opportunity and a direct route to jobs. (JOW)

A computer program (VEHSIM) for vehicle fuel economy and performance simulation (automobiles and light trucks). Volume 2. Users guide

DOT National Transportation Integrated Search

1981-01-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

A computer program (VEHSIM) for vehicle fuel economy and performance simulation (automobiles and light trucks). Volume 1. Description and analysis

DOT National Transportation Integrated Search

1981-01-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Putting Paraeducators on the Path to Teacher Certification

ERIC Educational Resources Information Center

Morrison, Judith; Lightner, Lindsay

2017-01-01

In response to local districts' needs for certified teachers with community roots who understand local schools and students, the authors developed an innovative alternative route for paraprofessionals based on a traditional bachelor's program. Their goals were to provide a rigorous, research-based program that allows paraprofessionals to get a…

A computer program (HEVSIM) for heavy duty vehicle fuel economy and performance simulation : Volume 1: Description and Analysis

DOT National Transportation Integrated Search

1981-09-01

This report presents a description of a vehicle simulation program, which can determine the fuel economy and performance of a specified motor vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated by HEVSIM i...

Computer Program (VEHSIM) for Vehicle Fuel Economy and Performance Simulation (Automobiles and Light Trucks) : Vol. I: Description and Analysis

DOT National Transportation Integrated Search

1981-10-01

This report presents an updated description of a vehicle simulation program, VEHSIM, which can determine the fuel economy and performance of a specified vehicle over a defined route as it executes a given driving schedule. Vehicle input accommodated ...

Context Aware Routing Management Architecture for Airborne Networks

DTIC Science & Technology

2012-03-22

awareness, increased survivability, 2 higher operation tempo , greater lethality, improve speed of command and certain degree of self-synchronization [35...first two sets of experiments. This error model simulates deviations from predetermined routes as well as variations on signal strength for radio...routes computed using Maximum Concurrent Multi-Commodity flow algorithm are not susceptible to rapid topology variations induced by noise. 57 5

Role of fomites in SARS transmission during the largest hospital outbreak in Hong Kong.

PubMed

Xiao, Shenglan; Li, Yuguo; Wong, Tze-Wai; Hui, David S C

2017-01-01

The epidemic of severe acute respiratory syndrome (SARS) had a significant effect on global society in the early 2000s and the potential of its resurgence exists. Studies on the modes of transmission of SARS are limited though a number of outbreak studies have revealed the possible airborne route. To develop more specific and effective control strategies, we conducted a detailed mechanism-based investigation that explored the role of fomite transmission in the well-known Ward 8A outbreak. We considered three hypothetical transmission routes, i.e., the long-range airborne, fomite and combined routes, in 1,744 scenarios with combinations of some important parameters. A multi-agent model was used to predict the infection risk distributions of the three hypothetical routes. Model selection was carried out for different scenarios to compare the distributions of infection risk with that of the reported attack rates and select the hypotheses with the best fitness. Our results reveal that under the assumed conditions, the SARS coronavirus was most possible to have spread via the combined long-range airborne and fomite routes, and that the fomite route played a non-negligible role in the transmission.

Eliciting candidate anatomical routes for protein interactions: a scenario from endocrine physiology

PubMed Central

2013-01-01

Background In this paper, we use: i) formalised anatomical knowledge of connectivity between body structures and ii) a formal theory of physiological transport between fluid compartments in order to define and make explicit the routes followed by proteins to a site of interaction. The underlying processes are the objects of mathematical models of physiology and, therefore, the motivation for the approach can be understood as using knowledge representation and reasoning methods to propose concrete candidate routes corresponding to correlations between variables in mathematical models of physiology. In so doing, the approach projects physiology models onto a representation of the anatomical and physiological reality which underpins them. Results The paper presents a method based on knowledge representation and reasoning for eliciting physiological communication routes. In doing so, the paper presents the core knowledge representation and algorithms using it in the application of the method. These are illustrated through the description of a prototype implementation and the treatment of a simple endocrine scenario whereby a candidate route of communication between ANP and its receptors on the external membrane of smooth muscle cells in renal arterioles is elicited. The potential of further development of the approach is illustrated through the informal discussion of a more complex scenario. Conclusions The work presented in this paper supports research in intercellular communication by enabling knowledge‐based inference on physiologically‐related biomedical data and models. PMID:23590598

Cascade defense via routing in complex networks

NASA Astrophysics Data System (ADS)

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

2015-05-01

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

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

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

Zhu, Lei; Holden, Jacob; Gonder, Jeff

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 navigationmore » 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%.« less

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

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

Zhu, Lei; Holden, Jacob; Gonder, Jeffrey D

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 navigationmore » 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%.« less

Surface Hydrology in Global River Basins in the Off-Line Land-Surface GEOS Assimilation (OLGA) System

NASA Technical Reports Server (NTRS)

Bosilovich, Michael G.; Yang, Runhua; Houser, Paul R.

1998-01-01

Land surface hydrology for the Off-line Land-surface GEOS Analysis (OLGA) system and Goddard Earth Observing System (GEOS-1) Data Assimilation System (DAS) has been examined using a river routing model. The GEOS-1 DAS land-surface parameterization is very simple, using an energy balance prediction of surface temperature and prescribed soil water. OLGA uses near-surface atmospheric data from the GEOS-1 DAS to drive a more comprehensive parameterization of the land-surface physics. The two global systems are evaluated using a global river routing model. The river routing model uses climatologic surface runoff from each system to simulate the river discharge from global river basins, which can be compared to climatologic river discharge. Due to the soil hydrology, the OLGA system shows a general improvement in the simulation of river discharge compared to the GEOS-1 DAS. Snowmelt processes included in OLGA also have a positive effect on the annual cycle of river discharge and source runoff. Preliminary tests of a coupled land-atmosphere model indicate improvements to the hydrologic cycle compared to the uncoupled system. The river routing model has provided a useful tool in the evaluation of the GCM hydrologic cycle, and has helped quantify the influence of the more advanced land surface model.

Autonomous control of production networks using a pheromone approach

NASA Astrophysics Data System (ADS)

Armbruster, D.; de Beer, C.; Freitag, M.; Jagalski, T.; Ringhofer, C.

2006-04-01

The flow of parts through a production network is usually pre-planned by a central control system. Such central control fails in presence of highly fluctuating demand and/or unforeseen disturbances. To manage such dynamic networks according to low work-in-progress and short throughput times, an autonomous control approach is proposed. Autonomous control means a decentralized routing of the autonomous parts themselves. The parts’ decisions base on backward propagated information about the throughput times of finished parts for different routes. So, routes with shorter throughput times attract parts to use this route again. This process can be compared to ants leaving pheromones on their way to communicate with following ants. The paper focuses on a mathematical description of such autonomously controlled production networks. A fluid model with limited service rates in a general network topology is derived and compared to a discrete-event simulation model. Whereas the discrete-event simulation of production networks is straightforward, the formulation of the addressed scenario in terms of a fluid model is challenging. Here it is shown, how several problems in a fluid model formulation (e.g. discontinuities) can be handled mathematically. Finally, some simulation results for the pheromone-based control with both the discrete-event simulation model and the fluid model are presented for a time-dependent influx.

32 CFR 989.32 - Noise.

Code of Federal Regulations, 2010 CFR

2010-07-01

... database entry. Utilize the current NOISEMAP computer program for air installations and the Assessment System for Aircraft Noise for military training routes and military operating areas. Guidance on...

32 CFR 989.32 - Noise.

Code of Federal Regulations, 2013 CFR

2013-07-01

... database entry. Utilize the current NOISEMAP computer program for air installations and the Assessment System for Aircraft Noise for military training routes and military operating areas. Guidance on...

32 CFR 989.32 - Noise.

Code of Federal Regulations, 2012 CFR

2012-07-01

... database entry. Utilize the current NOISEMAP computer program for air installations and the Assessment System for Aircraft Noise for military training routes and military operating areas. Guidance on...

32 CFR 989.32 - Noise.

Code of Federal Regulations, 2011 CFR

2011-07-01

... database entry. Utilize the current NOISEMAP computer program for air installations and the Assessment System for Aircraft Noise for military training routes and military operating areas. Guidance on...

32 CFR 989.32 - Noise.

Code of Federal Regulations, 2014 CFR

2014-07-01

... database entry. Utilize the current NOISEMAP computer program for air installations and the Assessment System for Aircraft Noise for military training routes and military operating areas. Guidance on...

Routing and Scheduling Optimization Model of Sea Transportation

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

TH-C-18A-06: Combined CT Image Quality and Radiation Dose Monitoring Program Based On Patient Data to Assess Consistency of Clinical Imaging Across Scanner Models

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

Christianson, O; Winslow, J; Samei, E

2014-06-15

Purpose: One of the principal challenges of clinical imaging is to achieve an ideal balance between image quality and radiation dose across multiple CT models. The number of scanners and protocols at large medical centers necessitates an automated quality assurance program to facilitate this objective. Therefore, the goal of this work was to implement an automated CT image quality and radiation dose monitoring program based on actual patient data and to use this program to assess consistency of protocols across CT scanner models. Methods: Patient CT scans are routed to a HIPPA compliant quality assurance server. CTDI, extracted using opticalmore » character recognition, and patient size, measured from the localizers, are used to calculate SSDE. A previously validated noise measurement algorithm determines the noise in uniform areas of the image across the scanned anatomy to generate a global noise level (GNL). Using this program, 2358 abdominopelvic scans acquired on three commercial CT scanners were analyzed. Median SSDE and GNL were compared across scanner models and trends in SSDE and GNL with patient size were used to determine the impact of differing automatic exposure control (AEC) algorithms. Results: There was a significant difference in both SSDE and GNL across scanner models (9–33% and 15–35% for SSDE and GNL, respectively). Adjusting all protocols to achieve the same image noise would reduce patient dose by 27–45% depending on scanner model. Additionally, differences in AEC methodologies across vendors resulted in disparate relationships of SSDE and GNL with patient size. Conclusion: The difference in noise across scanner models indicates that protocols are not optimally matched to achieve consistent image quality. Our results indicated substantial possibility for dose reduction while achieving more consistent image appearance. Finally, the difference in AEC methodologies suggests the need for size-specific CT protocols to minimize variability in image quality across CT vendors.« less

Effectiveness evaluation of STOL transport operations

NASA Technical Reports Server (NTRS)

Hitt, E. F.; Bruckner, J. M. H.; Drago, V. J.; Brown, R. A.; Rea, F. G.; Porter, R. F.

1973-01-01

A short-takeoff and landing (STOL) systems simulation model has been developed and implemented in a computer code (known as STOL OPS) which permits evaluation of the operation of a STOL aircraft and its avionics in a commercial airline operating environment. STOL OPS concentrated on the avionics functions of navigation, guidance, control, communication, hazard aviodance, and systems management. External world factors influencing the operation of the STOL aircraft include each airport and its geometry, air traffic at each airport, air traffic control equipment and procedures, weather (including winds and visibility), and the flight path between each airport served by the route. The development of the STOL OPS program provides NASA a set of computer programs which can be used for detailed analysis of a STOL aircraft and its avionics and permit establishment of system requirements as a function of airline mission performance goals.

Mechanical alloying, characterization and consolidation of Ti-Al-Ni alloys

NASA Technical Reports Server (NTRS)

Nash, P.; Higgins, G. T.; Dillinger, N.; Hwang, S. J.; Kim, H.

1989-01-01

Mechanical alloying is being investigated as a processing route for the production of aluminide intermetallics. This program involves powder production and characterization, consolidation and thermal treatments and determination of microstructure-property relationships. An attritor mill is being used to produce powder in lots up to 1000 grams and the processing parameters are being systematically varied to establish the optimum milling conditions. The mill is being instrumented to generate data related to the processing to provide a basis for theoretical modeling. Powder is being characterized using thermal analysis, optical and electron microscopy and X-ray diffraction. Particle size distributions and powder density are being determined. Consolidation of the powder is being approached in several different ways including, cold isostatic pressing, sintering, extrusion and hot pressing. The results of the program so far will be presented and future directions discussed.

Cognitive Task Analysis of En Route Air Traffic Control: Model Extension and Validation.

ERIC Educational Resources Information Center

Redding, Richard E.; And Others

Phase II of a project extended data collection and analytic procedures to develop a model of expertise and skill development for en route air traffic control (ATC). New data were collected by recording the Dynamic Simulator (DYSIM) performance of five experts with a work overload problem. Expert controllers were interviewed in depth for mental…

Continental-scale river flow in climate models

NASA Technical Reports Server (NTRS)

Miller, James R.; Russell, Gary L.; Caliri, Guilherme

1994-01-01

The hydrologic cycle is a major part of the global climate system. There is an atmospheric flux of water from the ocean surface to the continents. The cycle is closed by return flow in rivers. In this paper a river routing model is developed to use with grid box climate models for the whole earth. The routing model needs an algorithm for the river mass flow and a river direction file, which has been compiled for 4 deg x 5 deg and 2 deg x 2.5 deg resolutions. River basins are defined by the direction files. The river flow leaving each grid box depends on river and lake mass, downstream distance, and an effective flow speed that depends on topography. As input the routing model uses monthly land source runoff from a 5-yr simulation of the NASA/GISS atmospheric climate model (Hansen et al.). The land source runoff from the 4 deg x 5 deg resolution model is quartered onto a 2 deg x 2.5 deg grid, and the effect of grid resolution is examined. Monthly flow at the mouth of the world's major rivers is compared with observations, and a global error function for river flow is used to evaluate the routing model and its sensitivity to physical parameters. Three basinwide parameters are introduced: the river length weighted by source runoff, the turnover rate, and the basinwide speed. Although the values of these parameters depend on the resolution at which the rivers are defined, the values should converge as the grid resolution becomes finer. When the routing scheme described here is coupled with a climate model's source runoff, it provides the basis for closing the hydrologic cycle in coupled atmosphere-ocean models by realistically allowing water to return to the ocean at the correct location and with the proper magnitude and timing.

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

PubMed

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

2018-01-01

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

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

PubMed Central

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

2017-01-01

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

Melissa McCullough

EPA Pesticide Factsheets

As Senior Sustainability Advisor for the EPA Sustainable and Healthy Communities Research Program, Melissa sees Sustainability as the best route for the US to meet long term economic and environmental needs.

A functional near-infrared spectroscopy study of lexical decision task supports the dual route model and the phonological deficit theory of dyslexia.

PubMed

Sela, Itamar; Izzetoglu, Meltem; Izzetoglu, Kurtulus; Onaral, Banu

2014-01-01

The dual route model (DRM) of reading suggests two routes of reading development: the phonological and the orthographic routes. It was proposed that although the two routes are active in the process of reading; the first is more involved at the initial stages of reading acquisition, whereas the latter needs more reading training to mature. A number of studies have shown that deficient phonological processing is a core deficit in developmental dyslexia. According to the DRM, when the Lexical Decision Task (LDT) is performed, the orthographic route should also be involved when decoding words, whereas it is clear that when decoding pseudowords the phonological route should be activated. Previous functional near-infrared spectroscopy (fNIR) studies have suggested that the upper left frontal lobe is involved in decision making in the LDT. The current study used fNIR to compare left frontal lobe activity during LDT performance among three reading-level groups: 12-year-old children, young adult dyslexic readers, and young adult typical readers. Compared to typical readers, the children demonstrated lower activity under the word condition only, whereas the dyslexic readers showed lower activity under the pseudoword condition only. The results provide evidence for upper left frontal lobe involvement in LDT and support the DRM and the phonological deficit theory of dyslexia.

Online shopping interface components: relative importance as peripheral and central cues.

PubMed

Warden, Clyde A; Wu, Wann-Yih; Tsai, Dungchun

2006-06-01

The Elaboration Likelihood Model (ELM) uses central (more thoughtful) and peripheral (less thoughtful) routes of persuasion to maximize communication effectiveness. This research implements ELM to investigate the relative importance of different aspects of the user experience in online shopping. Of all the issues surrounding online shopping, convenience, access to information, and trust were found to be the most important. These were implemented in an online conjoint shopping task. Respondents were found to use the central route of the ELM on marketing messages that involved issues of minimizing travel, information access, and assurances of system security. Users employed the peripheral ELM route when considering usability, price comparison, and personal information protection. A descriptive model of Web-based marketing components, their roles in the central and peripheral routes, and their relative importance to online consumer segments was developed.

Channel erosion surveys along TAPS route, Alaska, 1974

USGS Publications Warehouse

Childers, Joseph; Jones, Stanley H.

1975-01-01

Repeated site surveys and aerial photographs at 26 stream crossings along the trans-Alaska pipeline system (TAPS) route during the period 1969-74 provide chronologie records of channel changes that predate pipeline-related construction at the sites. The 1974 surveys and photographs show some of the channel changes wrought by construction of the haul road from the Yukon River to Prudhoe Bay and by construction of camps and working pads all along the pipeline route. No pipeline crossings were constructed before 1975. These records of channel changes together with flood and icing measurements are part of the United States Department of the lnterior's continuing surveillance program to document the hydrologic aspects of the trans-Alaska pipeline and its environmental impacts.

Routing to preserve energy in wireless networks

NASA Astrophysics Data System (ADS)

Block, Frederick J., IV

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

Occupational exposure to radon for underground tourist routes in Poland: Doses to lung and the risk of developing lung cancer.

PubMed

Walczak, Katarzyna; Olszewski, Jerzy; Politański, Piotr; Zmyślony, Marek

2017-07-14

Radon concentrations for 31 Polish underground tourist routes were analyzed. The equivalent dose to the lung, the effective dose and the relative risk were calculated for employees of the analyzed routes on the grounds of information on radon concentrations, work time, etc. The relative risk for lung cancers was calculated using the Biological Effects of Ionizing Radiation (BEIR) VI Committee model. Equivalent doses to the lungs of workers were determined using the coefficients calculated by the Kendall and Smith. The conversion coefficient proposed by the International Atomic Energy Agency (IAEA) in the report No. 33 was used for estimating the effective doses. In 13 routes, the effective dose was found to be above 1 mSv/year, and in 3 routes, it exceeded 6 mSv/year. For 5 routes, the equivalent dose to lungs was higher than 100 mSv/year, and in 1 case it was as high as 490 mSv/year. In 22.6% of underground workplaces the risk of developing lung cancer among employees was about 2 times higher than that for the general population, and for 1 tourist route it was about 5 times higher. The geometric mean of the relative risk of lung cancer for all workers of underground tourist routes was 1.73 (95% confidence interval (CI): 1.6-1.87). Routes were divided into: caves, mines, post-military underground constructions and urban underground constructions. The difference between levels of the relative risk of developing lung cancer for all types of underground tourist routes was not found to be significant. If we include the professional group of the employees of underground tourist routes into the group of occupational exposure, the number of persons who are included in the Category A due to occupational exposure may increase by about 3/4. The professional group of the employees of underground tourist routes should be monitored for their exposure to radon. Int J Occup Med Environ Health 2017;30(5):687-694. This work is available in Open Access model and licensed under a CC BY-NC 3.0 PL license.

mfpa: Extension of mfp using the ACD covariate transformation for enhanced parametric multivariable modeling.

PubMed

Royston, Patrick; Sauerbrei, Willi

2016-01-01

In a recent article, Royston (2015, Stata Journal 15: 275-291) introduced the approximate cumulative distribution (acd) transformation of a continuous covariate x as a route toward modeling a sigmoid relationship between x and an outcome variable. In this article, we extend the approach to multivariable modeling by modifying the standard Stata program mfp. The result is a new program, mfpa, that has all the features of mfp plus the ability to fit a new model for user-selected covariates that we call fp1( p 1 , p 2 ). The fp1( p 1 , p 2 ) model comprises the best-fitting combination of a dimension-one fractional polynomial (fp1) function of x and an fp1 function of acd ( x ). We describe a new model-selection algorithm called function-selection procedure with acd transformation, which uses significance testing to attempt to simplify an fp1( p 1 , p 2 ) model to a submodel, an fp1 or linear model in x or in acd ( x ). The function-selection procedure with acd transformation is related in concept to the fsp (fp function-selection procedure), which is an integral part of mfp and which is used to simplify a dimension-two (fp2) function. We describe the mfpa command and give univariable and multivariable examples with real data to demonstrate its use.

Research in Network Management Techniques for Tactical Data Communications Network.

DTIC Science & Technology

1982-09-01

the control period. Research areas include Packet Network modelling, adaptive network routing, network design algorithms, network design techniques...contro!lers are designed to perform their limited tasks optimally. For the dynamic routing problem considered here, the local controllers are node...feedback to finding in optimum stead-o-state routing (static strategies) under non - control which can be easily implemented in real time. congested

Calibrating a Rainfall-Runoff and Routing Model for the Continental United States

NASA Astrophysics Data System (ADS)

Jankowfsky, S.; Li, S.; Assteerawatt, A.; Tillmanns, S.; Hilberts, A.

2014-12-01

Catastrophe risk models are widely used in the insurance industry to estimate the cost of risk. The models consist of hazard models linked to vulnerability and financial loss models. In flood risk models, the hazard model generates inundation maps. In order to develop country wide inundation maps for different return periods a rainfall-runoff and routing model is run using stochastic rainfall data. The simulated discharge and runoff is then input to a two dimensional inundation model, which produces the flood maps. In order to get realistic flood maps, the rainfall-runoff and routing models have to be calibrated with observed discharge data. The rainfall-runoff model applied here is a semi-distributed model based on the Topmodel (Beven and Kirkby, 1979) approach which includes additional snowmelt and evapotranspiration models. The routing model is based on the Muskingum-Cunge (Cunge, 1969) approach and includes the simulation of lakes and reservoirs using the linear reservoir approach. Both models were calibrated using the multiobjective NSGA-II (Deb et al., 2002) genetic algorithm with NLDAS forcing data and around 4500 USGS discharge gauges for the period from 1979-2013. Additional gauges having no data after 1979 were calibrated using CPC rainfall data. The model performed well in wetter regions and shows the difficulty of simulating areas with sinks such as karstic areas or dry areas. Beven, K., Kirkby, M., 1979. A physically based, variable contributing area model of basin hydrology. Hydrol. Sci. Bull. 24 (1), 43-69. Cunge, J.A., 1969. On the subject of a flood propagation computation method (Muskingum method), J. Hydr. Research, 7(2), 205-230. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T., 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on evolutionary computation, 6(2), 182-197.

Space Station Freedom secondary power wiring requirements

NASA Technical Reports Server (NTRS)

Sawyer, C. R.

1994-01-01

Secondary power is produced by DDCU's (direct current to direct current converter units) and routed to and through secondary power distribution assemblies (SPDA's) to loads or tertiary distribution assemblies. This presentation outlines requirements of Space Station Freedom (SSF) EEE (electrical, electronic, and electromechanical) parts wire and the approved electrical wire and cable. The SSF PDRD (Program Definition and Requirements Document) language problems and resolution are reviewed. The cable routing to and from the SPDA's is presented as diagrams and the wire recommendations and characteristics are given.

Flight Planning

NASA Technical Reports Server (NTRS)

1991-01-01

Seagull Technology, Inc., Sunnyvale, CA, produced a computer program under a Langley Research Center Small Business Innovation Research (SBIR) grant called STAFPLAN (Seagull Technology Advanced Flight Plan) that plans optimal trajectory routes for small to medium sized airlines to minimize direct operating costs while complying with various airline operating constraints. STAFPLAN incorporates four input databases, weather, route data, aircraft performance, and flight-specific information (times, payload, crew, fuel cost) to provide the correct amount of fuel optimal cruise altitude, climb and descent points, optimal cruise speed, and flight path.

Pain medicine--a new credential in Canada.

PubMed

Morley-Forster, Patricia; Karpinski, Jolanta

2015-06-01

In 2010, Pain Medicine was formally recognized as a subspecialty in Canada by the Royal College of Physicians and Surgeons of Canada, a national organization with oversight of the medical education of specialists in Canada. The first trainees began their training at the Western University, London, Canada in July, 2014. This article traces the process of Pain Medicine's development as a discipline in Canada and outlines its multiple entry routes, 2-year curriculum, and assessment procedures. The application for specialty status was initiated in 2007 with the understanding that while Anesthesiology would be the parent specialty, the curriculum would train clinicians in a multidisciplinary setting. To receive recognition as a Royal College subspecialty, Pain Medicine had to successfully pass through three phases, each stage requiring formal approval by the Committee on Specialties. The multiple entry routes to this 2-year subspecialty program are described in this article as are the objectives of training, the curriculum, assessment of competency and the practice-eligibility route to certification. The process of accreditation of new training programs across Canada is also discussed. The new Pain Medicine training program in Canada will train experts in the prevention, diagnosis, treatment and rehabilitation of the spectrum of acute pain, cancer pain and non-cancer pain problems. These physicians will become leaders in education, research, advocacy and administration of this emerging field. Wiley Periodicals, Inc.

Assessing Program Coverage of Two Approaches to Distributing a Complementary Feeding Supplement to Infants and Young Children in Ghana

PubMed Central

Aaron, Grant J.; Strutt, Nicholas; Boateng, Nathaniel Amoh; Guevarra, Ernest; Siling, Katja; Norris, Alison; Ghosh, Shibani; Nyamikeh, Mercy; Attiogbe, Antoine; Burns, Richard; Foriwa, Esi; Toride, Yasuhiko; Kitamura, Satoshi; Tano-Debrah, Kwaku; Sarpong, Daniel; Myatt, Mark

2016-01-01

The work reported here assesses the coverage achieved by two sales-based approaches to distributing a complementary food supplement (KOKO Plus™) to infants and young children in Ghana. Delivery Model 1 was conducted in the Northern Region of Ghana and used a mixture of health extension workers (delivering behavior change communications and demand creation activities at primary healthcare centers and in the community) and petty traders recruited from among beneficiaries of a local microfinance initiative (responsible for the sale of the complementary food supplement at market stalls and house to house). Delivery Model 2 was conducted in the Eastern Region of Ghana and used a market-based approach, with the product being sold through micro-retail routes (i.e., small shops and roadside stalls) in three districts supported by behavior change communications and demand creation activities led by a local social marketing company. Both delivery models were implemented sub-nationally as 1-year pilot programs, with the aim of informing the design of a scaled-up program. A series of cross-sectional coverage surveys was implemented in each program area. Results from these surveys show that Delivery Model 1 was successful in achieving and sustaining high (i.e., 86%) effective coverage (i.e., the child had been given the product at least once in the previous 7 days) during implementation. Effective coverage fell to 62% within 3 months of the behavior change communications and demand creation activities stopping. Delivery Model 2 was successful in raising awareness of the product (i.e., 90% message coverage), but effective coverage was low (i.e., 9.4%). Future programming efforts should use the health extension / microfinance / petty trader approach in rural settings and consider adapting this approach for use in urban and peri-urban settings. Ongoing behavior change communications and demand creation activities is likely to be essential to the continued success of such programming. PMID:27755554

Assessing Program Coverage of Two Approaches to Distributing a Complementary Feeding Supplement to Infants and Young Children in Ghana.

PubMed

Aaron, Grant J; Strutt, Nicholas; Boateng, Nathaniel Amoh; Guevarra, Ernest; Siling, Katja; Norris, Alison; Ghosh, Shibani; Nyamikeh, Mercy; Attiogbe, Antoine; Burns, Richard; Foriwa, Esi; Toride, Yasuhiko; Kitamura, Satoshi; Tano-Debrah, Kwaku; Sarpong, Daniel; Myatt, Mark

2016-01-01

The work reported here assesses the coverage achieved by two sales-based approaches to distributing a complementary food supplement (KOKO Plus™) to infants and young children in Ghana. Delivery Model 1 was conducted in the Northern Region of Ghana and used a mixture of health extension workers (delivering behavior change communications and demand creation activities at primary healthcare centers and in the community) and petty traders recruited from among beneficiaries of a local microfinance initiative (responsible for the sale of the complementary food supplement at market stalls and house to house). Delivery Model 2 was conducted in the Eastern Region of Ghana and used a market-based approach, with the product being sold through micro-retail routes (i.e., small shops and roadside stalls) in three districts supported by behavior change communications and demand creation activities led by a local social marketing company. Both delivery models were implemented sub-nationally as 1-year pilot programs, with the aim of informing the design of a scaled-up program. A series of cross-sectional coverage surveys was implemented in each program area. Results from these surveys show that Delivery Model 1 was successful in achieving and sustaining high (i.e., 86%) effective coverage (i.e., the child had been given the product at least once in the previous 7 days) during implementation. Effective coverage fell to 62% within 3 months of the behavior change communications and demand creation activities stopping. Delivery Model 2 was successful in raising awareness of the product (i.e., 90% message coverage), but effective coverage was low (i.e., 9.4%). Future programming efforts should use the health extension / microfinance / petty trader approach in rural settings and consider adapting this approach for use in urban and peri-urban settings. Ongoing behavior change communications and demand creation activities is likely to be essential to the continued success of such programming.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order.

PubMed

Xia, Yangkun; Fu, Zhuo; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can't be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution.

Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order

PubMed Central

Xia, Yangkun; Pan, Lijun; Duan, Fenghua

2018-01-01

The vehicle routing problem (VRP) has a wide range of applications in the field of logistics distribution. In order to reduce the cost of logistics distribution, the distance-constrained and capacitated VRP with split deliveries by order (DCVRPSDO) was studied. We show that the customer demand, which can’t be split in the classical VRP model, can only be discrete split deliveries by order. A model of double objective programming is constructed by taking the minimum number of vehicles used and minimum vehicle traveling cost as the first and the second objective, respectively. This approach contains a series of constraints, such as single depot, single vehicle type, distance-constrained and load capacity limit, split delivery by order, etc. DCVRPSDO is a new type of VRP. A new tabu search algorithm is designed to solve the problem and the examples testing show the efficiency of the proposed algorithm. This paper focuses on constructing a double objective mathematical programming model for DCVRPSDO and designing an adaptive tabu search algorithm (ATSA) with good performance to solving the problem. The performance of the ATSA is improved by adding some strategies into the search process, including: (a) a strategy of discrete split deliveries by order is used to split the customer demand; (b) a multi-neighborhood structure is designed to enhance the ability of global optimization; (c) two levels of evaluation objectives are set to select the current solution and the best solution; (d) a discriminating strategy of that the best solution must be feasible and the current solution can accept some infeasible solution, helps to balance the performance of the solution and the diversity of the neighborhood solution; (e) an adaptive penalty mechanism will help the candidate solution be closer to the neighborhood of feasible solution; (f) a strategy of tabu releasing is used to transfer the current solution into a new neighborhood of the better solution. PMID:29763419

Modelling the impact of liner shipping network perturbations on container cargo routing: Southeast Asia to Europe application.

PubMed

Achurra-Gonzalez, Pablo E; Novati, Matteo; Foulser-Piggott, Roxane; Graham, Daniel J; Bowman, Gary; Bell, Michael G H; Angeloudis, Panagiotis

2016-06-03

Understanding how container routing stands to be impacted by different scenarios of liner shipping network perturbations such as natural disasters or new major infrastructure developments is of key importance for decision-making in the liner shipping industry. The variety of actors and processes within modern supply chains and the complexity of their relationships have previously led to the development of simulation-based models, whose application has been largely compromised by their dependency on extensive and often confidential sets of data. This study proposes the application of optimisation techniques less dependent on complex data sets in order to develop a quantitative framework to assess the impacts of disruptive events on liner shipping networks. We provide a categorization of liner network perturbations, differentiating between systemic and external and formulate a container assignment model that minimises routing costs extending previous implementations to allow feasible solutions when routing capacity is reduced below transport demand. We develop a base case network for the Southeast Asia to Europe liner shipping trade and review of accidents related to port disruptions for two scenarios of seismic and political conflict hazards. Numerical results identify alternative routing paths and costs in the aftermath of port disruptions scenarios and suggest higher vulnerability of intra-regional connectivity. Copyright © 2016 Elsevier Ltd. All rights reserved.

Development of flood routing simulation system of digital Qingjiang based on integrated spatial information technology

NASA Astrophysics Data System (ADS)

Yuan, Yanbin; Zhou, You; Zhu, Yaqiong; Yuan, Xiaohui; Sælthun, N. R.

2007-11-01

Based on digital technology, flood routing simulation system development is an important component of "digital catchment". Taking QingJiang catchment as a pilot case, in-depth analysis on informatization of Qingjiang catchment management being the basis, aiming at catchment data's multi-source, - dimension, -element, -subject, -layer and -class feature, the study brings the design thought and method of "subject-point-source database" (SPSD) to design system structure in order to realize the unified management of catchments data in great quantity. Using the thought of integrated spatial information technology for reference, integrating hierarchical structure development model of digital catchment is established. The model is general framework of the flood routing simulation system analysis, design and realization. In order to satisfy the demands of flood routing three-dimensional simulation system, the object-oriented spatial data model are designed. We can analyze space-time self-adapting relation between flood routing and catchments topography, express grid data of terrain by using non-directed graph, apply breadth first search arithmetic, set up search method for the purpose of dynamically searching stream channel on the basis of simulated three-dimensional terrain. The system prototype is therefore realized. Simulation results have demonstrated that the proposed approach is feasible and effective in the application.

Modelling the metabolism of protein secretion through the Tat route in Streptomyces lividans.

PubMed

Valverde, José R; Gullón, Sonia; Mellado, Rafael P

2018-06-14

Streptomyces lividans has demonstrated its value as an efficient host for protein production due to its ability to secrete functional proteins directly to the media. Secretory proteins that use the major Sec route need to be properly folded outside the cell, whereas secretory proteins using the Tat route appear outside the cell correctly folded. This feature makes the Tat system very attractive for the production of natural or engineered Tat secretory proteins. S. lividans cells are known to respond differently to overproduction and secretion of Tat versus Sec proteins. Increased understanding of the impact of protein secretion through the Tat route can be obtained by a deeper analysis of the metabolic impact associated with protein production, and its dependence on protein origin, composition, secretion mechanisms, growth phases and nutrients. Flux Balance Analysis of Genome-Scale Metabolic Network models provides a theoretical framework to investigate cell metabolism under different constraints. We have built new models for various S. lividans strains to better understand the mechanisms associated with overproduction of proteins secreted through the Tat route. We compare models of an S. lividans Tat-dependent agarase overproducing strain with those of the S. lividans wild-type, an S. lividans strain carrying the multi-copy plasmid vector and an α-amylase Sec-dependent overproducing strain. Using updated genomic, transcriptomic and experimental data we could extend existing S. lividans models and produce a new model which produces improved results largely extending the coverage of S. lividans strains, the number of genes and reactions being considered, the predictive behaviour and the dependence on specification of exchange constraints. Comparison of the optimized solutions obtained highlights numerous changes between Tat- and Sec-dependent protein secreting strains affecting the metabolism of carbon, amino acids, nucleotides, lipids and cofactors, and variability analysis predicts a large potential for protein overproduction. This work provides a detailed look to metabolic changes associated to Tat-dependent protein secretion reproducing experimental observations and identifying changes that are specific to each secretory route, presenting a novel, improved, more accurate and strain-independent model of S. lividans, thus opening the way for enhanced metabolic engineering of protein overproduction in S. lividans.

Stereotype Threat-Based Diversity Programming: Helping Students While Empowering and Respecting Faculty

ERIC Educational Resources Information Center

Artze-Vega, Isis; Richardson, Leslie; Traxler, Adrienne

2014-01-01

As college student populations grow increasingly diverse, centers for teaching and learning are often charged with promoting inclusive teaching practices. Yet faculty cite many affective barriers to diversity training, and we often preach to the choir. These challenges led us to seek alternate routes for diversity programming, and stereotype…

Descriptive Profile and Survey of Alternatively Certified Texas Music Educators

ERIC Educational Resources Information Center

Dye, Christopher K.

2018-01-01

The purpose of the study was to examine the features of Texas's Alternative Route to Certification (ARC) programs in music education, the demographics and prior experiences of program completers, and the employment of ARC completers in K-12 public schools. Data were collected from the State Board of Educator Certification about demographics and…

7 CFR 1000.76 - Payments by a handler operating a partially regulated distributing plant.

Code of Federal Regulations, 2011 CFR

2011-01-01

... and pricing program, shall pay to the market administrator for the producer-settlement fund the amount... pooling of producer returns under a State government's milk classification and pricing program shall pay... disposed of as route disposition in the marketing area; (2) For orders with multiple component pricing...

Navigation API Route Fuel Saving Opportunity Assessment on Large-Scale Real-World Travel Data for Conventional Vehicles and Hybrid Electric Vehicles: Preprint

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

Zhu, Lei; Holden, Jacob; Gonder, Jeffrey D

The green routing strategy instructing a vehicle to select a fuel-efficient route benefits the current transportation system with fuel-saving opportunities. This paper introduces a navigation API route fuel-saving evaluation framework for estimating fuel advantages of alternative API routes based on large-scale, real-world travel data for conventional vehicles (CVs) and hybrid electric vehicles (HEVs). The navigation APIs, such Google Directions API, integrate traffic conditions and provide feasible alternative routes for origin-destination pairs. This paper develops two link-based fuel-consumption models stratified by link-level speed, road grade, and functional class (local/non-local), one for CVs and the other for HEVs. The link-based fuel-consumption modelsmore » are built by assigning travel from a large number of GPS driving traces to the links in TomTom MultiNet as the underlying road network layer and road grade data from a U.S. Geological Survey elevation data set. Fuel consumption on a link is calculated by the proposed fuel consumption model. This paper envisions two kinds of applications: 1) identifying alternate routes that save fuel, and 2) quantifying the potential fuel savings for large amounts of travel. An experiment based on a large-scale California Household Travel Survey GPS trajectory data set is conducted. The fuel consumption and savings of CVs and HEVs are investigated. At the same time, the trade-off between fuel saving and time saving for choosing different routes is also examined for both powertrains.« less

A patient with aphasia using the nonsemantic lexical route for Kanji reading.

PubMed

Hashimoto, Kosei; Uno, Akira; Sambai, Ami; Mizumoto, Go

We report a patient with aphasia, caused by cerebral hemorrhage, who probably used the nonsemantic lexical route when reading words aloud. To investigate the mechanisms underlying her reading dysfunction, we analyzed her reading abilities using the Dual-Route Cascaded Model. Language tests resulted in low correct percentages for both reading comprehension and reading nonwords aloud, suggesting problems in the semantic system and the nonlexical route. Conversely, the patient showed high scores on the reading words aloud task. Although she failed to understand many inconsistent-atypical words in the reading comprehension test, she correctly read most words aloud, suggesting that she used the nonsemantic lexical route. In addition, the lexical reading route was analyzed in detail by using inconsistent-atypical Kanji words as stimuli. Finally, we analyzed her reading dysfunction compared with previous cases.

Conditional Routing of Information to the Cortex: A Model of the Basal Ganglia's Role in Cognitive Coordination

ERIC Educational Resources Information Center

Stocco, Andrea; Lebiere, Christian; Anderson, John R.

2010-01-01

The basal ganglia play a central role in cognition and are involved in such general functions as action selection and reinforcement learning. Here, we present a model exploring the hypothesis that the basal ganglia implement a conditional information-routing system. The system directs the transmission of cortical signals between pairs of regions…

Acquiring Regular and Irregular Past Tense Morphemes in English and French: Evidence from Bilingual Children

ERIC Educational Resources Information Center

Nicoladis, Elena; Paradis, Johanne

2012-01-01

The aim of this study was to use crosslinguistic data from French-English bilinguals to test two models of past tense acquisition: (a) single route (all past tense forms rely on morphophonological schemas) and (b) dual route (irregular forms are learned as words, regulars through rules). These models make similar predictions about English…

Gis-Based Route Finding Using ANT Colony Optimization and Urban Traffic Data from Different Sources

NASA Astrophysics Data System (ADS)

Davoodi, M.; Mesgari, M. S.

2015-12-01

Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD), Automatic Number Plate Recognition (ANPR), Floating Car Data (FCD), VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network) is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

A performance evaluation of ACO and SA TSP in a supply chain network

NASA Astrophysics Data System (ADS)

Rao, T. Srinivas

2017-07-01

Supply Chain management and E commerce business solutions are one of the prominent areas of active research. In our paper we have modelled a supply chain model which aggregates all the manufacturers requirement and the products are supplied to all the manufacturer through a common vehicle routing algorithm. An appropriate tsp has been constructed for all the manufacturers which determines the shortest route thru which the aggregated material can be supplied in the shortest possible time. In this paper we have solved the shortest route through constructing a Simulated annealing algorithm and Ant colony algorithm and their performance is evaluated.

Predicting the Coupling Properties of Axially-Textured Materials.

PubMed

Fuentes-Cobas, Luis E; Muñoz-Romero, Alejandro; Montero-Cabrera, María E; Fuentes-Montero, Luis; Fuentes-Montero, María E

2013-10-30

A description of methods and computer programs for the prediction of "coupling properties" in axially-textured polycrystals is presented. Starting data are the single-crystal properties, texture and stereography. The validity and proper protocols for applying the Voigt, Reuss and Hill approximations to estimate coupling properties effective values is analyzed. Working algorithms for predicting mentioned averages are given. Bunge's symmetrized spherical harmonics expansion of orientation distribution functions, inverse pole figures and (single and polycrystals) physical properties is applied in all stages of the proposed methodology. The established mathematical route has been systematized in a working computer program. The discussion of piezoelectricity in a representative textured ferro-piezoelectric ceramic illustrates the application of the proposed methodology. Polycrystal coupling properties, predicted by the suggested route, are fairly close to experimentally measured ones.

Predicting the Coupling Properties of Axially-Textured Materials

PubMed Central

Fuentes-Cobas, Luis E.; Muñoz-Romero, Alejandro; Montero-Cabrera, María E.; Fuentes-Montero, Luis; Fuentes-Montero, María E.

2013-01-01

A description of methods and computer programs for the prediction of “coupling properties” in axially-textured polycrystals is presented. Starting data are the single-crystal properties, texture and stereography. The validity and proper protocols for applying the Voigt, Reuss and Hill approximations to estimate coupling properties effective values is analyzed. Working algorithms for predicting mentioned averages are given. Bunge’s symmetrized spherical harmonics expansion of orientation distribution functions, inverse pole figures and (single and polycrystals) physical properties is applied in all stages of the proposed methodology. The established mathematical route has been systematized in a working computer program. The discussion of piezoelectricity in a representative textured ferro-piezoelectric ceramic illustrates the application of the proposed methodology. Polycrystal coupling properties, predicted by the suggested route, are fairly close to experimentally measured ones. PMID:28788370

An integrated modeling approach for estimating the water quality benefits of conservation practices at the river basin scale.

PubMed

Santhi, C; Kannan, N; White, M; Di Luzio, M; Arnold, J G; Wang, X; Williams, J R

2014-01-01

The USDA initiated the Conservation Effects Assessment Project (CEAP) to quantify the environmental benefits of conservation practices at regional and national scales. For this assessment, a sampling and modeling approach is used. This paper provides a technical overview of the modeling approach used in CEAP cropland assessment to estimate the off-site water quality benefits of conservation practices using the Ohio River Basin (ORB) as an example. The modeling approach uses a farm-scale model, Agricultural Policy Environmental Extender (APEX), and a watershed scale model (the Soil and Water Assessment Tool [SWAT]) and databases in the Hydrologic Unit Modeling for the United States system. Databases of land use, soils, land use management, topography, weather, point sources, and atmospheric depositions were developed to derive model inputs. APEX simulates the cultivated cropland, Conserve Reserve Program land, and the practices implemented on them, whereas SWAT simulates the noncultivated land (e.g., pasture, range, urban, and forest) and point sources. Simulation results from APEX are input into SWAT. SWAT routes all sources, including APEX's, to the basin outlet through each eight-digit watershed. Each basin is calibrated for stream flow, sediment, and nutrient loads at multiple gaging sites and turned in for simulating the effects of conservation practice scenarios on water quality. Results indicate that sediment, nitrogen, and phosphorus loads delivered to the Mississippi River from ORB could be reduced by 16, 15, and 23%, respectively, due to current conservation practices. Modeling tools are useful to provide science-based information for assessing existing conservation programs, developing future programs, and developing insights on load reductions necessary for hypoxia in the Gulf of Mexico. Copyright © by the American Society of Agronomy, Crop Science Society of America, and Soil Science Society of America, Inc.

Optimal route discovery for soft QOS provisioning in mobile ad hoc multimedia networks

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

In this paper, we propose an optimal routing discovery algorithm for ad hoc multimedia networks whose resource keeps changing, First, we use stochastic models to measure the network resource availability, based on the information about the location and moving pattern of the nodes, as well as the link conditions between neighboring nodes. Then, for a certain multimedia packet flow to be transmitted from a source to a destination, we formulate the optimal soft-QoS provisioning problem as to find the best route that maximize the probability of satisfying its desired QoS requirements in terms of the maximum delay constraints. Based on the stochastic network resource model, we developed three approaches to solve the formulated problem: A centralized approach serving as the theoretical reference, a distributed approach that is more suitable to practical real-time deployment, and a distributed dynamic approach that utilizes the updated time information to optimize the routing for each individual packet. Examples of numerical results demonstrated that using the route discovered by our distributed algorithm in a changing network environment, multimedia applications could achieve better QoS statistically.

Quantifying the Effects of Idle-Stop Systems on Fuel Economy in Light-Duty Passenger Vehicles

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

Jeff Wishart; Matthew Shirk

2012-12-01

Vehicles equipped with idle-stop (IS) systems are capable of engine shut down when the vehicle is stopped and rapid engine re-start for the vehicle launch. This capability reduces fuel consumption and emissions during periods when the engine is not being utilized to provide propulsion or to power accessories. IS systems are a low-cost and fast-growing technology in the industry-wide pursuit of increased vehicle efficiency, possibly becoming standard features in European vehicles in the near future. In contrast, currently there are only three non-hybrid vehicle models for sale in North America with IS systems and these models are distinctly low-volume models.more » As part of the United States Department of Energy’s Advanced Vehicle Testing Activity, ECOtality North America has tested the real-world effect of IS systems on fuel consumption in three vehicle models imported from Europe. These vehicles were chosen to represent three types of systems: (1) spark ignition with 12-V belt alternator starter; (2) compression ignition with 12-V belt alternator starter; and (3) direct-injection spark ignition, with 12-V belt alternator starter/combustion restart. The vehicles have undergone both dynamometer and on-road testing; the test results show somewhat conflicting data. The laboratory data and the portion of the on-road data in which driving is conducted on a prescribed route with trained drivers produced significant fuel economy improvement. However, the fleet data do not corroborate improvement, even though the data show significant engine-off time. It is possible that the effects of the varying driving styles and routes in the fleet testing overshadowed the fuel economy improvements. More testing with the same driver over routes that are similar with the IS system-enabled and disabled is recommended. There is anecdotal evidence that current Environmental Protection Agency fuel economy test procedures do not capture the fuel economy gains that IS systems produce in real-world driving. The program test results provide information on the veracity of these claims.« less

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

NASA Astrophysics Data System (ADS)

Batham, Deepak; Yadav, Dharmendra Singh; Prakash, Shashi

2017-12-01

Elastic optical networks (EONs) provide flexibility to assign wide range of spectral resources to the connection requests. In this manuscript, we address two issues related to spectrum assignment in EONs: the non uniform spectrum assignment along different links of the route and the spectrum fragmentation in the network. To address these issues, two routing and spectrum assignment (RSA) strategies have been proposed: Least Loaded RSA (LLRSA) and Route Fragmentation Aware RSA (RFARSA). The LLRSA allocates spectrum homogeneously along different links in the network, where as RFARSA accords priority to the routes which are less fragmented. To highlight the salient features of the two strategies, two new metrics, route fragmentation index (RFI) and standard deviation (SD) are introduced. RFI is defined as the ratio of non-contiguous FSs to the total available free FSs on the route, and SD relates to the measure of non-uniformity in the allocation of resources on the links in the network. A simulation program has been developed to evaluate the performance of the proposed (LLRSA and RFARSA) strategies, and the existing strategies of shortest path RSA (SPRSA) and spectrum compactness based defragmentation (SCD) strategies, on the metric of RFI, bandwidth blocking probability (BBP), network capacity utilized, and SD. The variation in the metrics on the basis of number of requests and the bandwidth (number of FSs) requested has been studied. It has been conclusively established that the proposed strategies (LLRSA and RFARSA) outperform the existing strategies in terms of all the metrics.

Discussion on the 3D visualizing of 1:200 000 geological map

NASA Astrophysics Data System (ADS)

Wang, Xiaopeng

2018-01-01

Using United States National Aeronautics and Space Administration Shuttle Radar Topography Mission (SRTM) terrain data as digital elevation model (DEM), overlap scanned 1:200 000 scale geological map, program using Direct 3D of Microsoft with C# computer language, the author realized the three-dimensional visualization of the standard division geological map. User can inspect the regional geology content with arbitrary angle, rotating, roaming, and can examining the strata synthetical histogram, map section and legend at any moment. This will provide an intuitionistic analyzing tool for the geological practitioner to do structural analysis with the assistant of landform, dispose field exploration route etc.

Self-Learning Intelligent Agents for Dynamic Traffic Routing on Transportation Networks

NASA Astrophysics Data System (ADS)

Sadek, Add; Basha, Nagi

Intelligent Transportation Systems (ITS) are designed to take advantage of recent advances in communications, electronics, and Information Technology in improving the efficiency and safety of transportation systems. Among the several ITS applications is the notion of Dynamic Traffic Routing (DTR), which involves generating "optimal" routing recommendations to drivers with the aim of maximizing network utilizing. In this paper, we demonstrate the feasibility of using a self-learning intelligent agent to solve the DTR problem to achieve traffic user equilibrium in a transportation network. The core idea is to deploy an agent to a simulation model of a highway. The agent then learns by itself by interacting with the simulation model. Once the agent reaches a satisfactory level of performance, it can then be deployed to the real-world, where it would continue to learn how to refine its control policies over time. To test this concept in this paper, the Cell Transmission Model (CTM) developed by Carlos Daganzo of the University of California at Berkeley is used to simulate a simple highway with two main alternative routes. With the model developed, a Reinforcement Learning Agent (RLA) is developed to learn how to best dynamically route traffic, so as to maximize the utilization of existing capacity. Preliminary results obtained from our experiments are promising. RL, being an adaptive online learning technique, appears to have a great potential for controlling a stochastic dynamic systems such as a transportation system. Furthermore, the approach is highly scalable and applicable to a variety of networks and roadways.

Best Practices Article: Hitting the Target with Transition to Teaching in Mississippi's Poorest School Districts: High Retention Rates through Program Support, Resources, and Strategic Recruitment

ERIC Educational Resources Information Center

Boggan, Matthew K.; Jayroe, Teresa; Alexander, Ben

2016-01-01

In order to assist in alleviating the teaching shortage in poor, rural school districts, also known as Local Education Agencies (LEA's), faculty in the College of Education at Mississippi State University sought funding that would provide financial support for a new alternate route teaching program. This program, known as Learning and Educating…

PLUTONIUM/HIGH-LEVEL VITRIFIED WASTE BDBE DOSE CALCULATION

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

D.C. Richardson

2003-03-19

In accordance with the Nuclear Waste Policy Amendments Act of 1987, Yucca Mountain was designated as the site to be investigated as a potential repository for the disposal of high-level radioactive waste. The Yucca Mountain site is an undeveloped area located on the southwestern edge of the Nevada Test Site (NTS), about 100 miles northwest of Las Vegas. The site currently lacks rail service or an existing right-of-way. If the Yucca Mountain site is found suitable for the repository, rail service is desirable to the Office of Civilian Waste Management (OCRWM) Program because of the potential of rail transportation tomore » reduce costs and to reduce the number of shipments relative to highway transportation. A Preliminary Rail Access Study evaluated 13 potential rail spur options. Alternative routes within the major options were also developed. Each of these options was then evaluated for potential land use conflicts and access to regional rail carriers. Three potential routes having few land use conflicts and having access to regional carriers were recommended for further investigation. Figure 1-1 shows these three routes. The Jean route is estimated to be about 120 miles long, the Carlin route to be about 365 miles long, and Caliente route to be about 365 miles long. The remaining ten routes continue to be monitored and should any of the present conflicts change, a re-evaluation of that route will be made. Complete details of the evaluation of the 13 routes can be found in the previous study. The DOE has not identified any preferred route and recognizes that the transportation issues need a full and open treatment under the National Environmental Policy Act. The issue of transportation will be included in public hearings to support development of the Environmental Impact Statement (EIS) proceedings for either the Monitored Retrievable Storage Facility or the Yucca Mountain Project or both.« less

Chitosan-adjuvanted Mycoplasma gallisepticum bacterin via intraocular administration enhances Mycoplasma gallisepticum protection in commercial layers.

PubMed

Limsatanun, A; Sasipreeyajan, J; Pakpinyo, S

2018-06-01

Mycoplasma gallisepticum (MG) causes respiratory signs and economic losses in the poultry industry. MG vaccination is one of the effective prevention and control measures that have been used around the world. Our previous study demonstrated that chitosan-adjuvanted MG bacterin could effectively reduce pathological lesions induced by MG and that chitosan could be used as an adjuvant in MG bacterin. The present study determining the efficacy of MG bacterins against the Thai MG strain was based on vaccine programs. Seven groups (25 layers/group) were received MG bacterins containing 0.5% chitosan or a commercial bacterin via intramuscular (IM) or intraocular (IO) route at 6 and 10 wk of age. Sham-negative and sham-positive controls were groups 1 and 2, respectively. Group 3: IM route of chitosan bacterin followed by IM route of chitosan bacterin; group 4: commercial bacterin via IM route followed by chitosan bacterin via IO route; group 5: commercial bacterin via IM route followed by commercial bacterin via IM route; group 6: chitosan bacterin via IM followed by chitosan bacterin via IO route; and group 7: chitosan bacterin via IO route followed by chitosan bacterin via IO route were determined. At 16 wk of age, all groups, excluding group 1, were challenged intratracheally with 0.1 mL containing Thai MG strain 107 colony-forming unit. At 17, 18, and 20 wk of age, 5 birds in each group were bled for serological testing and swabbed at the choanal cleft for the quantitative real-time PCR assay, the euthanized and necropsied. The results showed that birds vaccinated with a commercial intramuscular bacterin followed by an intraocularly chitosan adjuvant bacterin showed the best protection against the MG challenge. The study indicated that chitosan could be the effective mucosal adjuvant and increased the effectiveness of MG bacterin.

A Study of Driver's Route Choice Behavior Based on Evolutionary Game Theory

PubMed Central

Jiang, Xiaowei; Ji, Yanjie; Deng, Wei

2014-01-01

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

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

PubMed

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

2014-01-01

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

An Efficient Framework Model for Optimizing Routing Performance in VANETs.

PubMed

Al-Kharasani, Nori M; Zulkarnain, Zuriati Ahmad; Subramaniam, Shamala; Hanapi, Zurina Mohd

2018-02-15

Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistical framework model to address the problem of optimizing routing configuration parameters in Vehicle-to-Vehicle (V2V) communication. Our framework solution is based on the utilization of the network resources to further reflect the current state of the network and to balance the trade-off between frequent changes in network topology and the QoS requirements. It consists of three stages: simulation network stage used to execute different urban scenarios, the function stage used as a competitive approach to aggregate the weighted cost of the factors in a single value, and optimization stage used to evaluate the communication cost and to obtain the optimal configuration based on the competitive cost. The simulation results show significant performance improvement in terms of the Packet Delivery Ratio (PDR), Normalized Routing Load (NRL), Packet loss (PL), and End-to-End Delay (E2ED).

A dual-route cascaded model of reading by deaf adults: evidence for grapheme to viseme conversion.

PubMed

Elliott, Eeva A; Braun, Mario; Kuhlmann, Michael; Jacobs, Arthur M

2012-01-01

There is an ongoing debate whether deaf individuals access phonology when reading, and if so, what impact the ability to access phonology might have on reading achievement. However, the debate so far has been theoretically unspecific on two accounts: (a) the phonological units deaf individuals may have of oral language have not been specified and (b) there seem to be no explicit cognitive models specifying how phonology and other factors operate in reading by deaf individuals. We propose that deaf individuals have representations of the sublexical structure of oral-aural language which are based on mouth shapes and that these sublexical units are activated during reading by deaf individuals. We specify the sublexical units of deaf German readers as 11 "visemes" and incorporate the viseme set into a working model of single-word reading by deaf adults based on the dual-route cascaded model of reading aloud by Coltheart, Rastle, Perry, Langdon, and Ziegler (2001. DRC: A dual route cascaded model of visual word recognition and reading aloud. Psychological Review, 108, 204-256. doi: 10.1037//0033-295x.108.1.204). We assessed the indirect route of this model by investigating the "pseudo-homoviseme" effect using a lexical decision task in deaf German reading adults. We found a main effect of pseudo-homovisemy, suggesting that at least some deaf individuals do automatically access sublexical structure during single-word reading.

Experimental analysis of green roof substrate detention characteristics.

PubMed

Yio, Marcus H N; Stovin, Virginia; Werdin, Jörg; Vesuviano, Gianni

2013-01-01

Green roofs may make an important contribution to urban stormwater management. Rainfall-runoff models are required to evaluate green roof responses to specific rainfall inputs. The roof's hydrological response is a function of its configuration, with the substrate - or growing media - providing both retention and detention of rainfall. The objective of the research described here is to quantify the detention effects due to green roof substrates, and to propose a suitable hydrological modelling approach. Laboratory results from experimental detention tests on green roof substrates are presented. It is shown that detention increases with substrate depth and as a result of increasing substrate organic content. Model structures based on reservoir routing are evaluated, and it is found that a one-parameter reservoir routing model coupled with a parameter that describes the delay to start of runoff best fits the observed data. Preliminary findings support the hypothesis that the reservoir routing parameter values can be defined from the substrate's physical characteristics.

Quasiperiodicity route to chaos in cardiac conduction model

NASA Astrophysics Data System (ADS)

Quiroz-Juárez, M. A.; Vázquez-Medina, R.; Ryzhii, E.; Ryzhii, M.; Aragón, J. L.

2017-01-01

It has been suggested that cardiac arrhythmias are instances of chaos. In particular that the ventricular fibrillation is a form of spatio-temporal chaos that arises from normal rhythm through a quasi-periodicity or Ruelle-Takens-Newhouse route to chaos. In this work, we modify the heterogeneous oscillator model of cardiac conduction system proposed in Ref. [Ryzhii E, Ryzhii M. A heterogeneous coupled oscillator model for simulation of ECG signals. Comput Meth Prog Bio 2014;117(1):40-49. doi:10.1016/j.cmpb.2014.04.009.], by including an ectopic pacemaker that stimulates the ventricular muscle to model arrhythmias. With this modification, the transition from normal rhythm to ventricular fibrillation is controlled by a single parameter. We show that this transition follows the so-called torus of quasi-periodic route to chaos, as verified by using numerical tools such as power spectrum and largest Lyapunov exponent.

Effect of signals on two-route traffic system with real-time information

NASA Astrophysics Data System (ADS)

Tobita, Kazuhiro; Nagatani, Takashi

2012-12-01

We study the effect of signals on the vehicular traffic in the two-route system at the tour-time feedback strategy where the vehicles move ahead through a series of signals. The Nagel-Schreckenberg model is applied to the vehicular motion. The traffic signals are controlled by both cycle time and split. The tour times on two routes fluctuate periodically and alternately. The period increases with decreasing the split. Also, the tour time on each route varies with time by synchronizing with the density. The dependences of tour times and densities on both split and cycle time are clarified.

On the multiple depots vehicle routing problem with heterogeneous fleet capacity and velocity

NASA Astrophysics Data System (ADS)

Hanum, F.; Hartono, A. P.; Bakhtiar, T.

2018-03-01

This current manuscript concerns with the optimization problem arising in a route determination of products distribution. The problem is formulated in the form of multiple depots and time windowed vehicle routing problem with heterogeneous capacity and velocity of fleet. Model includes a number of constraints such as route continuity, multiple depots availability and serving time in addition to generic constraints. In dealing with the unique feature of heterogeneous velocity, we generate a number of velocity profiles along the road segments, which then converted into traveling-time tables. An illustrative example of rice distribution among villages by bureau of logistics is provided. Exact approach is utilized to determine the optimal solution in term of vehicle routes and starting time of service.

Methodology of mixed load customized bus lines and adjustment based on time windows

PubMed Central

Song, Rui

2018-01-01

Custom bus routes need to be optimized to meet the needs of a customized bus for personalized trips of different passengers. This paper introduced a customized bus routing problem in which trips for each depot are given, and each bus stop has a fixed time window within which trips should be completed. Treating a trip as a virtual stop was the first consideration in solving the school bus routing problem (SBRP). Then, the mixed load custom bus routing model was established with a time window that satisfies its requirement and the result were solved by Cplex software. Finally, a simple network diagram with three depots, four pickup stops, and five delivery stops was structured to verify the correctness of the model, and based on the actual example, the result is that all the buses ran 124.42 kilometers, the sum of kilometers was 10.35 kilometers less than before. The paths and departure times of the different busses that were provided by the model were evaluated to meet the needs of the given conditions, thus providing valuable information for actual work. PMID:29320505

A network flow model for load balancing in circuit-switched multicomputers

NASA Technical Reports Server (NTRS)

Bokhari, Shahid H.

1990-01-01

In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends largely on link contention - the variation due to distance between nodes is negligible. This has a major impact on the load balancing problem. In this case, there are some nodes with excess load (sources) and others with deficit load (sinks) and it is required to find a matching of sources to sinks that avoids contention. The problem is made complex by the hardwired routing on currently available machines: the user can control only which nodes communicate but not how the messages are routed. Network flow models of message flow in the mesh and the hypercube were developed to solve this problem. The crucial property of these models is the correspondence between minimum cost flows and correctly routed messages. To solve a given load balancing problem, a minimum cost flow algorithm is applied to the network. This permits one to determine efficiently a maximum contention free matching of sources to sinks which, in turn, tells one how much of the given imbalance can be eliminated without contention.

Effect of the route of administration on the biodistribution of radioiodinated OV-TL 3 F(ab')2 in experimental ovarian cancer.

PubMed

Tibben, J G; Massuger, L F; Boerman, O C; Borm, G F; Claessens, R A; Corstens, F H

1994-11-01

The effect of the route administration on the distribution of radioiodinated OV-TL 3 F(ab')2 was studied in Balb/c female mice with intraperitoneal or subcutaneous ovarian carcinoma xenografts. In the intraperitoneal tumour model in which both ascites and solid tumour deposits were present, intraperitoneal administration resulted in a lower estimated radiation dose to blood as compared with intravenous administration. In this model normalization to equal estimated radiation doses to blood for both routes of administration indicated that a twice as high estimated radiation dose can be guided to solid intraperitoneal tumour deposits following intraperitoneal administration. Evacuation of ascitic tumour cells prior to monoclonal antibody injection further increased the estimated radiation dose to solid intraperitoneal tumour deposits following intraperitoneal delivery. Following simultaneous intravenous and intraperitoneal injection of the monoclonal antibody, tissue uptake showed no relevant differences in the subcutaneous tumour model. Overall, the intraperitoneal route of administration was found to be the best choice for therapeutic delivery of iodine-131 labelled monoclonal antibodies.

Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

PubMed Central

Jin, Junchen

2016-01-01

The shunting schedule of electric multiple units depot (SSED) is one of the essential plans for high-speed train maintenance activities. This paper presents a 0-1 programming model to address the problem of determining an optimal SSED through automatic computing. The objective of the model is to minimize the number of shunting movements and the constraints include track occupation conflicts, shunting routes conflicts, time durations of maintenance processes, and shunting running time. An enhanced particle swarm optimization (EPSO) algorithm is proposed to solve the optimization problem. Finally, an empirical study from Shanghai South EMU Depot is carried out to illustrate the model and EPSO algorithm. The optimization results indicate that the proposed method is valid for the SSED problem and that the EPSO algorithm outperforms the traditional PSO algorithm on the aspect of optimality. PMID:27436998

Resource Optimization Scheme for Multimedia-Enabled Wireless Mesh Networks

PubMed Central

Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md. Jalil; Suh, Doug Young

2014-01-01

Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment. PMID:25111241

Population trajectory of burrowing owls (Athene cunicularia) in eastern Washington

USGS Publications Warehouse

Conway, C.J.; Pardieck, K.L.

2006-01-01

Anecdotal evidence suggests that burrowing owls have declined in Washington. The Washington Department of Fish and Wildlife is currently conducting a status review for burrowing owls which will help determine whether they should be listed as threatened or endangered in the state. To provide insights into the current status of burrowing owls (Athene cunicularia), we analyzed data from the North American Breeding Bird Survey using two analytical approaches to determine their current population trajectory in eastern Washington. We used a one-sample t-test to examine whether trend estimates across all BBS routes in Washington differed from zero. We also used a mixed model analysis to estimate the rate of decline in number of burrowing owls detected between 1968 and 2005. The slope in number of burrowing owls detected was negative for 12 of the 16 BBS routes in Washington that have detected burrowing owls. Numbers of breeding burrowing owls detected in eastern Washington declined at a rate of 1.5% annually. We suggest that all BBS routes that have detected burrowing owls in past years in eastern Washington be surveyed annually and additional surveys conducted to track population trends of burrowing owls at finer spatial scales in eastern Washington. In the meantime, land management and regulatory agencies should ensure that publicly managed areas with breeding burrowing owls are not degraded and should implement education and outreach programs to promote protection of privately owned areas with breeding owls.

Resource optimization scheme for multimedia-enabled wireless mesh networks.

PubMed

Ali, Amjad; Ahmed, Muhammad Ejaz; Piran, Md Jalil; Suh, Doug Young

2014-08-08

Wireless mesh networking is a promising technology that can support numerous multimedia applications. Multimedia applications have stringent quality of service (QoS) requirements, i.e., bandwidth, delay, jitter, and packet loss ratio. Enabling such QoS-demanding applications over wireless mesh networks (WMNs) require QoS provisioning routing protocols that lead to the network resource underutilization problem. Moreover, random topology deployment leads to have some unused network resources. Therefore, resource optimization is one of the most critical design issues in multi-hop, multi-radio WMNs enabled with multimedia applications. Resource optimization has been studied extensively in the literature for wireless Ad Hoc and sensor networks, but existing studies have not considered resource underutilization issues caused by QoS provisioning routing and random topology deployment. Finding a QoS-provisioned path in wireless mesh networks is an NP complete problem. In this paper, we propose a novel Integer Linear Programming (ILP) optimization model to reconstruct the optimal connected mesh backbone topology with a minimum number of links and relay nodes which satisfies the given end-to-end QoS demands for multimedia traffic and identification of extra resources, while maintaining redundancy. We further propose a polynomial time heuristic algorithm called Link and Node Removal Considering Residual Capacity and Traffic Demands (LNR-RCTD). Simulation studies prove that our heuristic algorithm provides near-optimal results and saves about 20% of resources from being wasted by QoS provisioning routing and random topology deployment.

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

PubMed

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

2012-10-01

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

Routing architecture and security for airborne networks

NASA Astrophysics Data System (ADS)

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

2009-05-01

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

DTN routing in body sensor networks with dynamic postural partitioning.

PubMed

Quwaider, Muhannad; Biswas, Subir

2010-11-01

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

Analysis of the single-vehicle cyclic inventory routing problem

NASA Astrophysics Data System (ADS)

Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo, Manel

2012-11-01

The single-vehicle cyclic inventory routing problem (SV-CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer, selected for replenishments, the supplier collects a corresponding fixed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each and to design the vehicle route so that the resulting profit (difference between the total reward and the total logistical cost) is maximised while preventing stockouts at each of the selected customers. This problem appears often as a sub-problem in many logistical problems. In this article, the SV-CIRP is formulated as a mixed-integer program with a nonlinear objective function. After a thorough analysis of the structure of the problem and its features, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of a savings-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general, the gap may get as large as 25%, which justifies the effort to continue exploring and developing exact and approximation algorithms for the SV-CIRP.

Cost-effectiveness of the streamflow-gaging program in Wyoming

USGS Publications Warehouse

Druse, S.A.; Wahl, K.L.

1988-01-01

This report documents the results of a cost-effectiveness study of the streamflow-gaging program in Wyoming. Regression analysis or hydrologic flow-routing techniques were considered for 24 combinations of stations from a 139-station network operated in 1984 to investigate suitability of techniques for simulating streamflow records. Only one station was determined to have sufficient accuracy in the regression analysis to consider discontinuance of the gage. The evaluation of the gaging-station network, which included the use of associated uncertainty in streamflow records, is limited to the nonwinter operation of the 47 stations operated by the Riverton Field Office of the U.S. Geological Survey. The current (1987) travel routes and measurement frequencies require a budget of $264,000 and result in an average standard error in streamflow records of 13.2%. Changes in routes and station visits using the same budget, could optimally reduce the standard error by 1.6%. Budgets evaluated ranged from $235,000 to $400,000. A $235,000 budget increased the optimal average standard error/station from 11.6 to 15.5%, and a $400,000 budget could reduce it to 6.6%. For all budgets considered, lost record accounts for about 40% of the average standard error. (USGS)

On the formulation and solution of an emergency routing problem.

DOT National Transportation Integrated Search

2007-10-01

In this work, we will identify important variables that contribute to : vehicular movement in an emergency environment. In particular, we for- : mulate and pose the Convoy Routing Problem (using far fewer variables : than other important models witho...

Improving Statewide Freight Routing Capabilities for Sub-National Commodity Flows

DOT National Transportation Integrated Search

2012-10-01

The ability to fully understand and accurately characterize freight vehicle route choices is important in helping to inform regional and state decisions. This project recommends improvements to WSDOTs Statewide Freight GIS Network Model to more ac...

The impact of state safe routes to school-related laws on active travel to school policies and practices in U.S. elementary schools.

PubMed

Chriqui, Jamie F; Taber, Daniel R; Slater, Sandy J; Turner, Lindsey; Lowrey, Kerri McGowan; Chaloupka, Frank J

2012-01-01

This study examined the relationship between state laws requiring minimum bussing distances, hazardous route exemptions, sidewalks, crossing guards, speed zones, and traffic control measures around schools and active travel to school (ATS) policies/practices in nationally representative samples of U.S. public elementary schools between 2007-2009. The state laws and school data were compiled through primary legal research and annual mail-back surveys of principals, respectively. Multivariate logistic and zero-inflated poisson regression indicated that all state law categories (except for sidewalks) relate to ATS. These laws should be considered in addition to formal safe routes to school programs as possible influences on ATS. Copyright © 2011 Elsevier Ltd. All rights reserved.

A reconfigurable continuous-flow fluidic routing fabric using a modular, scalable primitive.

PubMed

Silva, Ryan; Bhatia, Swapnil; Densmore, Douglas

2016-07-05

Microfluidic devices, by definition, are required to move liquids from one physical location to another. Given a finite and frequently fixed set of physical channels to route fluids, a primitive design element that allows reconfigurable routing of that fluid from any of n input ports to any n output ports will dramatically change the paradigms by which these chips are designed and applied. Furthermore, if these elements are "regular" regarding their design, the programming and fabrication of these elements becomes scalable. This paper presents such a design element called a transposer. We illustrate the design, fabrication and operation of a single transposer. We then scale this design to create a programmable fabric towards a general-purpose, reconfigurable microfluidic platform analogous to the Field Programmable Gate Array (FPGA) found in digital electronics.

77 FR 71652 - Self-Regulatory Organizations; BATS Y-Exchange, Inc.; Order Granting Approval to Proposed Rule...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-12-03

... flow of eight retail brokers revealed that nearly 100% of their customer market orders were routed to... pilot program to attract additional retail order flow to the Exchange, while also providing the potential for price improvement to such order flow. The Program would be limited to trades occurring at...

Quality Alternative Certification Programs in Special Education Ensure High Retention

ERIC Educational Resources Information Center

Karge, Belinda D.; McCabe, Marjorie

2014-01-01

Market driven alternative routes to teaching have evolved into a quality program option and not just an answer to the teacher shortage. Alternative certification is a viable means of recruiting, training, and certifying those who have a bachelor's degree and a strong desire to enter the field of teaching. California has been a leader in the…

Youth Walking and Biking Rates Vary by Environments around 5 Louisiana Schools

ERIC Educational Resources Information Center

Gustat, Jeanette; Richards, Katherine; Rice, Janet; Andersen, Lori; Parker-Karst, Kathryn; Cole, Shalanda

2015-01-01

Background: The prevalence of obesity in children is high, and many do not meet physical activity recommendations. The Safe Routes to School (SRTS) program encourages school-aged children to walk and bike to school. We assessed the condition of the walking/biking environment around schools in Louisiana prior to the state's first SRTS program.…

Strange Bedfellows in Science Teacher Preparation: Conflicting Perspectives on Social Justice Presented in a Teach for America-University Partnership

ERIC Educational Resources Information Center

McNew-Birren, Jill; Hildebrand, Tyra; Belknap, Gabrielle

2018-01-01

Teach For America (TFA), a widespread and well-known route into the teaching profession, frequently partners with university-based education programs to prepare and certify its corps members. However, university-based teacher education programs frequently emphasize very different understandings of socially just education and priorities for…

Cross-layer protocols optimized for real-time multimedia services in energy-constrained mobile ad hoc networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2003-07-01

Mobile ad hoc networking (MANET) supports self-organizing, mobile infrastructures and enables an autonomous network of mobile nodes that can operate without a wired backbone. Ad hoc networks are characterized by multihop, wireless connectivity via packet radios and by the need for efficient dynamic protocols. All routers are mobile and can establish connectivity with other nodes only when they are within transmission range. Importantly, ad hoc wireless nodes are resource-constrained, having limited processing, memory, and battery capacity. Delivery of high quality-ofservice (QoS), real-time multimedia services from Internet-based applications over a MANET is a challenge not yet achieved by proposed Internet Engineering Task Force (IETF) ad hoc network protocols in terms of standard performance metrics such as end-to-end throughput, packet error rate, and delay. In the distributed operations of route discovery and maintenance, strong interaction occurs across MANET protocol layers, in particular, the physical, media access control (MAC), network, and application layers. The QoS requirements are specified for the service classes by the application layer. The cross-layer design must also satisfy the battery-limited energy constraints, by minimizing the distributed power consumption at the nodes and of selected routes. Interactions across the layers are modeled in terms of the set of concatenated design parameters including associated energy costs. Functional dependencies of the QoS metrics are described in terms of the concatenated control parameters. New cross-layer designs are sought that optimize layer interdependencies to achieve the "best" QoS available in an energy-constrained, time-varying network. The protocol design, based on a reactive MANET protocol, adapts the provisioned QoS to dynamic network conditions and residual energy capacities. The cross-layer optimization is based on stochastic dynamic programming conditions derived from time-dependent models of MANET packet flows. Regulation of network behavior is modeled by the optimal control of the conditional rates of multivariate point processes (MVPPs); these rates depend on the concatenated control parameters through a change of probability measure. The MVPP models capture behavior of many service applications, e.g., voice, video and the self-similar behavior of Internet data sessions. Performance verification of the cross-layer protocols, derived from the dynamic programming conditions, can be achieved by embedding the conditions in a reactive routing protocol for MANETs, in a simulation environment, such as the wireless extension of ns-2. A canonical MANET scenario consists of a distributed collection of battery-powered laptops or hand-held terminals, capable of hosting multimedia applications. Simulation details and performance tradeoffs, not presented, remain for a sequel to the paper.

On the improvement of blood sample collection at clinical laboratories

PubMed Central

2014-01-01

Background Blood samples are usually collected daily from different collection points, such hospitals and health centers, and transported to a core laboratory for testing. This paper presents a project to improve the collection routes of two of the largest clinical laboratories in Spain. These routes must be designed in a cost-efficient manner while satisfying two important constraints: (i) two-hour time windows between collection and delivery, and (ii) vehicle capacity. Methods A heuristic method based on a genetic algorithm has been designed to solve the problem of blood sample collection. The user enters the following information for each collection point: postal address, average collecting time, and average demand (in thermal containers). After implementing the algorithm using C programming, this is run and, in few seconds, it obtains optimal (or near-optimal) collection routes that specify the collection sequence for each vehicle. Different scenarios using various types of vehicles have been considered. Unless new collection points are added or problem parameters are changed substantially, routes need to be designed only once. Results The two laboratories in this study previously planned routes manually for 43 and 74 collection points, respectively. These routes were covered by an external carrier company. With the implementation of this algorithm, the number of routes could be reduced from ten to seven in one laboratory and from twelve to nine in the other, which represents significant annual savings in transportation costs. Conclusions The algorithm presented can be easily implemented in other laboratories that face this type of problem, and it is particularly interesting and useful as the number of collection points increases. The method designs blood collection routes with reduced costs that meet the time and capacity constraints of the problem. PMID:24406140

Precipitation-runoff and streamflow-routing models for the Willamette River basin, Oregon

USGS Publications Warehouse

Laenen, Antonius; Risley, John C.

1997-01-01

With an input of current streamflow, precipitation, and air temperature data the combined runoff and routing models can provide current estimates of streamflow at almost 500 locations on the main stem and major tributaries of the Willamette River with a high degree of accuracy. Relative contributions of surface runoff, subsurface flow, and ground-water flow can be assessed for 1 to 10 HRU classes in each of 253 subbasins identified for precipitation-runoff modeling. Model outputs were used with a water-quality model to simulate the movement of dye in the Pudding River as an example

Pilot Study of the Pharmacokinetics (PK) and Pharmacodynamics (PD) of Tranexamic Acid (TXA) in a Swine (Sus scrofa) and Sheep (Ovis aries) Model

DTIC Science & Technology

2016-04-05

There were differences in bioavailability depending on route and species, and the drug half-life was shorter in pigs, compared to sheep. CONCLUSIONS...expanded to human studies to further explore these alternative routes of administration of TXA. More data is needed to determine ideal dosages via these novel routes as well as the bioavailability profile during ongoing hemorrhage.

Characteristics of couples applying for bibliotherapy via different recruitment strategies: a multivariate comparison.

PubMed

van Lankveld, J J; Grotjohann, Y; van Lokven, B M; Everaerd, W

1999-01-01

This study compared characteristics of couples with different sexual dysfunctions who were recruited for participation in a bibliotherapy program via two routes: in response to media advertisements and through their presence on a waiting list for therapist-administered treatment in an outpatient sexology clinic. Data were collected from 492 subjects (246 couples). Male sexology patients were younger than media-recruited males. However, type of sexual dysfunction accounted for a substantially larger proportion of variance in the demographic and psychometric data. An interaction effect of recruitment strategy and sexual dysfunction type was found with respect to female anorgasmia. We conclude from the absence of differences between the two study groups that the Wills and DePaulo (1991) model of help-seeking behavior for mental problems does not apply to couples with sexual dysfunctions joining a bibliotherapy program who either primarily requested professional treatment or who responded to media advertising.

Can increased leaf photosynthesis be converted into higher crop mass production? A simulation study for rice using the crop model GECROS

PubMed Central

Struik, Paul C.

2017-01-01

Abstract Various genetic engineering routes to enhance C3 leaf photosynthesis have been proposed to improve crop productivity. However, their potential contribution to crop productivity needs to be assessed under realistic field conditions. Using 31 year weather data, we ran the crop model GECROS for rice in tropical, subtropical, and temperate environments, to evaluate the following routes: (1) improving mesophyll conductance (gm); (2) improving Rubisco specificity (Sc/o); (3) improving both gm and Sc/o; (4) introducing C4 biochemistry; (5) introducing C4 Kranz anatomy that effectively minimizes CO2 leakage; (6) engineering the complete C4 mechanism; (7) engineering cyanobacterial bicarbonate transporters; (8) engineering a more elaborate cyanobacterial CO2-concentrating mechanism (CCM) with the carboxysome in the chloroplast; and (9) a mechanism that combines the low ATP cost of the cyanobacterial CCM and the high photosynthetic capacity per unit leaf nitrogen. All routes improved crop mass production, but benefits from Routes 1, 2, and 7 were ≤10%. Benefits were higher in the presence than in the absence of drought, and under the present climate than for the climate predicted for 2050. Simulated crop mass differences resulted not only from the increased canopy photosynthesis competence but also from changes in traits such as light interception and crop senescence. The route combinations gave larger effects than the sum of the effects of the single routes, but only Route 9 could bring an advantage of ≥50% under any environmental conditions. To supercharge crop productivity, exploring a combination of routes in improving the CCM, photosynthetic capacity, and quantum efficiency is required. PMID:28379522

AutoRoute Rapid Flood Inundation Model

DTIC Science & Technology

2013-03-01

Res. 33(2): 309-319. U.S. Army Engineer Hydrologic Engineering Center. 2010. “ HEC - RAS : River Analysis System, User’s Manual, Version 4.1.” Davis...cross-section data does not exist. As such, the AutoRoute model is not meant to be as accurate as models such as HEC - RAS (U.S. Army Engineer...such as HEC - RAS assume that the defined low point of cross sections must be connected. However, in this approach the channel is assumed to be defined

Model for Bi-objective emergency rescue vehicle routing optimization

NASA Astrophysics Data System (ADS)

Yang, Yuhang

2017-03-01

Vehicle routing problem is an important research topic in management science. In this paper, one vehicle can rescue multiple disaster points and two optimization objectives are rescue time and rescue effect. Rescue effect is expressed as the ratio of unloaded material to arrival time when rescue vehicles participate in rescue every time. In this paper, the corresponding emergency rescue model is established and the effectiveness of the model is verified by simulated annealing algorithm. It can provide the basis for practical decision-making.

Quantitative microbial risk assessment of Cryptosporidium and Giardia in well water from a native community of Mexico.

PubMed

Balderrama-Carmona, Ana Paola; Gortáres-Moroyoqui, Pablo; Álvarez-Valencia, Luis Humberto; Castro-Espinoza, Luciano; Balderas-Cortés, José de Jesús; Mondaca-Fernández, Iram; Chaidez-Quiroz, Cristóbal; Meza-Montenegro, María Mercedes

2015-01-01

Cryptosporidium and Giardia are gastrointestinal disease-causing organisms transmitted by the fecal-oral route, zoonotic and prevalent in all socioeconomic segments with greater emphasis in rural communities. The goal of this study was to assess the risk of cryptosporidiosis and giardiasis of Potam dwellers consuming drinking water from communal well water. To achieve the goal, quantitative microbial risk assessment (QMRA) was carried out as follows: (a) identification of Cryptosporidium oocysts and Giardia cysts in well water samples by information collection rule method, (b) assessment of exposure to healthy Potam residents, (c) dose-response modelling, and (d) risk characterization using an exponential model. All well water samples tested were positive for Cryptosporidium and Giardia. The QMRA results indicate a mean of annual risks of 99:100 (0.99) for cryptosporidiosis and 1:1 (1.0) for giardiasis. The outcome of the present study may drive decision-makers to establish an educational and treatment program to reduce the incidence of parasite-borne intestinal infection in the Potam community, and to conduct risk analysis programs in other similar rural communities in Mexico.

Route of delivery to the airway influences the distribution of pulmonary disease but not the outcome of Mycobacterium tuberculosis infection in rhesus macaques.

PubMed

Sibley, Laura; Dennis, Mike; Sarfas, Charlotte; White, Andrew; Clark, Simon; Gleeson, Fergus; McIntyre, Anthony; Rayner, Emma; Pearson, Geoffrey; Williams, Ann; Marsh, Philip; Sharpe, Sally

2016-01-01

Non-human primates (NHP) provide a key component in the preclinical assessment pathway for new TB vaccines. In the established models, Mycobacterium tuberculosis challenge is typically delivered to airways of macaques either by aerosol or bronchoscopic instillation and therefore, an understanding of these delivery routes would facilitate the comparison of data generated from models using different challenge methods. This study compared the clinical effects, antigen-specific IFNγ response profiles and disease burden following delivery of comparable doses of M. tuberculosis to the lungs of rhesus macaques by either aerosol or bronchoscopic instillation. The outcome of infection in terms of clinical effects and overall disease burden was comparable between both routes of challenge. However, the pathology in the lungs differed as disease was localised to the site of inoculation following bronchoscopic instillation while aerosol exposure resulted in lesions being evenly distributed through the lung. Whilst the IFNγ response to PPD was similar, responses to CFP10 and ESAT6 peptide pools measured with an ex vivo ELISPOT differed with regards to responses to the N-terminal regions depending on the route of infection. Both challenge routes therefore provide valid and comparable models for evaluation of new TB vaccines, although subtle differences in host responses may occur. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.

Geographic information system-based healthcare waste management planning for treatment site location and optimal transportation routeing.

PubMed

Shanmugasundaram, Jothiganesh; Soulalay, Vongdeuane; Chettiyappan, Visvanathan

2012-06-01

In Lao People's Democratic Republic (Lao PDR), a growth of healthcare centres, and the environmental hazards and public health risks typically accompanying them, increased the need for healthcare waste (HCW) management planning. An effective planning of an HCW management system including components such as the treatment plant siting and an optimized routeing system for collection and transportation of waste is deemed important. National government offices at developing countries often lack the proper tools and methodologies because of the high costs usually associated with them. However, this study attempts to demonstrate the use of an inexpensive GIS modelling tool for healthcare waste management in the country. Two areas were designed for this study on HCW management, including: (a) locating centralized treatment plants and designing optimum travel routes for waste collection from nearby healthcare facilities; and (b) utilizing existing hospital incinerators and designing optimum routes for collecting waste from nearby healthcare facilities. Spatial analysis paved the way to understand the spatial distribution of healthcare wastes and to identify hotspots of higher waste generating locations. Optimal route models were designed for collecting and transporting HCW to treatment plants, which also highlights constraints in collecting and transporting waste for treatment and disposal. The proposed model can be used as a decision support tool for the efficient management of hospital wastes by government healthcare waste management authorities and hospitals.