A morphological study of waves in the thermosphere using DE-2 observations

Theoretical model and data analysis of DE-2 observations for determining the correlation between the neutral wave activity and plasma irregularities have been presented. The relationships between the observed structure of the sources, precipitation and joule heating, and the fluctuations in neutral and plasma parameters are obtained by analyzing two measurements of neutral atmospheric wave activity and plasma irregularities by DE-2 during perigee passes at an altitude on the order of 300 to 350 km over the polar cap. A theoretical model based on thermal nonlinearity (joule heating) to give mode-mode coupling is developed to explore the role of neutral disturbance (winds and gravity waves) on the generation of plasma irregularities

Designing cost-sharing methods for Bayesian games

We study the design of cost-sharing protocols for two fundamental resource allocation problems, the Set Cover and the Steiner Tree Problem, under environments of incomplete information (Bayesian model). Our objective is to design protocols where the worst-case Bayesian Nash equilibria, have low cost, i.e. the Bayesian Price of Anarchy (PoA) is minimized. Although budget balance is a very natural requirement, it puts considerable restrictions on the design space, resulting in high PoA. We propose an alternative, relaxed requirement called budget balance in the equilibrium (BBiE).We show an interesting connection between algorithms for Oblivious Stochastic optimization problems and cost-sharing design with low PoA. We exploit this connection for both problems and we enforce approximate solutions of the stochastic problem, as Bayesian Nash equilibria, with the same guarantees on the PoA. More interestingly, we show how to obtain the same bounds on the PoA, by using anonymous posted prices which are desirable because they are easy to implement and, as we show, induce dominant strategies for the players

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem

We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the average completion time of the optimal nonpreemptive schedule to that of the optimal preemptive schedule is at most 7}{3}, improving a bound of (3- 1}{m}) due to Phillips, Stein and Wein. We then use our technique to give an improved bound on the quality of a linear programming relaxation of the problem considered by Hall, Schulz, Shmoys and Wein

Fast approximation algorithms for fractional packing and covering problems

This paper published in "Computational Optimization and Applications" 2 (1993) 301-31