Probabilistic maximal covering location-allocation models with constrained waiting time or queue length for congested systems

When dealing with the design of service networks, such as healthand EMS services, banking or distributed ticket selling services, thelocation of service centers has a strong influence on the congestion ateach of them, and consequently, on the quality of service. In this paper,several models are presented to consider service congestion. The firstmodel addresses the issue of the location of the least number of single--servercenters such that all the population is served within a standard distance,and nobody stands in line for a time longer than a given time--limit, or withmore than a predetermined number of other clients. We then formulateseveral maximal coverage models, with one or more servers per service center.A new heuristic is developed to solve the models and tested in a 30--nodesnetwork.

A new chance-constrained maximum capture location problem

The paper presents a new model based on the basic Maximum Capture model,MAXCAP. The New Chance Constrained Maximum Capture modelintroduces astochastic threshold constraint, which recognises the fact that a facilitycan be open only if a minimum level of demand is captured. A metaheuristicbased on MAX MIN ANT system and TABU search procedure is presented tosolve the model. This is the first time that the MAX MIN ANT system isadapted to solve a location problem. Computational experience and anapplication to 55 node network are also presented.

Implementing TURF analysis through binary linear programming

This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.

On p-beauty contest integer games

In this paper we provide a full characterization of the pure-strategyNash Equilibria for the p-Beauty Contest Game when we restrict player schoices to integer numbers. Opposed to the case of real number choices,equilibrium uniqueness may be lost depending on the value of p and thenumber of players: in particular, as p approaches 1 any symmetric profileconstitutes a Nash Equilibrium. We also show that any experimental p-BeautyContest Game can be associated to a game with the integer restriction andthus multiplicity of equilibria becomes an issue. Finally, we show thatin these games the iterated deletion of weakly dominated strategies maynot lead to a single outcome while the iterated best-reply process alwaysdoes (though the outcome obtained depends on the initial conditions).

Restless bandits, linear programming relaxations and a primal-dual index heuristic

We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.

Mixed equilibrium in a Downsian model with a favored candidate

This paper examines competition in the standard one-dimensional Downsian model of two-candidate elections, but where one candidate (A) enjoys an advantage over the other candidate (D). Voters' preferences are Euclidean, but any voter will vote for candidate A over candidate D unless D is closer to her ideal point by some fixed distance \delta. The location of the median voter's ideal point is uncertain, and its distribution is commonly known by both candidates. The candidates simultaneously choose locations to maximize the probability of victory. Pure strategy equilibria often fails to exist in this model, except under special conditions about \delta and the distribution of the median ideal point. We solve for the essentially unique symmetric mixed equilibrium, show that candidate A adopts more moderate policies than candidate D, and obtain some comparative statics results about the probability of victory and the expected distance between the two candidates' policies.

Surface topography and mixed-pixel effects on the simulated L-band brightness temperatures.

The impact of topography and mixed pixels on L-band radiometric observations over land needs to be quantified to improve the accuracy of soil moisture retrievals. For this purpose, a series of simulations has been performed with an improved version of the soil moisture and ocean salinity (SMOS) end-to-end performance simulator (SEPS). The brightness temperature generator of SEPS has been modified to include a 100-m-resolution land cover map and a 30-m-resolution digital elevation map of Catalonia (northeast of Spain). This high-resolution generator allows the assessment of the errors in soil moisture retrieval algorithms due to limited spatial resolution and provides a basis for the development of pixel disaggregation techniques. Variation of the local incidence angle, shadowing, and atmospheric effects (up- and downwelling radiation) due to surface topography has been analyzed. Results are compared to brightness temperatures that are computed under the assumption of an ellipsoidal Earth.

Programming and analysing measurement experiments using the PicoCricket system

The aim of this project is to get used to another kind of programming. Since now, I used very complex programming languages to develop applications or even to program microcontrollers, but PicoCricket system is the evidence that we don’t need so complex development tools to get functional devices. PicoCricket system is the clear example of simple programming to make devices work the way we programmed it. There’s an easy but effective way to program small, devices just saying what we want them to do. We cannot do complex algorithms and mathematical operations but we can program them in a short time. Nowadays, the easier and faster we produce, the more we earn. So the tendency is to develop fast, cheap and easy, and PicoCricket system can do it.

Gas-sensing properties of sprayed films of (CdO)x(ZnO)1-x mixed oxide

A novel NO2 sensor based on (CdO)x(ZnO)1-x mixed-oxide thin films deposited by the spray pyrolysis technique is developed. The sensor response to 3-ppm NO2 is studied in the range 50°C-350°C for three different film compositions. The device is also tested for other harmful gases, such as CO (300 ppm) and CH4 (3000 ppm). The sensor response to these reducing gases is different at different temperatures varying from the response typical for the p-type semiconductor to that typical for the n-type semiconductor. Satisfactory response to NO2 and dynamic behavior at 230°C, as well as low resistivity, are observed for the mixed-oxide film with 30% Cd. The response to interfering gas is poor at working temperature (230°C). On the basis of this study, a possible sensing mechanism is proposed.

The assignment game: core bounds for mixed-pair coalitions

In the assignment game framework, we try to identify those assignment matrices in which no entry can be increased without changing the coreof the game. These games will be called buyer¿seller exact games and satisfy the condition that each mixed¿pair coalition attains the corresponding matrix entry in the core of the game. For a given assignment game, a unique buyerseller exact assignment game with the same core is proved to exist. In order to identify this matrix and to provide a characterization of those assignment games which are buyer¿seller exact in terms of the assignment matrix, attainable upper and lower core bounds for the mixed¿pair coalitions are found. As a consequence, an open question posed in Quint (1991) regarding a canonical representation of a ¿45o¿lattice¿ by means of the core of an assignment game can now be answered

On the consequences of misspecifing assumptions concerning residuals distribution in a repeated measures and nonlinear mixed modelling context

In this paper we describe the results of a simulation study performed to elucidate the robustness of the Lindstrom and Bates (1990) approximation method under non-normality of the residuals, under different situations. Concerning the fixed effects, the observed coverage probabilities and the true bias and mean square error values, show that some aspects of this inferential approach are not completely reliable. When the true distribution of the residuals is asymmetrical, the true coverage is markedly lower than the nominal one. The best results are obtained for the skew normal distribution, and not for the normal distribution. On the other hand, the results are partially reversed concerning the random effects. Soybean genotypes data are used to illustrate the methods and to motivate the simulation scenarios

Impact of incorrect assumptions on the covariance structure of random effects and/or residuals in nonlinear mixed models for repeated measures data

In this paper we analyse, using Monte Carlo simulation, the possible consequences of incorrect assumptions on the true structure of the random effects covariance matrix and the true correlation pattern of residuals, over the performance of an estimation method for nonlinear mixed models. The procedure under study is the well known linearization method due to Lindstrom and Bates (1990), implemented in the nlme library of S-Plus and R. Its performance is studied in terms of bias, mean square error (MSE), and true coverage of the associated asymptotic confidence intervals. Ignoring other criteria like the convenience of avoiding over parameterised models, it seems worst to erroneously assume some structure than do not assume any structure when this would be adequate.

Structure and energetics of mixed 4He-3He drops

Using a finite-range density functional, we have investigated the energetics and structural features of mixed helium clusters. The possibility of doping the cluster with a molecule of sulfur hexafluoride is also considered. It is seen that the repulsion introduced by the impurity strongly modifies the properties of the smallest drops. Although only a qualitative comparison is possible, the gross features displayed by our calculations are in agreement with recent experimental findings.

Integer filling facfor phases and isospin in vertical diatomic artificial molecules

Integer filling factor phases of many-electron vertically coupled diatomic artificial quantum dot molecules are investigated for different values of the interdot coupling. The experimental results are analyzed within local-spin density functional theory for which we have determined a simple lateral confining potential law that can be scaled for the different coupling regimes, and Hartree-Fock theory. Maximum density droplets composed of electrons in both bonding and antibonding or just bonding states are revealed, and interesting isospin-flip physics appears for weak interdot coupling when the systematic depopulation of antibonding states leads to changes in isospin.