Search results for "routing"

ARC A computerized system for urban garbage collection

1993

In this paper we present ARC a computerized system developed for urban garbage collection. The package is intended to help the planners in the design of efficient collection routes and to facilitate the study and evaluation of alternatives concerning issues such as the type and number of vehicles, frequency of collection and type and location of refuse containers. The final product is a “user friendly” system designed to be used by the planners without outside assistance.

Donsker-Type Theorem for BSDEs: Rate of Convergence

2019

In this paper, we study in the Markovian case the rate of convergence in Wasserstein distance when the solution to a BSDE is approximated by a solution to a BSDE driven by a scaled random walk as introduced in Briand, Delyon and Mémin (Electron. Commun. Probab. 6 (2001) Art. ID 1). This is related to the approximation of solutions to semilinear second order parabolic PDEs by solutions to their associated finite difference schemes and the speed of convergence. peerReviewed

A PHASE TRANSITION FOR LARGE VALUES OF BIFURCATING AUTOREGRESSIVE MODELS

2019

We describe the asymptotic behavior of the number $$Z_n[a_n,\infty )$$ of individuals with a large value in a stable bifurcating autoregressive process, where $$a_n\rightarrow \infty $$ . The study of the associated first moment is equivalent to the annealed large deviation problem of an autoregressive process in a random environment. The trajectorial behavior of $$Z_n[a_n,\infty )$$ is obtained by the study of the ancestral paths corresponding to the large deviation event together with the environment of the process. This study of large deviations of autoregressive processes in random environment is of independent interest and achieved first. The estimates for bifurcating autoregressive pr…

On implementation of the Gibbs sampler for estimating the accuracy of multiple diagnostic tests

2010

Implementation of the Gibbs sampler for estimating the accuracy of multiple binary diagnostic tests in one population has been investigated. This method, proposed by Joseph, Gyorkos and Coupal, makes use of a Bayesian approach and is used in the absence of a gold standard to estimate the prevalence, the sensitivity and specificity of medical diagnostic tests. The expressions that allow this method to be implemented for an arbitrary number of tests are given. By using the convergence diagnostics procedure of Raftery and Lewis, the relation between the number of iterations of Gibbs sampling and the precision of the estimated quantiles of the posterior distributions is derived. An example conc…

Le specie alloctone invasive in Sicilia: caratterizzazione del fenomeno, strategie di colonizzazione e possibili strategie di contrasto

2014

A Dominance Variant Under the Multi-Unidimensional Pairwise-Preference Framework: Model Formulation and Markov Chain Monte Carlo Estimation.

2018

Forced-choice questionnaires have been proposed as a way to control some response biases associated with traditional questionnaire formats (e.g., Likert-type scales). Whereas classical scoring methods have issues of ipsativity, item response theory (IRT) methods have been claimed to accurately account for the latent trait structure of these instruments. In this article, the authors propose the multi-unidimensional pairwise preference two-parameter logistic (MUPP-2PL) model, a variant within Stark, Chernyshenko, and Drasgow’s MUPP framework for items that are assumed to fit a dominance model. They also introduce a Markov Chain Monte Carlo (MCMC) procedure for estimating the model’s paramete…

Efficient Analysis of Arbitrarily Shaped Inductive Obstacles in Rectangular Waveguides Using a Surface Integral Equation Formulation

2007

In this paper we propose to use the Surface Integral Equation technique for the analysis of arbitrarily shaped Hplane obstacles in rectangular waveguides, which can contain both metallic and/or dielectric objects. The Green functions are formulated using both spectral and spatial images series, whose convergence behavior has been improved through several acceleration techniques. Proceeding in this way, the convergence of the series is not attached to the employment of any particular basis or test function, thus consequently increasing the flexibility of the implemented technique. In order to test the accuracy and numerical efficiency of the proposed method, results for practical microwave c…

A surface hopping algorithm for nonadiabatic minimum energy path calculations

2015

The article introduces a robust algorithm for the computation of minimum energy paths transiting along regions of near-to or degeneracy of adiabatic states. The method facilitates studies of excited state reactivity involving weakly avoided crossings and conical intersections. Based on the analysis of the change in the multiconfigurational wave function the algorithm takes the decision whether the optimization should continue following the same electronic state or switch to a different state. This algorithm helps to overcome convergence difficulties near degeneracies. The implementation in the MOLCAS quantum chemistry package is discussed. To demonstrate the utility of the proposed procedur…

The vehicle as a source and consumer of information : collection, dissemination and data processing for sustainable mobility

2014

Today, vehicles have become more sophisticated, intelligent and connected. Indeed, they are equipped with sensors, radars, GPS, communication interfaces and high processing and storage capacities. They can collect, process and communicate information related to their working conditions and their environment forming a vehicular network. The incorporation of communication technologies on vehicles garnered a huge attention of industry, government authorities and standardizations organizations and opened the way for innovative applications that revolutionized the automotive market with the main goals to ensure safety on roads, increase transport efficiency and provide comfort to drivers and pas…

Optimal Configuration for N-Dimensional Twin Torus Networks

2014

Torus topology is one of the most common topologies used in the current largest supercomputers. Although 3D torus is widely used, recently some supercomputers in the Top500 list have been built using networks with topologies of five or six dimensions. To obtain an nD torus, 2n ports per node are needed. These ports can be offered by a single or several cards per node. In the second case, there are multiple ways of assigning the dimension and direction of the card ports. In a previous work we proposed the 3D Twin (3DT) torus which uses two 4-port cards per node, and obtained the optimal port configuration. This paper extends and generalizes that work in order to obtain the optimal port confi…