GIS-Based Population Model Applied to Nevada Transportation Routes

International Nuclear Information System (INIS)

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

1999-01-01

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

An inventory location routing model with environmental considerations

Directory of Open Access Journals (Sweden)

Lerhlaly Sanaa

2017-01-01

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

A Method for Driving Route Predictions Based on Hidden Markov Model

Directory of Open Access Journals (Sweden)

Ning Ye

2015-01-01

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

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

Science.gov (United States)

2014-01-01

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

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

International Nuclear Information System (INIS)

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

1982-12-01

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

Optimization Model for Headway of a Suburban Bus Route

Directory of Open Access Journals (Sweden)

Xiaohong Jiang

2014-01-01

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

Area Based Models of New Highway Route Growth

OpenAIRE

David Levinson; Wei Chen

2007-01-01

Empirical data and statistical models are used to answer the question of where new highway routes are most likely to be located. High-quality land-use, population distribution and highway network GIS data for the Twin CitiesMetropolitan Area from 1958 to 1990 are developed for this study. The highway system is classified into three levels, Interstate highways, divided highways, and secondary highways. Binary logit models estimate the new route growth probability of divided highways and second...

Human BDCM Mulit-Route PBPK Model

Data.gov (United States)

U.S. Environmental Protection Agency — This data set contains the code for the BDCM human multi-route model written in the programming language acsl. The final published manuscript is provided since it...

Modeling of Complex Life Cycle Prediction Based on Cell Division

Directory of Open Access Journals (Sweden)

Fucheng Zhang

2017-01-01

Full Text Available Effective fault diagnosis and reasonable life expectancy are of great significance and practical engineering value for the safety, reliability, and maintenance cost of equipment and working environment. At present, the life prediction methods of the equipment are equipment life prediction based on condition monitoring, combined forecasting model, and driven data. Most of them need to be based on a large amount of data to achieve the problem. For this issue, we propose learning from the mechanism of cell division in the organism. We have established a moderate complexity of life prediction model across studying the complex multifactor correlation life model. In this paper, we model the life prediction of cell division. Experiments show that our model can effectively simulate the state of cell division. Through the model of reference, we will use it for the equipment of the complex life prediction.

Vertex routing models

International Nuclear Information System (INIS)

Markovic, D; Gros, C

2009-01-01

A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed by cyclic attractors, allowing to define a measure for the information centrality of a vertex given by the number of attractors passing through this vertex. We find the number of vertices having a nonzero information centrality to be extensive/subextensive for models with/without a memory trace in the thermodynamic limit. We evaluate the distribution of the number of cycles, of the cycle length and of the maximal basins of attraction, finding a complete scaling collapse in the thermodynamic limit for the latter. Possible implications of our results for the information flow in social networks are discussed.

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

Science.gov (United States)

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…

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

International Nuclear Information System (INIS)

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

1983-10-01

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

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

Science.gov (United States)

Jin, Fanglei; Zhang, Yongsheng; Liu, Shasha

2017-01-01

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

Route Assessment for Unmanned Aerial Vehicle Based on Cloud Model

Directory of Open Access Journals (Sweden)

Xixia Sun

2014-01-01

Full Text Available An integrated route assessment approach based on cloud model is proposed in this paper, where various sources of uncertainties are well kept and modeled by cloud theory. Firstly, a systemic criteria framework incorporating models for scoring subcriteria is developed. Then, the cloud model is introduced to represent linguistic variables, and survivability probability histogram of each route is converted into normal clouds by cloud transformation, enabling both randomness and fuzziness in the assessment environment to be managed simultaneously. Finally, a new way to measure the similarity between two normal clouds satisfying reflexivity, symmetry, transitivity, and overlapping is proposed. Experimental results demonstrate that the proposed route assessment approach outperforms fuzzy logic based assessment approach with regard to feasibility, reliability, and consistency with human thinking.

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

Science.gov (United States)

Nadi, S.; Houshyaripour, A. H.

2017-09-01

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

Modeling a four-layer location-routing problem

Directory of Open Access Journals (Sweden)

Mohsen Hamidi

2012-01-01

Full Text Available Distribution is an indispensable component of logistics and supply chain management. Location-Routing Problem (LRP is an NP-hard problem that simultaneously takes into consideration location, allocation, and vehicle routing decisions to design an optimal distribution network. Multi-layer and multi-product LRP is even more complex as it deals with the decisions at multiple layers of a distribution network where multiple products are transported within and between layers of the network. This paper focuses on modeling a complicated four-layer and multi-product LRP which has not been tackled yet. The distribution network consists of plants, central depots, regional depots, and customers. In this study, the structure, assumptions, and limitations of the distribution network are defined and the mathematical optimization programming model that can be used to obtain the optimal solution is developed. Presented by a mixed-integer programming model, the LRP considers the location problem at two layers, the allocation problem at three layers, the vehicle routing problem at three layers, and a transshipment problem. The mathematical model locates central and regional depots, allocates customers to plants, central depots, and regional depots, constructs tours from each plant or open depot to customers, and constructs transshipment paths from plants to depots and from depots to other depots. Considering realistic assumptions and limitations such as producing multiple products, limited production capacity, limited depot and vehicle capacity, and limited traveling distances enables the user to capture the real world situations.

1:N Space Division Switches for Optical Routing, Reconfigurable Interconnections, and Time and Wavelength-Division Switching Applications

National Research Council Canada - National Science Library

Shire, D

1998-01-01

... of time-division multiplexing and demultiplexing operations. Hysteresis in the input-output transfer characteristics of the coupled in-plane lasers and VCSELs also leads to bistable operation over a range of bias conditions...

Behavioural Models for Route Choice of Passengers in Multimodal Public Transport Networks

DEFF Research Database (Denmark)

Anderson, Marie Karen

in the estimation of route choice models of public transport users based upon observed choices. Public transport route choice models have not benefitted from the same technological enhancements as car models because of the necessity (i) to collect additional information concerning lines and transfers, and (ii...... modes, public transport modes, lines, transfers, egress modes) is large. This thesis proposes a doubly stochastic approach for generating alternative routes that are relevant to travellers, since the method allows accounting for both perceived costs of the network elements and heterogeneity......The subject of this thesis is behavioural models for route choice of passengers in multimodal public transport networks. While research in sustainable transport has dedicated much attention toward the determinants of choice between car and sustainable travel options, it has devoted less attention...

Discrete Optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints

Science.gov (United States)

Juliandri, Dedy; Mawengkang, Herman; Bu'ulolo, F.

2018-01-01

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers’ demand. The problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. The goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. The objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

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

Directory of Open Access Journals (Sweden)

Zhengyu Duan

2015-11-01

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

Risk Route Choice Analysis and the Equilibrium Model under Anticipated Regret Theory

Directory of Open Access Journals (Sweden)

pengcheng yuan

2014-02-01

Full Text Available The assumption about travellers’ route choice behaviour has major influence on the traffic flow equilibrium analysis. Previous studies about the travellers’ route choice were mainly based on the expected utility maximization theory. However, with the gradually increasing knowledge about the uncertainty of the transportation system, the researchers have realized that there is much constraint in expected util­ity maximization theory, because expected utility maximiza­tion requires travellers to be ‘absolutely rational’; but in fact, travellers are not truly ‘absolutely rational’. The anticipated regret theory proposes an alternative framework to the tra­ditional risk-taking in route choice behaviour which might be more scientific and reasonable. We have applied the antici­pated regret theory to the analysis of the risk route choosing process, and constructed an anticipated regret utility func­tion. By a simple case which includes two parallel routes, the route choosing results influenced by the risk aversion degree, regret degree and the environment risk degree have been analyzed. Moreover, the user equilibrium model based on the anticipated regret theory has been established. The equivalence and the uniqueness of the model are proved; an efficacious algorithm is also proposed to solve the model. Both the model and the algorithm are demonstrated in a real network. By an experiment, the model results and the real data have been compared. It was found that the model re­sults can be similar to the real data if a proper regret degree parameter is selected. This illustrates that the model can better explain the risk route choosing behaviour. Moreover, it was also found that the traveller’ regret degree increases when the environment becomes more and more risky.

Rigorous Progress on Algorithms Based Routing and Wavelength Assignment in Trans-Egypt Network (TEGYNET) Management

OpenAIRE

Abd El–Naser A. Mohammed; Ahmed Nabih Zaki Rashed; Osama S. Fragallah; Mohamed G. El-Abyad

2013-01-01

In simple wavelength-division multiplexed (WDM) networks, a connection must be established along a route using a common wavelength on all of the links along the route. The introduction of wavelength converters into WDM cross connects increases the hardware cost and complexity. Given a set of connection requests, the routing and wavelength assignment problem involves finding a route (routing) and assigning a wavelength to each request. This paper has presented the WDM technology is being exten...

Modeling route choice criteria from home to major streets: A discrete choice approach

Directory of Open Access Journals (Sweden)

Jose Osiris Vidana-Bencomo

2018-03-01

Full Text Available A discrete choice model that consists of three sub-models was developed to investigates the route choice criteria of drivers who travel from their homes in the morning to the access point along the major streets that bound the Traffic Analysis Zones (TAZs. The first sub-model is a Nested Logit Model (NLM that estimates the probability of a driver has or has no multiple routes, and if the driver has multiple routes, the route selection criteria are based on the access point’s intersection control type or other factors. The second sub-model is a Mixed Logit (MXL model. It estimates the probabilities of the type of intersection control preferred by a driver. The third sub-model is a NLM that estimates the probabilities of a driver selecting his/her route for its shortest travel time or to avoid pedestrian, and if the aim is to take the fastest route, the decision criteria is based on the shortest distance or minimum stops and turns. Data gathered in a questionnaire survey were used to estimate the sub-models. The attributes of the utility functions of the sub-models are the driver’s demographic and trip characteristics. The model provides a means for transportation planners to distribute the total number of home-based trips generated within a TAZ to the access points along the major streets that bound the TAZ.

Routing and Scheduling Optimization Model of Sea Transportation

Science.gov (United States)

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.

A multicast tree aggregation algorithm in wavelength-routed WDM networks

Science.gov (United States)

Cheng, Hsu-Chen; Kuo, Chin-Chun; Lin, Frank Y.

2005-02-01

Wavelength division multiplexing (WDM) has been considered a promising transmission technology in optical communication networks. With the continuous advance in optical technology, WDM network will play an important role in wide area backbone networks. Optical wavelength switching, compared with optical packet switching, is a more mature and more cost-effective choice for optical switching technologies. Besides, the technology of time division multiplexing in optical communication networks has been working smoothly for a long time. In the proposed research, the problem of multicast groups aggregation and multicast routing and wavelength assignment in wavelength-routed WDM network is studied. The optical cross connect switches in the problem are assumed to have limited optical multicast/splitting and TDM functionalities. Given the physical network topology and capacity, the objective is to maximize the total revenue by means of utmost merging multicast groups into larger macro-groups. The groups in the same macro-group will share a multicast tree to conduct data transmission. The problem is formulated as an optimization problem, where the objective function is to maximize the total revenue subject to capacity constraints of components in the optical network, wavelength continuity constraints, and tree topology constraints. The decision variables in the formulations include the merging results between groups, multicast tree routing assignment and wavelength assignment. The basic approach to the algorithm development for this model is Lagrangean relaxation in conjunction with a number of optimization techniques. In computational experiments, the proposed algorithms are evaluated on different network topologies and perform efficiently and effectively according to the experiment results.

Epidemic metapopulation model with traffic routing in scale-free networks

International Nuclear Information System (INIS)

Huang, Wei; Chen, Shengyong

2011-01-01

In this paper, we propose a model incorporating both the traffic routing dynamics and the virus prevalence dynamics. In this model, each packet may be isolated from the network on its transporting path, which means that the packet cannot be successfully delivered to its destination. In contrast, a successful transport means that a packet can be delivered from source to destination without being isolated. The effects of model parameters on the delivery success rate and the delivery failure rate are intensively studied and analyzed. Several routing strategies are performed for our model. Results show that the shortest path routing strategy is the most effective for enhancing the delivery success rate, especially when each packet is only allowed to be delivered to the neighbor with the lowest degree along the shortest path. We also find that, by minimizing the sum of the nodes' degree along the transporting path, we can also obtain a satisfactory delivery success rate

Spectral encoded optical label detection for dynamic routing of impulse radio ultra-wideband signals in metro-access networks

DEFF Research Database (Denmark)

Osadchiy, Alexey Vladimirovich; Yu, Xianbin; Yin, Xiaoli

2010-01-01

In this paper we propose and experimentally demonstrate the principle of coherent label detection for dynamic routing of wavelength division multiplexed impulse radio ultra-wideband signals by using four-tone spectral amplitude coded labels.......In this paper we propose and experimentally demonstrate the principle of coherent label detection for dynamic routing of wavelength division multiplexed impulse radio ultra-wideband signals by using four-tone spectral amplitude coded labels....

SDN-enabled dynamic WDM networks to address routing information inaccuracy

CSIR Research Space (South Africa)

Ravhuanzwo, Lusani

2016-11-01

Full Text Available Large dynamic wavelength-division multiplexed (WDM) networks based on the distributed control mechanism are susceptible to routing information inaccuracies. Factors such as non-negligible propagation delays, infrequent network state updates...

A novel model of magnetorheological damper with hysteresis division

Science.gov (United States)

Yu, Jianqiang; Dong, Xiaomin; Zhang, Zonglun

2017-10-01

Due to the complex nonlinearity of magnetorheological (MR) behavior, the modeling of MR dampers is a challenge. A simple and effective model of MR damper remains a work in progress. A novel model of MR damper is proposed with force-velocity hysteresis division method in this study. A typical hysteresis loop of MR damper can be simply divided into two novel curves with the division idea. One is the backbone curve and the other is the branch curve. The exponential-family functions which capturing the characteristics of the two curves can simplify the model and improve the identification efficiency. To illustrate and validate the novel phenomenological model with hysteresis division idea, a dual-end MR damper is designed and tested. Based on the experimental data, the characteristics of the novel curves are investigated. To simplify the parameters identification and obtain the reversibility, the maximum force part, the non-dimensional backbone part and the non-dimensional branch part are derived from the two curves. The maximum force part and the non-dimensional part are in multiplication type add-rule. The maximum force part is dependent on the current and maximum velocity. The non-dominated sorting genetic algorithm II (NSGA II) based on the design of experiments (DOE) is employed to identify the parameters of the normalized shape functions. Comparative analysis is conducted based on the identification results. The analysis shows that the novel model with few identification parameters has higher accuracy and better predictive ability.

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

Science.gov (United States)

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

AutoRoute Rapid Flood Inundation Model

Science.gov (United States)

2013-03-01

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

Capacitated Bounded Cardinality Hub Routing Problem: Model and Solution Algorithm

OpenAIRE

Gelareha, Shahin; Monemic, Rahimeh Neamatian; Semetd, Frederic

2017-01-01

In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein each hub acts as a transshipment node for one directed route. The number of hubs lies between a minimum and a maximum and the hub-level network is a complete subgraph. The transshipment operations take place at the hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoke- to-hub allocations. We propose a mathematical model and a branch-and-cut algor...

Two models of the capacitated vehicle routing problem

Directory of Open Access Journals (Sweden)

Zuzana Borčinova

2017-01-01

Full Text Available The aim of the Capacitated Vehicle Routing Problem (CVRP is to find a set of minimum total cost routes for a fleet of capacitated vehicles based at a single depot, to serve a set of customers. There exist various integer linear programming models of the CVRP. One of the main differences lies in the way to eliminate sub-tours, i.e. cycles that do not go through the depot. In this paper, we describe a well-known flow formulation of CVRP, where sub-tour elimination constraints have a cardinality exponentially growing with the number of customers. Then we present a mixed linear programming formulation with polynomial cardinality of sub-tour elimination constraints. Both of the models were implemented and compared on several benchmarks.

Phone Routing using the Dynamic Memory Model

DEFF Research Database (Denmark)

Bendtsen, Claus Nicolaj; Krink, Thiemo

2002-01-01

In earlier studies a genetic algorithm (GA) extended with the dynamic memory model has shown remarkable performance on real-world-like problems. In this paper we experiment with routing in communication networks and show that the dynamic memory GA performs remarkable well compared to ant colony...

The Time Division Multi-Channel Communication Model and the Correlative Protocol Based on Quantum Time Division Multi-Channel Communication

International Nuclear Information System (INIS)

Liu Xiao-Hui; Pei Chang-Xing; Nie Min

2010-01-01

Based on the classical time division multi-channel communication theory, we present a scheme of quantum time-division multi-channel communication (QTDMC). Moreover, the model of quantum time division switch (QTDS) and correlative protocol of QTDMC are proposed. The quantum bit error rate (QBER) is analyzed and the QBER simulation test is performed. The scheme shows that the QTDS can carry out multi-user communication through quantum channel, the QBER can also reach the reliability requirement of communication, and the protocol of QTDMC has high practicability and transplantable. The scheme of QTDS may play an important role in the establishment of quantum communication in a large scale in the future. (general)

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

Directory of Open Access Journals (Sweden)

Yi Yang

2014-01-01

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

Stochastic Individual-Based Modeling of Bacterial Growth and Division Using Flow Cytometry

Directory of Open Access Journals (Sweden)

Míriam R. García

2018-01-01

Full Text Available A realistic description of the variability in bacterial growth and division is critical to produce reliable predictions of safety risks along the food chain. Individual-based modeling of bacteria provides the theoretical framework to deal with this variability, but it requires information about the individual behavior of bacteria inside populations. In this work, we overcome this problem by estimating the individual behavior of bacteria from population statistics obtained with flow cytometry. For this objective, a stochastic individual-based modeling framework is defined based on standard assumptions during division and exponential growth. The unknown single-cell parameters required for running the individual-based modeling simulations, such as cell size growth rate, are estimated from the flow cytometry data. Instead of using directly the individual-based model, we make use of a modified Fokker-Plank equation. This only equation simulates the population statistics in function of the unknown single-cell parameters. We test the validity of the approach by modeling the growth and division of Pediococcus acidilactici within the exponential phase. Estimations reveal the statistics of cell growth and division using only data from flow cytometry at a given time. From the relationship between the mother and daughter volumes, we also predict that P. acidilactici divide into two successive parallel planes.

A model-based eco-routing strategy for electric vehicles in large urban networks

OpenAIRE

De Nunzio , Giovanni; Thibault , Laurent; Sciarretta , Antonio

2016-01-01

International audience; A novel eco-routing navigation strategy and energy consumption modeling approach for electric vehicles are presented in this work. Speed fluctuations and road network infrastructure have a large impact on vehicular energy consumption. Neglecting these effects may lead to large errors in eco-routing navigation, which could trivially select the route with the lowest average speed. We propose an energy consumption model that considers both accelerations and impact of the ...

Performance modeling of neighbor discovery in proactive routing protocols

Directory of Open Access Journals (Sweden)

Andres Medina

2011-07-01

Full Text Available It is well known that neighbor discovery is a critical component of proactive routing protocols in wireless ad hoc networks. However there is no formal study on the performance of proposed neighbor discovery mechanisms. This paper provides a detailed model of key performance metrics of neighbor discovery algorithms, such as node degree and the distribution of the distance to symmetric neighbors. The model accounts for the dynamics of neighbor discovery as well as node density, mobility, radio and interference. The paper demonstrates a method for applying these models to the evaluation of global network metrics. In particular, it describes a model of network connectivity. Validation of the models shows that the degree estimate agrees, within 5% error, with simulations for the considered scenarios. The work presented in this paper serves as a basis for the performance evaluation of remaining performance metrics of routing protocols, vital for large scale deployment of ad hoc networks.

Evolution of self-organized division of labor in a response threshold model

NARCIS (Netherlands)

Duarte, Ana; Pen, Ido; Keller, Laurent; Weissing, Franz J.

Division of labor in social insects is determinant to their ecological success. Recent models emphasize that division of labor is an emergent property of the interactions among nestmates obeying to simple behavioral rules. However, the role of evolution in shaping these rules has been largely

A Day-to-Day Route Choice Model Based on Reinforcement Learning

Directory of Open Access Journals (Sweden)

Fangfang Wei

2014-01-01

Full Text Available Day-to-day traffic dynamics are generated by individual traveler’s route choice and route adjustment behaviors, which are appropriate to be researched by using agent-based model and learning theory. In this paper, we propose a day-to-day route choice model based on reinforcement learning and multiagent simulation. Travelers’ memory, learning rate, and experience cognition are taken into account. Then the model is verified and analyzed. Results show that the network flow can converge to user equilibrium (UE if travelers can remember all the travel time they have experienced, but which is not necessarily the case under limited memory; learning rate can strengthen the flow fluctuation, but memory leads to the contrary side; moreover, high learning rate results in the cyclical oscillation during the process of flow evolution. Finally, both the scenarios of link capacity degradation and random link capacity are used to illustrate the model’s applications. Analyses and applications of our model demonstrate the model is reasonable and useful for studying the day-to-day traffic dynamics.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

Model-Checking Driven Design of QoS-Based Routing Protocol for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Zhi Chen

2015-01-01

Full Text Available Accurate and reliable routing protocols with Quality of Service (QoS support determine the mission-critical application efficiency in WSNs. This paper proposes a model-checking design driven framework for designing the QoS-based routing protocols of WSNs, which involves the light-weight design process, the timed automata model, and the alternative QoS verification properties. The accurate feedback of continually model checking in the iterative design process effectively stimulates the parameter tuning of the protocols. We demonstrate the straightforward and modular characteristics of the proposed framework in designing a prototype QoS-based routing protocol. The prototype study shows that the model-checking design framework may complement other design methods and ensure the QoS implementation of the QoS-based routing protocol design for WSNs.

Strategic Air Traffic Planning Using Eulerian Route Based Modeling and Optimization

Science.gov (United States)

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

Phased-array-based photonic integrated circuits for wavelength division multiplexing applications

NARCIS (Netherlands)

Staring, A.A.M.; Smit, M.K.

1997-01-01

Wavelength division multiplexing (WDM) technology provides many options to the design of flexible all-optical networks. In order to exploit these options to their full potential, photonic integrated circuits (PICs) for wavelength routing and switching will be indispensable. One of the basic building

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

Directory of Open Access Journals (Sweden)

Xinjun Lai

2016-06-01

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

Spatial-phase code-division multiple-access system with multiplexed Fourier holography switching for reconfigurable optical interconnection

Science.gov (United States)

Takasago, Kazuya; Takekawa, Makoto; Shirakawa, Atsushi; Kannari, Fumihiko

2000-05-01

A new, to our knowledge, space-variant optical interconnection system based on a spatial-phase code-division multiple-access technique with multiplexed Fourier holography is described. In this technique a signal beam is spread over wide spatial frequencies by an M -sequence pseudorandom phase code. At a receiver side a selected signal beam is properly decoded, and at the same time its spatial pattern is shaped with a Fourier hologram, which is recorded by light that is encoded with the same M -sequence phase mask as the desired signal beam and by light whose spatial beam pattern is shaped to a signal routing pattern. Using the multiplexed holography, we can simultaneously route multisignal flows into individually specified receiver elements. The routing pattern can also be varied by means of switching the encoding phase code or replacing the hologram. We demonstrated a proof-of-principle experiment with a doubly multiplexed hologram that enables simultaneous routing of two signal beams. Using a numerical model, we showed that the proposed scheme can manage more than 250 routing patterns for one signal flow with one multiplexed hologram at a signal-to-noise ratio of 5.

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

Science.gov (United States)

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

2018-01-01

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

Gain control through divisive inhibition prevents abrupt transition to chaos in a neural mass model.

Science.gov (United States)

Papasavvas, Christoforos A; Wang, Yujiang; Trevelyan, Andrew J; Kaiser, Marcus

2015-09-01

Experimental results suggest that there are two distinct mechanisms of inhibition in cortical neuronal networks: subtractive and divisive inhibition. They modulate the input-output function of their target neurons either by increasing the input that is needed to reach maximum output or by reducing the gain and the value of maximum output itself, respectively. However, the role of these mechanisms on the dynamics of the network is poorly understood. We introduce a novel population model and numerically investigate the influence of divisive inhibition on network dynamics. Specifically, we focus on the transitions from a state of regular oscillations to a state of chaotic dynamics via period-doubling bifurcations. The model with divisive inhibition exhibits a universal transition rate to chaos (Feigenbaum behavior). In contrast, in an equivalent model without divisive inhibition, transition rates to chaos are not bounded by the universal constant (non-Feigenbaum behavior). This non-Feigenbaum behavior, when only subtractive inhibition is present, is linked to the interaction of bifurcation curves in the parameter space. Indeed, searching the parameter space showed that such interactions are impossible when divisive inhibition is included. Therefore, divisive inhibition prevents non-Feigenbaum behavior and, consequently, any abrupt transition to chaos. The results suggest that the divisive inhibition in neuronal networks could play a crucial role in keeping the states of order and chaos well separated and in preventing the onset of pathological neural dynamics.

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

International Nuclear Information System (INIS)

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

2014-01-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

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

Science.gov (United States)

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.

Modeling and Tool Wear in Routing of CFRP

International Nuclear Information System (INIS)

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

2011-01-01

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

Chlorpyrifos PBPK/PD model for multiple routes of exposure.

Science.gov (United States)

Poet, Torka S; Timchalk, Charles; Hotchkiss, Jon A; Bartels, Michael J

2014-10-01

1. Chlorpyrifos (CPF) is an important pesticide used to control crop insects. Human Exposures to CPF will occur primarily through oral exposure to residues on foods. A physiologically based pharmacokinetic/pharmacodynamic (PBPK/PD) model has been developed that describes the relationship between oral, dermal and inhalation doses of CPF and key events in the pathway for cholinergic effects. The model was built on a prior oral model that addressed age-related changes in metabolism and physiology. This multi-route model was developed in rats and humans to validate all scenarios in a parallelogram design. 2. Critical biological effects from CPF exposure require metabolic activation to CPF oxon, and small amounts of metabolism in tissues will potentially have a great effect on pharmacokinetics and pharmacodynamic outcomes. Metabolism (bioactivation and detoxification) was therefore added in diaphragm, brain, lung and skin compartments. Pharmacokinetic data are available for controlled human exposures via the oral and dermal routes and from oral and inhalation studies in rats. The validated model was then used to determine relative dermal versus inhalation uptake from human volunteers exposed to CPF in an indoor scenario.

An Alternative Route to Teaching Fraction Division: Abstraction of Common Denominator Algorithm

Science.gov (United States)

Zembat, Ismail Özgür

2015-01-01

From a curricular stand point, the traditional invert and multiply algorithm for division of fractions provides few affordances for linking to a rich understanding of fractions. On the other hand, an alternative algorithm, called common denominator algorithm, has many such affordances. The current study serves as an argument for shifting…

Gain control through divisive inhibition prevents abrupt transition to chaos in a neural mass model

Science.gov (United States)

Papasavvas, Christoforos A.; Wang, Yujiang; Trevelyan, Andrew J.; Kaiser, Marcus

2016-01-01

Experimental results suggest that there are two distinct mechanisms of inhibition in cortical neuronal networks: subtractive and divisive inhibition. They modulate the input-output function of their target neurons either by increasing the input that is needed to reach maximum output or by reducing the gain and the value of maximum output itself, respectively. However, the role of these mechanisms on the dynamics of the network is poorly understood. We introduce a novel population model and numerically investigate the influence of divisive inhibition on network dynamics. Specifically, we focus on the transitions from a state of regular oscillations to a state of chaotic dynamics via period-doubling bifurcations. The model with divisive inhibition exhibits a universal transition rate to chaos (Feigenbaum behavior). In contrast, in an equivalent model without divisive inhibition, transition rates to chaos are not bounded by the universal constant (non-Feigenbaum behavior). This non-Feigenbaum behavior, when only subtractive inhibition is present, is linked to the interaction of bifurcation curves in the parameter space. Indeed, searching the parameter space showed that such interactions are impossible when divisive inhibition is included. Therefore, divisive inhibition prevents non-Feigenbaum behavior and, consequently, any abrupt transition to chaos. The results suggest that the divisive inhibition in neuronal networks could play a crucial role in keeping the states of order and chaos well separated and in preventing the onset of pathological neural dynamics. PMID:26465514

Re-forging the Iron Division: The Reconstitution of the 28th Infantry Division between the Huertgen and the Ardennes

Science.gov (United States)

2015-05-21

twisting forest road, the Kall Trail, as the Division’s main supply route. These factors, among others, eventually led to a tragedy of catastrophic...carl.army.mil/eto/eto-003.pdf. 8 The GI Offensive in Europe: The Triumph of American Infantry Divisions, 1941-1945, published in 1999. Robert Rush...The Ordeal and Triumph of an American Infantry Regiment (Lawrence: University Press of Kansas, 2001), 302, 304; Drea. 15 Weaver; Holt; Harry M. Kemp

Simulation of optimal arctic routes using a numerical sea ice model based on an ice-coupled ocean circulation method

Directory of Open Access Journals (Sweden)

Jong-Ho Nam

2013-06-01

Full Text Available Ever since the Arctic region has opened its mysterious passage to mankind, continuous attempts to take advantage of its fastest route across the region has been made. The Arctic region is still covered by thick ice and thus finding a feasible navigating route is essential for an economical voyage. To find the optimal route, it is necessary to establish an efficient transit model that enables us to simulate every possible route in advance. In this work, an enhanced algorithm to determine the optimal route in the Arctic region is introduced. A transit model based on the simulated sea ice and environmental data numerically modeled in the Arctic is developed. By integrating the simulated data into a transit model, further applications such as route simulation, cost estimation or hindcast can be easily performed. An interactive simulation system that determines the optimal Arctic route using the transit model is developed. The simulation of optimal routes is carried out and the validity of the results is discussed.

A Mathematical Model for the Industrial Hazardous Waste Location-Routing Problem

Directory of Open Access Journals (Sweden)

Omid Boyer

2013-01-01

Full Text Available Technology progress is a cause of industrial hazardous wastes increasing in the whole world . Management of hazardous waste is a significant issue due to the imposed risk on environment and human life. This risk can be a result of location of undesirable facilities and also routing hazardous waste. In this paper a biobjective mixed integer programing model for location-routing industrial hazardous waste with two objectives is developed. First objective is total cost minimization including transportation cost, operation cost, initial investment cost, and cost saving from selling recycled waste. Second objective is minimization of transportation risk. Risk of population exposure within bandwidth along route is used to measure transportation risk. This model can help decision makers to locate treatment, recycling, and disposal centers simultaneously and also to route waste between these facilities considering risk and cost criteria. The results of the solved problem prove conflict between two objectives. Hence, it is possible to decrease the cost value by marginally increasing the transportation risk value and vice versa. A weighted sum method is utilized to combine two objectives function into one objective function. To solve the problem GAMS software with CPLEX solver is used. The problem is applied in Markazi province in Iran.

Modelling Stochastic Route Choice Behaviours with a Closed-Form Mixed Logit Model

Directory of Open Access Journals (Sweden)

Xinjun Lai

2015-01-01

Full Text Available A closed-form mixed Logit approach is proposed to model the stochastic route choice behaviours. It combines both the advantages of Probit and Logit to provide a flexible form in alternatives correlation and a tractable form in expression; besides, the heterogeneity in alternative variance can also be addressed. Paths are compared by pairs where the superiority of the binary Probit can be fully used. The Probit-based aggregation is also used for a nested Logit structure. Case studies on both numerical and empirical examples demonstrate that the new method is valid and practical. This paper thus provides an operational solution to incorporate the normal distribution in route choice with an analytical expression.

Ship speed optimization: Concepts, models and combined speed-routing scenarios

DEFF Research Database (Denmark)

Psaraftis, Harilaos N.; Kontovas, Christos A.

2014-01-01

The purpose of this paper is to clarify some important issues as regards ship speed optimization at the operational level and develop models that optimize ship speed for a spectrum of routing scenarios in a single ship setting. The paper's main contribution is the incorporation of those fundament...... parameters and other considerations that weigh heavily in a ship owner's or charterer's speed decision and in his routing decision, wherever relevant. Various examples are given so as to illustrate the properties of the optimal solution and the various trade-offs that are involved....

An Alternative Route to Teaching Fraction Division: Abstraction of Common Denominator Algorithm

Directory of Open Access Journals (Sweden)

İsmail Özgür ZEMBAT

2015-06-01

Full Text Available From a curricular stand point, the traditional invert and multiply algorithm for division of fractions provides few affordances for linking to a rich understanding of fractions. On the other hand, an alternative algorithm, called common denominator algorithm, has many such affordances. The current study serves as an argument for shifting curriculum for fraction division from use of invert and multiply algorithm as a basis to the use of common denominator algorithm as a basis. This was accomplished with the analysis of learning of two prospective elementary teachers being an illustration of how to realize those conceptual affordances. In doing so, the article proposes an instructional sequence and details it by referring to both the (mathematical and pedagogical advantages and the disadvantages. As a result, this algorithm has a conceptual basis depending on basic operations of partitioning, unitizing, and counting, which make it accessible to learners. Also, when participants are encouraged to construct this algorithm based on their work with diagrams, common denominator algorithm formalizes the work that they do with diagrams.

An alternative route to teaching fraction division: Abstraction of common denominator algorithm

Directory of Open Access Journals (Sweden)

İsmail Özgür Zembat

2015-07-01

Full Text Available From a curricular stand point, the traditional invert and multiply algorithm for division of fractions provides few affordances for linking to a rich understanding of fractions. On the other hand, an alternative algorithm, called common denominator algorithm, has many such affordances. The current study serves as an argument for shifting curriculum for fraction division from use of invert and multiply algorithm as a basis to the use of common denominator algorithm as a basis. This was accomplished with the analysis of learning of two prospective elementary teachers being an illustration of how to realize those conceptual affordances. In doing so, the article proposes an instructional sequence and details it by referring to both the (mathematical and pedagogical advantages and the disadvantages. As a result, this algorithm has a conceptual basis depending on basic operations of partitioning, unitizing, and counting, which make it accessible to learners. Also, when participants are encouraged to construct this algorithm based on their work with diagrams, common denominator algorithm formalizes the work that they do with diagrams.

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

Energy Technology Data Exchange (ETDEWEB)

Pamučar, Dragan, E-mail: dpamucar@gmail.com [University of Defence in Belgrade, Department of Logistics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia); Gigović, Ljubomir, E-mail: gigoviclj@gmail.com [University of Defence in Belgrade, Department of Mathematics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia); Ćirović, Goran, E-mail: cirovic@sezampro.rs [College of Civil Engineering and Geodesy, The Belgrade University, Hajduk Stankova 2, 11000 Belgrade (Serbia); Regodić, Miodrag, E-mail: mregodic62@gmail.com [University of Defence in Belgrade, Department of Mathematics, Pavla Jurisica Sturma 33, 11000 Belgrade (Serbia)

2016-01-15

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

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

International Nuclear Information System (INIS)

Pamučar, Dragan; Gigović, Ljubomir; Ćirović, Goran; Regodić, Miodrag

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

H. Goelzer

2012-05-01

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

Flood routing modelling with Artificial Neural Networks

Directory of Open Access Journals (Sweden)

R. Peters

2006-01-01

Full Text Available For the modelling of the flood routing in the lower reaches of the Freiberger Mulde river and its tributaries the one-dimensional hydrodynamic modelling system HEC-RAS has been applied. Furthermore, this model was used to generate a database to train multilayer feedforward networks. To guarantee numerical stability for the hydrodynamic modelling of some 60 km of streamcourse an adequate resolution in space requires very small calculation time steps, which are some two orders of magnitude smaller than the input data resolution. This leads to quite high computation requirements seriously restricting the application – especially when dealing with real time operations such as online flood forecasting. In order to solve this problem we tested the application of Artificial Neural Networks (ANN. First studies show the ability of adequately trained multilayer feedforward networks (MLFN to reproduce the model performance.

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

International Nuclear Information System (INIS)

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

1998-05-01

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

Optimizing Cruising Routes for Taxi Drivers Using a Spatio-Temporal Trajectory Model

Directory of Open Access Journals (Sweden)

Liang Wu

2017-11-01

Full Text Available Much of the taxi route-planning literature has focused on driver strategies for finding passengers and determining the hot spot pick-up locations using historical global positioning system (GPS trajectories of taxis based on driver experience, distance from the passenger drop-off location to the next passenger pick-up location and the waiting times at recommended locations for the next passenger. The present work, however, considers the average taxi travel speed mined from historical taxi GPS trajectory data and the allocation of cruising routes to more than one taxi driver in a small-scale region to neighboring pick-up locations. A spatio-temporal trajectory model with load balancing allocations is presented to not only explore pick-up/drop-off information but also provide taxi drivers with cruising routes to the recommended pick-up locations. In simulation experiments, our study shows that taxi drivers using cruising routes recommended by our spatio-temporal trajectory model can significantly reduce the average waiting time and travel less distance to quickly find their next passengers, and the load balancing strategy significantly alleviates road loads. These objective measures can help us better understand spatio-temporal traffic patterns and guide taxi navigation.

Optimization of location routing inventory problem with transshipment

Science.gov (United States)

Ghani, Nor Edayu Abd; Shariff, S. Sarifah Radiah; Zahari, Siti Meriam

2015-05-01

Location Routing Inventory Problem (LRIP) is a collaboration of the three components in the supply chain. It is confined by location-allocation, vehicle routing and inventory management. The aim of the study is to minimize the total system cost in the supply chain. Transshipment is introduced in order to allow the products to be shipped to a customer who experiences a shortage, either directly from the supplier or from another customer. In the study, LRIP is introduced with the transshipment (LRIPT) and customers act as the transshipment points. We select the transshipment point by using the p-center and we present the results in two divisions of cases. Based on the analysis, the results indicated that LRIPT performed well compared to LRIP.

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

International Nuclear Information System (INIS)

Johnson, P.E.; Joy, D.S.; Clarke, D.B.; Jacobi, J.M.

1993-03-01

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

Predicting transportation routes for radioactive wastes

International Nuclear Information System (INIS)

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

1981-01-01

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

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

Science.gov (United States)

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

2016-01-01

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

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

Directory of Open Access Journals (Sweden)

Taghizadeh Mahmoud

2011-01-01

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

Science.gov (United States)

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.

A Mathematical model to predict the US Airlines operation costs and airports charges per route per passenger

NARCIS (Netherlands)

Carmona Benitez, R.B.; Lodewijiks, G.

2010-01-01

A mathematical model to estimate the average airlines operational costs and airports charges per route is important for airlines companies trying to open new routes and for data generation for other purpose such as transport modeling, simulation modeling, investment analyses for airlines and

Routing in opportunistic networks

CERN Document Server

Dhurandher, Sanjay; Anpalagan, Alagan; Vasilakos, Athanasios

2013-01-01

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

Solving a bi-objective mathematical programming model for bloodmobiles location routing problem

Directory of Open Access Journals (Sweden)

Masoud Rabbani

2017-01-01

Full Text Available Perishability of platelets, uncertainty of donors’ arrival and conflicting views in platelet supply chain have made platelet supply chain planning a problematic issue. In this paper, mobile blood collection system for platelet production is investigated. Two mathematical models are presented to cover the bloodmobile collection planning problem. The first model is a multi-objective fuzzy mathematical programming in which the bloodmobiles locations are considered with the aim of maximizing potential amount of blood collection and minimizing the operational cost. The second model is a vehicle routing problem with time windows which studies the shuttles routing problem. To tackle the first model, it is reformulated as a crisp multi objective linear programming model and then solved through a fuzzy multi objective programming approach. Several sensitivity analysis are conducted on important parameters to demonstrate the applicability of the proposed model. The proposed model is then solved by using a tailored Simulated Annealing (SA algorithm. The numerical results demonstrate promising efficiency of the proposed solution method.

Progress report 1979 July 01 to September 30, Health Sciences Division

International Nuclear Information System (INIS)

1979-12-01

In September 1979, the Biology and Health Physics Division and the Medical Division were amalgamated to form the Health Sciences Division. This is the first progress report of the new division. A new TLD reader for semi-automatic handling of individual TLD chips has been commissioned. As high range radiation detectors for spent fuel monitoring, optical photo-diodes show performance similar to that of silicon rectifiers. Studies continue on the use of water-permeable plastic membranes in tritium monitoring, particularly where it is important to distinguish between 3 H in elemental form and combined as water. The first of a series of radionuclide injection experiments was made in the sand aquifer near Perch Lake. These experiments are to develop methods for studying radionuclide transport in fractured rock. Investigations of soil and groundwater in the vicinity of waste management areas have shown that tritium is the only radionuclide present in significant quantities. Radiation damage to DNA and subsequent repair is being studied by observing both somatic and genetic effcts. Rare hereditary human diseases that present clinical or laboratory features indicative of defects in the DNA repair mechanism are being studied. Work on various metabolic models that describe retention and distribution of radionuclides in humans has continued with emphasis on tritium as HT, carbon as CO2, and compounds of the alkaline earth and actinide elements. Committed effective dose equivalent conversion factors for infants and adults have been calculated for 380 classes of compounds of radionuclide and intake routes, for 65 elements. (OT)

Understanding individual routing behaviour.

Science.gov (United States)

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

2016-03-01

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

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

Science.gov (United States)

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.

Digital model of underground tourist route “St. John’s Mine” in Krobica

Directory of Open Access Journals (Sweden)

Hanna Moczydłowska

2013-09-01

Full Text Available A general characteristics of “St. John’s Mine” tourist route (“Kopalnia Św. Jana”, Krobica, Lower Silesia has been shown, containing the history of mining workings, geology and stages of it’s investigation, protection and adaptation for a tourist traffic. The steps of construction of it’s spatial model, in Datamine Studio 3 software, are presented. The resulting model has been proposed as a complementary element of “Mine St. John’s Mine” tourist offer. It can be used as part of the introduction on the beginning of the route, and as a basis for the creation of an interactive model of the tourist facility.

Modeling Human Serum Albumin Tertiary Structure to Teach Upper-Division Chemistry Students Bioinformatics and Homology Modeling Basics

Science.gov (United States)

Petrovic, Dus?an; Zlatovic´, Mario

2015-01-01

A homology modeling laboratory experiment has been developed for an introductory molecular modeling course for upper-division undergraduate chemistry students. With this experiment, students gain practical experience in homology model preparation and assessment as well as in protein visualization using the educational version of PyMOL…

Capacitated Hub Routing Problem in Hub-and-Feeder Network Design: Modeling and Solution Algorithm

OpenAIRE

Gelareh , Shahin; Neamatian Monemi , Rahimeh; Semet , Frédéric

2015-01-01

International audience; In this paper, we address the Bounded Cardinality Hub Location Routing with Route Capacity wherein eachhub acts as a transshipment node for one directed route. The number of hubs lies between a minimum anda maximum and the hub-level network is a complete subgraph. The transshipment operations take place atthe hub nodes and flow transfer time from a hub-level transporter to a spoke-level vehicle influences spoketo-hub allocations. We propose a mathematical model and a b...

Equilibrium Price Dispersion in a Matching Model with Divisible Money

NARCIS (Netherlands)

Kamiya, K.; Sato, T.

2002-01-01

The main purpose of this paper is to show that, for any given parameter values, an equilibrium with dispersed prices (two-price equilibrium) exists in a simple matching model with divisible money presented by Green and Zhou (1998).We also show that our two-price equilibrium is unique in certain

Closing the gap between behavior and models in route choice: The role of spatiotemporal constraints and latent traits in choice set formation

DEFF Research Database (Denmark)

Kaplan, Sigal; Prato, Carlo Giacomo

2012-01-01

not account for individual-related spatiotemporal constraints. This paper reduces the gap by proposing a route choice model incorporating spatiotemporal constraints and latent traits. The proposed approach combines stochastic route generation with a latent variable semi-compensatory model representing......A considerable gap exists between the behavioral paradigm of choice set formation in route choice and its representation in route choice modeling. While travelers form their viable choice set by retaining routes that satisfy spatiotemporal constraints, existing route generation techniques do...

Using radar altimetry to update a routing model of the Zambezi River Basin

DEFF Research Database (Denmark)

Michailovsky, Claire Irene B.; Bauer-Gottwein, Peter

2012-01-01

Satellite radar altimetry allows for the global monitoring of lakes and river levels. However, the widespread use of altimetry for hydrological studies is limited by the coarse temporal and spatial resolution provided by current altimetric missions and the fact that discharge rather than level...... is needed for hydrological applications. To overcome these limitations, altimetry river levels can be combined with hydrological modeling in a dataassimilation framework. This study focuses on the updating of a river routing model of the Zambezi using river levels from radar altimetry. A hydrological model...... of the basin was built to simulate the land phase of the water cycle and produce inflows to a Muskingum routing model. River altimetry from the ENVISAT mission was then used to update the storages in the reaches of the Muskingum model using the Extended Kalman Filter. The method showed improvements in modeled...

Parameterizing road construction in route-based road weather models: can ground-penetrating radar provide any answers?

International Nuclear Information System (INIS)

Hammond, D S; Chapman, L; Thornes, J E

2011-01-01

A ground-penetrating radar (GPR) survey of a 32 km mixed urban and rural study route is undertaken to assess the usefulness of GPR as a tool for parameterizing road construction in a route-based road weather forecast model. It is shown that GPR can easily identify even the smallest of bridges along the route, which previous thermal mapping surveys have identified as thermal singularities with implications for winter road maintenance. Using individual GPR traces measured at each forecast point along the route, an inflexion point detection algorithm attempts to identify the depth of the uppermost subsurface layers at each forecast point for use in a road weather model instead of existing ordinal road-type classifications. This approach has the potential to allow high resolution modelling of road construction and bridge decks on a scale previously not possible within a road weather model, but initial results reveal that significant future research will be required to unlock the full potential that this technology can bring to the road weather industry. (technical design note)

A Stochastic Route Choice Model for Car Travellers in the Copenhagen Region

DEFF Research Database (Denmark)

Nielsen, Otto Anker; Frederiksen, Rasmus Dyhr; Daly, A.

2002-01-01

The paper presents a large-scale stochastic road traffic assignment model for the Copenhagen Region. The model considers several classes of passenger cars (different trip purposes), vans and trucks, each with its own utility function on which route choices are based. The utility functions include...

Meta-analysis of choice set generation effects on route choice model estimates and predictions

DEFF Research Database (Denmark)

Prato, Carlo Giacomo

2012-01-01

are applied for model estimation and results are compared to the ‘true model estimates’. Last, predictions from the simulation of models estimated with objective choice sets are compared to the ‘postulated predicted routes’. A meta-analytical approach allows synthesizing the effect of judgments......Large scale applications of behaviorally realistic transport models pose several challenges to transport modelers on both the demand and the supply sides. On the supply side, path-based solutions to the user assignment equilibrium problem help modelers in enhancing the route choice behavior...... modeling, but require them to generate choice sets by selecting a path generation technique and its parameters according to personal judgments. This paper proposes a methodology and an experimental setting to provide general indications about objective judgments for an effective route choice set generation...

Overview of en route noise prediction using a integrated noise model

Science.gov (United States)

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

An Improved Model of Nonuniform Coleochaete Cell Division.

Science.gov (United States)

Wang, Yuandi; Cong, Jinyu

2016-08-01

Cell division is a key biological process in which cells divide forming new daughter cells. In the present study, we investigate continuously how a Coleochaete cell divides by introducing a modified differential equation model in parametric equation form. We discuss both the influence of "dead" cells and the effects of various end-points on the formation of the new cells' boundaries. We find that the boundary condition on the free end-point is different from that on the fixed end-point; the former has a direction perpendicular to the surface. It is also shown that the outer boundaries of new cells are arc-shaped. The numerical experiments and theoretical analyses for this model to construct the outer boundary are given.

Capacity Constrained Routing Algorithms for Evacuation Route Planning

National Research Council Canada - National Science Library

Lu, Qingsong; George, Betsy; Shekhar, Shashi

2006-01-01

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

A location-routing problem model with multiple periods and fuzzy demands

Directory of Open Access Journals (Sweden)

Ali Nadizadeh

2014-08-01

Full Text Available This paper puts forward a dynamic capacitated location-routing problem with fuzzy demands (DCLRP-FD. It is given on input a set of identical vehicles (each having a capacity, a fixed cost and availability level, a set of depots with restricted capacities and opening costs, a set of customers with fuzzy demands, and a planning horizon with multiple periods. The problem consists of determining the depots to be opened only in the first period of the planning horizon, the customers and the vehicles to be assigned to each opened depot, and performing the routes that may be changed in each time period due to fuzzy demands. A fuzzy chance-constrained programming (FCCP model has been designed using credibility theory and a hybrid heuristic algorithm with four phases is presented in order to solve the problem. To obtain the best value of the fuzzy parameters of the model and show the influence of the availability level of vehicles on final solution, some computational experiments are carried out. The validity of the model is then evaluated in contrast with CLRP-FD's models in the literature. The results indicate that the model and the proposed algorithm are robust and could be used in real world problems.

Atmospheric and Geophysical Sciences Division Program Report, 1988--1989

Energy Technology Data Exchange (ETDEWEB)

1990-06-01

In 1990, the Atmospheric and Geophysical Sciences Division begins its 17th year as a division. As the Division has grown over the years, its modeling capabilities have expanded to include a broad range of time and space scales ranging from hours to decades and from local to global. Our modeling is now reaching out from its atmospheric focus to treat linkages with the oceans and the land. In this report, we describe the Division's goal and organizational structure. We also provide tables and appendices describing the Division's budget, personnel, models, and publications. 2 figs., 1 tab.

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

Science.gov (United States)

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.

Indoor Pedestrian Navigation Based on Hybrid Route Planning and Location Modeling

DEFF Research Database (Denmark)

Schougaard, Kari Rye; Grønbæk, Kaj; Scharling, Tejs

2012-01-01

This paper introduces methods and services called PerPosNav for development of custom indoor pedestrian navigation applications to be deployed on a variety of platforms. PerPosNav combines symbolic and geometry based modeling of buildings, and in turn combines graph-based and geometric route...

Atmospheric and Geophysical Sciences Division: Program report, FY 1987

International Nuclear Information System (INIS)

1988-05-01

In 1988 the Atmospheric and Geophysical Sciences Division began its 15th year as a division. As the Division has grown over the years, its modeling capabilities have expanded to include a broad range of time and space scales ranging from hours to years, and from kilometers to global, respectively. For this report, we have chosen to show a subset of results from several projects to illustrate the breadth, depth, and diversity of the modeling activities that are a major part of the Division's research, development, and application efforts. In addition, the recent reorganization of the Division, including the merger of another group with the Division, is described, and the budget, personnel, models, and publications are reviewed. 95 refs., 26 figs., 2 tabs

Division of household tasks and financial management

NARCIS (Netherlands)

Antonides, G.

2011-01-01

Both the standard economic model and bargaining theory make predictions about financial management and the division of household labor between household partners. Using a large Internet survey, we have tested several predictions about task divisions reported by Dutch household partners. The division

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.

Science.gov (United States)

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.

Robustness of airline route networks

Science.gov (United States)

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

2016-03-01

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

Search route decision of environmental monitoring at emergency time

International Nuclear Information System (INIS)

Aoyama, Isao

1979-01-01

The search route decision method is reviewed, especially the adequate arrangement of monitors in view of time in the information-gathering activity by transferring the monitors on the horizontal space after the confirmation of the abnormal release of radioactive material. As for the field of the theory of search, the developmental history is explained, namely the experiences of the naval anti submarine operation in WW-2, the salvage activities and the search problem on the sea. The kinematics for search, the probability theory for detection and the optimum distribution for search are the most important contents of the application of theory of search relating to the environmental monitoring at emergency condition. The combination of a search model consists of the peculiarity of targets, the peculiarity of observers and the standard of optimality. The peculiarity of targets is divided into the space of search, the number of targets, the way of appearance of targets and the motion of targets. The peculiarity of observers is divided into the number of observers, the divisibility of efforts for search, the credibility of search information and the search process. The standard of optimality is divided into the maximum probability of detection, the minimum risk expected and the others. Each item written above of search model is explained. Concerning the formulation of the search model, the theoretical equations for detection probability, discovery potential and instantaneous detection probability, density are derived, and these equations are evaluated and explained. The future plan is to advance the search technology so as to evaluate the detection potential to decide the route of running a monitoring car for a nuclear power plant at accidental condition. (Nakai, Y.)

A nested recursive logit model for route choice analysis

DEFF Research Database (Denmark)

Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

2015-01-01

choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination....... The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible......We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...

Modeling and Optimization of Inventory-Distribution Routing Problem for Agriculture Products Supply Chain

Directory of Open Access Journals (Sweden)

Li Liao

2013-01-01

Full Text Available Mathematical models of inventory-distribution routing problem for two-echelon agriculture products distribution network are established, which are based on two management modes, franchise chain and regular chain, one-to-many, interval periodic order, demand depending on inventory, deteriorating treatment cost of agriculture products, start-up costs of vehicles and so forth. Then, a heuristic adaptive genetic algorithm is presented for the model of franchise chain. For the regular chain model, a two-layer genetic algorithm based on oddment modification is proposed, in which the upper layer is to determine the distribution period and quantity and the lower layer is to seek the optimal order cycle, quantity, distribution routes, and the rational oddment modification number for the distributor. By simulation experiments, the validity of the algorithms is demonstrated, and the two management modes are compared.

Route prediction model of infectious diseases for 2018 Winter Olympics in Korea

International Nuclear Information System (INIS)

Kim, Eungyeong; Lee, Seok; Byun, Young Tae; Kim, Jae Hun; Lee, Taikjin; Lee, Hyuk-jae

2014-01-01

There are many types of respiratory infectious diseases caused by germs, virus, mycetes and parasites. Researchers recently have tried to develop mathematical models to predict the epidemic of infectious diseases. However, with the development of ground transportation system in modern society, the spread of infectious diseases became faster and more complicated in terms of the speed and the pathways. The route of infectious diseases during Vancouver Olympics was predicted based on the Susceptible-Infectious-Recovered (SIR) model. In this model only the air traffic as an essential factor for the intercity migration of infectious diseases was involved. Here, we propose a multi-city transmission model to predict the infection route during 2018 Winter Olympics in Korea based on the pre-existing SIR model. Various types of transportation system such as a train, a car, a bus, and an airplane for the interpersonal contact in both inter- and intra-city are considered. Simulation is performed with assumptions and scenarios based on realistic factors including demographic, transportation and diseases data in Korea. Finally, we analyze an economic profit and loss caused by the variation of the number of tourists during the Olympics

Route prediction model of infectious diseases for 2018 Winter Olympics in Korea

Science.gov (United States)

Kim, Eungyeong; Lee, Seok; Byun, Young Tae; Kim, Jae Hun; Lee, Hyuk-jae; Lee, Taikjin

2014-03-01

There are many types of respiratory infectious diseases caused by germs, virus, mycetes and parasites. Researchers recently have tried to develop mathematical models to predict the epidemic of infectious diseases. However, with the development of ground transportation system in modern society, the spread of infectious diseases became faster and more complicated in terms of the speed and the pathways. The route of infectious diseases during Vancouver Olympics was predicted based on the Susceptible-Infectious-Recovered (SIR) model. In this model only the air traffic as an essential factor for the intercity migration of infectious diseases was involved. Here, we propose a multi-city transmission model to predict the infection route during 2018 Winter Olympics in Korea based on the pre-existing SIR model. Various types of transportation system such as a train, a car, a bus, and an airplane for the interpersonal contact in both inter- and intra-city are considered. Simulation is performed with assumptions and scenarios based on realistic factors including demographic, transportation and diseases data in Korea. Finally, we analyze an economic profit and loss caused by the variation of the number of tourists during the Olympics.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

A general framework for modeling growth and division of mammalian cells.

Science.gov (United States)

Gauthier, John H; Pohl, Phillip I

2011-01-06

Modeling the cell-division cycle has been practiced for many years. As time has progressed, this work has gone from understanding the basic principles to addressing distinct biological problems, e.g., the nature of the restriction point, how checkpoints operate, the nonlinear dynamics of the cell cycle, the effect of localization, etc. Most models consist of coupled ordinary differential equations developed by the researchers, restricted to deal with the interactions of a limited number of molecules. In the future, cell-cycle modeling--and indeed all modeling of complex biologic processes--will increase in scope and detail. A framework for modeling complex cell-biologic processes is proposed here. The framework is based on two constructs: one describing the entire lifecycle of a molecule and the second describing the basic cellular machinery. Use of these constructs allows complex models to be built in a straightforward manner that fosters rigor and completeness. To demonstrate the framework, an example model of the mammalian cell cycle is presented that consists of several hundred differential equations of simple mass action kinetics. The model calculates energy usage, amino acid and nucleotide usage, membrane transport, RNA synthesis and destruction, and protein synthesis and destruction for 33 proteins to give an in-depth look at the cell cycle. The framework presented here addresses how to develop increasingly descriptive models of complex cell-biologic processes. The example model of cellular growth and division constructed with the framework demonstrates that large structured models can be created with the framework, and these models can generate non-trivial descriptions of cellular processes. Predictions from the example model include those at both the molecular level--e.g., Wee1 spontaneously reactivates--and at the system level--e.g., pathways for timing-critical processes must shut down redundant pathways. A future effort is to automatically estimate

Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks

International Nuclear Information System (INIS)

Comellas, Francesc; Miralles, Alicia

2009-01-01

This paper introduces a labeling and optimal routing algorithm for a family of modular, self-similar, small-world graphs with clustering zero. Many properties of this family are comparable to those of networks associated with technological and biological systems with low clustering, such as the power grid, some electronic circuits and protein networks. For these systems, the existence of models with an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization) and also to understand the underlying mechanisms that have shaped their particular structure.

Transport Routes Optimization Model Through Application of Fuzzy Logic

Directory of Open Access Journals (Sweden)

Ivan Bortas

2018-03-01

Full Text Available The transport policy of the European Union is based on the mission of restructuring road traffic into other and energy-favourable transport modes which have not been sufficiently represented yet. Therefore, the development of the inland waterway and rail transport, and connectivity in the intermodal transport network are development planning priorities of the European transport strategy. The aim of this research study was to apply the scientific methodology and thus analyse the factors that affect the distribution of the goods flows and by using the fuzzy logic to make an optimization model, according to the criteria of minimizing the costs and negative impact on the environment, for the selection of the optimal transport route. Testing of the model by simulation, was performed on the basis of evaluating the criteria of the influential parameters with unprecise and indefinite input parameters. The testing results show that by the distribution of the goods flow from road transport network to inland waterways or rail transport, can be predicted in advance and determine the transport route with optimal characteristics. The results of the performed research study will be used to improve the process of planning the transport service, with the aim of reducing the transport costs and environmental pollution.

Analyzing multiday route choice behavior of commuters using GPS data

Directory of Open Access Journals (Sweden)

Wenyun Tang

2016-02-01

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

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

Science.gov (United States)

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.

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

Science.gov (United States)

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.

The Time Window Vehicle Routing Problem Considering Closed Route

Science.gov (United States)

Irsa Syahputri, Nenna; Mawengkang, Herman

2017-12-01

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

Routed planar networks

Directory of Open Access Journals (Sweden)

David J. Aldous

2016-04-01

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

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

Science.gov (United States)

Santos, Andrés; Manzano, Gema

2010-04-14

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

Comparison of MANET Routing Protocols in Different Traffic and Mobility Models

Directory of Open Access Journals (Sweden)

J. Baraković

2010-06-01

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

Multifactor-Driven Hierarchical Routing on Enterprise Service Bus

Science.gov (United States)

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

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

Simulation of optimal arctic routes using a numerical sea ice model based on an ice-coupled ocean circulation method

OpenAIRE

Jong-Ho Nam; Inha Park; Ho Jin Lee; Mi Ok Kwon; Kyungsik Choi; Young-Kyo Seo

2013-01-01

Ever since the Arctic region has opened its mysterious passage to mankind, continuous attempts to take advantage of its fastest route across the region has been made. The Arctic region is still covered by thick ice and thus finding a feasible navigating route is essential for an economical voyage. To find the optimal route, it is necessary to establish an efficient transit model that enables us to simulate every possible route in advance. In this work, an enhanced algorithm to determine the o...

Iconic memory-based omnidirectional route panorama navigation.

Science.gov (United States)

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

2005-01-01

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

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

Science.gov (United States)

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.

Multicast routing for wavelength-routed WDM networks with dynamic membership

Science.gov (United States)

Huang, Nen-Fu; Liu, Te-Lung; Wang, Yao-Tzung; Li, Bo

2000-09-01

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work, we explore the optical link control layer on the top of optical layer that enables the possibility of bandwidth on-demand service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over the optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to joint a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as less as possible. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.

Modeling and Optimization of Inventory-Distribution Routing Problem for Agriculture Products Supply Chain

OpenAIRE

Liao, Li; Li, Jianfeng; Wu, Yaohua

2013-01-01

Mathematical models of inventory-distribution routing problem for two-echelon agriculture products distribution network are established, which are based on two management modes, franchise chain and regular chain, one-to-many, interval periodic order, demand depending on inventory, deteriorating treatment cost of agriculture products, start-up costs of vehicles and so forth. Then, a heuristic adaptive genetic algorithm is presented for the model of franchise chain. For the regular chain model,...

A Hybrid 3D Indoor Space Model

Directory of Open Access Journals (Sweden)

A. Jamali

2016-10-01

Full Text Available GIS integrates spatial information and spatial analysis. An important example of such integration is for emergency response which requires route planning inside and outside of a building. Route planning requires detailed information related to indoor and outdoor environment. Indoor navigation network models including Geometric Network Model (GNM, Navigable Space Model, sub-division model and regular-grid model lack indoor data sources and abstraction methods. In this paper, a hybrid indoor space model is proposed. In the proposed method, 3D modeling of indoor navigation network is based on surveying control points and it is less dependent on the 3D geometrical building model. This research proposes a method of indoor space modeling for the buildings which do not have proper 2D/3D geometrical models or they lack semantic or topological information. The proposed hybrid model consists of topological, geometrical and semantical space.

Multi-objective evacuation routing optimization for toxic cloud releases

International Nuclear Information System (INIS)

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

2017-01-01

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

Dynamic multicast routing scheme in WDM optical network

Science.gov (United States)

Zhu, Yonghua; Dong, Zhiling; Yao, Hong; Yang, Jianyong; Liu, Yibin

2007-11-01

During the information era, the Internet and the service of World Wide Web develop rapidly. Therefore, the wider and wider bandwidth is required with the lower and lower cost. The demand of operation turns out to be diversified. Data, images, videos and other special transmission demands share the challenge and opportunity with the service providers. Simultaneously, the electrical equipment has approached their limit. So the optical communication based on the wavelength division multiplexing (WDM) and the optical cross-connects (OXCs) shows great potentials and brilliant future to build an optical network based on the unique technical advantage and multi-wavelength characteristic. In this paper, we propose a multi-layered graph model with inter-path between layers to solve the problem of multicast routing wavelength assignment (RWA) contemporarily by employing an efficient graph theoretic formulation. And at the same time, an efficient dynamic multicast algorithm named Distributed Message Copying Multicast (DMCM) mechanism is also proposed. The multicast tree with minimum hops can be constructed dynamically according to this proposed scheme.

Delay Management with Re-Routing of Passengers

NARCIS (Netherlands)

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

2010-01-01

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

Modernisation of passengers stock deposit at the regional division Braşov

Directory of Open Access Journals (Sweden)

Elena SIMA

2010-08-01

Full Text Available The purpose of this paper is to present the latest accomplishments at the Regional Division Brasov regarding the modernisation of stock depot for passengers but also future programs that will continue this process. The rolling stock used in passenger transport was followed: passenger wagons, sleeping wagons, diesel engines, electric engines.   Passenger transport organisation should aim the accomplishment of the following requirements: ensuring passengers’ security on the route and in stations; reducing travel time (by increasing trains’ speed, choosing the best routes, reducing stops at stations, ensuring certain fast links at railway junctions; intensive usage of rolling stock, of fixed installations; the appropriate combination of freight with passenger transport, passengers’ good serving at stations and trains, especially by ensuring a timetable which would provide convenient hours and reliable connections at railway junctions.

Great Ellipse Route Planning Based on Space Vector

Directory of Open Access Journals (Sweden)

LIU Wenchao

2015-07-01

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

Entanglement-Gradient Routing for Quantum Networks.

Science.gov (United States)

Gyongyosi, Laszlo; Imre, Sandor

2017-10-27

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

A Model for the Development an Upper-Division Marketing Certificate Program: Professional Sales.

Science.gov (United States)

Grahn, Joyce L.

The sequential components of a model for the development of an upper-division marketing certificate program in professional sales are described in this report as they were implemented at the University of Minnesota's General College during Fall 1980. After introductory material examining the responsibilities of the professional sales…

Division of Labor

KAUST Repository

Oke, Muse; Zaher, Manal S.; Hamdan, Samir

2014-01-01

The first assignment of DNA polymerases at the eukaryotic replication fork was possible after the in vitro reconstitution of the simian virus 40 (SV40) replication system. In this system, DNA polymerase α (Pol α) provides both leading and lagging strands with RNA-DNA primers that are extended by DNA polymerase δ (Pol δ). Extrapolating the architecture of the replication fork from the SV40 model system to an actual eukaryotic cell has been challenged by the discovery of a third DNA polymerase in Saccharomyces cerevisiae, DNA polymerase ε (Pol ε). A division of labor has been proposed for the eukaryotic replication fork whereby Pol ε replicates the leading strand and Pol δ replicates the lagging strand. However, an alternative model of unequal division of labor in which Pol δ can still participate in leading-strand synthesis is plausible.

Division of Labor

KAUST Repository

Oke, Muse

2014-09-12

The first assignment of DNA polymerases at the eukaryotic replication fork was possible after the in vitro reconstitution of the simian virus 40 (SV40) replication system. In this system, DNA polymerase α (Pol α) provides both leading and lagging strands with RNA-DNA primers that are extended by DNA polymerase δ (Pol δ). Extrapolating the architecture of the replication fork from the SV40 model system to an actual eukaryotic cell has been challenged by the discovery of a third DNA polymerase in Saccharomyces cerevisiae, DNA polymerase ε (Pol ε). A division of labor has been proposed for the eukaryotic replication fork whereby Pol ε replicates the leading strand and Pol δ replicates the lagging strand. However, an alternative model of unequal division of labor in which Pol δ can still participate in leading-strand synthesis is plausible.

78 FR 49111 - Airworthiness Directives; Pratt & Whitney Division Turbofan Engines

Science.gov (United States)

2013-08-13

... Airworthiness Directives; Pratt & Whitney Division Turbofan Engines AGENCY: Federal Aviation Administration (FAA... & Whitney Division (PW) turbofan engine model PW4074, PW4074D, PW4077, PW4077D, PW4084D, PW4090, and PW4090...) Applicability This AD applies to all Pratt & Whitney Division (PW) turbofan engine models PW4074, PW4074D...

Routing Data Authentication in Wireless Networks; TOPICAL

International Nuclear Information System (INIS)

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

2001-01-01

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

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

Science.gov (United States)

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…

OSM-ORIENTED METHOD OF MULTIMODAL ROUTE PLANNING

Directory of Open Access Journals (Sweden)

X. Li

2015-07-01

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

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

Directory of Open Access Journals (Sweden)

Tsung-Han Lee

2013-01-01

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

Motivation Cards to Support Students’ Understanding on Fraction Division

Directory of Open Access Journals (Sweden)

Kamirsyah Wahyu

2017-02-01

Full Text Available This design research aims to develop a learning activity which supports the fifth-grade students to understand measurement fraction division problems (A whole number divided by a fraction that result in a whole number answer conceptually. Furthermore, how students solve the fraction division problem using models is also analyzed.  Data for the retrospective analysis is collected through two teaching experiments in the form of students’ work, field notes, and some part of classroom discussions. The important findings in this research are: 1 the developed learning activity namely Motivation Cards support students understand that  3 divided by one-half means how many one-half are in 3 through models. However, when the divisor is not a unit fraction they could not directly relate the unshaded part in area model for example. 2 area model is proper model to be firstly introduced when the students work on fraction division. 3 understanding this kind of fraction division help students understand other measurement fraction division where both divisor and dividend are fractions. 4 the learning activity supports the development of character values for students.    

Fast reactor calculational route for Pu burning core design

Energy Technology Data Exchange (ETDEWEB)

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

1998-01-01

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

Capacity utilization in resilient wavelength-routed optical networks using link restoration

DEFF Research Database (Denmark)

Limal, Emmanuel; Danielsen, Søren Lykke; Stubkjær, Kristian

1998-01-01

The construction of resilient wavelength-routed optical networks has attracted much interest. Many network topologies, path and wavelength assignment strategies have been proposed. The assessment of network strategies is very complex and comparison is difficult. Here, we take a novel analytical...... approach in estimating the maximum capacity utilization that is possible in wavelength-division multiplexing (WDM) networks that are resilient against single link failures. The results apply to general network topologies and can therefore be used to evaluate the performance of more specific wavelength...

Coordinated Platoon Routing in a Metropolitan Network

Energy Technology Data Exchange (ETDEWEB)

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

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

Single and multiple object tracking using log-euclidean Riemannian subspace and block-division appearance model.

Science.gov (United States)

Hu, Weiming; Li, Xi; Luo, Wenhan; Zhang, Xiaoqin; Maybank, Stephen; Zhang, Zhongfei

2012-12-01

Object appearance modeling is crucial for tracking objects, especially in videos captured by nonstationary cameras and for reasoning about occlusions between multiple moving objects. Based on the log-euclidean Riemannian metric on symmetric positive definite matrices, we propose an incremental log-euclidean Riemannian subspace learning algorithm in which covariance matrices of image features are mapped into a vector space with the log-euclidean Riemannian metric. Based on the subspace learning algorithm, we develop a log-euclidean block-division appearance model which captures both the global and local spatial layout information about object appearances. Single object tracking and multi-object tracking with occlusion reasoning are then achieved by particle filtering-based Bayesian state inference. During tracking, incremental updating of the log-euclidean block-division appearance model captures changes in object appearance. For multi-object tracking, the appearance models of the objects can be updated even in the presence of occlusions. Experimental results demonstrate that the proposed tracking algorithm obtains more accurate results than six state-of-the-art tracking algorithms.

American College Football Division I Team Attachment: A Model for Sponsorship Effectiveness

Directory of Open Access Journals (Sweden)

Hsin-Chung Chen

2013-10-01

Full Text Available The purpose of this study was to examine sponsorship effectiveness at the Division I level, including the relationship between fans and sponsors. To collect the necessary data, the 13-item questionnaire was disseminated at two college football games by volunteer sampling at three Division I universities in the United States. With a total of 407 respondents, LISREL 8.52 and SPSS 17.0 were used to analyze the data for descriptive statistics, CFA, and SEM. By utilizing SEM, the variables of team attachment, sponsor image, word of mouth, and purchase intentions fit the proposed model.  Pragmatically, the significance of team attachment can be understated in its role as an initial construct to begin the sponsorship process. Considering the construct of sponsor image as a mediating variable, sponsor image played an important role to anticipate an increase in positive word of mouth or an increase in consumer purchase intentions.

Do Dual-Route Models Accurately Predict Reading and Spelling Performance in Individuals with Acquired Alexia and Agraphia?

OpenAIRE

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

2007-01-01

Coltheart and colleagues (Coltheart, Rastle, Perry, Langdon, & Ziegler, 2001; Castles, Bates, & Coltheart, 2006) 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...

Division of labour in the yeast

DEFF Research Database (Denmark)

Wloch-Salamon, Dominika M.; Fisher, Roberta May; Regenberg, Birgitte

2017-01-01

. Saccharomyces cerevisiae displays several phenotypes that could be considered a division of labour, including quiescence, apoptosis and biofilm formation, but they have not been explicitly treated as such. We discuss each of these examples, using a definition of division of labour that involves phenotypic...... variation between cells within a population, cooperation between cells performing different tasks and maximization of the inclusive fitness of all cells involved. We then propose future research directions and possible experimental tests using S. cerevisiae as a model organism for understanding the genetic...... mechanisms and selective pressures that can lead to the evolution of the very first stages of a division of labour....

Multimodal route choice models of public transport passengers in the Greater Copenhagen Area

DEFF Research Database (Denmark)

Anderson, Marie Karen; Nielsen, Otto Anker; Prato, Carlo Giacomo

2014-01-01

Understanding route choice behavior is crucial to explain travelers’ preferences and to predict traffic flows under different scenarios. A growing body of literature has concentrated on public transport users without, however, concentrating on multimodal public transport networks because......,641 public transport users in the Greater Copenhagen Area.A two-stage approach consisting of choice set generation and route choice model estimation allowed uncovering the preferences of the users of this multimodal large-scale public transport network. The results illustrate the rates of substitution...... not only of the in-vehicle times for different public transport modes, but also of the other time components (e.g., access, walking, waiting, transfer) composing the door-to-door experience of using a multimodal public transport network, differentiating by trip length and purpose, and accounting...

Collision risk-capacity tradeoff analysis of an en-route corridor model

Directory of Open Access Journals (Sweden)

Ye Bojia

2014-02-01

Full Text Available Flow corridors are a new class of trajectory-based airspace which derives from the next generation air transportation system concept of operations. Reducing the airspace complexity and increasing the capacity are the main purposes of the en-route corridor. This paper analyzes the collision risk-capacity tradeoff using a combined discrete–continuous simulation method. A basic two-dimensional en-route flow corridor with performance rules is designed as the operational environment. A second-order system is established by combining the point mass model and the proportional derivative controller together to simulate the self-separation operations of the aircrafts in the corridor and the operation performance parameters from the User Manual for the Base of Aircraft Data are used in this research in order to improve the reliability. Simulation results indicate that the aircrafts can self-separate from each other efficiently by adjusting their velocities, and rationally setting the values of some variables can improve the rate and stability of the corridor with low risks of loss of separation.

History-Based Response Threshold Model for Division of Labor in Multi-Agent Systems

Science.gov (United States)

Lee, Wonki; Kim, DaeEun

2017-01-01

Dynamic task allocation is a necessity in a group of robots. Each member should decide its own task such that it is most commensurate with its current state in the overall system. In this work, the response threshold model is applied to a dynamic foraging task. Each robot employs a task switching function based on the local task demand obtained from the surrounding environment, and no communication occurs between the robots. Each individual member has a constant-sized task demand history that reflects the global demand. In addition, it has response threshold values for all of the tasks and manages the task switching process depending on the stimuli of the task demands. The robot then determines the task to be executed to regulate the overall division of labor. This task selection induces a specialized tendency for performing a specific task and regulates the division of labor. In particular, maintaining a history of the task demands is very effective for the dynamic foraging task. Various experiments are performed using a simulation with multiple robots, and the results show that the proposed algorithm is more effective as compared to the conventional model. PMID:28555031

Deduction of passengers' route choice from smart card data

NARCIS (Netherlands)

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

2013-01-01

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

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

NARCIS (Netherlands)

Westerbeek, Hans; Maes, Alfons

2013-01-01

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

Dismantling at the CEA's Nuclear Energy Division: strategy and programmes

International Nuclear Information System (INIS)

Lecomte, C.; Prunele, D. de; Rozain, J.P.; Nokhamzon, J.G.; Tallec, M.

2008-01-01

The CEA's Nuclear Energy Division (DEN) nuclear facilities currently include seventeen reactors and thirty six other miscellaneous facilities, particularly laboratories, fuel processing units and facilities specific to waste management. Some of these are currently being dismantled or must be dismantled soon so that the DEN, the Nuclear Energy Division, can construct new equipment and thus have available a range of R and D facilities in line with the issues of the nuclear industry of the future. At CEA, the first nuclear facility dismantling operations go back several dozen years and involve numerous and varied facilities. The first operations of any significance took place in the 1960's and 1970's and covered, for example, the first plutonium plant at Fontenay-aux-Roses (total dismantling) and small research reactors or critical models - CESAR and PEGGY at Cadarache and MINERVE at Fontenay-aux Roses (civil engineering cleaned up and kept). At La Hague, the dismantling of AT1, a pilot workshop used by the CEA during the 1970's to process irradiated fuels from fast neutron reactors, was completed in March 2001 (IAEA former stage 3, excluding civil engineering demolition). On the other hand, during this period of first dismantling, the intermediate-sized reactors (G1, Rapsodie) were only partially dismantled after shut down, mainly due to the lack of graphite and sodium waste management routes at the time. About twenty facilities were thus dealt with up to 2001, in other words about half of all the nuclear facilities shut down permanently before this date. (authors)

An integrated location inventory routing model in supply chain network designing under uncertainty

Directory of Open Access Journals (Sweden)

Hojat Angazi

2016-09-01

Full Text Available In this study an integrated model is proposed for the location inventory routing problem under uncertainty. This problem involves determining the location of distribution centers (DCs in a three echelon supply chain. The DCs receive orders from the customer and according to a continuous review inventory replenishment policy place orders to the supplier. The products are directly shipped from the supplier to the DCs. The vehicles start from the DCs to fulfill the demands of the customers. Determining the routing of the vehicles is one of the decisions involved in this problem. The demands of customers are stochastically distributed and the capacity of DCs are limited. If one of the DCs undergo a disruption and is unable to fulfill the demands of the customers, shortage may occur. Moreover in the proposed model the shortage is considered as partial backlogging. This means that if shortage occurs, some of the orders result in lost sales and other orders are fulfilled in the next period. In order to optimally solve the proposed model a nonlinear integer programming (INLP model is developed. However, since the problem is NP-hard, the mathematical formulation cannot be efficiently solved for large sized instances of the problem. Therefore an outer approximation method is developed to solve the problem more efficiently. The computational results show the efficiency of the proposed method.

PENERAPAN MODEL STUDENT TEAMS ACHIEVEMENT DIVISION UNTUK MENINGKATKAN HASIL BELAJAR DAN KREATIVITAS BELAJAR EKONOMI

Directory of Open Access Journals (Sweden)

Dearlina Sinaga

2016-10-01

Full Text Available Abstrak: Penelitian ini bertujuan untuk meningkatkan hasil belajar dan kreativitas belajar ekonomi. Penelitian tindakan kelas ini menggunakan model pembelajaran kooperatif tipe Student Teams Achievement Division. Subjek penelitian adalah siswa kelas VIII-2 SMP Negeri-1 Pancur Batu yang berjumlah 38 orang. Data hasil belajar diperoleh lewat teknik tes, sedangkan data kreativitas belajar siswa lewat teknik observasi. Analisis data menggunakan metode analisis deskriptif kuantatif. Hasil penelitian menunjukkan bahwa hasil rata-rata pretes adalah 62,89 dimana hanya 37% siswa yang memenuhi Standart Ketuntasan Belajar Minimal (SKBM. Setelah diadakan tindakan siklus I nilai rata-rata meningkat menjadi 75 dengan 71% siswa mencapai SKBM, pada siklus II nilai rata-rata meningkat menjadi 79 dengan 87% siswa memenuhi ketuntasan. Kreativitas juga mengalami peningkatan dari 59% pada siklus I menjadi 78% pada siklus II. Dengan demikian, penerapan model STAD hasil belajar ekonomi meningkat sebesar 16% dari siklus I ke II serta dapat meningkatkan kreativitas sebesar 19% dari perbandingan siklus I dan siklus II. Kata Kunci: model STAD, hasil belajar, kreativitas belajar THE APPLICATION OF STUDENT TEAMS ACHIEVEMENT DIVISION LEARNING MODEL TO IMPROVE THE LEARNING OUTCOMES AND CREATIVITY IN LEARNING ECONOMICS Abstract: The purpose of this research is to improve the learning outcomes and creativity in learning economics. This Classroom Action Research (CAR was carried out using the model of Student Teams Achievement Division. The research subjects were students of class VIII-2 of SMP N 1 Pancur Batu with the total of 38 students. Data for outcomes analysis were collected through test and observation sheet. The results show that the average value of the pre-test is 62.89 in which only 37% of students meet the Minimum Standards Mastery Learning (SKBM. After the first cycle, the average value increases to 75 with 71% of students achieving SKBM, and after the second cycle

Numerical Modeling of Fiber-Reinforced Metal Matrix Composite Processing by the Liquid Route: Literature Contribution

Science.gov (United States)

Lacoste, Eric; Arvieu, Corinne; Mantaux, Olivier

2018-04-01

One of the technologies used to produce metal matrix composites (MMCs) is liquid route processing. One solution is to inject a liquid metal under pressure or at constant rate through a fibrous preform. This foundry technique overcomes the problem of the wettability of ceramic fibers by liquid metal. The liquid route can also be used to produce semiproducts by coating a filament with a molten metal. These processes involve physical phenomena combined with mass and heat transfer and phase change. The phase change phenomena related to solidification and also to the melting of the metal during the process notably result in modifications to the permeability of porous media, in gaps in impregnation, in the appearance of defects (porosities), and in segregation in the final product. In this article, we provide a state-of-the-art review of numerical models and simulation developed to study these physical phenomena involved in MMC processing by the liquid route.

Remotely Sensed Based Lake/Reservoir Routing in Congo River Basin

Science.gov (United States)

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.

Performance analysis of quantum access network using code division multiple access model

International Nuclear Information System (INIS)

Hu Linxi; Yang Can; He Guangqiang

2017-01-01

A quantum access network has been implemented by frequency division multiple access and time division multiple access, while code division multiple access is limited for its difficulty to realize the orthogonality of the code. Recently, the chaotic phase shifters were proposed to guarantee the orthogonality by different chaotic signals and spread the spectral content of the quantum states. In this letter, we propose to implement the code division multiple access quantum network by using chaotic phase shifters and synchronization. Due to the orthogonality of the different chaotic phase shifter, every pair of users can faithfully transmit quantum information through a common channel and have little crosstalk between different users. Meanwhile, the broadband spectra of chaotic signals efficiently help the quantum states to defend against channel loss and noise. (paper)

Multimodal Languaging as a Pedagogical Model--A Case Study of the Concept of Division in School Mathematics

Science.gov (United States)

Joutsenlahti, Jorma; Kulju, Pirjo

2017-01-01

The purpose of this study is to present a multimodal languaging model for mathematics education. The model consists of mathematical symbolic language, a pictorial language, and a natural language. By applying this model, the objective was to study how 4th grade pupils (N = 21) understand the concept of division. The data was collected over six…

Mathematical Modeling and Analysis Methodology for Opportunistic Routing in Wireless Multihop Networks

Directory of Open Access Journals (Sweden)

Wang Dongyang

2015-01-01

Full Text Available Modeling the forwarding feature and analyzing the performance theoretically for opportunistic routing in wireless multihop network are of great challenge. To address this issue, a generalized geometric distribution (GGD is firstly proposed. Based on the GGD, the forwarding probability between any two forwarding candidates could be calculated and it can be proved that the successful delivery rate after several transmissions of forwarding candidates is irrelevant to the priority rule. Then, a discrete-time queuing model is proposed to analyze mean end-to-end delay (MED of a regular opportunistic routing with the knowledge of the forwarding probability. By deriving the steady-state joint generating function of the queue length distribution, MED for directly connected networks and some special cases of nondirectly connected networks could be ultimately determined. Besides, an approximation approach is proposed to assess MED for the general cases in the nondirectly connected networks. By comparing with a large number of simulation results, the rationality of the analysis is validated. Both the analysis and simulation results show that MED varies with the number of forwarding candidates, especially when it comes to connected networks; MED increases more rapidly than that in nondirectly connected networks with the increase of the number of forwarding candidates.

Correlation between cationic lipid-based transfection and cell division

Energy Technology Data Exchange (ETDEWEB)

Kirchenbuechler, Inka; Kirchenbuechler, David; Elbaum, Michael, E-mail: michael@elbaum.ac.il

2016-07-01

We evaluate the temporal relation between protein expression by cationic lipid-mediated transfection and cell division using time lapse fluorescence microscopy. Detailed image analysis provides new insights on the single cell level while simultaneously achieving appropriate statistics. Earlier evidence by less direct methods such as flow cytometry indicates a primary route for transfection involving nuclear envelope breakdown, but also suggests the existence of a pathway independent of mitosis. We confirm and quantify both mechanisms. We found the timing for successful transfection to be unexpectedly flexible, contrary to assertions of a narrow time window. Specifically, cells dividing more than 24 h after exposure to the transfection medium express the probed protein at a comparable level to cells in a mitotic state during or shortly after transfection. This finding can have a profound impact on the guidance and development of non-viral gene delivery materials. - Highlights: • Cationic lipid-based transfection supports protein expression without cell division. • Protein expression is unrelated to cell cycle status at the time of transfection. • Time-lapse imaging provides direct evaluation without statistical averaging. • Lipoplex dissociation is a likely target for improvement of transfection efficiency.

Completion of the work on the Route Gregory

CERN Document Server

2001-01-01

It won't be long now before the work on the Route Gregory is completed ! The purpose of the work, which started at the end of last year, is to replace two sections of the drinking water supply and fire system pipework. Unfortunately, the work has been hampered by bad weather and complicated by the need to maintain the supply of water to the SPS and by a number of leaking valves. In collaboration with the Services Industriels de Genève, the Cooling and Ventilation (CV) Group of ST Division has succeeded in maintaining uninterrupted water supplies to the Meyrin Site. The hole has just been filled in and the small area of unmade road surface is due to be tarmacked in the coming weeks.

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

Directory of Open Access Journals (Sweden)

Nguyen Thanh Long

2015-02-01

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

Routing Service Quality—Local Driver Behavior Versus Routing Services

DEFF Research Database (Denmark)

Ceikute, Vaida; Jensen, Christian S.

2013-01-01

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

A joint routing and speed optimization problem

OpenAIRE

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

2016-01-01

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

Digital model of underground tourist route “St. John’s Mine” in Krobica

OpenAIRE

Hanna Moczydłowska; Paweł P. Zagożdżon

2013-01-01

A general characteristics of “St. John’s Mine” tourist route (“Kopalnia Św. Jana”, Krobica, Lower Silesia) has been shown, containing the history of mining workings, geology and stages of it’s investigation, protection and adaptation for a tourist traffic. The steps of construction of it’s spatial model, in Datamine Studio 3 software, are presented. The resulting model has been proposed as a complementary element of “Mine St. John’s Mine” tourist offer. It can be used as part of the introduct...

Cognitive process modelling of controllers in en route air traffic control.

Science.gov (United States)

Inoue, Satoru; Furuta, Kazuo; Nakata, Keiichi; Kanno, Taro; Aoyama, Hisae; Brown, Mark

2012-01-01

In recent years, various efforts have been made in air traffic control (ATC) to maintain traffic safety and efficiency in the face of increasing air traffic demands. ATC is a complex process that depends to a large degree on human capabilities, and so understanding how controllers carry out their tasks is an important issue in the design and development of ATC systems. In particular, the human factor is considered to be a serious problem in ATC safety and has been identified as a causal factor in both major and minor incidents. There is, therefore, a need to analyse the mechanisms by which errors occur due to complex factors and to develop systems that can deal with these errors. From the cognitive process perspective, it is essential that system developers have an understanding of the more complex working processes that involve the cooperative work of multiple controllers. Distributed cognition is a methodological framework for analysing cognitive processes that span multiple actors mediated by technology. In this research, we attempt to analyse and model interactions that take place in en route ATC systems based on distributed cognition. We examine the functional problems in an ATC system from a human factors perspective, and conclude by identifying certain measures by which to address these problems. This research focuses on the analysis of air traffic controllers' tasks for en route ATC and modelling controllers' cognitive processes. This research focuses on an experimental study to gain a better understanding of controllers' cognitive processes in air traffic control. We conducted ethnographic observations and then analysed the data to develop a model of controllers' cognitive process. This analysis revealed that strategic routines are applicable to decision making.

Marriage, Specialization, and the Gender Division of Labor

OpenAIRE

Matthew J. Baker; Joyce P. Jacobsen

2005-01-01

A customary gender division of labor is one in which women and men are directed towards certain tasks and/or explicitly prohibited from performing others. We offer an explanation as to why the gender division of labor is so often enforced by custom, and why customary gender divisions of labor generally involve both direction and prohibition. Our model builds on the literature on the marital hold-up problem, and considers both problems in choice of specialty and human capital acquisition in a ...

2 Dimensional Hydrodynamic Flood Routing Analysis on Flood Forecasting Modelling for Kelantan River Basin

Directory of Open Access Journals (Sweden)

Azad Wan Hazdy

2017-01-01

Full Text Available Flood disaster occurs quite frequently in Malaysia and has been categorized as the most threatening natural disaster compared to landslides, hurricanes, tsunami, haze and others. A study by Department of Irrigation and Drainage (DID show that 9% of land areas in Malaysia are prone to flood which may affect approximately 4.9 million of the population. 2 Dimensional floods routing modelling demonstrate is turning out to be broadly utilized for flood plain display and is an extremely viable device for evaluating flood. Flood propagations can be better understood by simulating the flow and water level by using hydrodynamic modelling. The hydrodynamic flood routing can be recognized by the spatial complexity of the schematization such as 1D model and 2D model. It was found that most of available hydrological models for flood forecasting are more focus on short duration as compared to long duration hydrological model using the Probabilistic Distribution Moisture Model (PDM. The aim of this paper is to discuss preliminary findings on development of flood forecasting model using Probabilistic Distribution Moisture Model (PDM for Kelantan river basin. Among the findings discuss in this paper includes preliminary calibrated PDM model, which performed reasonably for the Dec 2014, but underestimated the peak flows. Apart from that, this paper also discusses findings on Soil Moisture Deficit (SMD and flood plain analysis. Flood forecasting is the complex process that begins with an understanding of the geographical makeup of the catchment and knowledge of the preferential regions of heavy rainfall and flood behaviour for the area of responsibility. Therefore, to decreases the uncertainty in the model output, so it is important to increase the complexity of the model.

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

Science.gov (United States)

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.

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

Science.gov (United States)

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

2011-03-01

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

Model-Based Analysis of Arabidopsis Leaf Epidermal Cells Reveals Distinct Division and Expansion Patterns for Pavement and Guard Cells1[W][OA

Science.gov (United States)

Asl, Leila Kheibarshekan; Dhondt, Stijn; Boudolf, Véronique; Beemster, Gerrit T.S.; Beeckman, Tom; Inzé, Dirk; Govaerts, Willy; De Veylder, Lieven

2011-01-01

To efficiently capture sunlight for photosynthesis, leaves typically develop into a flat and thin structure. This development is driven by cell division and expansion, but the individual contribution of these processes is currently unknown, mainly because of the experimental difficulties to disentangle them in a developing organ, due to their tight interconnection. To circumvent this problem, we built a mathematic model that describes the possible division patterns and expansion rates for individual epidermal cells. This model was used to fit experimental data on cell numbers and sizes obtained over time intervals of 1 d throughout the development of the first leaf pair of Arabidopsis (Arabidopsis thaliana). The parameters were obtained by a derivative-free optimization method that minimizes the differences between the predicted and experimentally observed cell size distributions. The model allowed us to calculate probabilities for a cell to divide into guard or pavement cells, the maximum size at which it can divide, and its average cell division and expansion rates at each point during the leaf developmental process. Surprisingly, average cell cycle duration remained constant throughout leaf development, whereas no evidence for a maximum cell size threshold for cell division of pavement cells was found. Furthermore, the model predicted that neighboring cells of different sizes within the epidermis expand at distinctly different relative rates, which could be verified by direct observations. We conclude that cell division seems to occur independently from the status of cell expansion, whereas the cell cycle might act as a timer rather than as a size-regulated machinery. PMID:21693673

Writ in water, lines in sand: Ancient trade routes, models and comparative evidence

Directory of Open Access Journals (Sweden)

Eivind Heldaas Seland

2015-12-01

Full Text Available Historians and archaeologists often take connectivity for granted, and fail to address the problems of documenting patterns of movement. This article highlights the methodological challenges of reconstructing trade routes in prehistory and early history. The argument is made that these challenges are best met through the application of modern models of connectivity, in combination with the conscious use of comparative approaches.

PENGEMBANGAN MODEL PEMBELAJARAN MODIFIED STUDENT TEAMS ACHIEVEMENT DIVISION (MSTAD DALAM MENINGKATKAN HASIL BELAJAR SISWA PADA PEMBELAJARAN STRUKTUR ALJABAR

Directory of Open Access Journals (Sweden)

Kartika Sari

2015-09-01

Full Text Available The application of Students Team Achievement Division (STAD model in learning algebra structure indicated that the model is slow on detecting an error in understanding the material and it also need more time to completely delivered all of the course’s material. Therefore, in this study STAD was modified into Modified Students Teams Achievement Division (MSTAD. MSTAD development was carried out through three stages: developing new ideas based on previous research, developing results, and conducting trials. Trials  were performed  on  students taking  Algebra Structure 1  course in  2013/2014  and  2014/2015 academic year in one of the universities in Bali. Results showed that error in understanding the material was detected early, and every material was delivered on time. Statistical analysis also showed that class where MSTAD was applied achieve significantly better learning outcomes compared to STAD class and conventional class for 2013/2014 academic year (t= -9,339 < t0,05(41 = -2,702 as well as 2014/2015 academic year (Z0,5(1-0,01=0,4950 = 2,57.   ABSTRAK Penerapan   model   Student Team Achievement Division (STAD dalam pembelajaran Struktur Aljabar menunjukkan bahwa kesalahan dalam memahami materi lambat terdeteksi dan perlu tambahan waktu untuk menyelesaikan semua materi. Oleh karena itu, dalam penelitian ini dikembangkan modifikasi model STAD yaitu model pembelajaran Modified Student Teams Achievement Division (MSTAD.Pengembangan dilakukan melalui tiga tahap yaitu mengembangkan ide baru berdasarkan penelitian sebelumnya, mengem- bangkan hasil, dan melaksanakan uji coba. Uji coba dilakukan pada mahasiswa yang mengambil mata kuliah Struktur Aljabar 1 pada Tahun Ajaran 2013/2014 dan 2014/2015 di Jurusan Matematika salah satu Universitas di Bali. Hasil ujicoba menunjukkan bahwa kesalahan dalam memahami materi dapat terdeteksi lebih awal dan materi juga dapat diselesaikan tepat waktu. Hasil analisis statistik juga menunjukkan

A division algebra classification of generalized supersymmetries

International Nuclear Information System (INIS)

Toppan, Francesco

2004-10-01

Generalized supersymmetries admitting bosonic tensor central charges are classified in accordance with their division algebra properties. Division algebra consistent constraints lead (in the complex and quaternionic cases) to the classes of hermitian and holomorphic generalized supersymmetries. Applications to the analytic continuation of the M-algebra to the Euclidean and the systematic investigation of certain classes of models in generic space-times are briefly mentioned. (author)

Routing architecture and security for airborne networks

Science.gov (United States)

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

2009-05-01

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

Towards seasonal Arctic shipping route predictions

Science.gov (United States)

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

2017-12-01

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

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

Directory of Open Access Journals (Sweden)

Qiuping Li

2018-02-01

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

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

Science.gov (United States)

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.

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

Directory of Open Access Journals (Sweden)

Rustamov Samir

2018-04-01

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

Transportation of radioactive materials routing analysis: The Nevada experience

International Nuclear Information System (INIS)

Ardila-Coulson, M.V.

1991-01-01

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

State alternative route designations

International Nuclear Information System (INIS)

1989-07-01

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

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

Directory of Open Access Journals (Sweden)

Wahlgren Lina

2012-03-01

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

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

Directory of Open Access Journals (Sweden)

Y. van der Velde

2011-03-01

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

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

International Nuclear Information System (INIS)

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

1985-01-01

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

Genes involved in cell division in mycoplasmas

Directory of Open Access Journals (Sweden)

Frank Alarcón

2007-01-01

Full Text Available Bacterial cell division has been studied mainly in model systems such as Escherichia coli and Bacillus subtilis, where it is described as a complex process with the participation of a group of proteins which assemble into a multiprotein complex called the septal ring. Mycoplasmas are cell wall-less bacteria presenting a reduced genome. Thus, it was important to compare their genomes to analyze putative genes involved in cell division processes. The division and cell wall (dcw cluster, which in E. coli and B. subtilis is composed of 16 and 17 genes, respectively, is represented by only three to four genes in mycoplasmas. Even the most conserved protein, FtsZ, is not present in all mycoplasma genomes analyzed so far. A model for the FtsZ protein from Mycoplasma hyopneumoniae and Mycoplasma synoviae has been constructed. The conserved residues, essential for GTP/GDP binding, are present in FtsZ from both species. A strong conservation of hydrophobic amino acid patterns is observed, and is probably necessary for the structural stability of the protein when active. M. synoviae FtsZ presents an extended amino acid sequence at the C-terminal portion of the protein, which may participate in interactions with other still unknown proteins crucial for the cell division process.

COORDINATION OF THE WORK OF BUSES IN CITY ROUTES

Directory of Open Access Journals (Sweden)

Fuad DASHDAMIROV

2013-12-01

Full Text Available The paper studied the work of bus routes passing through a street. Optimality criterion was chosen for the development of appropriate models of effective work of buses on the land. The paper proposes a new model costing time passengers at bus stops. A method of technique was developed to coordinate the buses running on the combined section of route.

Optimum Route Planning and Scheduling for Unmanned Aerial Vehicles

National Research Council Canada - National Science Library

Sonmezocak, Erkan; Kurt, Senol

2008-01-01

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

Hurricane Evacuation Routes

Data.gov (United States)

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

Deconstructing Interocular Suppression: Attention and Divisive Normalization.

Directory of Open Access Journals (Sweden)

Hsin-Hung Li

2015-10-01

Full Text Available In interocular suppression, a suprathreshold monocular target can be rendered invisible by a salient competitor stimulus presented in the other eye. Despite decades of research on interocular suppression and related phenomena (e.g., binocular rivalry, flash suppression, continuous flash suppression, the neural processing underlying interocular suppression is still unknown. We developed and tested a computational model of interocular suppression. The model included two processes that contributed to the strength of interocular suppression: divisive normalization and attentional modulation. According to the model, the salient competitor induced a stimulus-driven attentional modulation selective for the location and orientation of the competitor, thereby increasing the gain of neural responses to the competitor and reducing the gain of neural responses to the target. Additional suppression was induced by divisive normalization in the model, similar to other forms of visual masking. To test the model, we conducted psychophysics experiments in which both the size and the eye-of-origin of the competitor were manipulated. For small and medium competitors, behavioral performance was consonant with a change in the response gain of neurons that responded to the target. But large competitors induced a contrast-gain change, even when the competitor was split between the two eyes. The model correctly predicted these results and outperformed an alternative model in which the attentional modulation was eye specific. We conclude that both stimulus-driven attention (selective for location and feature and divisive normalization contribute to interocular suppression.

Deconstructing Interocular Suppression: Attention and Divisive Normalization.

Science.gov (United States)

Li, Hsin-Hung; Carrasco, Marisa; Heeger, David J

2015-10-01

In interocular suppression, a suprathreshold monocular target can be rendered invisible by a salient competitor stimulus presented in the other eye. Despite decades of research on interocular suppression and related phenomena (e.g., binocular rivalry, flash suppression, continuous flash suppression), the neural processing underlying interocular suppression is still unknown. We developed and tested a computational model of interocular suppression. The model included two processes that contributed to the strength of interocular suppression: divisive normalization and attentional modulation. According to the model, the salient competitor induced a stimulus-driven attentional modulation selective for the location and orientation of the competitor, thereby increasing the gain of neural responses to the competitor and reducing the gain of neural responses to the target. Additional suppression was induced by divisive normalization in the model, similar to other forms of visual masking. To test the model, we conducted psychophysics experiments in which both the size and the eye-of-origin of the competitor were manipulated. For small and medium competitors, behavioral performance was consonant with a change in the response gain of neurons that responded to the target. But large competitors induced a contrast-gain change, even when the competitor was split between the two eyes. The model correctly predicted these results and outperformed an alternative model in which the attentional modulation was eye specific. We conclude that both stimulus-driven attention (selective for location and feature) and divisive normalization contribute to interocular suppression.

A green vehicle routing problem with customer satisfaction criteria

Science.gov (United States)

Afshar-Bakeshloo, M.; Mehrabi, A.; Safari, H.; Maleki, M.; Jolai, F.

2016-12-01

This paper develops an MILP model, named Satisfactory-Green Vehicle Routing Problem. It consists of routing a heterogeneous fleet of vehicles in order to serve a set of customers within predefined time windows. In this model in addition to the traditional objective of the VRP, both the pollution and customers' satisfaction have been taken into account. Meanwhile, the introduced model prepares an effective dashboard for decision-makers that determines appropriate routes, the best mixed fleet, speed and idle time of vehicles. Additionally, some new factors evaluate the greening of each decision based on three criteria. This model applies piecewise linear functions (PLFs) to linearize a nonlinear fuzzy interval for incorporating customers' satisfaction into other linear objectives. We have presented a mixed integer linear programming formulation for the S-GVRP. This model enriches managerial insights by providing trade-offs between customers' satisfaction, total costs and emission levels. Finally, we have provided a numerical study for showing the applicability of the model.

Division of labour in the yeast: Saccharomyces cerevisiae.

Science.gov (United States)

Wloch-Salamon, Dominika M; Fisher, Roberta M; Regenberg, Birgitte

2017-10-01

Division of labour between different specialized cell types is a central part of how we describe complexity in multicellular organisms. However, it is increasingly being recognized that division of labour also plays an important role in the lives of predominantly unicellular organisms. Saccharomyces cerevisiae displays several phenotypes that could be considered a division of labour, including quiescence, apoptosis and biofilm formation, but they have not been explicitly treated as such. We discuss each of these examples, using a definition of division of labour that involves phenotypic variation between cells within a population, cooperation between cells performing different tasks and maximization of the inclusive fitness of all cells involved. We then propose future research directions and possible experimental tests using S. cerevisiae as a model organism for understanding the genetic mechanisms and selective pressures that can lead to the evolution of the very first stages of a division of labour. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Planning Routes Across Economic Terrains: Maximizing Utility, Following Heuristics

Science.gov (United States)

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

2010-01-01

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

PLANNING ROUTES ACROSS ECONOMIC TERRAINS: MAXIMIZING UTILITY, FOLLOWING HEURISTICS

Directory of Open Access Journals (Sweden)

Hang eZhang

2010-12-01

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

78 FR 16620 - Airworthiness Directives; Pratt & Whitney Division Turbofan Engines

Science.gov (United States)

2013-03-18

... Division Turbofan Engines AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of proposed... Division (PW) turbofan engine models PW4074, PW4074D, PW4077, PW4077D, PW4084D, PW4090, and PW4090-3 with a... proposed AD. Discussion We propose to adopt a new AD for all PW turbofan engine models PW4074, PW4074D...

THESEUS: A wavelength division multiplexed/microwave subcarrier multiplexed optical network, its ATM switch applications and device requirements

Science.gov (United States)

Xin, Wei

1997-10-01

A Terabit Hybrid Electro-optical /underline[Se]lf- routing Ultrafast Switch (THESEUS) has been proposed. It is a self-routing wavelength division multiplexed (WDM) / microwave subcarrier multiplexed (SCM) asynchronous transfer mode (ATM) switch for the multirate ATM networks. It has potential to be extended to a large ATM switch as 1000 x 1000 without internal blocking. Among the advantages of the hybrid implementation are flexibility in service upgrade, relaxed tolerances on optical filtering, protocol simplification and less processing overhead. For a small ATM switch, the subcarrier can be used as output buffers to solve output contention. A mathematical analysis was conducted to evaluate different buffer configurations. A testbed has been successfully constructed. Multirate binary data streams have been switched through the testbed and error free reception ([<]10-9 bit error rate) has been achieved. A simple, intuitive theoretical model has been developed to describe the heterodyne optical beat interference. A new concept of interference time and interference length has been introduced. An experimental confirmation has been conducted. The experimental results match the model very well. It shows that a large portion of optical bandwidth is wasted due to the beat interference. Based on the model, several improvement approaches have been proposed. The photo-generated carrier lifetime of silicon germanium has been measured using time-resolved reflectivity measurement. Via oxygen ion implantation, the carrier lifetime has been reduced to as short as 1 ps, corresponding to 1 THz of photodetector bandwidth. It has also been shown that copper dopants act as recombination centers in the silicon germanium.

Optimal Re-Routes and Ground Delays Using a Route-Based Aggregate Air Traffic Flow Model

Science.gov (United States)

Soler, Lluis

The National Airspace System (NAS) is very complex and with a high level of uncertainty. For this reason, developing an automated conflict resolution tool at NAS level is presented as a big challenge. One way to address the problem is by using aggregate models, which can significantly reduce its dimension and complexity. Significant effort has been made to develop an air traffic aggregate model capable to effectively state and solve the problem. In this study, a Route-Based Aggregate Model is developed and tested. It consists in a modification of several existing models and overcomes some issues identified in previous aggregate models. It allows the implementation of Traffic Flow Management conventional controls, such as ground delay and rerouting. These control strategies can be used to avoid congestion conflicts based on sectors and airports capacity as well as regions affected by convective weather. The optimization problem is posed as a Linear Programming routine, which guarantees an optimal solution that minimizes the total accumulated delay required to avoid such capacity conflicts. The solutions can be directly translated into specific instructions at aircraft level, via modification of the times of departure and flight plans. The model is integrated with Future Air Traffic Management Concepts Evaluation Tool (FACET), a state of the art air traffic simulation tool, and uses its files as both input and output. This allows simulating in FACET the solution obtained from the aggregate domain. The approach is validated by applying it in three realistic scenarios at different scales. Results show that, for time horizons larger than 2 hours, the accuracy of the aggregate model is similar to other simulation tools. Also, the modified flight plans, the product of the disaggregated solution, reduce the number of capacity conflicts in the FACET simulation. Future research will study the robustness of these solutions and determine the most appropriate scenarios where to

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

Energy Technology Data Exchange (ETDEWEB)

Johnson, PE

2003-09-18

The Transportation Routing Analysis Geographic Information System (TRAGIS) model is used to calculate highway, rail, or waterway routes within the United States. TRAGIS is a client-server application with the user interface and map data files residing on the user's personal computer and the routing engine and network data files on a network server. The user's manual provides documentation on installation and the use of the many features of the model.

An Airlift Hub-and-Spoke Location-Routing Model with Time Windows: Case Study of the CONUS-to-Korea Airlift Problem

National Research Council Canada - National Science Library

Cox, David

1998-01-01

.... This study develops an alternative hub-and-spoke combined location-routing integer linear programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers...

On the Capacity of Hybrid Wireless Networks with Opportunistic Routing

Directory of Open Access Journals (Sweden)

Le Tan

2010-01-01

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

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

Directory of Open Access Journals (Sweden)

Tadeusz Pastusiak

2016-12-01

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

Automated Flight Routing Using Stochastic Dynamic Programming

Science.gov (United States)

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

2010-01-01

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

Tour Route Multiobjective Optimization Design Based on the Tourist Satisfaction

Directory of Open Access Journals (Sweden)

Yan Han

2014-01-01

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

The mechanisms of labor division from the perspective of individual optimization

Science.gov (United States)

Zhu, Lirong; Chen, Jiawei; Di, Zengru; Chen, Liujun; Liu, Yan; Stanley, H. Eugene

2017-12-01

Although the tools of complexity research have been applied to the phenomenon of labor division, its underlying mechanisms are still unclear. Researchers have used evolutionary models to study labor division in terms of global optimization, but focusing on individual optimization is a more realistic, real-world approach. We do this by first developing a multi-agent model that takes into account information-sharing and learning-by-doing and by using simulations to demonstrate the emergence of labor division. We then use a master equation method and find that the computational results are consistent with the results of the simulation. Finally we find that the core underlying mechanisms that cause labor division are learning-by-doing, information cost, and random fluctuation.

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

Institute of Scientific and Technical Information of China (English)

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

2003-01-01

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

Applied Physics Division 1998 Progress Report

International Nuclear Information System (INIS)

Cecchini, M.; Crescentini, L; Ghezzi, L.; Kent, C.; Bottomei, M.

2001-01-01

This report outlines the 1998 research activities carried out by the Applied Physics Division of the Innovation Department of ENEA (Italian Agency for New Technologies, Energy and Environment). The fields addressed and discussed include: optical and electro-optical technologies (chaps. 1 and 2); accelerator technologies (chap. 3); diagnostic systems for science and engineering (chaps. 4 and 5); theory, modelling and computational methods (chaps. 6 and 7). The aim of the Applied Physics Division is to develop technologies and systems that can be directly applied by internal (ENEA) and external users in research (high-resolution spectroscopy, laser-generated soft-x-ray sources), production processes (laser material photoproduction, structural analysis), social, cultural and environmental sciences (laser remote sensing, modelling of ecosystems and population dynamics) and medicine (particle accelerator for radiotherapy). Most of the work in 1998 was performed by the division's laboratories at the Frascati, Casaccia and Bologna Research Centres of ENEA; some was done elsewhere in collaboration with other ENEA units, external laboratories and industries. A good share of the activities was carried out for international projects; in particular, the IV European Union Framework Program

Applied Physics Division 1998 Progress Report

Energy Technology Data Exchange (ETDEWEB)

Cecchini, M.; Crescentini, L; Ghezzi, L.; Kent, C.; Bottomei, M. [ENEA, Centro Ricerche Frascati, Frascati, RM (Italy). Applied physics Division

1999-07-01

This report outlines the 1998 research activities carried out by the Applied Physics Division of the Innovation Department of ENEA (Italian Agency for New Technologies, Energy and Environment). The fields addressed and discussed include: optical and electro-optical technologies (chaps. 1 and 2); accelerator technologies (chap. 3); diagnostic systems for science and engineering (chaps. 4 and 5); theory, modelling and computational methods (chaps. 6 and 7). The aim of the Applied Physics Division is to develop technologies and systems that can be directly applied by internal (ENEA) and external users in research (high-resolution spectroscopy, laser-generated soft-x-ray sources), production processes (laser material photoproduction, structural analysis), social, cultural and environmental sciences (laser remote sensing, modelling of ecosystems and population dynamics) and medicine (particle accelerator for radiotherapy). Most of the work in 1998 was performed by the division's laboratories at the Frascati, Casaccia and Bologna Research Centres of ENEA; some was done elsewhere in collaboration with other ENEA units, external laboratories and industries. A good share of the activities was carried out for international projects; in particular, the IV European Union Framework Program.

Testing the dual-route model of perceived gaze direction: Linear combination of eye and head cues.

Science.gov (United States)

Otsuka, Yumiko; Mareschal, Isabelle; Clifford, Colin W G

2016-06-01

We have recently proposed a dual-route model of the effect of head orientation on perceived gaze direction (Otsuka, Mareschal, Calder, & Clifford, 2014; Otsuka, Mareschal, & Clifford, 2015), which computes perceived gaze direction as a linear combination of eye orientation and head orientation. By parametrically manipulating eye orientation and head orientation, we tested the adequacy of a linear model to account for the effect of horizontal head orientation on perceived direction of gaze. Here, participants adjusted an on-screen pointer toward the perceived gaze direction in two image conditions: Normal condition and Wollaston condition. Images in the Normal condition included a change in the visible part of the eye along with the change in head orientation, while images in the Wollaston condition were manipulated to have identical eye regions across head orientations. Multiple regression analysis with explanatory variables of eye orientation and head orientation revealed that linear models account for most of the variance both in the Normal condition and in the Wollaston condition. Further, we found no evidence that the model with a nonlinear term explains significantly more variance. Thus, the current study supports the dual-route model that computes the perceived gaze direction as a linear combination of eye orientation and head orientation.

Energy Technology Division research summary -- 1994

Energy Technology Data Exchange (ETDEWEB)

1994-09-01

Research funded primarily by the NRC is directed toward assessing the roles of cyclic fatigue, intergranular stress corrosion cracking, and irradiation-assisted stress corrosion cracking on failures in light water reactor (LWR) piping systems, pressure vessels, and various core components. In support of the fast reactor program, the Division has responsibility for fuel-performance modeling and irradiation testing. The Division has major responsibilities in several design areas of the proposed International Thermonuclear Experimental Reactor (ITER). The Division supports the DOE in ensuring safe shipment of nuclear materials by providing extensive review of the Safety Analysis Reports for Packaging (SARPs). Finally, in the nuclear area they are investigating the safe disposal of spent fuel and waste. In work funded by DOE`s Energy Efficiency and Renewable Energy, the high-temperature superconductivity program continues to be a major focal point for industrial interactions. Coatings and lubricants developed in the division`s Tribology Section are intended for use in transportation systems of the future. Continuous fiber ceramic composites are being developed for high-performance heat engines. Nondestructive testing techniques are being developed to evaluate fiber distribution and to detect flaws. A wide variety of coatings for corrosion protection of metal alloys are being studied. These can increase lifetimes significant in a wide variety of coal combustion and gasification environments.

Creating a Context for Learning: Activating Children’s Whole Number Knowledge Prepares Them to Understand Fraction Division

Directory of Open Access Journals (Sweden)

Pooja Gupta Sidney

2017-07-01

Full Text Available When children learn about fractions, their prior knowledge of whole numbers often interferes, resulting in a whole number bias. However, many fraction concepts are generalizations of analogous whole number concepts; for example, fraction division and whole number division share a similar conceptual structure. Drawing on past studies of analogical transfer, we hypothesize that children’s whole number division knowledge will support their understanding of fraction division when their relevant prior knowledge is activated immediately before engaging with fraction division. Children in 5th and 6th grade modeled fraction division with physical objects after modeling a series of addition, subtraction, multiplication, and division problems with whole number operands and fraction operands. In one condition, problems were blocked by operation, such that children modeled fraction problems immediately after analogous whole number problems (e.g., fraction division problems followed whole number division problems. In another condition, problems were blocked by number type, such that children modeled all four arithmetic operations with whole numbers in the first block, and then operations with fractions in the second block. Children who solved whole number division problems immediately before fraction division problems were significantly better at modeling the conceptual structure of fraction division than those who solved all of the fraction problems together. Thus, implicit analogies across shared concepts can affect children’s mathematical thinking. Moreover, specific analogies between whole number and fraction concepts can yield a positive, rather than a negative, whole number bias.

A user equilibrium, traffic assignment model of network route and parking lot choice, with search circuits and cruising flows

OpenAIRE

LEURENT, Fabien; BOUJNAH, Houda

2014-01-01

The paper provides a novel network model of parking and route choice. Parking supply is represented by parking type, management strategy including the fare, capacity and occupancy rate of parking lot, and network location, in relation to access routes along the roadway network. Trip demand is segmented according to origin-destination pair, the disposal of private parking facilities and the individual preferences for parking quality of service. Each traveller is assumed to make a two stage cho...

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

Directory of Open Access Journals (Sweden)

Lesiba Morries Kola

2017-12-01

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

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

Science.gov (United States)

Hanold, Gregg T.; Hanold, David T.

2010-01-01

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

Computational Fair Division

DEFF Research Database (Denmark)

Branzei, Simina

Fair division is a fundamental problem in economic theory and one of the oldest questions faced through the history of human society. The high level scenario is that of several participants having to divide a collection of resources such that everyone is satisfied with their allocation -- e.g. two...... heirs dividing a car, house, and piece of land inherited. The literature on fair division was developed in the 20th century in mathematics and economics, but computational work on fair division is still sparse. This thesis can be seen as an excursion in computational fair division divided in two parts....... The first part tackles the cake cutting problem, where the cake is a metaphor for a heterogeneous divisible resource such as land, time, mineral deposits, and computer memory. We study the equilibria of classical protocols and design an algorithmic framework for reasoning about their game theoretic...

An Evaluation of the Model School Division (MSD) Preschool Program for the School Year 1973-74.

Science.gov (United States)

District of Columbia Public Schools, Washington, DC. Dept. of Research and Evaluation.

This study was designed to assess the extent to which children served by the Model Schools Division Preschool Program developed socially, intellectually, physically and emotionally during the 1973-74 school year. This evaluation was also designed to measure the appropriateness of the learning environment and the amount of services provided by the…

Integrating routing decisions in public transportation problems

CERN Document Server

Schmidt, Marie E

2014-01-01

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

Variable threshold algorithm for division of labor analyzed as a dynamical system.

Science.gov (United States)

Castillo-Cagigal, Manuel; Matallanas, Eduardo; Navarro, Iñaki; Caamaño-Martín, Estefanía; Monasterio-Huelin, Félix; Gutiérrez, Álvaro

2014-12-01

Division of labor is a widely studied aspect of colony behavior of social insects. Division of labor models indicate how individuals distribute themselves in order to perform different tasks simultaneously. However, models that study division of labor from a dynamical system point of view cannot be found in the literature. In this paper, we define a division of labor model as a discrete-time dynamical system, in order to study the equilibrium points and their properties related to convergence and stability. By making use of this analytical model, an adaptive algorithm based on division of labor can be designed to satisfy dynamic criteria. In this way, we have designed and tested an algorithm that varies the response thresholds in order to modify the dynamic behavior of the system. This behavior modification allows the system to adapt to specific environmental and collective situations, making the algorithm a good candidate for distributed control applications. The variable threshold algorithm is based on specialization mechanisms. It is able to achieve an asymptotically stable behavior of the system in different environments and independently of the number of individuals. The algorithm has been successfully tested under several initial conditions and number of individuals.

StateGEN/StateNET - A structured method to perform route comparisons

International Nuclear Information System (INIS)

Cashwell, J.W.; Erickson, C.M.

1989-01-01

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

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

International Nuclear Information System (INIS)

Cashwell, J.W.; Erickson, C.M.

1989-01-01

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

On infinitely divisible semimartingales

DEFF Research Database (Denmark)

Basse-O'Connor, Andreas; Rosiński, Jan

2015-01-01

to non Gaussian infinitely divisible processes. First we show that the class of infinitely divisible semimartingales is so large that the natural analog of Stricker's theorem fails to hold. Then, as the main result, we prove that an infinitely divisible semimartingale relative to the filtration generated...... by a random measure admits a unique decomposition into an independent increment process and an infinitely divisible process of finite variation. Consequently, the natural analog of Stricker's theorem holds for all strictly representable processes (as defined in this paper). Since Gaussian processes...... are strictly representable due to Hida's multiplicity theorem, the classical Stricker's theorem follows from our result. Another consequence is that the question when an infinitely divisible process is a semimartingale can often be reduced to a path property, when a certain associated infinitely divisible...

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

NARCIS (Netherlands)

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

2012-01-01

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

Characterization of dependencies between growth and division in budding yeast.

Science.gov (United States)

Mayhew, Michael B; Iversen, Edwin S; Hartemink, Alexander J

2017-02-01

Cell growth and division are processes vital to the proliferation and development of life. Coordination between these two processes has been recognized for decades in a variety of organisms. In the budding yeast Saccharomyces cerevisiae , this coordination or 'size control' appears as an inverse correlation between cell size and the rate of cell-cycle progression, routinely observed in G 1 prior to cell division commitment. Beyond this point, cells are presumed to complete S/G 2 /M at similar rates and in a size-independent manner. As such, studies of dependence between growth and division have focused on G 1 Moreover, in unicellular organisms, coordination between growth and division has commonly been analysed within the cycle of a single cell without accounting for correlations in growth and division characteristics between cycles of related cells. In a comprehensive analysis of three published time-lapse microscopy datasets, we analyse both intra- and inter-cycle dependencies between growth and division, revisiting assumptions about the coordination between these two processes. Interestingly, we find evidence (i) that S/G 2 /M durations are systematically longer in daughters than in mothers, (ii) of dependencies between S/G 2 /M and size at budding that echo the classical G 1 dependencies, and (iii) in contrast with recent bacterial studies, of negative dependencies between size at birth and size accumulated during the cell cycle. In addition, we develop a novel hierarchical model to uncover inter-cycle dependencies, and we find evidence for such dependencies in cells growing in sugar-poor environments. Our analysis highlights the need for experimentalists and modellers to account for new sources of cell-to-cell variation in growth and division, and our model provides a formal statistical framework for the continued study of dependencies between biological processes. © 2017 The Author(s).

Cell-Division Behavior in a Heterogeneous Swarm Environment.

Science.gov (United States)

Erskine, Adam; Herrmann, J Michael

2015-01-01

We present a system of virtual particles that interact using simple kinetic rules. It is known that heterogeneous mixtures of particles can produce particularly interesting behaviors. Here we present a two-species three-dimensional swarm in which a behavior emerges that resembles cell division. We show that the dividing behavior exists across a narrow but finite band of parameters and for a wide range of population sizes. When executed in a two-dimensional environment the swarm's characteristics and dynamism manifest differently. In further experiments we show that repeated divisions can occur if the system is extended by a biased equilibrium process to control the split of populations. We propose that this repeated division behavior provides a simple model for cell-division mechanisms and is of interest for the formation of morphological structure and to swarm robotics.

A Dual-Route Perspective on Eye Movements of Dyslexic Readers

Science.gov (United States)

Hawelka, Stefan; Gagl, Benjamin; Wimmer, Heinz

2010-01-01

This study assessed eye movement abnormalities of adolescent dyslexic readers and interpreted the findings by linking the dual-route model of single word reading with the E-Z Reader model of eye movement control during silent sentence reading. A dysfunction of the lexical route was assumed to account for a reduced number of words which received…

Metroplex Optimization Model Expansion and Analysis: The Airline Fleet, Route, and Schedule Optimization Model (AFRS-OM)

Science.gov (United States)

Sherry, Lance; Ferguson, John; Hoffman, Karla; Donohue, George; Beradino, Frank

2012-01-01

This report describes the Airline Fleet, Route, and Schedule Optimization Model (AFRS-OM) that is designed to provide insights into airline decision-making with regards to markets served, schedule of flights on these markets, the type of aircraft assigned to each scheduled flight, load factors, airfares, and airline profits. The main inputs to the model are hedged fuel prices, airport capacity limits, and candidate markets. Embedded in the model are aircraft performance and associated cost factors, and willingness-to-pay (i.e. demand vs. airfare curves). Case studies demonstrate the application of the model for analysis of the effects of increased capacity and changes in operating costs (e.g. fuel prices). Although there are differences between airports (due to differences in the magnitude of travel demand and sensitivity to airfare), the system is more sensitive to changes in fuel prices than capacity. Further, the benefits of modernization in the form of increased capacity could be undermined by increases in hedged fuel prices

Using the hybrid fuzzy goal programming model and hybrid genetic algorithm to solve a multi-objective location routing problem for infectious waste disposaL

Energy Technology Data Exchange (ETDEWEB)

Wichapa, Narong; Khokhajaikiat, Porntep

2017-07-01

Disposal of infectious waste remains one of the most serious problems in the social and environmental domains of almost every nation. Selection of new suitable locations and finding the optimal set of transport routes to transport infectious waste, namely location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Design/methodology/approach: Due to the complexity of this problem, location routing problem for a case study, forty hospitals and three candidate municipalities in sub-Northeastern Thailand, was divided into two phases. The first phase is to choose suitable municipalities using hybrid fuzzy goal programming model which hybridizes the fuzzy analytic hierarchy process and fuzzy goal programming. The second phase is to find the optimal routes for each selected municipality using hybrid genetic algorithm which hybridizes the genetic algorithm and local searches including 2-Opt-move, Insertion-move and ?-interchange-move. Findings: The results indicate that the hybrid fuzzy goal programming model can guide the selection of new suitable municipalities, and the hybrid genetic algorithm can provide the optimal routes for a fleet of vehicles effectively. Originality/value: The novelty of the proposed methodologies, hybrid fuzzy goal programming model, is the simultaneous combination of both intangible and tangible factors in order to choose new suitable locations, and the hybrid genetic algorithm can be used to determine the optimal routes which provide a minimum number of vehicles and minimum transportation cost under the actual situation, efficiently.

Using the hybrid fuzzy goal programming model and hybrid genetic algorithm to solve a multi-objective location routing problem for infectious waste disposaL

International Nuclear Information System (INIS)

Wichapa, Narong; Khokhajaikiat, Porntep

2017-01-01

Disposal of infectious waste remains one of the most serious problems in the social and environmental domains of almost every nation. Selection of new suitable locations and finding the optimal set of transport routes to transport infectious waste, namely location routing problem for infectious waste disposal, is one of the major problems in hazardous waste management. Design/methodology/approach: Due to the complexity of this problem, location routing problem for a case study, forty hospitals and three candidate municipalities in sub-Northeastern Thailand, was divided into two phases. The first phase is to choose suitable municipalities using hybrid fuzzy goal programming model which hybridizes the fuzzy analytic hierarchy process and fuzzy goal programming. The second phase is to find the optimal routes for each selected municipality using hybrid genetic algorithm which hybridizes the genetic algorithm and local searches including 2-Opt-move, Insertion-move and ?-interchange-move. Findings: The results indicate that the hybrid fuzzy goal programming model can guide the selection of new suitable municipalities, and the hybrid genetic algorithm can provide the optimal routes for a fleet of vehicles effectively. Originality/value: The novelty of the proposed methodologies, hybrid fuzzy goal programming model, is the simultaneous combination of both intangible and tangible factors in order to choose new suitable locations, and the hybrid genetic algorithm can be used to determine the optimal routes which provide a minimum number of vehicles and minimum transportation cost under the actual situation, efficiently.

Deduction of passengers' route choices from smart card data

NARCIS (Netherlands)

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

2015-01-01

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

Simulated Annealing Technique for Routing in a Rectangular Mesh Network

Directory of Open Access Journals (Sweden)

Noraziah Adzhar

2014-01-01

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

Application of a random effects negative binomial model to examine tram-involved crash frequency on route sections in Melbourne, Australia.

Science.gov (United States)

Naznin, Farhana; Currie, Graham; Logan, David; Sarvi, Majid

2016-07-01

Safety is a key concern in the design, operation and development of light rail systems including trams or streetcars as they impose crash risks on road users in terms of crash frequency and severity. The aim of this study is to identify key traffic, transit and route factors that influence tram-involved crash frequencies along tram route sections in Melbourne. A random effects negative binomial (RENB) regression model was developed to analyze crash frequency data obtained from Yarra Trams, the tram operator in Melbourne. The RENB modelling approach can account for spatial and temporal variations within observation groups in panel count data structures by assuming that group specific effects are randomly distributed across locations. The results identify many significant factors effecting tram-involved crash frequency including tram service frequency (2.71), tram stop spacing (-0.42), tram route section length (0.31), tram signal priority (-0.25), general traffic volume (0.18), tram lane priority (-0.15) and ratio of platform tram stops (-0.09). Findings provide useful insights on route section level tram-involved crashes in an urban tram or streetcar operating environment. The method described represents a useful planning tool for transit agencies hoping to improve safety performance. Copyright © 2016 Elsevier Ltd. All rights reserved.

The optimal choice of medication administration route regarding intravenous, intramuscular, and subcutaneous injection

Directory of Open Access Journals (Sweden)

Jin JF

2015-07-01

Full Text Available Jing-fen Jin,1 Ling-ling Zhu,2 Meng Chen,3 Hui-min Xu,3 Hua-fen Wang,1 Xiu-qin Feng,1 Xiu-ping Zhu,3 Quan Zhou31Division of Nursing, 2VIP Care Ward, Division of Nursing, 3Department of Pharmacy, The Second Affiliated Hospital, School of Medicine, Zhejiang University, Hangzhou, People’s Republic of ChinaBackground: Intravenous (IV, intramuscular (IM, and subcutaneous (SC are the three most frequently used injection routes in medication administration. Comparative studies of SC versus IV, IM versus IV, or IM versus SC have been sporadically conducted, and some new findings are completely different from the dosage recommendation as described in prescribing information. However, clinicians may still be ignorant of such new evidence-based findings when choosing treatment methods.Methods: A literature search was performed using PubMed, MEDLINE, and Web of Sciences™ Core Collection to analyze the advantages and disadvantages of SC, IV, and IM administration in head-to-head comparative studies.Results: “SC better than IV” involves trastuzumab, rituximab, antitumor necrosis factor medications, bortezomib, amifostine, recombinant human granulocyte-macrophage colony-stimulating factor, granulocyte colony-stimulating factor, recombinant interleukin-2, immunoglobulin, epoetin alfa, heparin, and opioids. “IV better than SC” involves ketamine, vitamin K1, and abatacept. With respect to insulin and ketamine, whether IV has advantages over SC is determined by specific clinical circumstances. “IM better than IV” involves epinephrine, hepatitis B immunoglobulin, pegaspargase, and some antibiotics. “IV better than IM” involves ketamine, morphine, and antivenom. “IM better than SC” involves epinephrine. “SC better than IM” involves interferon-beta-1a, methotrexate, human chorionic gonadotropin, hepatitis B immunoglobulin, hydrocortisone, and morphine. Safety, efficacy, patient preference, and pharmacoeconomics are four principles

Autonomous model protocell division driven by molecular replication.

Science.gov (United States)

Taylor, J W; Eghtesadi, S A; Points, L J; Liu, T; Cronin, L

2017-08-10

The coupling of compartmentalisation with molecular replication is thought to be crucial for the emergence of the first evolvable chemical systems. Minimal artificial replicators have been designed based on molecular recognition, inspired by the template copying of DNA, but none yet have been coupled to compartmentalisation. Here, we present an oil-in-water droplet system comprising an amphiphilic imine dissolved in chloroform that catalyses its own formation by bringing together a hydrophilic and a hydrophobic precursor, which leads to repeated droplet division. We demonstrate that the presence of the amphiphilic replicator, by lowering the interfacial tension between droplets of the reaction mixture and the aqueous phase, causes them to divide. Periodic sampling by a droplet-robot demonstrates that the extent of fission is increased as the reaction progresses, producing more compartments with increased self-replication. This bridges a divide, showing how replication at the molecular level can be used to drive macroscale droplet fission.Coupling compartmentalisation and molecular replication is essential for the development of evolving chemical systems. Here the authors show an oil-in-water droplet containing a self-replicating amphiphilic imine that can undergo repeated droplet division.

Modelling cell division and endoreduplication in tomato fruit pericarp

NARCIS (Netherlands)

Apri, M.; Kromdijk, J.; Visser, de P.H.B.; Gee, de M.; Molenaar, J.

2014-01-01

In many developing plant tissues and organs, differentiating cells switch from the classical cell cycle to an alternative partial cycle. This partial cycle bypasses mitosis and allows for multiple rounds of genome duplication without cell division, giving rise to cells with high ploidy numbers. This

Trip Energy Estimation Methodology and Model Based on Real-World Driving Data for Green Routing Applications: Preprint

Energy Technology Data Exchange (ETDEWEB)

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

2018-02-09

A data-informed model to predict energy use for a proposed vehicle trip has been developed in this paper. The methodology leverages nearly 1 million miles of real-world driving data to generate the estimation model. Driving is categorized at the sub-trip level by average speed, road gradient, and road network geometry, then aggregated by category. An average energy consumption rate is determined for each category, creating an energy rates look-up table. Proposed vehicle trips are then categorized in the same manner, and estimated energy rates are appended from the look-up table. The methodology is robust and applicable to almost any type of driving data. The model has been trained on vehicle global positioning system data from the Transportation Secure Data Center at the National Renewable Energy Laboratory and validated against on-road fuel consumption data from testing in Phoenix, Arizona. The estimation model has demonstrated an error range of 8.6% to 13.8%. The model results can be used to inform control strategies in routing tools, such as change in departure time, alternate routing, and alternate destinations to reduce energy consumption. This work provides a highly extensible framework that allows the model to be tuned to a specific driver or vehicle type.

Analytical model for macromolecular partitioning during yeast cell division

International Nuclear Information System (INIS)

Kinkhabwala, Ali; Khmelinskii, Anton; Knop, Michael

2014-01-01

Asymmetric cell division, whereby a parent cell generates two sibling cells with unequal content and thereby distinct fates, is central to cell differentiation, organism development and ageing. Unequal partitioning of the macromolecular content of the parent cell — which includes proteins, DNA, RNA, large proteinaceous assemblies and organelles — can be achieved by both passive (e.g. diffusion, localized retention sites) and active (e.g. motor-driven transport) processes operating in the presence of external polarity cues, internal asymmetries, spontaneous symmetry breaking, or stochastic effects. However, the quantitative contribution of different processes to the partitioning of macromolecular content is difficult to evaluate. Here we developed an analytical model that allows rapid quantitative assessment of partitioning as a function of various parameters in the budding yeast Saccharomyces cerevisiae. This model exposes quantitative degeneracies among the physical parameters that govern macromolecular partitioning, and reveals regions of the solution space where diffusion is sufficient to drive asymmetric partitioning and regions where asymmetric partitioning can only be achieved through additional processes such as motor-driven transport. Application of the model to different macromolecular assemblies suggests that partitioning of protein aggregates and episomes, but not prions, is diffusion-limited in yeast, consistent with previous reports. In contrast to computationally intensive stochastic simulations of particular scenarios, our analytical model provides an efficient and comprehensive overview of partitioning as a function of global and macromolecule-specific parameters. Identification of quantitative degeneracies among these parameters highlights the importance of their careful measurement for a given macromolecular species in order to understand the dominant processes responsible for its observed partitioning

The simulation model of growth and cell divisions for the root apex with an apical cell in application to Azolla pinnata.

Science.gov (United States)

Piekarska-Stachowiak, Anna; Nakielski, Jerzy

2013-12-01

In contrast to seed plants, the roots of most ferns have a single apical cell which is the ultimate source of all cells in the root. The apical cell has a tetrahedral shape and divides asymmetrically. The root cap derives from the distal division face, while merophytes derived from three proximal division faces contribute to the root proper. The merophytes are produced sequentially forming three sectors along a helix around the root axis. During development, they divide and differentiate in a predictable pattern. Such growth causes cell pattern of the root apex to be remarkably regular and self-perpetuating. The nature of this regularity remains unknown. This paper shows the 2D simulation model for growth of the root apex with the apical cell in application to Azolla pinnata. The field of growth rates of the organ, prescribed by the model, is of a tensor type (symplastic growth) and cells divide taking principal growth directions into account. The simulations show how the cell pattern in a longitudinal section of the apex develops in time. The virtual root apex grows realistically and its cell pattern is similar to that observed in anatomical sections. The simulations indicate that the cell pattern regularity results from cell divisions which are oriented with respect to principal growth directions. Such divisions are essential for maintenance of peri-anticlinal arrangement of cell walls and coordinated growth of merophytes during the development. The highly specific division program that takes place in merophytes prior to differentiation seems to be regulated at the cellular level.

Peningkatan Keterampilan Proses Sains dan Hasil Belajar Fisika Siswa pada Model Pembelajaran Kooperatif Tipe Student Team Achievement Division

Directory of Open Access Journals (Sweden)

Happy Komike Sari

2016-06-01

Full Text Available Berdasarkan observasi di SMA Negeri 15 Bandarlampung, proses pelaksanaan pembelajaran fisika masih belum meraih hasil yang maksimal terutama pada siswa kelas X. Tujuan utama dari penelitian ini adalah untuk mendeskripsikan peningkatan Keterampilan Proses Sains (KPS dan hasil belajar fisika siswa menggunakan model pembelajaran kooperatif tipe Student Team Achievement Division (STAD. Penelitian ini merupakan jenis penelitian tindakan kelas yang dilaksanakan dalam tiga siklus pada 30 siswa di kelas X5 SMA Negeri 15 Bandarlampung. Setiap siklus terdiri dari perencanaan, tindakan dan pengamatan, dan refleksi. Data penelitian dikumpulkan dengan menggunakan lembar observasi untuk Keterampilan Proses Sains (KPS dan soal uraian untuk hasil belajar. Dari hasil penelitian menunjukkan bahwa model pembelajaran kooperatif tipe Student Team Achievement Division (STAD dapat meningkatkan Keterampilan Proses Sains (KPS dan hasil belajar fisika siswa dari siswa ke siswa. Based on observations in SMA NegerI 15 Bandarlampung, the implementation process of learning physics is still not achieve the maximum results, especially in class X. The main purpose of this study is to describe the increase of KPS and students’ learning achievement in learning physics using a cooperative learning model type Student Team Achievement Division (STAD. This classroom action research has been conducted in three cycles with 30 students of X5 Class of SMA Negeri 15 Bandarlampung. Every cycle consists of planning, action and observation, and reflection. The data were collected using observation sheet for KPS and essay test for learning achievement. Based on the results indicate that the cooperative learning model type STAD effectively could increase KPS and students’ learning achievement in learning physics from cycle to cycle

Division of Finance Homepage

Science.gov (United States)

Top Department of Administration logo Alaska Department of Administration Division of Finance Search Search the Division of Finance site DOF State of Alaska Finance Home Content Area Accounting Charge Cards You are here Administration / Finance Division of Finance Updates IRIS Expenditure Object Codes

VINE ROUTES IN BULGARIA

Directory of Open Access Journals (Sweden)

Lyuben Hristov

2015-03-01

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

Robust against route failure using power proficient reliable routing in MANET

Directory of Open Access Journals (Sweden)

M. Malathi

2018-03-01

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

Penultimate modeling of spatial extremes: statistical inference for max-infinitely divisible processes

KAUST Repository

Huser, Raphaël

2018-01-09

Extreme-value theory for stochastic processes has motivated the statistical use of max-stable models for spatial extremes. However, fitting such asymptotic models to maxima observed over finite blocks is problematic when the asymptotic stability of the dependence does not prevail in finite samples. This issue is particularly serious when data are asymptotically independent, such that the dependence strength weakens and eventually vanishes as events become more extreme. We here aim to provide flexible sub-asymptotic models for spatially indexed block maxima, which more realistically account for discrepancies between data and asymptotic theory. We develop models pertaining to the wider class of max-infinitely divisible processes, extending the class of max-stable processes while retaining dependence properties that are natural for maxima: max-id models are positively associated, and they yield a self-consistent family of models for block maxima defined over any time unit. We propose two parametric construction principles for max-id models, emphasizing a point process-based generalized spectral representation, that allows for asymptotic independence while keeping the max-stable extremal-$t$ model as a special case. Parameter estimation is efficiently performed by pairwise likelihood, and we illustrate our new modeling framework with an application to Dutch wind gust maxima calculated over different time units.

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

Science.gov (United States)

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.

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

OpenAIRE

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

2012-01-01

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

A Performance Study of LEACH and Direct Diffusion Routing Protocols in Wireless Sensor Network

International Nuclear Information System (INIS)

Fakher, S.; Sharshar, K.; Moawad, M.I.; Shokair, M.

2016-01-01

The Wireless Sensor Network (WSN) is composed of a large number of sensor nodes with limited computation communication, and battery facilities. One of the common applications of this network is environment monitoring through sensing motion, measuring temperature, humidity and radiation. One of the basic activities in WSN is data gathering which represents a great challenge. Many routing protocols are proposed for that network to collect and aggregate the data. The most popular ones are hierarchy and data centric routing protocols. The main goal of this study is to identify the most preferable routing protocol, to be used in each mobility model. This paper studies the performance of LEACH (Low Energy Adaptive Clustering Hierarchy) from hierarchy routing protocol and direct diffusion from data centric routing protocol which is not clarified until now. Moreover, a comparison between LEACH and direct diffusion protocol using NS2 simulator will be made, and an analysis of these protocols will be conducted. The comparison includes packet delivery ratio, throughput, average energy ratio, average delay, network lifetime, and routing overhead. The performance is evaluated by varying the number of sensor nodes under three mobility models Reference Point Group Mobility Model (RPGM), Manhattan and random waypoint mobility model. Simulation results show that LEACH routing protocol has a good performance in RPGM and Manhattan than random waypoint mobility model. Direct diffusion has a good performance in random waypoint mobility model than in RPGM and Manhattan mobility model

Cell Division Synchronization

Science.gov (United States)

The report summarizes the progress in the design and construction of automatic equipment for synchronizing cell division in culture by periodic...Concurrent experiments in hypothermic synchronization of algal cell division are reported.

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

Science.gov (United States)

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.

Argonne Physics Division Colloquium

Science.gov (United States)

[Argonne Logo] [DOE Logo] Physics Division Home News Division Information Contact PHY Org Chart Physics Division Colloquium Auditorium, Building 203, Argonne National Laboratory Fridays at 11:00 AM 2017 : Sereres Johnston 15 Sep 2017 Joint Physics and Materials Science Colloquium J. C. Séamus Davis, Cornell

Vehicle Routing Problem for Fashion Supply Chains with Cross-Docking

Directory of Open Access Journals (Sweden)

Zhi-Hua Hu

2013-01-01

Full Text Available Cross-docking, as a strategy to reduce lead time and enhance the efficiency of the fashion supply chain, has attracted substantial attention from both the academy and the industry. Cross-docking is a critical part of many fashion and textiles supply chains in practice because it can help to achieve many supply chain strategies such as postponement. We consider a model where there are multiple suppliers and customers in a single cross-docking center. With such a model setting, the issue concerning the coordinated routing between the inbound and outbound routes is much more complex than many traditional vehicle routing problems (VRPs. We formulate the optimal route selection problems from the suppliers to the cross-docking center and from the cross-docking center to the customers as the respective VRPs. Based on the relationships between the suppliers and the customers, we integrate the two VRP models to optimize the overall traveling time, distance, and waiting time at the cross-docking center. In addition, we propose a novel mixed 0/1 integer linear programming model by which the complexity of the problem can be reduced significantly. As demonstrated by the simulation analysis, our proposed model can be solved very efficiently by a commonly used optimization software package.

Usefulness of computed tomography virtual bronchoscopy in the evaluation of bronchi divisions

International Nuclear Information System (INIS)

Adamczyk, Michał; Tomaszewski, Grzegorz; Naumczyk, Patrycja; Kluczewska, Ewa; Walecki, Jerzy

2013-01-01

Since introduction of multislice CT scanners into clinical practice, virtual brochoscopy has gained a lot of quality and diagnostic potential. Nevertheless it does not have established place in diagnostics of tracheal and bronchi disorders and its potential has not been examined enough. Nowadays a majority of bronchial tree variants and lesions are revealed by bronchofiberoscopy, which is an objective and a relatively safe method, but has side effects, especially in higher-risk subjects. Therefore noninvasive techniques enabling evaluation of airways should be consistently developed and updated. Material consisted of 100 adults (45 female, 55 male) aged between 18 and 65 years (mean 40 years, median 40.5 years, SD 14.02), who underwent chest CT examination by means of a 16-slice scanner. Every patient had normal appearance of chest organs, with the exception of minor abnormalities that did not alter airways route. Divisions of bronchial tree to segmental level were evaluated and assigned to particular types by means of virtual bronchoscopy projection. In case of difficulties MPR or MinIP projection was used. The frequency of lobar bronchi divisions other than the typical ones was in: right upper lobar bronchi 45%, left 55%; middle lobar bronchi 21%, lingula 26%; right lower lobar bronchi 28%, left 29%. Subsuperior bronchus or bronchi were found on the right side in 44% and on the left side in 37%. No dependency between types of bronchial divisions on different levels was found

A novel insight into beaconless geo-routing

KAUST Repository

Bader, Ahmed

2012-12-01

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

Energy Technology Division research summary -- 1994

International Nuclear Information System (INIS)

1994-09-01

Research funded primarily by the NRC is directed toward assessing the roles of cyclic fatigue, intergranular stress corrosion cracking, and irradiation-assisted stress corrosion cracking on failures in light water reactor (LWR) piping systems, pressure vessels, and various core components. In support of the fast reactor program, the Division has responsibility for fuel-performance modeling and irradiation testing. The Division has major responsibilities in several design areas of the proposed International Thermonuclear Experimental Reactor (ITER). The Division supports the DOE in ensuring safe shipment of nuclear materials by providing extensive review of the Safety Analysis Reports for Packaging (SARPs). Finally, in the nuclear area they are investigating the safe disposal of spent fuel and waste. In work funded by DOE's Energy Efficiency and Renewable Energy, the high-temperature superconductivity program continues to be a major focal point for industrial interactions. Coatings and lubricants developed in the division's Tribology Section are intended for use in transportation systems of the future. Continuous fiber ceramic composites are being developed for high-performance heat engines. Nondestructive testing techniques are being developed to evaluate fiber distribution and to detect flaws. A wide variety of coatings for corrosion protection of metal alloys are being studied. These can increase lifetimes significant in a wide variety of coal combustion and gasification environments

The role of visual and spatial working memory in forming mental models derived from survey and route descriptions.

Science.gov (United States)

Meneghetti, Chiara; Labate, Enia; Pazzaglia, Francesca; Hamilton, Colin; Gyselinck, Valérie

2017-05-01

This study examines the involvement of spatial and visual working memory (WM) in the construction of flexible spatial models derived from survey and route descriptions. Sixty young adults listened to environment descriptions, 30 from a survey perspective and the other 30 from a route perspective, while they performed spatial (spatial tapping [ST]) and visual (dynamic visual noise [DVN]) secondary tasks - believed to overload the spatial and visual working memory (WM) components, respectively - or no secondary task (control, C). Their mental representations of the environment were tested by free recall and a verification test with both route and survey statements. Results showed that, for both recall tasks, accuracy was worse in the ST than in the C or DVN conditions. In the verification test, the effect of both ST and DVN was a decreasing accuracy for sentences testing spatial relations from the opposite perspective to the one learnt than if the perspective was the same; only ST had a stronger interference effect than the C condition for sentences from the opposite perspective from the one learnt. Overall, these findings indicate that both visual and spatial WM, and especially the latter, are involved in the construction of perspective-flexible spatial models. © 2016 The British Psychological Society.

Divisible ℤ-modules

Directory of Open Access Journals (Sweden)

Futa Yuichi

2016-03-01

Full Text Available In this article, we formalize the definition of divisible ℤ-module and its properties in the Mizar system [3]. We formally prove that any non-trivial divisible ℤ-modules are not finitely-generated.We introduce a divisible ℤ-module, equivalent to a vector space of a torsion-free ℤ-module with a coefficient ring ℚ. ℤ-modules are important for lattice problems, LLL (Lenstra, Lenstra and Lovász base reduction algorithm [15], cryptographic systems with lattices [16] and coding theory [8].

Solar UV radiation exposure of seamen - Measurements, calibration and model calculations of erythemal irradiance along ship routes

Energy Technology Data Exchange (ETDEWEB)

Feister, Uwe [German Meteorological Service, Meteorological Observatory Lindenberg - Richard-Assmann-Observatory, Am Observatorium 12, 15848 Lindenberg (Germany); Meyer, Gabriele; Kirst, Ulrich [German Social Accident Insurance Institution for Transport and Traffic, Ottenser Hauptstrasse 54, 22765 Hamburg (Germany)

2013-05-10

Seamen working on vessels that go along tropical and subtropical routes are at risk to receive high doses of solar erythemal radiation. Due to small solar zenith angles and low ozone values, UV index and erythemal dose are much higher than at mid-and high latitudes. UV index values at tropical and subtropical Oceans can exceed UVI = 20, which is more than double of typical mid-latitude UV index values. Daily erythemal dose can exceed the 30-fold of typical midlatitude winter values. Measurements of erythemal exposure of different body parts on seamen have been performed along 4 routes of merchant vessels. The data base has been extended by two years of continuous solar irradiance measurements taken on the mast top of RV METEOR. Radiative transfer model calculations for clear sky along the ship routes have been performed that use satellite-based input for ozone and aerosols to provide maximum erythemal irradiance and dose. The whole data base is intended to be used to derive individual erythemal exposure of seamen during work-time.

The stem cell division theory of cancer.

Science.gov (United States)

López-Lázaro, Miguel

2018-03-01

All cancer registries constantly show striking differences in cancer incidence by age and among tissues. For example, lung cancer is diagnosed hundreds of times more often at age 70 than at age 20, and lung cancer in nonsmokers occurs thousands of times more frequently than heart cancer in smokers. An analysis of these differences using basic concepts in cell biology indicates that cancer is the end-result of the accumulation of cell divisions in stem cells. In other words, the main determinant of carcinogenesis is the number of cell divisions that the DNA of a stem cell has accumulated in any type of cell from the zygote. Cell division, process by which a cell copies and separates its cellular components to finally split into two cells, is necessary to produce the large number of cells required for living. However, cell division can lead to a variety of cancer-promoting errors, such as mutations and epigenetic mistakes occurring during DNA replication, chromosome aberrations arising during mitosis, errors in the distribution of cell-fate determinants between the daughter cells, and failures to restore physical interactions with other tissue components. Some of these errors are spontaneous, others are promoted by endogenous DNA damage occurring during quiescence, and others are influenced by pathological and environmental factors. The cell divisions required for carcinogenesis are primarily caused by multiple local and systemic physiological signals rather than by errors in the DNA of the cells. As carcinogenesis progresses, the accumulation of DNA errors promotes cell division and eventually triggers cell division under permissive extracellular environments. The accumulation of cell divisions in stem cells drives not only the accumulation of the DNA alterations required for carcinogenesis, but also the formation and growth of the abnormal cell populations that characterize the disease. This model of carcinogenesis provides a new framework for understanding the

Latent factors and route choice behaviour

DEFF Research Database (Denmark)

Prato, Carlo Giacomo

. A reliable dataset was prepared through measures of internal consistency and sampling adequacy, and data were analyzed with a proper application of factor analysis to the route choice context. For the dataset obtained from the survey, six latent constructs affecting driver behaviour were extracted and scores...... on each factor for each survey participant were calculated. Path generation algorithms were examined with respect to observed behaviour, through a measure of reproduction with deterministic techniques of the routes indicated in the answers to the survey. Results presented evidence that the majority...... and Link Nested Logit. Estimates were produced from model specifications that considered level-of-service, label and facility dummy variables. Moreover, a modelling framework was designed to represent drivers’ choices as affected by the latent constructs extracted with factor analysis. Previous experience...

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

DEFF Research Database (Denmark)

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

2013-01-01

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

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

NARCIS (Netherlands)

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

2016-01-01

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

Route Monopolie and Optimal Nonlinear Pricing

Science.gov (United States)

Tournut, Jacques

2003-01-01

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

Periodic Heterogeneous Vehicle Routing Problem With Driver Scheduling

Science.gov (United States)

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

2018-01-01

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

A Mathematical Model and Algorithm for Routing Air Traffic Under Weather Uncertainty

Science.gov (United States)

Sadovsky, Alexander V.

2016-01-01

A central challenge in managing today's commercial en route air traffic is the task of routing the aircraft in the presence of adverse weather. Such weather can make regions of the airspace unusable, so all affected flights must be re-routed. Today this task is carried out by conference and negotiation between human air traffic controllers (ATC) responsible for the involved sectors of the airspace. One can argue that, in so doing, ATC try to solve an optimization problem without giving it a precise quantitative formulation. Such a formulation gives the mathematical machinery for constructing and verifying algorithms that are aimed at solving the problem. This paper contributes one such formulation and a corresponding algorithm. The algorithm addresses weather uncertainty and has closed form, which allows transparent analysis of correctness, realism, and computational costs.

Ship Pipe Routing Design Using NSGA-II and Coevolutionary Algorithm

Directory of Open Access Journals (Sweden)

Wentie Niu

2016-01-01

Full Text Available Pipe route design plays a prominent role in ship design. Due to the complex configuration in layout space with numerous pipelines, diverse design constraints, and obstacles, it is a complicated and time-consuming process to obtain the optimal route of ship pipes. In this article, an optimized design method for branch pipe routing is proposed to improve design efficiency and to reduce human errors. By simplifying equipment and ship hull models and dividing workspace into three-dimensional grid cells, the mathematic model of layout space is constructed. Based on the proposed concept of pipe grading method, the optimization model of pipe routing is established. Then an optimization procedure is presented to deal with pipe route planning problem by combining maze algorithm (MA, nondominated sorting genetic algorithm II (NSGA-II, and cooperative coevolutionary nondominated sorting genetic algorithm II (CCNSGA-II. To improve the performance in genetic algorithm procedure, a fixed-length encoding method is presented based on improved maze algorithm and adaptive region strategy. Fuzzy set theory is employed to extract the best compromise pipeline from Pareto optimal solutions. Simulation test of branch pipe and design optimization of a fuel piping system were carried out to illustrate the design optimization procedure in detail and to verify the feasibility and effectiveness of the proposed methodology.

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

Directory of Open Access Journals (Sweden)

Wei Zhang

2016-01-01

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

Division of labour and the evolution of extreme specialization.

Science.gov (United States)

Cooper, Guy A; West, Stuart A

2018-05-28

Division of labour is a common feature of social groups, from biofilms to complex animal societies. However, we lack a theoretical framework that can explain why division of labour has evolved on certain branches of the tree of life but not others. Here, we model the division of labour over a cooperative behaviour, considering both when it should evolve and the extent to which the different types should become specialized. We found that: (1) division of labour is usually-but not always-favoured by high efficiency benefits to specialization and low within-group conflict; and (2) natural selection favours extreme specialization, where some individuals are completely dependent on the helping behaviour of others. We make a number of predictions, several of which are supported by the existing empirical data, from microbes and animals, while others suggest novel directions for empirical work. More generally, we show how division of labour can lead to mutual dependence between different individuals and hence drive major evolutionary transitions, such as those to multicellularity and eusociality.

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

Science.gov (United States)

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…

Modelling and Initial Validation of the DYMO Routing Protocol for Mobile Ad-Hoc Networks

DEFF Research Database (Denmark)

Espensen, Kristian Asbjørn Leth; Kjeldsen, Mads Keblov; Kristensen, Lars Michael

2008-01-01

A mobile ad-hoc network (MANET) is an infrastructureless network established by a set of mobile devices using wireless communication. The Dynamic MANET On-demand (DYMO) protocol is a routing protocol for multi-hop communication in MANETs currently under development by the Internet Engineering Task...... Force (IETF). This paper presents a Coloured Petri Net (CPN) model of the mandatory parts of the DYMO protocol, and shows how scenario-based state space exploration has been used to validate key properties of the protocol. Our CPN modelling and verification work has spanned two revisions of the DYMO...... protocol specification and have had direct impact on the most recent version of the protocol specification....

Intermittency route to chaos in a biochemical system.

Science.gov (United States)

De la Fuente, I M; Martinez, L; Veguillas, J

1996-01-01

The numerical analysis of a glycolytic model performed through the construction of a system of three differential-delay equations reveals a phenomenon of intermittency route to chaos. In our biochemical system, the consideration of delay time variations under constant input flux as well as frequency variations of the periodic substrate input flux allows us, in both cases, to observe a type of transition to chaos different from the 'Feigenbaum route'.

Model of Optimal Cargo Transport Structure by Full Container Ship on Predefined Sailing Route

Directory of Open Access Journals (Sweden)

Serđo Kos

2004-01-01

Full Text Available This paper presents the mathematical model for solving theproblem of defining optimal cargo transport structure, occurringwhen, on a predefined sailing route, adequate number ofcontainers of various types, masses and sizes, possibly includingRO!RO cargo, is to be selected, i.e., a "container lot" is to beestablished in loading ports with the aim of gaining maximumship profit and, at the same time, of exploiting useful load andtransport capacity of container ship as much as possible. Theimplementation of the proposed model enables considerableincrease in the efficiency of container ship operations. Themodel was tested using a numerical example with real data.The applied post-optimal analysis examines the influence ofchange in some values of the mathematical model on the resultingoptimal program.

Hazmat Routes (National)

Data.gov (United States)

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

Mechanical Division of Cell-Sized Liposomes

NARCIS (Netherlands)

Deshpande, S.R.; Kerssemakers, J.W.J.; Dekker, C.

2018-01-01

Liposomes, self-assembled vesicles with a lipid-bilayer boundary similar to cell membranes, are extensively used in both fundamental and applied sciences. Manipulation of their physical properties, such as growth and division, may significantly expand their use as model systems in cellular and

An Indirect Route for Ethanol Production

Energy Technology Data Exchange (ETDEWEB)

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

2005-04-29

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

Experimental Facilities Division/User Program Division technical progress report 1999-2000

International Nuclear Information System (INIS)

2001-01-01

In October 1999, the two divisions of the Advanced Photon Source (APS), the Accelerator Systems Division (ASD) and the Experimental Facilities Division (XFD), were reorganized into four divisions (see high-level APS organizational chart, Fig. 1.1). In addition to ASD and XFD, two new divisions were created, the APS Operations Division (AOD), to oversee APS operations, and the User Program Division (UPD), to serve the APS user community by developing and maintaining the highest quality user technical and administration support. Previous XFD Progress Reports (ANL/APS/TB-30 and ANL/APS/TB-34) covered a much broader base, including APS user administrative support and what was previously XFD operations (front ends, interlocks, etc.) This Progress Report summarizes the main scientific and technical activities of XFD, and the technical support, research and development (R and D) activities of UPD from October 1998 through November 2000. The report is divided into four major sections, (1) Introduction, (2) SRI-CAT Beamlines, Technical Developments, and Scientific Applications, (3) User Technical Support, and (4) Major Plans for the Future. Sections 2 and 3 describe the technical activities and research accomplishments of the XFD and UPD personnel in supporting the synchrotron radiation instrumentation (SRI) collaborative access team (CAT) and the general APS user community. Also included in this report is a comprehensive list of publications (Appendix 1) and presentations (Appendix 2) by XFD and UPD staff during the time period covered by this report. The organization of section 2, SRI CAT Beamlines, Technical Developments, and Scientific Applications has been made along scientific techniques/disciplines and not ''geographical'' boundaries of the sectors in which the work was performed. Therefore items under the subsection X-ray Imaging and Microfocusing could have been (and were) performed on several different beamlines by staff in different divisions. The management of

Division of atomic physics

International Nuclear Information System (INIS)

Kroell, S.

1994-01-01

The Division of Atomic Physics, Lund Institute of Technology (LTH), is responsible for the basic physics teaching in all subjects at LTH and for specialized teaching in Optics, Atomic Physics, Atomic and Molecular Spectroscopy and Laser Physics. The Division has research activities in basic and applied optical spectroscopy, to a large extent based on lasers. It is also part of the Physics Department, Lund University, where it forms one of eight divisions. Since the beginning of 1980 the research activities of our division have been centred around the use of lasers. The activities during the period 1991-1992 is described in this progress reports

Earth Sciences Division annual report 1990

Energy Technology Data Exchange (ETDEWEB)

NONE

1991-06-01

This Annual Report presents summaries of selected representative research activities grouped according to the principal disciplines of the Earth Sciences Division: Reservoir Engineering and Hydrogeology, Geology and Geochemistry, and Geophysics and Geomechanics. Much of the Division`s research deals with the physical and chemical properties and processes in the earth`s crust, from the partially saturated, low-temperature near-surface environment to the high-temperature environments characteristic of regions where magmatic-hydrothermal processes are active. Strengths in laboratory and field instrumentation, numerical modeling, and in situ measurement allow study of the transport of mass and heat through geologic media -- studies that now include the appropriate chemical reactions and the hydraulic-mechanical complexities of fractured rock systems. Of particular note are three major Division efforts addressing problems in the discovery and recovery of petroleum, the application of isotope geochemistry to the study of geodynamic processes and earth history, and the development of borehole methods for high-resolution imaging of the subsurface using seismic and electromagnetic waves. In 1989 a major DOE-wide effort was launched in the areas of Environmental Restoration and Waste Management. Many of the methods previously developed for and applied to deeper regions of the earth will in the coming years be turned toward process definition and characterization of the very shallow subsurface, where man-induced contaminants now intrude and where remedial action is required.

Eco-routing: More green drivers means more benefits?

Energy Technology Data Exchange (ETDEWEB)

Valdes Serrano, C.; Perez Prada, F.; Monzon de Caceres, A.

2016-07-01

Information and Communications Technology (ICT)/Information and Technology Services (ITS) can play an important role in the transport sector, helping in maintaining accessibility and contemporarily optimizing the use of the vehicles. Among these ICT measures, eco-routing seems a promising one. Drivers normally follow the route which minimizes their generalized costs, normally time and money. But environmental concern is increasing, and drivers are starting to think about the effects of their driving. This means including CO2 emissions or fuel consumption in their route choice. But is this always positive, independently of the traffic situation and the penetration level of green drivers? This articles aims to analyze what happens in terms of fuel consumption, CO2 emissions and travel time, when different penetration levels of drivers, and with different traffic situations, follow the route of minimum fuel consumption instead of the conventional generalized costs. The analysis is based on a modelling process using a transport model of the whole region of Madrid. A total of 18 scenarios are considered: 3 reference scenarios (for congested, medium and low flow traffic situations), and 5 different penetration levels of green drivers for each traffic situation. Results show how impact varies substantially with the level of traffic and, also, that the more the best is not always true. (Author)

ARBR: Adaptive reinforcement-based routing for DTN

KAUST Repository

Elwhishi, Ahmed

2010-10-01

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

P-bRS: A Physarum-Based Routing Scheme for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Mingchuan Zhang

2014-01-01

Full Text Available Routing in wireless sensor networks (WSNs is an extremely challenging issue due to the features of WSNs. Inspired by the large and single-celled amoeboid organism, slime mold Physarum polycephalum, we establish a novel selecting next hop model (SNH. Based on this model, we present a novel Physarum-based routing scheme (P-bRS for WSNs to balance routing efficiency and energy equilibrium. In P-bRS, a sensor node can choose the proper next hop by using SNH which comprehensively considers the distance, energy residue, and location of the next hop. The simulation results show how P-bRS can achieve the effective trade-off between routing efficiency and energy equilibrium compared to two famous algorithms.

A Model of Onion Routing With Provable Anonymity

Science.gov (United States)

2006-08-30

Lysyanskaya. “A Formal Treatment of Onion Routing.” CRYPTO 2005, pp. 169.187, 2005. [4] David Chaum . “The dining cryptographers problem...1988. [5] David Chaum . “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms.” Communi- cations of the ACM, 24(2), pp. 84-88, 1981...network layer.” ACM Conference on Computer and Communications Security, pp. 193-206, 2002. [11] David Goldschlag, Michael Reed, and Paul Syverson

Route and landmark selection tool (RULST) : user's manual.; TOPICAL

International Nuclear Information System (INIS)

Widing, M. A.

2002-01-01

The Route and Landmark Selection Tool (RULST) is a software program designed to assist military planners in defining geographical objects, such as routes, landmarks, spurs, and yards, at a given facility. Argonne National Laboratory is currently developing a prototype of this tool for use by the Military Traffic Management Command Transportation Engineering Agency (MTMCTEA). The primary objective of RULST is to populate database tables of facility objects for use in MTMCTEA models. RULST defines facility data for use in models such as Port Simulation (PORTSIM) and Transportation System Capability (TRANSCAP), which simulate the transportation of equipment through ports and military installations. The main purpose of RULST is to allow you to specify the relationships between landmarks and routes. The nodes, links, and landmarks that describe a facility are often predefined on the basis of the layout of the physical site

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

Science.gov (United States)

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

A functional near-infrared spectroscopy study of lexical decision task supports the dual route model and the phonological deficit theory of dyslexia.

Science.gov (United States)

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.

Generalized Lorenz models and their routes to chaos. II. Energy-conserving horizontal mode truncations

International Nuclear Information System (INIS)

Roy, D.; Musielak, Z.E.

2007-01-01

All attempts to generalize the three-dimensional Lorenz model by selecting higher-order Fourier modes can be divided into three categories, namely: vertical, horizontal and vertical-horizontal mode truncations. The previous study showed that the first method allowed only construction of a nine-dimensional system when the selected modes were energy-conserving. The results presented in this paper demonstrate that a five-dimensional model is the lowest-order generalized Lorenz model that can be constructed by the second method and that its route to chaos is the same as that observed in the original Lorenz model. It is shown that the onset of chaos in both systems is determined by a number of modes that describe the vertical temperature difference in a convection roll. In addition, a simple rule that allows selecting modes that conserve energy for each method is derived

Novel Congestion-Free Alternate Routing Path Scheme using Stackelberg Game Theory Model in Wireless Networks

Directory of Open Access Journals (Sweden)

P. Chitra

2017-04-01

Full Text Available Recently, wireless network technologies were designed for most of the applications. Congestion raised in the wireless network degrades the performance and reduces the throughput. Congestion-free network is quit essen- tial in the transport layer to prevent performance degradation in a wireless network. Game theory is a branch of applied mathematics and applied sciences that used in wireless network, political science, biology, computer science, philosophy and economics. e great challenges of wireless network are their congestion by various factors. E ective congestion-free alternate path routing is pretty essential to increase network performance. Stackelberg game theory model is currently employed as an e ective tool to design and formulate conges- tion issues in wireless networks. is work uses a Stackelberg game to design alternate path model to avoid congestion. In this game, leaders and followers are selected to select an alternate routing path. e correlated equilibrium is used in Stackelberg game for making better decision between non-cooperation and cooperation. Congestion was continuously monitored to increase the throughput in the network. Simulation results show that the proposed scheme could extensively improve the network performance by reducing congestion with the help of Stackelberg game and thereby enhance throughput.

Technical activities, 1990: Surface Science Division

International Nuclear Information System (INIS)

Powell, C.J.

1991-05-01

The report summarizes technical activities and accomplishments of the NIST Surface Science Division during Fiscal Year 1990. Overviews are presented of the Division and of its three constituent groups: Surface Dynamical Processes, Thin Films and Interfaces, and Surface Spectroscopies and Standards. These overviews are followed by reports of selected technical accomplishments during the year. A summary is given of Division outputs and interactions that includes lists of publications, talks, committee assignments, seminars (including both Division seminars and Interface Science seminars arranged through the Division), conferences organized, and a standard reference material certified. Finally, lists are given of Division staff and of guest scientists who have worked in the Division during the past year

Mean Velocity Prediction Information Feedback Strategy in Two-Route Systems under ATIS

Directory of Open Access Journals (Sweden)

Jianqiang Wang

2015-02-01

Full Text Available Feedback contents of previous information feedback strategies in advanced traveler information systems are almost real-time traffic information. Compared with real-time information, prediction traffic information obtained by a reliable and effective prediction algorithm has many undisputable advantages. In prediction information environment, a traveler is prone to making a more rational route-choice. For these considerations, a mean velocity prediction information feedback strategy (MVPFS is presented. The approach adopts the autoregressive-integrated moving average model (ARIMA to forecast short-term traffic flow. Furthermore, prediction results of mean velocity are taken as feedback contents and displayed on a variable message sign to guide travelers' route-choice. Meanwhile, discrete choice model (Logit model is selected to imitate more appropriately travelers' route-choice behavior. In order to investigate the performance of MVPFS, a cellular automaton model with ARIMA is adopted to simulate a two-route scenario. The simulation shows that such innovative prediction feedback strategy is feasible and efficient. Even more importantly, this study demonstrates the excellence of prediction feedback ideology.

3. Theoretical Physics Division

International Nuclear Information System (INIS)

For the period September 1980 - Aug 1981, the studies in theoretical physics divisions have been compiled under the following headings: in nuclear physics, nuclear structure, nuclear reactions and intermediate energies; in particle physics, NN and NantiN interactions, dual topological unitarization, quark model and quantum chromodynamics, classical and quantum field theories, non linear integrable equations and topological preons and Grand unified theories. A list of publications, lectures and meetings is included [fr

Modeling and Solving the Multi-depot Vehicle Routing Problem with Time Window by Considering the Flexible end Depot in Each Route

Directory of Open Access Journals (Sweden)

Mohammad Mirabi

2016-11-01

Full Text Available This paper considers the multi-depot vehicle routing problem with time window in which each vehicle starts from a depot and there is no need to return to its primary depot after serving customers. The mathematical model which is developed by new approach aims to minimizing the transportation cost including the travelled distance, the latest and the earliest arrival time penalties. Furthermore, in order to reduce the problem searching space, a novel GA clustering method is developed. Finally, Experiments are run on number problems of varying depots and time window, and customer sizes. The method is compared to two other clustering techniques, fuzzy C means (FCM and K-means algorithm. Experimental results show the robustness and effectiveness of the proposed algorithm.

Route planning of raw materials transportation in the industrial hub of Mariupol city

Directory of Open Access Journals (Sweden)

Юлія Вікторівна Булгакова

2017-07-01

Full Text Available The multi-modal freight transportation routes planning problem is viewed in this paper. The case study of iron ore deliveries to the metallurgical enterprises of Mariupol from Kryvyi Rih is presented. Based on the analysis of Ukrainian railroads and sea ports infrastructures six possible routes of multi-modal iron ore transportation are built. The paper presents a short review of route planning problem in multi-modal freight transportations, which are use sea and land parts together, regarding decision support methods of routes evaluation and selection. The lack of studies dedicated to fuzzy logic theory application for solving the stated problems is identified. The relevance of fuzzy set application to the route planning problem is proved. Taking into account the peculiarities of iron ore transportations technology, the following criterions of routes evaluation are chosen: «transportation costs», «delivery times», «transportation risks». The model of multicriterion decision-making of routes evaluation and the optimal route selection, based on fuzzy logic theory, is developed. Criteria of routes evaluation are set by three terms Gaussian and sigmoidal membership functions. The approach to each function construction is practice-based and executed together with iron ore supply chain manager. The model is created in MATLAB Fuzzy Logic Tool Box environment using Mamdani’s fuzzy inference

Generation and quality assessment of route choice sets in public transport networks by means of RP data analysis

DEFF Research Database (Denmark)

Larsen, Marie Karen; Nielsen, Otto Anker; Prato, Carlo Giacomo

2010-01-01

Literature in route choice modelling shows that a lot of attention has been devoted to route choices of car drivers, but much less attention has been dedicated to route choices of public transport users. As modelling route choice behaviour consists of generating relevant routes and estimating...... discrete choice models, this paper focuses on the issue of choice set generation in public transport networks. Specifically, this paper describes the generation of choice sets for users of the Greater Copenhagen public transport system by applying a doubly stochastic path generation algorithm...

Modeling and Simulation of a Novel Relay Node Based Secure Routing Protocol Using Multiple Mobile Sink for Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Madhumathy Perumal

2015-01-01

Full Text Available Data gathering and optimal path selection for wireless sensor networks (WSN using existing protocols result in collision. Increase in collision further increases the possibility of packet drop. Thus there is a necessity to eliminate collision during data aggregation. Increasing the efficiency is the need of the hour with maximum security. This paper is an effort to come up with a reliable and energy efficient WSN routing and secure protocol with minimum delay. This technique is named as relay node based secure routing protocol for multiple mobile sink (RSRPMS. This protocol finds the rendezvous point for optimal transmission of data using a “splitting tree” technique in tree-shaped network topology and then to determine all the subsequent positions of a sink the “Biased Random Walk” model is used. In case of an event, the sink gathers the data from all sources, when they are in the sensing range of rendezvous point. Otherwise relay node is selected from its neighbor to transfer packets from rendezvous point to sink. A symmetric key cryptography is used for secure transmission. The proposed relay node based secure routing protocol for multiple mobile sink (RSRPMS is experimented and simulation results are compared with Intelligent Agent-Based Routing (IAR protocol to prove that there is increase in the network lifetime compared with other routing protocols.

Multihop Wireless Networks Opportunistic Routing

CERN Document Server

Zeng, Kai; Li, Ming

2011-01-01

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

Cooperative Route Planning for Multiple Aircraft in a Semifree ATC System

Directory of Open Access Journals (Sweden)

Yi Yang

2018-01-01

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

Technical note: A hydrological routing scheme for the Ecosystem Demography model (ED2+R tested in the Tapajós River basin in the Brazilian Amazon

Directory of Open Access Journals (Sweden)

F. F. Pereira

2017-09-01

Full Text Available Land surface models are excellent tools for studying how climate change and land use affect surface hydrology. However, in order to assess the impacts of Earth processes on river flows, simulated changes in runoff need to be routed through the landscape. In this technical note, we describe the integration of the Ecosystem Demography (ED2 model with a hydrological routing scheme. The purpose of the study was to create a tool capable of incorporating to hydrological predictions the terrestrial ecosystem responses to climate, carbon dioxide, and land-use change, as simulated with terrestrial biosphere models. The resulting ED2+R model calculates the lateral routing of surface and subsurface runoff resulting from the terrestrial biosphere models' vertical water balance in order to determine spatiotemporal patterns of river flows within the simulated region. We evaluated the ED2+R model in the Tapajós, a 476 674 km2 river basin in the southeastern Amazon, Brazil. The results showed that the integration of ED2 with the lateral routing scheme results in an adequate representation (Nash–Sutcliffe efficiency up to 0.76, Kling–Gupta efficiency up to 0.86, Pearson's R up to 0.88, and volume ratio up to 1.06 of daily to decadal river flow dynamics in the Tapajós. These results are a consistent step forward with respect to the no river representation common among terrestrial biosphere models, such as the initial version of ED2.

CulRoute: Gamified WebGIS3D platform for selection of touristic routes

Directory of Open Access Journals (Sweden)

E.P.L. Baptista

2015-11-01

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

Physics Division Argonne National Laboratory description of the programs and facilities.

Energy Technology Data Exchange (ETDEWEB)

Thayer, K.J. [ed.

1999-05-24

The ANL Physics Division traces its roots to nuclear physics research at the University of Chicago around the time of the second world war. Following the move from the University of Chicago out to the present Argonne site and the formation of Argonne National Laboratory: the Physics Division has had a tradition of research into fundamental aspects of nuclear and atomic physics. Initially, the emphasis was on areas such as neutron physics, mass spectrometry, and theoretical studies of the nuclear shell model. Maria Goeppert Maier was an employee in the Physics Division during the time she did her Nobel-Prize-winning work on the nuclear shell model. These interests diversified and at the present time the research addresses a wide range of current problems in nuclear and atomic physics. The major emphasis of the current experimental nuclear physics research is in heavy-ion physics, centered around the ATLAS facility (Argonne Tandem-Linac Accelerator System) with its new injector providing intense, energetic ion beams over the fill mass range up to uranium. ATLAS is a designated National User Facility and is based on superconducting radio-frequency technology developed in the Physics Division. A small program continues in accelerator development. In addition, the Division has a strong program in medium-energy nuclear physics carried out at a variety of major national and international facilities. The nuclear theory research in the Division spans a wide range of interests including nuclear dynamics with subnucleonic degrees of freedom, dynamics of many-nucleon systems, nuclear structure, and heavy-ion interactions. This research makes contact with experimental research programs in intermediate-energy and heavy-ion physics, both within the Division and on the national and international scale. The Physics Division traditionally has strong connections with the nation's universities. We have many visiting faculty members and we encourage students to participate in our

Joint Power Charging and Routing in Wireless Rechargeable Sensor Networks.

Science.gov (United States)

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

2017-10-09

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

A multi-objective location routing problem using imperialist competitive algorithm

Directory of Open Access Journals (Sweden)

Amir Mohammad Golmohammadi

2016-06-01

Full Text Available Nowadays, most manufacturing units try to locate their requirements and the depot vehicle routing in order to transport the goods at optimum cost. Needless to mention that the locations of the required warehouses influence on the performance of vehicle routing. In this paper, a mathematical programming model to optimize the storage location and vehicle routing are presented. The first objective function of the model minimizes the total cost associated with the transportation and storage, and the second objective function minimizes the difference distance traveled by vehicles. The study uses Imperialist Competitive Algorithm (ICA to solve the resulted problems in different sizes. The preliminary results have indicated that the proposed study has performed better than NSGA-II and PAES methods in terms of Quality metric and Spacing metric.

Colonic stem cell data are consistent with the immortal model of stem cell division under non-random strand segregation.

Science.gov (United States)

Walters, K

2009-06-01

Colonic stem cells are thought to reside towards the base of crypts of the colon, but their numbers and proliferation mechanisms are not well characterized. A defining property of stem cells is that they are able to divide asymmetrically, but it is not known whether they always divide asymmetrically (immortal model) or whether there are occasional symmetrical divisions (stochastic model). By measuring diversity of methylation patterns in colon crypt samples, a recent study found evidence in favour of the stochastic model, assuming random segregation of stem cell DNA strands during cell division. Here, the effect of preferential segregation of the template strand is considered to be consistent with the 'immortal strand hypothesis', and explore the effect on conclusions of previously published results. For a sample of crypts, it is shown how, under the immortal model, to calculate mean and variance of the number of unique methylation patterns allowing for non-random strand segregation and compare them with those observed. The calculated mean and variance are consistent with an immortal model that incorporates non-random strand segregation for a range of stem cell numbers and levels of preferential strand segregation. Allowing for preferential strand segregation considerably alters previously published conclusions relating to stem cell numbers and turnover mechanisms. Evidence in favour of the stochastic model may not be as strong as previously thought.

An Endosymbiotic Evolutionary Algorithm for the Hub Location-Routing Problem

Directory of Open Access Journals (Sweden)

Ji Ung Sun

2015-01-01

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

Sensitivity Test of Parameters Influencing Flood Hydrograph Routing with a Diffusion-Wave Distributed using Distributed Hydrological Model, Wet Spa, in Ziarat Watershed

Directory of Open Access Journals (Sweden)

narges javidan

2017-02-01

Full Text Available Introduction: Flood routing is a procedure to calculate flood stage and water depth along a river or to estimate flood hydrograph at river downstream or at reservoir outlets using the upstream hydrography . In river basins, excess rainfall is routed to the basin outlet using flow routing techniques to generate flow hydrograph. A GIS-based distributed hydrological model, Wet Spa, has been under development suitable for flood prediction and watershed management on a catchment scale. The model predicts outflow hydrographs at the basin outlet or at any converging point in the watershed, and it does so in a user-specified time step. The model is physically based, spatially distributed and time-continuous, and simulates hydrological processes of precipitation, snowmelt, interception, depression, surface runoff, infiltration, evapotranspiration, percolation, interflow, groundwater flow, etc. continuously both in time and space, for which the water and energy balance are maintained on each raster cell. Surface runoff is produced using a modified coefficient method based on the cellular characteristics of slope, land use, and soil type, and allowed to vary with soil moisture, rainfall intensity and storm duration. Interflow is computed based on the Darcy’s law and the kinematic approximation as a function of the effective hydraulic conductivity and the hydraulic gradient, while groundwater flow is estimated with a linear reservoir method on a small subcatchment scale as a function of groundwater storage and a recession coefficient. Special emphasis is given to the overland flow and channel flow routing using the method of linear diffusive wave approximation, which is capable to predict flow discharge at any converging point downstream by a unit response function. The model accounts for spatially distributed hydrological and geophysical characteristics of the catchment. Determination of the river flow hydrograph is a main target in hydrology

Expanding the applicability of random regret minimization for route choice analysis

DEFF Research Database (Denmark)

Prato, Carlo Giacomo

2014-01-01

The discrete choice paradigm of random regret minimization (RRM) has been recently proposed in several choice contexts. In the route choice context, the paradigm has been used to model the choice among three routes and to formulate regret-based stochastic user equilibrium. However, in the same co...

Optimal routing of coordinated aircraft to Identify moving surface contacts

Science.gov (United States)

2017-06-01

either model for any asset’s route. Its inclusion may eliminate arcs that could be part of an optimal route for an asset. As such, it should be...Arma Aérea.” Revista general de Marina 8: 319–332. http://www.armada.mde.es/archivo/rgm/ 2016/08/2016_08.pdf. Marine Traffic. n.d. “Density maps

Identifying and prioritizing ungulate migration routes for landscape-level conservation

Science.gov (United States)

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

2009-01-01

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

Secure Route Structures for Parallel Mobile Agents Based Systems Using Fast Binary Dispatch

Directory of Open Access Journals (Sweden)

Yan Wang

2005-01-01

Full Text Available In a distributed environment, where a large number of computers are connected together to enable the large-scale sharing of data and computing resources, agents, especially mobile agents, are the tools for autonomously completing tasks on behalf of their owners. For applications of large-scale mobile agents, security and efficiency are of great concern. In this paper, we present a fast binary dispatch model and corresponding secure route structures for mobile agents dispatched in parallel to protect the dispatch routes of agents while ensuring the dispatch efficiency. The fast binary dispatch model is simple but efficient with a dispatch complexity of O(log2n. The secure route structures adopt the combination of public-key encryption and digital signature schemes and expose minimal route information to hosts. The nested structure can help detect attacks as early as possible. We evaluated the various models both analytically and empirically.

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

Science.gov (United States)

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

2016-01-01

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

E-Division activities report

International Nuclear Information System (INIS)

Barschall, H.H.

1984-07-01

E (Experimental Physics) Division carries out basic and applied research in atomic and nuclear physics, in materials science, and in other areas related to the missions of the Laboratory. Some of the activities are cooperative efforts with other divisions of the Laboratory, and, in a few cases, with other laboratories. Many of the experiments are directly applicable to problems in weapons and energy, some have only potential applied uses, and others are in pure physics. This report presents abstracts of papers published by E (Experimental Physics) Division staff members between July 1983 and June 1984. In addition, it lists the members of the scientific staff of the division, including visitors and students, and some of the assignments of staff members on scientific committees. A brief summary of the budget is included

Progress report of Applied Physics Division. 1 October 1980 - 30 June 1981. Acting Division Chief - Dr. J. Parry

International Nuclear Information System (INIS)

2004-01-01

In September 1980, the Commission approved a reorganization of Physics Division, Engineering Research Division and Instrumentation and Control Division to form two new research divisions to be known as Applied Physics Division and Nuclear Technology Division. The Applied Physics Division will be responsible for applied science programs, particularly those concerned with nuclear techniques. The Division is organized as four sections with the following responsibilities: (1) Nuclear Applications and Energy Studies Section. Program includes studies in nuclear physics, nuclear applications, ion implantation and neutron scattering. (2) Semiconductor and Radiation Physics Section. Studies in semiconductor radiation detectors, radiation standards and laser applications. (3) Electronic Systems Section. This includes systems analysis, digital systems, instrument design, project instrumentation and instrument maintenance. (4) Fusion Physics Section. This covers work carried out by staff currently attached to university groups (author)

An Application of the PMI Model at the System Level: Evaluation of a Division in Central Administration.

Science.gov (United States)

Bland, June D.

Each of the divisions of the Office of Educational Accountability in the District of Columbia Public Schools was required to submit an evaluation design that would be used to measure division accomplishments at the end of the school year. Since the Division of Research and Evaluation had already completed the development of the Planning,…

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

OpenAIRE

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

2017-01-01

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

Performance Analysis of the Enhanced DSR Routing Protocol for the Short Time Disconnected MANET to the OPNET Modeler

Directory of Open Access Journals (Sweden)

PAPAJ Ján

2013-05-01

Full Text Available Disconnected mobile ad-hoc networks (MANET are very important areas of the research. In this article, the performance analysis of the enhanced dynamic source routing protocol (OPP_DSR is introduced. This modification enables the routing process in the case when there are no connections to other mobile nodes. It also will enable the routing mechanisms when the routes, selected by routing mechanisms, are disconnected for some time. Disconnection can be for a short time and standard routing protocol DSR cannot reflect on this situation.The main idea is based on opportunistic forwarding where the nodes not only forward data but it's stored in the cache during long time. The network parameters throughput, routing load and are analysed.

Personal continuous route pattern mining

Institute of Scientific and Technical Information of China (English)

Qian YE; Ling CHEN; Gen-cai CHEN

2009-01-01

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

Does the patient's inherent rating tendency influence reported satisfaction scores and affect division ranking?

Science.gov (United States)

Francis, Patricia; Agoritsas, Thomas; Chopard, Pierre; Perneger, Thomas

2016-04-01

To determine the impact of adjusting for rating tendency (RT) on patient satisfaction scores in a large teaching hospital and to assess the impact of adjustment on the ranking of divisions. Cross-sectional survey. Large 2200-bed university teaching hospital. All adult patients hospitalized during a 1-month period in one of 20 medical divisions. None. Patient experience of care measured by the Picker Patient Experience questionnaire and RT scores. Problem scores were weakly but significantly associated with RT. Division ranking was slightly modified in RT adjusted models. Division ranking changed substantially in case-mix adjusted models. Adjusting patient self-reported problem scores for RT did impact ranking of divisions, although marginally. Further studies are needed to determine the impact of RT when comparing different institutions, particularly across inter-cultural settings, where the difference in RT may be more substantial. © The Author 2016. Published by Oxford University Press in association with the International Society for Quality in Health Care; all rights reserved.

Modeling and Analysis of Mechanical Properties of Aluminium Alloy (A413 Processed through Squeeze Casting Route Using Artificial Neural Network Model and Statistical Technique

Directory of Open Access Journals (Sweden)

R. Soundararajan

2015-01-01

Full Text Available Artificial Neural Network (ANN approach was used for predicting and analyzing the mechanical properties of A413 aluminum alloy produced by squeeze casting route. The experiments are carried out with different controlled input variables such as squeeze pressure, die preheating temperature, and melt temperature as per Full Factorial Design (FFD. The accounted absolute process variables produce a casting with pore-free and ideal fine grain dendritic structure resulting in good mechanical properties such as hardness, ultimate tensile strength, and yield strength. As a primary objective, a feed forward back propagation ANN model has been developed with different architectures for ensuring the definiteness of the values. The developed model along with its predicted data was in good agreement with the experimental data, inferring the valuable performance of the optimal model. From the work it was ascertained that, for castings produced by squeeze casting route, the ANN is an alternative method for predicting the mechanical properties and appropriate results can be estimated rather than measured, thereby reducing the testing time and cost. As a secondary objective, quantitative and statistical analysis was performed in order to evaluate the effect of process parameters on the mechanical properties of the castings.

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

Science.gov (United States)

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

Chemical Routes to Colloidal Chalcogenide Nanosheets

Energy Technology Data Exchange (ETDEWEB)

Schaak, Raymond E. [Pennsylvania State Univ., University Park, PA (United States)

2014-11-25

This project began with an emphasis on developing new low-­temperature synthetic routes to intermetallic alloys in order to advance the synthesis and processing science of superconducting materials, as well as to potentially discover new materials that would be inaccessible using more traditional higher-­temperature methods. Our initial target materials, chosen as model systems for developing new low-­temperature solution-­based synthetic platforms, were based on well known superconducting alloys, including Nb₃M (M = Ga, Ge, Sn), Bi-­M (M = In, Cu), and MgCNi₃. Several key, fundamental synthetic challenges that underpinned the formation of these materials using solution chemistry routes were identified and investigated.

Truck Route Choice Modeling using Large Streams of GPS Data

Science.gov (United States)

2017-07-31

The primary goal of this research was to use large streams of truck-GPS data to analyze travel routes (or paths) chosen by freight trucks to travel between different origin and destination (OD) location pairs in metropolitan regions of Florida. Two s...

PERBEDAAN PENGARUH MODEL STUDENT TEAMS ACHIEVEMENT DIVISION (STAD DAN NUMBERED HEADS TOGETHER (NHT TERHADAP HASIL BELAJAR MATEMATIKA SISWA KELAS V SD

Directory of Open Access Journals (Sweden)

Nur Halimah

2017-09-01

Full Text Available This study aimed to determine the significance of the influence differences between the use of Student Teams Achievement Division (STAD model and Numbered Heads Together (NHT model on the 5th grade mathematics learning outcomes in SD Negeri Sumberejo 01 and SD Negeri Sumberejo 02. The type of research used was a quasi experiment with an unpredictable Pretest Posttest design. The subjects of the study were students of grade 5 in SD N Sumberejo 01 as experimental class 1 and grade V SD N of Sumberejo 02 as experiment class 2. The variables in this study consisted of independent variables, namely Student Teams Achievement Division (STAD model, Numbered Heads Together (NHT model and dependent variable was learning outcome. Data collection was done by test technique. The data analysis technique used T test with Independent T test Sample applied to posttest value. Result of t test of posttest value of experiment group 1 and experiment  group 2 showed that the value was in significance 0,019 ˂ 0,05, because the significance ˂ 0,05 hence Ho rejected and Ha accepted with conclusion there was significant difference between the model of STAD and NHT to the result of learning of mathematics at student grade 5 in SD Negeri Sumberejo 01 and SD Sumberejo 02. The significant difference in mathematics learning outcomes was supported by the difference average of two research samples, where the average of learning outcomes on the application of STAD learning model was 77.89, While the average of learning outcomes on the application of NHT learning model was 85.53. This meant that the learning treatment with NHT model has different significant impact compared to the STAD learning model on mathematics learning outcomes of grade 5 SD Sumberejo 01 and SD N Sumberejo 02 Semester II of 2016/2017academic year. Kata Kunci : Student Teams Achievement Division (STAD, Numbered Heads Together (NHT, Learning Outcomes, Mathematics, 5th grade primary school students

DTN routing in body sensor networks with dynamic postural partitioning.

Science.gov (United States)

Quwaider, Muhannad; Biswas, Subir

2010-11-01

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

Class network routing

Science.gov (United States)

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

2009-09-08

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

Comparison of Concussion Rates Between NCAA Division I and Division III Men's and Women's Ice Hockey Players.

Science.gov (United States)

Rosene, John M; Raksnis, Bryan; Silva, Brie; Woefel, Tyler; Visich, Paul S; Dompier, Thomas P; Kerr, Zachary Y

2017-09-01

Examinations related to divisional differences in the incidence of sports-related concussions (SRC) in collegiate ice hockey are limited. To compare the epidemiologic patterns of concussion in National Collegiate Athletic Association (NCAA) ice hockey by sex and division. Descriptive epidemiology study. A convenience sample of men's and women's ice hockey teams in Divisions I and III provided SRC data via the NCAA Injury Surveillance Program during the 2009-2010 to 2014-2015 academic years. Concussion counts, rates, and distributions were examined by factors including injury activity and position. Injury rate ratios (IRRs) and injury proportion ratios (IPRs) with 95% confidence intervals (CIs) were used to compare concussion rates and distributions, respectively. Overall, 415 concussions were reported for men's and women's ice hockey combined. The highest concussion rate was found in Division I men (0.83 per 1000 athlete-exposures [AEs]), followed by Division III women (0.78/1000 AEs), Division I women (0.65/1000 AEs), and Division III men (0.64/1000 AEs). However, the only significant IRR was that the concussion rate was higher in Division I men than Division III men (IRR = 1.29; 95% CI, 1.02-1.65). The proportion of concussions from checking was higher in men than women (28.5% vs 9.4%; IPR = 3.02; 95% CI, 1.63-5.59); however, this proportion was higher in Division I women than Division III women (18.4% vs 1.8%; IPR = 10.47; 95% CI, 1.37-79.75). The proportion of concussions sustained by goalkeepers was higher in women than men (14.2% vs 2.9%; IPR = 4.86; 95% CI, 2.19-10.77), with findings consistent within each division. Concussion rates did not vary by sex but differed by division among men. Checking-related concussions were less common in women than men overall but more common in Division I women than Division III women. Findings highlight the need to better understand the reasons underlying divisional differences within men's and women's ice hockey and the

SPICE analysis of the charge division in resistive semiconductor nanowire diodes

International Nuclear Information System (INIS)

Guardiola, C; Money, K; Carabe, A

2014-01-01

In this paper we present an analysis of the charge division method in semiconductor nanowire Schottky diodes using an electrical model based on the SPICE simulation code. A semiconductor nanowire prototype that is simulated as an RC network and two readout electronic systems are modelled in order to understand its behaviour and to assess its application as a possible ionizing particle detector in clinical high-LET particle beams. We study the use of resistive charge division along the semiconductor nanowire to calculate the position of deposited charge generated by an ionizing particle as it crosses the nanodevice and to determine the minimal viable spatial resolution. Our aim is to demonstrate the charge division concept in resistive semiconductor nanowire diodes, and to subsequently understand the performance of these nanodevices as radiation sensors and address the design limitations of such an application

Developing an eco-routing application.

Science.gov (United States)

2014-01-01

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

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

Science.gov (United States)

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.

Route-Based Signal Preemption Control of Emergency Vehicle

Directory of Open Access Journals (Sweden)

Haibo Mu

2018-01-01

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

About some types of constraints in problems of routing

Science.gov (United States)

Petunin, A. A.; Polishuk, E. G.; Chentsov, A. G.; Chentsov, P. A.; Ukolov, S. S.

2016-12-01

Many routing problems arising in different applications can be interpreted as a discrete optimization problem with additional constraints. The latter include generalized travelling salesman problem (GTSP), to which task of tool routing for CNC thermal cutting machines is sometimes reduced. Technological requirements bound to thermal fields distribution during cutting process are of great importance when developing algorithms for this task solution. These requirements give rise to some specific constraints for GTSP. This paper provides a mathematical formulation for the problem of thermal fields calculating during metal sheet thermal cutting. Corresponding algorithm with its programmatic implementation is considered. The mathematical model allowing taking such constraints into account considering other routing problems is discussed either.

Acoustic model optimisation for a call routing system

CSIR Research Space (South Africa)

Kleynhans, N

2012-11-01

Full Text Available Secretary system and provides background on some application-specific ASR issues. Section III details the ASR development effort as well as corpus selection and design. Our experiments are described Fig. 1. High level AutoSecretary call flow. in Section IV... and results and a discussion are presented in Section V. Lastly, the conclusion and possible future work appear in Section VI. II. BACKGROUND A. AutoSecretary IVR System Figure 1 shows the high level call flow of the AutoSecretary call routing system...

Routing strategy including time and carbon dioxide emissions : effects on network performance

NARCIS (Netherlands)

Zhang, Fan; Chen, Y.; Goni Ros, B.; GAO, Jian; Knoop, V.L.

2016-01-01

Traffic congestion leads to delays and increased carbon dioxide (CO2) emissions. Traffic management measures such as providing information on environmental route costs have been proposed to mitigate congestion. Multi-criteria routing dynamic traffic assignment (MCR-DTA) models are needed to evaluate

Evolution of division of labor: emergence of different activities among group members.

Science.gov (United States)

Nakahashi, Wataru; Feldman, Marcus W

2014-05-07

The division of labor is an important component of the organization of human society. However, why this division evolved in hominids requires further investigation. Archeological evidence suggests that it appeared after the emergence of Homo sapiens and contributed to the great success of our species. We develop a mathematical model to investigate under what conditions division of labor should evolve. We assume two types of resources the acquisition of which demands different skills, and study the evolution of the strategy that an individual should use to divide its lifetime into learning and using each skill. We show that division of labor likely evolves when group size is large, skill learning is important for acquiring resources, and there is food sharing within a group. We also investigate division of labor by gender under the assumption that the genders have different efficiencies in acquiring each resource. We show that division of labor by gender likely evolves when skill learning is important and the difference in efficiencies between genders in acquiring resources is large. We discuss how the results of our analysis might apply to the evolution of division of labor in hominids. Copyright © 2014 Elsevier Ltd. All rights reserved.

Network harness: bundles of routes in public transport networks

Science.gov (United States)

Berche, B.; von Ferber, C.; Holovatch, T.

2009-12-01

Public transport routes sharing the same grid of streets and tracks are often found to proceed in parallel along shorter or longer sequences of stations. Similar phenomena are observed in other networks built with space consuming links such as cables, vessels, pipes, neurons, etc. In the case of public transport networks (PTNs) this behavior may be easily worked out on the basis of sequences of stations serviced by each route. To quantify this behavior we use the recently introduced notion of network harness. It is described by the harness distribution P(r, s): the number of sequences of s consecutive stations that are serviced by r parallel routes. For certain PTNs that we have analyzed we observe that the harness distribution may be described by power laws. These power laws indicate a certain level of organization and planning which may be driven by the need to minimize the costs of infrastructure and secondly by the fact that points of interest tend to be clustered in certain locations of a city. This effect may be seen as a result of the strong interdependence of the evolutions of both the city and its PTN. To further investigate the significance of the empirical results we have studied one- and two-dimensional models of randomly placed routes modeled by different types of walks. While in one dimension an analytic treatment was successful, the two dimensional case was studied by simulations showing that the empirical results for real PTNs deviate significantly from those expected for randomly placed routes.

Waste Collection Vehicle Routing Problem: Literature Review

Directory of Open Access Journals (Sweden)

Hui Han

2015-08-01

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

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

International Nuclear Information System (INIS)

Peterson, B.E.

1985-11-01

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

Division site positioning in bacteria: one size does not fit all.

Directory of Open Access Journals (Sweden)

Leigh Graham Monahan

2014-02-01

Full Text Available Spatial regulation of cell division in bacteria has been a focus of research for decades. It has been well studied in two model rod-shaped organisms, Escherichia coli and Bacillus subtilis, with the general belief that division site positioning occurs as a result of the combination of two negative regulatory systems, Min and nucleoid occlusion. These systems influence division by preventing the cytokinetic Z ring from forming anywhere other than midcell. However, evidence is accumulating for the existence of additional mechanisms that are involved in controlling Z ring positioning both in these organisms and in several other bacteria. In some cases the decision of where to divide is solved by variations on a common evolutionary theme, and in others completely different proteins and mechanisms are involved. Here we review the different ways bacteria solve the problem of finding the right place to divide. It appears that a one-size-fits-all model does not apply, and that individual species have adapted a division-site positioning mechanism that best suits their lifestyle, environmental niche and mode of growth to ensure equal partitioning of DNA for survival of the next generation.

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

Directory of Open Access Journals (Sweden)

Huang Qiong

2014-01-01

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

Computation Offloading Algorithm for Arbitrarily Divisible Applications in Mobile Edge Computing Environments: An OCR Case

Directory of Open Access Journals (Sweden)

Bo Li

2018-05-01

Full Text Available Divisible applications are a class of tasks whose loads can be partitioned into some smaller fractions, and each part can be executed independently by a processor. A wide variety of divisible applications have been found in the area of parallel and distributed processing. This paper addresses the problem of how to partition and allocate divisible applications to available resources in mobile edge computing environments with the aim of minimizing the completion time of the applications. A theoretical model was proposed for partitioning an entire divisible application according to the load of the application and the capabilities of available resources, and the solutions were derived in closed form. Both simulations and real experiments were carried out to justify this model.

The vehicle routing problem latest advances and new challenges

CERN Document Server

Golden, Bruce L; Wasil, Edward A

2008-01-01

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

Quality-constrained routing in publish/subscribe systems

NARCIS (Netherlands)

Zieba, Bogumil; van Sinderen, Marten J.; Wegdam, M.

2005-01-01

Routing in publish/subscribe (pub/sub) features a communication model where messages are not given explicit destination addresses, but destinations are determined by matching the subscription declared by subscribers. For a dynamic computing environment with applications that have quality demands,

Tramp Ship Routing and Scheduling - Incorporating Additional Complexities

DEFF Research Database (Denmark)

Vilhelmsen, Charlotte

to mergers, pooling, and collaboration efforts between shipping companies, the fleet sizes have grown to a point where manual planning is no longer adequate in a market with tough competition and low freight rates. This thesis therefore aims at developing new mathematical models and solution methods...... for tramp ship routing and scheduling problems. This is done in the context of Operations Research, a research field that has achieved great success within optimisation-based planning for vehicle routing problems and in many other areas. The first part of this thesis contains a comprehensive introduction...

Acoustic model optimisation for a call routing system

CSIR Research Space (South Africa)

Kleynhans, N

2012-11-01

Full Text Available and results and a discussion are presented in Section V. Lastly, the conclusion and possible future work appear in Section VI. II. BACKGROUND A. AutoSecretary IVR System Figure 1 shows the high level call flow of the AutoSecretary call routing system... to be difficult Corpus Name # utterances duration in hours Lwazi English 5843 5.03 Lwazi English plus Lwazi language prompts 7770 5.57 NCHLT English 106018 76.97 AST English (5 dialects) 51745 29.80 TABLE I THE NUMBER OF TRAINING UTTERANCES AND DURATION...

A mathematical model for the municipal solid waste location-routing problem with intermediate transfer stations

Directory of Open Access Journals (Sweden)

Hossein Asefi

2015-09-01

Full Text Available Municipal solid waste management is one of the challenging issues in mega cities due to various interrelated factors such as operational costs and environmental concerns. Cost as one of the most significant constraints of municipal solid waste management can be effectively economized by efficient planning approaches. Considering diverse waste types in an integrated municipal solid waste system, a mathematical model of the location-routing problem is formulated and solved in this study in order to minimize the total cost of transportation and facility establishment.

Security-Based Mechanism for Proactive Routing Schema Using Game Theory Model

Directory of Open Access Journals (Sweden)

Hicham Amraoui

2016-01-01

Full Text Available Game theory may offer a useful mechanism to address many problems in mobile ad hoc networks (MANETs. One of the key concepts in the research field of such networks with Optimized Link State Routing Protocol (OLSR is the security problem. Relying on applying game theory to study this problem, we consider two strategies during this suggested model: cooperate and not-cooperate. However, in such networks, it is not easy to identify different actions of players. In this paper, we have essentially been inspired from recent advances provided in game theory to propose a new model for security in MANETs. Our proposal presents a powerful tool with a large number of players where interactions are played multiple times. Moreover, each node keeps a cooperation rate (CR record of other nodes to cope with the behaviors and mitigate aggregate effect of other malicious devices. Additionally, our suggested security mechanism does not only take into consideration security requirements, but also take into account system resources and network performances. The simulation results using Network Simulator 3 are presented to illustrate the effectiveness of the proposal.

77 FR 40586 - Coastal Programs Division

Science.gov (United States)

2012-07-10

... DEPARTMENT OF COMMERCE National Oceanic and Atmospheric Administration Coastal Programs Division AGENCY: Coastal Programs Division, Office of Ocean and Coastal Resource Management, National Ocean.... FOR FURTHER INFORMATION CONTACT: Kerry Kehoe, Coastal Programs Division (NORM/3), Office of Ocean and...

Asymmetries in Cell Division, Cell Size, and Furrowing in the Xenopus laevis Embryo.

Science.gov (United States)

Tassan, Jean-Pierre; Wühr, Martin; Hatte, Guillaume; Kubiak, Jacek

2017-01-01

Asymmetric cell divisions produce two daughter cells with distinct fate. During embryogenesis, this mechanism is fundamental to build tissues and organs because it generates cell diversity. In adults, it remains crucial to maintain stem cells. The enthusiasm for asymmetric cell division is not only motivated by the beauty of the mechanism and the fundamental questions it raises, but has also very pragmatic reasons. Indeed, misregulation of asymmetric cell divisions is believed to have dramatic consequences potentially leading to pathogenesis such as cancers. In diverse model organisms, asymmetric cell divisions result in two daughter cells, which differ not only by their fate but also in size. This is the case for the early Xenopus laevis embryo, in which the two first embryonic divisions are perpendicular to each other and generate two pairs of blastomeres, which usually differ in size: one pair of blastomeres is smaller than the other. Small blastomeres will produce embryonic dorsal structures, whereas the larger pair will evolve into ventral structures. Here, we present a speculative model on the origin of the asymmetry of this cell division in the Xenopus embryo. We also discuss the apparently coincident asymmetric distribution of cell fate determinants and cell-size asymmetry of the 4-cell stage embryo. Finally, we discuss the asymmetric furrowing during epithelial cell cytokinesis occurring later during Xenopus laevis embryo development.

Budget Setting Strategies for the Company's Divisions

NARCIS (Netherlands)

Berg, M.; Brekelmans, R.C.M.; De Waegenaere, A.M.B.

1997-01-01

The paper deals with the issue of budget setting to the divisions of a company. The approach is quantitative in nature both in the formulation of the requirements for the set-budgets, as related to different general managerial objectives of interest, and in the modelling of the inherent

An overview of smart grid routing algorithms

Science.gov (United States)

Wang, Junsheng; OU, Qinghai; Shen, Haijuan

2017-08-01

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

An Airlift Hub-and-Spoke Location-Routing Model with Time Windows: Case Study of the CONUS-to-Korea Airlift Problem

Science.gov (United States)

1998-03-01

a point of embarkation to a point of debarkation. This study develops an alternative hub-and-spoke combined location-routing integer linear...programming prototype model, and uses this model to determine what advantages a hub-and-spoke system offers, and in which scenarios it is better-suited than the...extension on the following works: the hierarchical model of Perl and Daskin (1983), time windows features of Chan (1991), combining subtour-breaking and range

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

Directory of Open Access Journals (Sweden)

Jisheng Zhang

2015-06-01

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

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

Science.gov (United States)

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

2014-01-01

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

A patient with aphasia using the nonsemantic lexical route for Kanji reading.

Science.gov (United States)

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.

Congested Link Inference Algorithms in Dynamic Routing IP Network

Directory of Open Access Journals (Sweden)

Yu Chen

2017-01-01

Full Text Available The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP and Rest Bayesian Network Model (RBNM, we proposed an Improved CLINK (ICLINK algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

Southern states' routing agency report

International Nuclear Information System (INIS)

1989-02-01

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

Southern States' Routing Agency Report

International Nuclear Information System (INIS)

1990-03-01

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

Theoretical Division progress report

International Nuclear Information System (INIS)

Cooper, N.G.

1979-04-01

This report presents highlights of activities in the Theoretical (T) Division from October 1976-January 1979. The report is divided into three parts. Part I presents an overview of the Division: its unique function at the Los Alamos Scientific Laboratory (LASL) and within the scientific community as a whole; the organization of personnel; the main areas of research; and a survey of recent T-Division initiatives. This overview is followed by a survey of the 13 groups within the Division, their main responsibilities, interests, and expertise, consulting activities, and recent scientific accomplisments. The remainder of the report, Parts II and III, is devoted to articles on selected research activities. Recent efforts on topics of immediate interest to energy and weapons programs at LASL and elsewhere are described in Part II, Major National Programs. Separate articles present T-Divison contributions to weapons research, reactor safety and reactor physics research, fusion research, laser isotope separation, and other energy research. Each article is a compilation of independent projects within T Division, all related to but addressing different aspects of the major program. Part III is organized by subject discipline, and describes recent scientific advances of fundamental interest. An introduction, defining the scope and general nature of T-Division efforts within a given discipline, is followed by articles on the research topics selected. The reporting is done by the scientists involved in the research, and an attempt is made to communicate to a general audience. Some data are given incidentally; more technical presentations of the research accomplished may be found among the 47 pages of references. 110 figures, 5 tables

Load Balancing Routing with Bounded Stretch

Directory of Open Access Journals (Sweden)

Chen Siyuan

2010-01-01

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

Calculation of population doses with RADTRAN for route segments that have an unpopulated near-field region

International Nuclear Information System (INIS)

Kanipe, F.L.; Neuhauser, S.; Sprung, J.L.

1998-03-01

The RADTRAN code (Neuhauser and Kanipe, 1994) models the radiological consequences of the transportation of radioactive materials, both the exposures that will occur if the transport occurs without incident, and the exposures that may occur should the transport vehicle be involved in an accident while en route. Because accidents might occur at any point along a transportation route, RADTRAN divides the route into segments (links) and uses a uniform population density and constant meteorological conditions (wind speed and atmospheric stability) to represent the population and weather characteristics of each route segment. A way to perform RADTRAN calculations, that allows an unpopulated near-field region along a transportation link to be approximately modeled, is described, validated, and then illustratively applied to a coastal sailing route

Prokaryotic cell division: flexible and diverse

NARCIS (Netherlands)

den Blaauwen, T.

2013-01-01

Gram-negative rod-shaped bacteria have different approaches to position the cell division initiating Z-ring at the correct moment in their cell division cycle. The subsequent maturation into a functional division machine occurs in vastly different species in two steps with appreciable time in

Fusion energy division computer systems network

International Nuclear Information System (INIS)

Hammons, C.E.

1980-12-01

The Fusion Energy Division of the Oak Ridge National Laboratory (ORNL) operated by Union Carbide Corporation Nuclear Division (UCC-ND) is primarily involved in the investigation of problems related to the use of controlled thermonuclear fusion as an energy source. The Fusion Energy Division supports investigations of experimental fusion devices and related fusion theory. This memo provides a brief overview of the computing environment in the Fusion Energy Division and the computing support provided to the experimental effort and theory research

Solving multi-product inventory ship routing with a heterogeneous fleet model using a hybrid cross entropy-genetic algorithm: a case study in Indonesia

Directory of Open Access Journals (Sweden)

Budi Santosa

2016-01-01

Full Text Available This paper presents a model and an algorithm for an inventory ship routing problem (ISRP. It consists of two main parts: a model development of the ship routing problem in a multi-product inventory with a heterogeneous fleet and an algorithm development to solve the problem. The problem is referred to as ISRP. ISRP considers several parameters including the deadweight tonnage (DWT, product compatibility, port setup, and compartment washing costs. Considering these parameters, the objective function is to minimize the total cost, which consists of traveling, port setup, ship charter, and compartment washing costs. From the resulting model, there are two major steps used to solve the problem. The first is to select the ships in order to satisfy the constraint that restricts the mooring rule. The second is to find the best route, product allocation, and shipped quantity. ISRP is an Non Polynomial-hard problem. Finding the solution of such problem needs a high computation time. A new hybrid metaheuristics, namely the cross entropy-genetic algorithm (CEGA, was proposed to solve ISRP. The results were then compared with those resulted from a hybrid Tabu Search to measure the hybrid CEGA performance. The results showed that CEGA provided better solutions than those produced by the hybrid Tabu Search.

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

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

2011-01-01

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

Contention Aware Routing for Intermittently Connected Mobile Networks

KAUST Repository

Elwhishi, Ahmed

2011-08-21

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

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

International Nuclear Information System (INIS)

1989-01-01

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

Optimization Route of Food Logistics Distribution Based on Genetic and Graph Cluster Scheme Algorithm

OpenAIRE

Jing Chen

2015-01-01

This study takes the concept of food logistics distribution as the breakthrough point, by means of the aim of optimization of food logistics distribution routes and analysis of the optimization model of food logistics route, as well as the interpretation of the genetic algorithm, it discusses the optimization of food logistics distribution route based on genetic and cluster scheme algorithm.

Green open location-routing problem considering economic and environmental costs

Directory of Open Access Journals (Sweden)

Eliana M. Toro

2016-12-01

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

Glacial refugia and migration routes of the Neotropical genus Trizeuxis (Orchidaceae

Directory of Open Access Journals (Sweden)

Marta Kolanowska

2013-09-01

Full Text Available The morphology and anatomy of the monotypic genus Trizeuxis make this taxon almost impossible to recognize in fossil material and hereby difficult object of historical geographic studies. To estimate the distribution of potential refugia during the last glacial maximum and migration routes for Trizeuxis the ecological niche modeling was performed. The potential niche modeling was done using maximum entropy method implemented in Maxent application based on the species presence-only observations. As input data climatic variables and the digital elevation model were used. Two models of suitable glacial habitats distribution were prepared – for the studied species and for its host. The compiled map of the suitable habitats distribution of T. falcata and P. guajava during the last glacial maximum (LGM indicate two possible refugia for the studied orchid genus. The first one was located in the Madre de Dios region and the other one in the Mosquito Coast. The models suggest the existence of two migration routes of Trizeuxis species. The results indicate that the ecological niche modeling (ENM is a useful tool for analyzing not only the possible past distribution of the species, but may be also applied to determine the migration routes of the organisms not found in the fossil material.

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

Directory of Open Access Journals (Sweden)

Marcin Zyczkowski

2017-06-01

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

[Learning virtual routes: what does verbal coding do in working memory?].

Science.gov (United States)

Gyselinck, Valérie; Grison, Élise; Gras, Doriane

2015-03-01

Two experiments were run to complete our understanding of the role of verbal and visuospatial encoding in the construction of a spatial model from visual input. In experiment 1 a dual task paradigm was applied to young adults who learned a route in a virtual environment and then performed a series of nonverbal tasks to assess spatial knowledge. Results indicated that landmark knowledge as asserted by the visual recognition of landmarks was not impaired by any of the concurrent task. Route knowledge, assessed by recognition of directions, was impaired both by a tapping task and a concurrent articulation task. Interestingly, the pattern was modulated when no landmarks were available to perform the direction task. A second experiment was designed to explore the role of verbal coding on the construction of landmark and route knowledge. A lexical-decision task was used as a verbal-semantic dual task, and a tone decision task as a nonsemantic auditory task. Results show that these new concurrent tasks impaired differently landmark knowledge and route knowledge. Results can be interpreted as showing that the coding of route knowledge could be grounded on both a coding of the sequence of events and on a semantic coding of information. These findings also point on some limits of Baddeley's working memory model. (PsycINFO Database Record (c) 2015 APA, all rights reserved).

Location-routing Problem with Fuzzy time windows and Traffic time

Directory of Open Access Journals (Sweden)

Shima Teimoori

2014-05-01

Full Text Available The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard is the existence of congested times during the service time and distributing goods to the customer. This caused a delay in providing service for customer and imposed additional costs to distribution system. Thus we have provided a mathematical model for designing optimal distributing system. Since the vehicle location-routing problem is Np-hard, thus a solution method using genetic meta-heuristic algorithm was developed and the optimal sequence of servicing for the vehicle and optimal location for the warehouses were determined through an example.

Alternative reaction routes during coal hydrogenation and coal derived oil upgrading

Energy Technology Data Exchange (ETDEWEB)

Schulz, H.; Kordokuzis, G.; Langner, M. (University of Karlsruhe, Karlsruhe (Germany, F.R.). Engler-Bunte-Institute)

1989-10-01

Alternative reaction routes have been traced for the hydrodenitrogenation and hydrodeoxygenation of coal structure related model compounds. Reaction pathways are very structure specific. It is shown how reaction mechanisms switch from one route to another with changes in reaction conditions and catalyst features. Optimization of coal liquefaction processes can make use of this detailed understanding of selectivity. 5 refs., 7 figs.

Routing and scheduling and fleet management for liner shipping

DEFF Research Database (Denmark)

Kjeldsen, Karina Hjortshøj

2009-01-01

The problem of routing, scheduling and fleet management in global liner shipping is presented. The developed model incorporates the ships' speed as a decision variable. Furthermore, the model must be able to handle problems of the size and complexity experienced by the global liner shipping...

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

Directory of Open Access Journals (Sweden)

Tad T Brunyé

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

UPAYA PENCAPAIAN STANDAR KETUNTASAN BELAJAR MINIMAL (SKBM MELALUI PEMBELAJARAN KOOPERATIF MODEL STUDENT TEAM ACHIEVEMENT DIVISION (STAD

Directory of Open Access Journals (Sweden)

Nurcholish Arifin Handoyono

2015-12-01

Full Text Available The purpose of this study is to increase the minimum mastery standard in automotive electrical systems repairing matter with subject applying Student Team Achievement Division (STAD model cooperative learning. This study used a classroom action research whitch was conducted in two cyles, each eycle consisted of four phases: planning, implementation, observation, dan reflection. The data were analyzed descriptively. The result proved that teaching learning process using STAD model cooperative learning increased the minimum mastery standard of students. Before applying STAD model cooperative learning, none passed the minimum mastery standard. After applying STAD model cooperative learning, there are advancement in term of the number of students passing the standard 48,48% in the first cycle and 87,88% in the second cycle. The average score reached 71,48 and 81,83 in the first and the second cycle. Therefore, this study concludes that STAD cooperative model increased the minimum mastery standard in automotive electrical systems repairing subject.

49 CFR 1242.03 - Made by accounting divisions.

Science.gov (United States)

2010-10-01

... 49 Transportation 9 2010-10-01 2010-10-01 false Made by accounting divisions. 1242.03 Section 1242... accounting divisions. The separation shall be made by accounting divisions, where such divisions are maintained, and the aggregate of the accounting divisions reported for the quarter and for the year. ...

Route Fidelity during Marine Megafauna Migration

Directory of Open Access Journals (Sweden)

Travis W. Horton

2017-12-01

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

Routing and scheduling problems

DEFF Research Database (Denmark)

Reinhardt, Line Blander

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

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

Science.gov (United States)

McNally, B. David; Love, John

2011-01-01

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

Intelligent routing protocol for ad hoc wireless network

Science.gov (United States)

Peng, Chaorong; Chen, Chang Wen

2006-05-01

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

Selective Route Based on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network

Directory of Open Access Journals (Sweden)

Istikmal

2017-01-01

Full Text Available In this study, we developed network and throughput formulation models and proposed new method of the routing protocol algorithm with a cross-layer scheme based on signal-to-noise ratio (SNR. This method is an enhancement of routing protocol ad hoc on-demand distance vector (AODV. This proposed scheme uses selective route based on the SNR threshold in the reverse route mechanism. We developed AODV SNR-selective route (AODV SNR-SR for a mechanism better than AODV SNR, that is, the routing protocol that used average or sum of path SNR, and also better than AODV which is hop-count-based. We also used selective reverse route based on SNR mechanism, replacing the earlier method to avoid routing overhead. The simulation results show that AODV SNR-SR outperforms AODV SNR and AODV in terms of throughput, end-to-end delay, and routing overhead. This proposed method is expected to support Device-to-Device (D2D communications that are concerned with the quality of the channel awareness in the development of the future Fifth Generation (5G.

Risk assessment of alternative proliferation routes

International Nuclear Information System (INIS)

Ahmed, S.; Husseiny, A.A.

1982-01-01

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

Vehicle Routing with Three-dimensional Container Loading Constraints—Comparison of Nested and Joint Algorithms

Science.gov (United States)

Koloch, Grzegorz; Kaminski, Bogumil

2010-10-01

In the paper we examine a modification of the classical Vehicle Routing Problem (VRP) in which shapes of transported cargo are accounted for. This problem, known as a three-dimensional VRP with loading constraints (3D-VRP), is appropriate when transported commodities are not perfectly divisible, but they have fixed and heterogeneous dimensions. In the paper restrictions on allowable cargo positionings are also considered. These restrictions are derived from business practice and they extended the baseline 3D-VRP formulation as considered by Koloch and Kaminski (2010). In particular, we investigate how additional restrictions influence relative performance of two proposed optimization algorithms: the nested and the joint one. Performance of both methods is compared on artificial problems and on a big-scale real life case study.

Brood temperature, task division and colony survival in honeybees : A model

NARCIS (Netherlands)

Becher, Matthias A.; Hildenbrandt, Hanno; Hemelrijk, Charlotte K.; Moritz, Robin F. A.

2010-01-01

One of the mechanisms by which honeybees regulate division of labour among their colony members is age polyethism. Here the younger bees perform in-hive tasks such as heating and the older ones carry out tasks outside the hive such as foraging. Recently it has been shown that the higher

2017 T Division Lightning Talks

Energy Technology Data Exchange (ETDEWEB)

Ramsey, Marilyn Leann [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Abeywardhana, Jayalath AMM [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Adams, Colin Mackenzie [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Adams, Luke Clyde [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Carter, Austin Lewis [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Ducru, Pablo Philippe [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Duignan, Thomas John [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Gifford, Brendan Joel [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Hills, Benjamin Hale [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Hoffman, Kentaro Jack [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Khair, Adnan Ibne [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Kochanski, Kelly Anne Pribble [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Ledwith, Patrick John [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Leveillee, Joshua Anthony [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Lewis, Sina Genevieve [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Ma, Xiaoyu [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Merians, Hugh Drake [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Moore, Bryan Alexander [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Nijjar, Parmeet Kaur [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Oles, Vladyslav [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Olszewski, Maciej W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Philipbar, Brad Montgomery [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Reisner, Andrew Ray [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Roberts, David Benjamin [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Rufa, Dominic Antonio [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Sifain, Andrew E. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Smith, Justin Steven [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Smith, Lauren Taylor Wisbey [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Svolos, Lampros [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Thibault, Joshua Ryan [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Ushijima-Mwesigwa, Hayato Montezuma [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Weaver, Claire Marie [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Witzen, Wyatt Andrew [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Zentgraf, Sabine Silvia [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Alred, John Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

2017-10-06

All members of the T Division Community, students, staff members, group leaders, division management, and other interested individuals are invited to come and support the following student(s) as they present their Lightning Talks.

Division: The Sleeping Dragon

Science.gov (United States)

Watson, Anne

2012-01-01

Of the four mathematical operators, division seems to not sit easily for many learners. Division is often described as "the odd one out". Pupils develop coping strategies that enable them to "get away with it". So, problems, misunderstandings, and misconceptions go unresolved perhaps for a lifetime. Why is this? Is it a case of "out of sight out…

E-Division activities report

International Nuclear Information System (INIS)

Barschall, H.H.

1979-07-01

This report describes some of the activities in E (Experimental Physics) Division during the past year. E-Division carries out research and development in areas related to the missions of the Laboratory. Many of the activities are in pure and applied atomic and nuclear physics. In addition, this report describes work on accelerators, radiation damage, microwaves, and plasma diagnostics

Novel Coiled-Coil Cell Division Factor ZapB Stimulates Z Ring Assembly and Cell Division

DEFF Research Database (Denmark)

Ebersbach, Gitte; Galli, Elizabeth; Møller-Jensen, Jakob

2008-01-01

Formation of the Z ring is the first known event in bacterial cell division. However, it is not yet known how the assembly and contraction of the Z ring is regulated. Here, we identify a novel cell division factor ZapB in Escherichia coli that simultaneously stimulates Z ring assembly and cell...... division. Deletion of zapB resulted in delayed cell division and the formation of ectopic Z rings and spirals whereas overexpression of ZapB resulted in nucleoid condensation and aberrant cell divisions. Localization of ZapB to the divisome depended on FtsZ but not FtsA, ZipA or FtsI and ZapB interacted...... with FtsZ in a bacterial two-hybrid analysis. The simultaneous inactivation of FtsA and ZipA prevented Z ring assembly and ZapB localization. Time lapse microscopy showed that ZapB-GFP is present at mid-cell in a pattern very similar to that of FtsZ. Cells carrying a zapB deletion and the ftsZ84ts allele...

Collective network routing

Science.gov (United States)

Hoenicke, Dirk

2014-12-02

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

Diesel supply planning for offshore platforms by a mathematical model based on the vehicle routing problem with replenishment

Energy Technology Data Exchange (ETDEWEB)

Fiorot Astoures, H.; Alvarenga Rosa, R. de; Silva Rosa, A.

2016-07-01

Oil exploration in Brazil is mainly held by offshore platforms which require the supply of several products, including diesel to maintain its engines. One strategy to supply diesel to the platforms is to keep a vessel filled with diesel nearby the exploration basin. An empty boat leaves the port and goes directly to this vessel, then it is loaded with diesel. After that, it makes a trip to supply the platforms and when the boat is empty, it returns to the vessel to be reloaded with more diesel going to another trip. Based on this description, this paper proposes a mathematical model based on the Vehicle Routing Problem with Intermediate Replenishment Facilities (VRPIRF) to solve the problem. The purpose of the model is to plan the routes for the boats to meet the diesel requests of the platform. Given the fact that in the literature, papers about the VRPIRF are scarce and papers about the VRPIRF applied to offshore platforms were not found in the published papers, this paper is important to contribute with the evolution of this class of problem, bringing also a solution for a real application that is very important for the oil and gas business. The mathematical model was tested using the CPLEX 12.6. In order to assess the mathematical model, tests were done with data from the major Brazilian oil and gas company and several strategies were tested. (Author)

DOW-PR DOlphin and Whale Pods Routing Protocol for Underwater Wireless Sensor Networks (UWSNs).

Science.gov (United States)

Wadud, Zahid; Ullah, Khadem; Hussain, Sajjad; Yang, Xiaodong; Qazi, Abdul Baseer

2018-05-12

Underwater Wireless Sensor Networks (UWSNs) have intrinsic challenges that include long propagation delays, high mobility of sensor nodes due to water currents, Doppler spread, delay variance, multipath, attenuation and geometric spreading. The existing Weighting Depth and Forwarding Area Division Depth Based Routing (WDFAD-DBR) protocol considers the weighting depth of the two hops in order to select the next Potential Forwarding Node (PFN). To improve the performance of WDFAD-DBR, we propose DOlphin and Whale Pod Routing protocol (DOW-PR). In this scheme, we divide the transmission range into a number of transmission power levels and at the same time select the next PFNs from forwarding and suppressed zones. In contrast to WDFAD-DBR, our scheme not only considers the packet upward advancement, but also takes into account the number of suppressed nodes and number of PFNs at the first and second hops. Consequently, reasonable energy reduction is observed while receiving and transmitting packets. Moreover, our scheme also considers the hops count of the PFNs from the sink. In the absence of PFNs, the proposed scheme will select the node from the suppressed region for broadcasting and thus ensures minimum loss of data. Besides this, we also propose another routing scheme (whale pod) in which multiple sinks are placed at water surface, but one sink is embedded inside the water and is physically connected with the surface sink through high bandwidth connection. Simulation results show that the proposed scheme has high Packet Delivery Ratio (PDR), low energy tax, reduced Accumulated Propagation Distance (APD) and increased the network lifetime.

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

International Nuclear Information System (INIS)

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

1995-01-01

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

Cellular Clocks : Coupled Circadian Dispatch and Cell Division Cycles

NARCIS (Netherlands)

Merrow, Martha; Roenneberg, Till

2004-01-01

Gating of cell division by the circadian clock is well known, yet its mechanism is little understood. Genetically tractable model systems have led to new hypotheses and questions concerning the coupling of these two cellular cycles.

Latent variables and route choice behavior

DEFF Research Database (Denmark)

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

2012-01-01

In the last decade, a broad array of disciplines has shown a general interest in enhancing discrete choice models by considering the incorporation of psychological factors affecting decision making. This paper provides insight into the comprehension of the determinants of route choice behavior...... and bound algorithm. A hybrid model consists of measurement equations, which relate latent variables to measurement indicators and utilities to choice indicators, and structural equations, which link travelers’ observable characteristics to latent variables and explanatory variables to utilities. Estimation...

Route Scherrer and Route Einstein closed for construction work

CERN Multimedia

2015-01-01

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

Highway route controlled quantity shipment routing reports - An overview

International Nuclear Information System (INIS)

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

1989-01-01

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

Interdependency of formation and localisation of the Min complex controls symmetric plastid division.

Science.gov (United States)

Maple, Jodi; Møller, Simon G

2007-10-01

Plastid division represents a fundamental biological process essential for plant development; however, the molecular basis of symmetric plastid division is unclear. AtMinE1 plays a pivotal role in selection of the plastid division site in concert with AtMinD1. AtMinE1 localises to discrete foci in chloroplasts and interacts with AtMinD1, which shows a similar localisation pattern. Here, we investigate the importance of Min protein complex formation during the chloroplast division process. Dissection of the assembly of the Min protein complex and determination of the interdependency of complex assembly and localisation in planta allow us to present a model of the molecular basis of selection of the division site in plastids. Moreover, functional analysis of AtMinE1 in bacteria demonstrates the level of functional conservation and divergence of the plastidic MinE proteins.

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

Data.gov (United States)

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

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

Directory of Open Access Journals (Sweden)

Alaa Azmi Allahham

2017-02-01

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

A Joint Route Choice Model for Electric and Conventional Car Users

DEFF Research Database (Denmark)

Jensen, Anders Fjendbo; Rasmussen, Thomas Kjær; Prato, Carlo Giacomo

Introduction Worldwide, governments have committed to reducing air pollution and carbon emissions. With a higher share of renewable sources in the electricity production, battery electric cars (EVs) could play a significant role in maintaining these commitments. Growing literature shows...... an increasing interest in EVs and their market, but current EV travel demand studies are usually based on data collected from users of conventional gasoline or diesel engine cars (CVs) (see e.g. (Golob and Gould 1998; Pearre et al. 2011; Greaves et al. 2014). EVs are however different from CVs in a number...... effects, such as effects on the electricity network and the transport network. The objective of this study is to use revealed preferences (RP) data to investigate differences in route choice behaviour between CV and EV users. To our knowledge, this is the first time that a state-of-the-art route choice...

NEN Division Funding Gap Analysis

International Nuclear Information System (INIS)

Esch, Ernst I.; Goettee, Jeffrey D.; Desimone, David J.; Lakis, Rollin E.; Miko, David K.

2012-01-01

The work in NEN Division revolves around proliferation detection. The sponsor funding model seems to have shifted over the last decades. For the past three lustra, sponsors are mainly interested in funding ideas and detection systems that are already at a technical readiness level 6 (TRL 6 -- one step below an industrial prototype) or higher. Once this level is reached, the sponsoring agency is willing to fund the commercialization, implementation, and training for the systems (TRL 8, 9). These sponsors are looking for a fast turnaround (1-2 years) technology development efforts to implement technology. To support the critical national and international needs for nonprolifertion solutions, we have to maintain a fluent stream of subject matter expertise from the fundamental principals of radiation detection through prototype development all the way to the implementation and training of others. NEN Division has large funding gaps in the Valley of Death region. In the current competitive climate for nuclear nonproliferation projects, it is imminent to increase our lead in this field.

Route-specific analysis for radioactive materials transportation

International Nuclear Information System (INIS)

1986-01-01

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

Podcast: The Electronic Crimes Division

Science.gov (United States)

Sept 26, 2016. Chris Lukas, the Special Agent in Charge of the Electronic Crimes Division within the OIG's Office of Investigations talks about computer forensics, cybercrime in the EPA and his division's role in criminal investigations.

Bellman Ford algorithm - in Routing Information Protocol (RIP)

Science.gov (United States)

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

2018-04-01

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

Modelling obsidian trade routes during late Neolithic in the south-east Banat region of Vršac using GIS

Directory of Open Access Journals (Sweden)

Marić Miroslav

2015-01-01

Full Text Available The aim of this paper is to reconstruct the possible trajectory of the movement of the obsidian that was brought to the region of present day Vršac from Carpathian 1 and Carpathian 2 sources, located between Košice and Miškolc (the present day border area between Hungary and Slovakia. This objective has been fulfilled using computer aided modelling performed within the constraints of geographic information system software based on the physical characteristics of the terrain and the reconstruction of paleoenvironmental and paleoclimatic conditions in the period of the late Neolithic. The second largest obsidian collection in the territory of Vinča culture originates from the site of Potporanj, south of Vršac. The abundance of finds indicates the importance this region had in the distribution of this resource during late Neolithic. In the paper the modelling of two different possibilities of land based distribution from the flow of the river Tisza are shown; the first from Perlez/Opovo (western route and the other from Mureє (northern route, i.e. present day Arad and Timiєoara. The modelled results indicate the existence of a settlement patterning close to the modelled pathways in the period of Vinča culture. [Projekat Ministarstva nauke Republike Srbije, br. 177012: Society, Culture and Communications in the Balkans in Proto - and Early History

Capacitated arc routing problem and its extensions in waste collection

International Nuclear Information System (INIS)

Fadzli, Mohammad; Najwa, Nurul; Luis, Martino

2015-01-01

Capacitated arc routing problem (CARP) is the youngest generation of graph theory that focuses on solving the edge/arc routing for optimality. Since many years, operational research devoted to CARP counterpart, known as vehicle routing problem (VRP), which does not fit to several real cases such like waste collection problem and road maintenance. In this paper, we highlighted several extensions of capacitated arc routing problem (CARP) that represents the real-life problem of vehicle operation in waste collection. By purpose, CARP is designed to find a set of routes for vehicles that satisfies all pre-setting constraints in such that all vehicles must start and end at a depot, service a set of demands on edges (or arcs) exactly once without exceeding the capacity, thus the total fleet cost is minimized. We also addressed the differentiation between CARP and VRP in waste collection. Several issues have been discussed including stochastic demands and time window problems in order to show the complexity and importance of CARP in the related industry. A mathematical model of CARP and its new version is presented by considering several factors such like delivery cost, lateness penalty and delivery time