Optimal Positioning of a Mobile Service Unit on a Line

In this paper we address the problem of locating a mobile response unit when demand is distributed according to a random variable on a line. Properties are proven which reduce the problem to locating a non-mobile facility, transforming the original optimization problem into an one-dimensional convex program.In the special case of a discrete demand (a simple probability measure), an algorithm which runs in expected linear time is proposed.     

Ad-hoc design of temporally shaped fs laser pulses based on plasma dynamics for deep ablation in fused silica

We have analyzed the ablation depth yield of fused silica irradiated with shaped pulse trains with a separation of 500 fs and increasing or decreasing intensity envelopes. This temporal separation value is extracted from previous studies on ablation dynamics upon irradiation with transform-limited 100 fs laser pulses. The use of decreasing intensity pulse trains leads to a strong increase of the induced ablation depth when compared to the behavior, at the same pulse fluence, of intensity increasing pulse trains. In addition, we have studied the material response under stretched (500 fs, FWHM) and transform-limited (100 fs, FWHM) pulses, for which avalanche or multiphoton ionization respectively dominates the carrier generation process. The comparison of the corresponding evolution of the ablated depth vs. fluence suggests that the use of pulse trains with decreasing intensity at high fluences should lead to enhanced single exposure ablation depths, beyond the limits corresponding to MPI- or AI-alone dominated processes.     

Cooperative location games based on the minimum diameter spanning Steiner subgraph problem

In this paper we introduce and analyze new classes of cooperative games related to facility location models. The players are the customers (demand points) in the location problem and the characteristic value of a coalition is the cost of serving its members. Specifically, the cost in our games is the service diameter of the coalition.We study the existence of core allocations for these games, focusing on network spaces, i.e., finite metric spaces induced by undirected graphs and positive edge lengths.     

The use of relative priorities in optimizing the performance of a queueing system

Relative priorities in an n-class queueing system can reduce server and customer costs. This property is demonstrated in a single server Markovian model where the goal is to minimize a non-linear cost function of class expected waiting times. Special attention is given to minimizing server’s costs when the expected waiting time of each class is restricted.     

Colloidal Flower‐Shaped Iron Oxide Nanoparticles: Synthesis Strategies and Coatings

The assembly of magnetic cores into regular structures may notably influence the properties displayed by a magnetic colloid. Here, key synthesis parameters driving the self‐assembly process capable of organizing colloidal magnetic cores into highly regular and reproducible multi‐core nanoparticles are determined. In addition, a self‐consistent picture that explains the collective magnetic properties exhibited by these complex assemblies is achieved through structural, colloidal, and magnetic means. For this purpose, different strategies to obtain flower‐shaped iron oxide assemblies in the size range 25–100 nm are examined. The routes are based on the partial oxidation of Fe(OH)₂, polyol‐mediated synthesis or the reduction of iron acetylacetonate. The nanoparticles are functionalized either with dextran, citric acid, or alternatively embedded in polystyrene and their long‐term stability is assessed. The core size is measured, calculated, and modeled using both structural and magnetic means, while the Debye model and multi‐core extended model are used to study interparticle interactions. This is the first step toward standardized protocols of synthesis and characterization of flower‐shaped nanoparticles.     

Folk theorems in multicriteria repeated N-person games

In this paper we consider the question of existence of a multicriteria-Nash equilibrium in multicriteria multistage N-person games. Besides, we present several forms of multicriteria-Nash equilibrium for repeated games both with infinitely and finitely many stages. The author thanks the Spanish Ministry of Science and Technology through grant number BFM01-2378.