Designing a Belief Function-Based Accessibility Indicator to Improve Web Browsing for Disabled People

The purpose of this study is to provide an accessibility measure of web-pages, in order to draw disabled users to the pages that have been designed to be ac-cessible to them. Our approach is based on the theory of belief functions, using data which are supplied by reports produced by automatic web content assessors that test the validity of criteria defined by the WCAG 2.0 guidelines proposed by the World Wide Web Consortium (W3C) organization. These tools detect errors with gradual degrees of certainty and their results do not always converge. For these reasons, to fuse information coming from the reports, we choose to use an information fusion framework which can take into account the uncertainty and imprecision of infor-mation as well as divergences between sources. Our accessibility indicator covers four categories of deficiencies. To validate the theoretical approach in this context, we propose an evaluation completed on a corpus of 100 most visited French news websites, and 2 evaluation tools. The results obtained illustrate the interest of our accessibility indicator

Error bounds for a numerical solution for dynamic economic models

AbstractIn this paper, we analyze a discretized version of the dynamic programming algorithm for a parameterized family of infinite-horizon economic models, and derive error bounds for the approximate value and policy functions. If h is the mesh size of the discretization, then the approximation error for the value function is bounded by Mh2, and the approximation error for the policy function is bounded by Nh, where the constants M and N can be estimated from primitive data of the model

An exact approach for the vehicle routing problem with two-dimensional loading constraints

We consider a special case of the symmetric capacitated vehicle routing problem, in which a fleet of K identical vehicles must serve n customers, each with a given demand consisting in a set of rectangular two-dimensional weighted items. The vehicles have a two-dimensional loading surface and a maximum weight capacity. The aim is to find a partition of the customers into routes of minimum total cost such that, for each vehicle, the weight capacity is taken into account and a feasible two-Dimensional allocation of the items into the loading surface exists. The problem has several practical applications in freight transportation, and it is -hard in the strong sense. We propose an exact approach, based on a branch-and-cut algorithm, for the minimization of the routing cost that iteratively calls a branch-and-bound algorithm for checking the feasibility of the loadings. Heuristics are also used to improve the overall performance of the algorithm. The effectiveness of the approach is shown by means of computational results

A first approach in solving initial-value problems in ODEs by elliptic fitting methods

Exponentially-fitted and trigonometrically-fitted methods have a long successful history in the solution of initial-value problems, but other functions might be considered in adapted methods. Specifically, this paper aims at the derivation of a new numerical scheme for approximating initial value problems of ordinary differential equations using elliptic functions. The example considered is the undamped Duffing equation where the forcing term is of autonomous type affected by a perturbation parameter. The new scheme is constructed by considering a suitable approximation to the theoretical solution based on elliptic functions. The proposed elliptic fitting procedure has been tested on a variety of problems, showing its good performance

Cardiovascular Endurance Among College Students: How is it Related to Overall Fitness?

Please see the pdf version of the abstract

The Two-Echelon Capacitated Vehicle Routing Problem

Multi-echelon distribution systems are quite common in supply-chain and logistic systems. They are used by public administrations in their transportation and traffic planning strategies as well as by companies to model their distribution systems. Unfortunately, the literature on com- binatorial optimization methods for multi-echelon distribution systems is very poor. The aim of this paper is twofold. Firstly, it introduces the family of Multi-Echelon Vehicle Routing Problems. Second, the Two-Echelon Capacitated Vehicle Routing Problem, is presented. The Two-Echelon Capacitated Vehicle Routing Problem (2E-CVRP) is an extension of the classical VRP where the delivery passes through intermediate depots (called satellites). As in the classical VRP, the goal is to deliver goods to customers with known demands, minimizing the total delivery cost while considering vehicle and satellites capacity constraints. A mathematical model for 2E-CVRP is presented and some valid in- equalities given, which are able to significantly improve the results on benchmark tests up to 50 customers and 5 satellites. Computational re- sults under different realistic scenarios are presented