Search results for "Computation"
showing 10 items of 7362 documents
EV-planning: Electric vehicle itinerary planning
2014
International audience; In the latest few years, lot of efforts have been done to pave the way to sustainable mobility, in order to solve pollution problems and fuel shortage. The use of electric vehicles (EV) is considered as one of the best ecologic and economic solution. However, autonomy barriers and limitations slow the progress and the deployment of this technology. In this paper, we propose an advanced electric vehicles' fleet management architecture. This architecture considers the most important factors that can affect the traveling mode of electric vehicles, in order to offer different services to fleet management companies for an efficient monitoring and management of their fleet…
Joint Radio and Computational Resource Allocation in IoT Fog Computing
2018
The current cloud-based Internet-of-Things (IoT) model has revealed great potential in offering storage and computing services to the IoT users. Fog computing, as an emerging paradigm to complement the cloud computing platform, has been proposed to extend the IoT role to the edge of the network. With fog computing, service providers can exchange the control signals with the users for specific task requirements, and offload users’ delay-sensitive tasks directly to the widely distributed fog nodes at the network edge, and thus improving user experience. So far, most existing works have focused on either the radio or computational resource allocation in the fog computing. In this work, we inve…
Adaptation based on interpolation errors for high order mesh refinement methods applied to conservation laws
2012
Adaptive mesh refinement is nowadays a widely used tool in the numerical solution of hyperbolic partial differential equations. The algorithm is based on the numerical approximation of the solution of the equations on a hierarchical set of meshes with different resolutions. Among the different parts that compose an adaptive mesh refinement algorithm, the decision of which level of resolution is adequate for each part of the domain, i.e., the design of a refinement criterion, is crucial for the performance of the algorithm. In this work we analyze a refinement strategy based on interpolation errors, as a building block of a high order adaptive mesh refinement algorithm. We show that this tec…
Algorithms for transforming an integral photography into a plenoptic picture
2013
We report a simple algorithm for transforming the set of elemental images captured with an integral-photography set up, into the set of micro-images ready to be projected into an integral-imaging monitor. The method is based in the transposing relation between an integral photography and a plenoptic picture. The reported technique permits to adapt the integral images to the resolution and size of the monitor.
A computational study of several heuristics for the DRPP
1995
The problem of designing a route of minimum length for a postman that starts and finishes at his office and has to deliver the mail along a set of streets in a city is known as the Rural Postman Problem. When the postman has to obey the directions of the streets, we have the directed version of this problem. Finding an exact solution, in the general case, is intractably difficult. Hence, we have implemented three heuristic algorithms for approximately solving this problem and a procedure for obtaining a lower bound to the optimal length. Also, we present numerical experimentations based on a collection of random instances with up to 30 connected components, 240 vertices and 801 arcs. A lowe…
Guaranteed Error Bounds I
2014
In Chap. 3, we discussed the main ideas of fully reliable error control methods and the corresponding numerical algorithms with the paradigm of simple elliptic type problems. This chapter is intended to show a deep connection between a posteriori estimates of the functional type and physical relations generating the problem. Also, the goal of this chapter is to consider a wider set of problems arising in various applications and explain things in terms of computational mechanics. For this purpose, we begin with a simple class of mechanical problems (straight beams) and after that consider curvilinear beams and more complicated models of continuum mechanics (linear elasticity, viscous fluids…
The set of conjugacy class sizes of a finite group does not determine its solvability
2014
Abstract We find a pair of groups, one solvable and the other non-solvable, with the same set of conjugacy class sizes.
Words and Patterns
2002
In this paper some new ideas, problems and results on patterns are proposed. In particular, motivated by questions concerning avoidability, we first study the set of binary patterns that can occur in one infinite binary word, comparing it with the set of factors of the word. This suggests a classification of infinite words in terms of the "difference" between the set of its patterns and the set of its factors. The fact that each factor in an infinite word can give rise to several distinct patterns leads to study the set of patterns of a single finite word. This set, endowed with a natural order relation, defines a poset: we investigate the relationships between the structure of such a poset…
Unknown order process emulation
2002
Approaches the emulation problem using feedforward neural networks of single input single output (SISO) processes, applying a backpropagation method with a higher convergence rate. In this kind of application, difficult problems appear when the system's order is a priori unknown. A search through the SISO processes space is proposed, aiming to find a favorable neural emulator over the training examples set.
Fast solution of radial distribution networks with automated compensation and reconfiguration
2000
Abstract Optimal operation of radial distribution networks with automated compensation and reconfiguration requires the solution of a combinatorial optimisation problem, since the variables are the on/off status of capacitor banks and the open/close status of tie-switches. The solution approaches recently proposed use iterative algorithms such as genetic algorithms, simulated annealing and tabu search, for which the network needs to be solved in different configurations and at different compensation levels. The aim of this evaluation is that of attributing a quality index to each solution so that all the solutions can be suitably ordered. In an automated network, any configuration can be ob…