Search results for "PROGRAM"
showing 10 items of 5938 documents
Design of a transverse flux machine for power generation from seawaves
2014
In this paper, we present a transverse flux linear generator. We investigate the possibility to use this generator to extract energy from seawaves. We propose an optimization procedure that allows us to obtain an optimized design of the generator. The optimized design of the converter shows a power generation capability index much higher than other renewable systems.
El Juicio Final en el trascoro de la Basílica de Morella
1992
LAS ESCULTURAS QUE REMATAN EL TRASCORO DE LA ARCIPRESTAL DE SANTA MARIA DE MORELLA ENCIERRAN UN PROGRAMA ICONOGRAFICO QUE GIRA EN TORNO AL JUICIO FINAL, TEMA MUY REPRESENTADO ESCULTORICAMENTE A LO LARGO DE TODA LA EDAD MEDIA, PREFERENTEMENTE EN LAS PORTADAS DE PONIENTE. EN LA BASILICA MORELLANA, EXCEPCIONALMENTE, SE ENCUENTRA EN EL INTERIOR, DESARROLLADO HORIZONTALMENTE EN TRES GRANDES FRISOS DEL TRASCORO, DONDE MULTITUD DE FIGURILLAS SON PROTAGONISTAS DE LOS HECHOS ANUNCIADOS EN LAS SAGRADAS ESCRITURAS (ABC/LAG).
Generator-based PET radiopharmaceuticals for molecular imaging of tumours: on the way to THERANOSTICS.
2011
Generator-derived radionuclides for PET/CT imaging are promising for optimizing targeted radiotherapy by an individual patient-based approach, applying pre-therapeutic evaluation, as well as dosimetric calculations, and for measuring treatment response after radionuclide therapy.
Application of graph grammars in music composing systems
1987
On solving separable block tridiagonal linear systems using a GPU implementation of radix-4 PSCR method
2018
Partial solution variant of the cyclic reduction (PSCR) method is a direct solver that can be applied to certain types of separable block tridiagonal linear systems. Such linear systems arise, e.g., from the Poisson and the Helmholtz equations discretized with bilinear finite-elements. Furthermore, the separability of the linear system entails that the discretization domain has to be rectangular and the discretization mesh orthogonal. A generalized graphics processing unit (GPU) implementation of the PSCR method is presented. The numerical results indicate up to 24-fold speedups when compared to an equivalent CPU implementation that utilizes a single CPU core. Attained floating point perfor…
Solving a large multicontainer loading problem in the car manufacturing industry
2017
Abstract Renault, a large car manufacturer with factories all over the world, has a production system in which not every factory produces all the parts required to assemble a vehicle. Every day, large quantities of car parts are sent from one factory to another, defining very large truck/container transportation problems. The main challenge faced by the Renault logistics platforms is to load the items into trucks and containers as efficiently as possible so as to minimize the number of vehicles sent. Therefore, the problem to be solved is a multicontainer loading problem in which, besides the usual geometric constraints preventing items from overlapping and exceeding the dimensions of the c…
A negotiation protocol to improve long distance truck parking
2017
A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots
2016
International audience; In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequaliti…
Mathematical models for multicontainer loading problems
2017
Abstract This paper deals with the problem of a distribution company that has to serve its customers by putting first the products on pallets and then loading the pallets onto trucks. We approach the problem by developing and solving integer linear models. We start with basic models, that include the essential features of the problem, such as respecting the dimensions of the truck, and not exceeding the total weight capacity and the maximum weigh capacity on each axle. Then, we add progressively new conditions to consider the weight and volume of pallet bases and to include other desirable features for the solutions to be useful in practice, such as the position of the center of gravity and…
Branch-and-Price-and-Cut for the Active-Passive Vehicle-Routing Problem
2018
This paper presents a branch-and-price-and-cut algorithm for the exact solution of the active-passive vehicle-routing problem (APVRP). The APVRP covers a range of logistics applications where pickup-and-delivery requests necessitate a joint operation of active vehicles (e.g., trucks) and passive vehicles (e.g., loading devices such as containers or swap bodies). The objective is to minimize a weighted sum of the total distance traveled, the total completion time of the routes, and the number of unserved requests. To this end, the problem supports a flexible coupling and decoupling of active and passive vehicles at customer locations. Accordingly, the operations of the vehicles have to be s…