The ability to make sense of the massive amounts high-dimensional data generated from molecular dynamics (MD) simulations is heavily dependent on knowledge a low dimensional manifold (parameterized by reaction coordinate or RC) that typically distinguishes between relevant metastable states and which captures slow interest. Methods based machine learning artificial intelligence have been propos...

Abstract This paper introduces a bottleneck game with finite sets of commuters and departing time slots as an extension congestion games Konishi et al. (J Econ Theory 72:225–237, 1997a). After characterizing Nash equilibrium the game, we provide sufficient conditions for which equivalence between strong equilibria holds. Somewhat surprisingly, unlike in games, pure strategies may often fail to ...

We introduce Colored Resource Allocation Games as a new model for selfish routing and wavelength assignment in multifiber all-optical networks. Colored Resource Allocation Games are a generalization of congestion and bottleneck games where players have their strategies in multiple copies (colors). We focus on two main subclasses of these games depending on the player cost: in Colored Congestion...

INTERESTS My main research interest is to develop end-to-end network diagnosis techniques to uncover dynamic network properties (e.g. congestion information, bottleneck equivalence, loss rates, topology, etc.) in a near real-time fashion. This information can be used to characterize the Internet dynamics and to dynamically adapt the control strategies of massively accessed Web servers (e.g. con...

In this paper we describe an implementation of a software transactional memory system that is capable of exploiting an increase in parallelism to improve performance. We demonstrate the improvements in performance via benchmarking our system against a standard STM. For the first time we show that parallelism can be exploited to offset an increase in contention. This provides a system where the ...