Passenger-friendly train disposition is a challenging, highly complex online optimization problem with uncertain and incomplete information about future delays. In this paper we focus on the timing within the disposition process. We introduce three different classification schemes to predict as early as possible the status of a transfer: whether it will almost surely break, is so critically del...

This paper presents a new methodology for statically scheduling a cyclic data-ow graph whose node computation times can be represented by random variables. A communication cost issue is also considered as another uncertain factor in which each node from the graph can produce diierent amount of data depending on the probability of its computation time. Since such communication costs rely on the ...

Probabilistic roadmaps (PRMs) are a commonly used approach to path planning in continuous spaces with obstacles. We examine the case where the obstacle locations are not known with certainty but can be observed during execution of the plan. We abstract the problem to one of traversing a graph where some edges (referred to as uncertain edges) may or may not be present, and where noisy observatio...

We study the L1 median for locationally uncertain points with discrete distributions. That is, each point in a data set has a discrete probability distribution describing its location. The L1 median is a robust estimator, useful when there are outliers in the point set. However given the probabilistic nature of this data, there is a distribution describing the L1 median, not a single location. ...

Myerson treated various situations of cooperation in the field of cooperative games and proposed the communication structure. In this paper, we define and characterize an allocation rule in terms of the position value, called an average spanning tree solution, for communication situations by introducing a concept of cooperation relationship which says that two players are deemed to possess this...

This paper presents a new methodology for statically scheduling a cyclic dataow graph whose node computation times can be represented by random variables. A communication cost issue is also considered as another uncertain factor in which each node from the graph can produce di erent amount of data depending on the probability of its computation time. Since such communication costs rely on the a...

This paper is concerned with the consensus tracking problem of high order MIMO nonlinear multi-agent systems. The agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. The communication network topology of agents is assumed to be a fixed undirected graph. A distributed adaptive control method is proposed to solve the consensus problem utilizing re...

Title of dissertation: DECLARATIVE CLEANING, ANALYSIS, AND QUERYING OF GRAPH-STRUCTURED DATA Walaa Eldin Moustafa, Doctor of Philosophy, 2013 Dissertation directed by: Professor Amol Deshpande, Professor Lise Getoor, Department of Computer Science Much of today’s data including social, biological, sensor, computer, and transportation network data is naturally modeled and represented by graphs. ...

Abstract This study tackles the problem of extracting node roles in uncertain graphs based on network motifs. Uncertain are useful for modeling information diffusion phenomena because presence or absence edges is stochastically determined. In such an graph, role also changes according to edges, so approximate calculation using a huge number samplings common. However, load very large, even small...

Community search is to explore valuable target community structure from a large social network. In real community, every point has geographic location information, and many edges are uncertain. Such network called spatial uncertain order meet the existing needs, this paper studies in so that searched communities can be relatively close geographical relationship between each other also very clos...