裏表紙

textabstractIn this paper, we consider the a priori traveling salesman problem (TSP) in the scenario model. In this problem, we are given a list of subsets of the vertices, called scenarios, along with a probability for each scenario. Given a tour on all vertices, the resulting tour for a given scenario is obtained by restricting the solution to the vertices of the scenario. The goal is to find a tour on all vertices that minimizes the expected length of the resulting restricted tour. We show that this problem is already NP-hard and APX-hard when all scenarios have size four. On the positive side, we show that there exists a constant-factor approximation algorithm in three restricted cases: if the number of scenarios is fixed, if the number of missing vertices per scenario is bounded by a constant, and if the scenarios are nested. Finally, we discuss an elegant relation with an a priori minimum spanning tree problem

Tight-binding modelling of the electronic band structure of layered superconducting perovskites

A detailed tight-binding analysis of the electron band structure of the CuO_2 plane of layered cuprates is performed within a sigma-band Hamiltonian including four orbitals - Cu3d_x^2-y^2, Cu4s, O2p_x, and O2p_y. Both the experimental and theoretical hints in favor of Fermi level located in a Cu or O band, respectively, are considered. For these two alternatives analytical expressions are obtained for the LCAO electron wave functions suitable for the treatment of electron superexchange. Simple formulae for the Fermi surface and electron dispersions are derived by applying the Loewdin down-fold procedure to set up the effective copper and oxygen Hamiltonians. They are used to fit the experimental ARUPS Fermi surface of Pb_0.42Bi_1.73Sr_1.94Ca_1.3Cu_1.92O_8+x and both the ARPES and LDA Fermi surface of Nd_2-xCe_xCuO_4-delta. The value of presenting the hopping amplitudes as surface integrals of ab initio atomic wave functions is demonstrated as well. The same approach is applied to the RuO_2 plane of the ruthenate Sr_2RuO_4. The LCAO Hamiltonians including the three in-plane pi-orbitals Ru4d_xy, O_a 2p_y, O_b 2p_x and the four transversal pi-orbitals Ru4d_zx, Ru4d_yz, O_a 2p_z, O_b 2p_z, are separately considered. It is shown that the equation for the constant energy curves and the Fermi contours has the same canonical form as the one for the layered cuprates.Comment: 21 pages, 10 figures, published in J. Phys.: Condens. Matter (complete and corrected References section

Knowledge-aided covariance matrix estimation and adaptive detection in compound-Gaussian noise

We address the problem of adaptive detection of a signal of interest embedded in colored noise modeled in terms of a compound-Gaussian process. The covariance matrices of the primary and the secondary data share a common structure while having different power levels. A Bayesian approach is proposed here, where both the power levels and the structure are assumed to be random, with some appropriate distributions. Within this framework we propose MMSE and MAP estimators of the covariance structure and their application to adaptive detection using the NMF test statistic and an optimized GLRT herein derived. Some results, also conducted in comparison with existing algorithms, are presented to illustrate the performances of the proposed algorithms. The relevant result is that the solutions presented herein allows to improve the performance over conventional ones, especially in presence of a small number of training data

ASAP: The After Salesman Problem

The customer contacts taking place after a sales transaction and the services involved are of increasing importance in contemporary business models. The responsiveness to service requests is a key dimension in service quality and therefore an important succes factor in this business domain. This responsiveness is of course highly dependent on the operational scheduling or dispatching decisions made in the often dynamic service settings. We consider the problem of optimizing responsiveness to service requests arriving in real time. We consider three models and formulations and present computational results on exact solution methods. The research is based on practical practical work done with the largest service organization in The Netherlands.operations research and management science;

Can dissipation prevent explosive decomposition in high-energy heavy ion collisions?

We discuss the role of dissipation in the explosive spinodal decomposition scenario of hadron production during the chiral transition after a high-energy heavy ion collision. We use a Langevin description inspired by microscopic nonequilibrium field theory results to perform real-time lattice simulations of the behavior of the chiral fields. We show that the effect of dissipation can be dramatic. Analytic results for the short-time dynamics are also presented.Comment: 9 latex pages, 4 eps figures, version to appear in Phys. Lett.

Persistent Monitoring of Events with Stochastic Arrivals at Multiple Stations

This paper introduces a new mobile sensor scheduling problem, involving a single robot tasked with monitoring several events of interest that occur at different locations. Of particular interest is the monitoring of transient events that can not be easily forecast. Application areas range from natural phenomena ({\em e.g.}, monitoring abnormal seismic activity around a volcano using a ground robot) to urban activities ({\em e.g.}, monitoring early formations of traffic congestion using an aerial robot). Motivated by those and many other examples, this paper focuses on problems in which the precise occurrence times of the events are unknown {\em a priori}, but statistics for their inter-arrival times are available. The robot's task is to monitor the events to optimize the following two objectives: {\em (i)} maximize the number of events observed and {\em (ii)} minimize the delay between two consecutive observations of events occurring at the same location. The paper considers the case when a robot is tasked with optimizing the event observations in a balanced manner, following a cyclic patrolling route. First, assuming the cyclic ordering of stations is known, we prove the existence and uniqueness of the optimal solution, and show that the optimal solution has desirable convergence and robustness properties. Our constructive proof also produces an efficient algorithm for computing the unique optimal solution with $O(n)$ time complexity, in which $n$ is the number of stations, with $O(\log n)$ time complexity for incrementally adding or removing stations. Except for the algorithm, most of the analysis remains valid when the cyclic order is unknown. We then provide a polynomial-time approximation scheme that gives a $(1+\epsilon)$-optimal solution for this more general, NP-hard problem