Incorporating waiting time in competitive location models: formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP, market capture is obtained by lower traveling distances or lower traveling time, in this new version not only the traveling time but also the waiting time will affect the market share. This problem is hard to solve using standard optimization techniques. Metaheuristics are shown to offer accurate results within acceptable computing times.

Incorporating waiting time in competitive location models: Formulations and heuristics

In this paper we propose a metaheuristic to solve a new version of the Maximum CaptureProblem. In the original MCP, market capture is obtained by lower traveling distances or lowertraveling time, in this new version not only the traveling time but also the waiting time willaffect the market share. This problem is hard to solve using standard optimization techniques.Metaheuristics are shown to offer accurate results within acceptable computing times.

A note on parallelizing the parameterized expectations algorithm

The parameterized expectations algorithm (PEA) involves a long simulation and a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization. This note shows that parallelization can lead to important speedups for the PEA. I provide example code for a simple model that can serve as a template for parallelization of more interesting models, as well as a download link for an image of a bootable CD that allows creation of a cluster and execution of the example code in minutes, with no need to install any software.

The Argentine ant (Linepithema humile) invasion effects on Mediterranean forests’ trophic web: blue tit (Parus caeruleus) reproduction and development

Les invasions biològiques representen una greu amenaça per al funcionament dels ecosistemes i per a la preservació de la biodiversitat.. La formiga argentina (Linepithema humile) està considerada com una de les 100 espècies invasores més nocives. Prospera en extenses àrees de clima mediterrani de regions temperades i subtropicals de tots els continents amb l’excepció de l’Antàrtida. És una formiga dominant i una competidora agressiva que mitjançant múltiples mecanismes, des de predació directe a competència, produeix efectes negatius en una amplia varietat de taxons, principalment formigues i altres artròpodes, però també vertebrats. S’ha investigat, per primera vegada, els efectes de la formiga invasiva sobre les comunitats d’artròpodes de fullatge i com aquestes pertorbacions es transmeten en la xarxa tròfica del bosc esclerofil•le mediterrani. En les suredes estudiades la invasió de formiga argentina és causa directe de la extinció local de la gran majoria de poblacions de formigues natives. En el període mostrejat s’han constatat també impactes negatius en la diversitat i en l’abundància d’artròpodes natius en les capçades dels arbres, particularment d’erugues. Una avaluació preliminar basada únicament amb dades del 2005 indica que, reduint la disponibilitat d’erugues, la formiga argentina empobreix l’hàbitat reproductiu de la mallerenga blava (Parus caeruleus). La mallerenga blava basa la dieta insectívora estricte de la seva pollada fonamentalment en les erugues. No hem detectat impactes en l’èxit reproductiu de les mallerengues blaves en zones envaïdes. Els polls crescuts en àrees envaïdes assoleixen una condició física similar als de les zones no envaïdes, però la reducció en la disponibilitat d’erugues associada a la invasió de formiga argentina es tradueix en un creixement descompassat i en una menor mida estructural del polls volanders. Així, les pertorbacions en la comunitat d’artròpodes associades a la invasió de la formiga argentina promouen efectes bottom-up que acaben perjudicant el desenvolupament dels polls de mallerenga blava.

A numerical algorithm for finding solutions of a generalized Nash equilibrium problem

A family of nonempty closed convex sets is built by using the data of the Generalized Nash equilibrium problem (GNEP). The sets are selected iteratively such that the intersection of the selected sets contains solutions of the GNEP. The algorithm introduced by Iusem-Sosa (2003) is adapted to obtain solutions of the GNEP. Finally some numerical experiments are given to illustrate the numerical behavior of the algorithm.

An algorithm for semi-infinite polynomial optimization

"Vegeu el resum a l'inici del document del fitxer adjunt."

An approximation algorithm for #k-SAT

"Vegeu el resum a l'inici del document del fitxer adjunt"

Effect of Temperature on the Development and Survival of the Argentine Ant, Linepithema humile

The influence of temperature on the developmental times and survival of insects can largely determine their distribution. For invasive species, like the Argentine ant, Linepithema humile Mayr (Hymenoptera: Formicidae), these data are essential for predicting their potential range based on mechanistic models. In the case of this species, such data are too scarce and incomplete to make accurate predictions based on its physiological needs. This research provides comprehensive new data about brood survival and developmental times at a wide range of temperatures under laboratory conditions. Temperature affected both the complete brood development from egg to adult worker and each of the immature stages separately. The higher the temperature, the shorter the development times. Brood survival from egg to adult was low, with the maximum survival rate being only 16% at 26º C. Temperature also affected survival of each of the immature stages differently: eggs were negatively affected by high temperatures, while larvae were negatively affected by low temperatures, and the survival of pupae was apparentlyindependent of environmental temperature. At 32º C no eggs survived, while at 18º C less than 2% of the eggs hatched into larva. The data from the present study are essential for developing prediction models about the distribution range of this tramp species based on its physiological needs in relation to temperature

Proposal of a parallel architecture for a motion detection algorithm

This paper proposes a parallel architecture for estimation of the motion of an underwater robot. It is well known that image processing requires a huge amount of computation, mainly at low-level processing where the algorithms are dealing with a great number of data. In a motion estimation algorithm, correspondences between two images have to be solved at the low level. In the underwater imaging, normalised correlation can be a solution in the presence of non-uniform illumination. Due to its regular processing scheme, parallel implementation of the correspondence problem can be an adequate approach to reduce the computation time. Taking into consideration the complexity of the normalised correlation criteria, a new approach using parallel organisation of every processor from the architecture is proposed

Speculative parallelization of multipath radiosity algorithm

In computer graphics, global illumination algorithms take into account not only the light that comes directly from the sources, but also the light interreflections. This kind of algorithms produce very realistic images, but at a high computational cost, especially when dealing with complex environments. Parallel computation has been successfully applied to such algorithms in order to make it possible to compute highly-realistic images in a reasonable time. We introduce here a speculation-based parallel solution for a global illumination algorithm in the context of radiosity, in which we have taken advantage of the hierarchical nature of such an algorithm

A Monte Carlo-Based Fiber Tracking Algorithm using Diffusion Tensor MRI

Diffusion tensor magnetic resonance imaging, which measures directional information of water diffusion in the brain, has emerged as a powerful tool for human brain studies. In this paper, we introduce a new Monte Carlo-based fiber tracking approach to estimate brain connectivity. One of the main characteristics of this approach is that all parameters of the algorithm are automatically determined at each point using the entropy of the eigenvalues of the diffusion tensor. Experimental results show the good performance of the proposed approach

Constraint algorithm for k-presymplectic Hamiltonian systems. Application to singular field theories

The k-symplectic formulation of field theories is especially simple, since only tangent and cotangent bundles are needed in its description. Its defining elements show a close relationship with those in the symplectic formulation of mechanics. It will be shown that this relationship also stands in the presymplectic case. In a natural way,one can mimick the presymplectic constraint algorithm to obtain a constraint algorithmthat can be applied to k-presymplectic field theory, and more particularly to the Lagrangian and Hamiltonian formulations offield theories defined by a singular Lagrangian, as well as to the unified Lagrangian-Hamiltonian formalism (Skinner--Rusk formalism) for k-presymplectic field theory. Two examples of application of the algorithm are also analyzed.

A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels

The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P