In many real world applications we do not have access to fully-labeled training data, but only to a list of possible labels. This is the case, e.g., when learning visual classifiers from images downloaded from the web, using just their text captions or tags as learning oracles. In general, these problems can be very difficult. However most of the time there exist different implicit sources of i...

Uncertainty of measuring complex-valued physical quantities can be described by complex sets. These sets can have complicated shapes, so we would like to nd a good approximating family of sets. Which approximating family is the best? We reduce the corresponding optimization problem to a geometric one: namely, we prove that, under some reasonable conditions, an optimal family must be shift-, rot...

Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...

risk response planning is one of the main phases in the project risk management and has major impacts on the success of a large-scale project. since projects are unique, and risks are dynamic through the life of the projects, it is necessary to formulate responses of the important risks. the conventional approaches tend to be less effective in dealing with the impreciseness of risk response pl...

In this paper, time optimal control problems of a class of integrator switched systems with polyhedral state constraint subsets are studied. We first develop a directed graph representation of the system discrete structure. Based on the graph representation, we generate candidate solution paths and propose an algorithm for seeking the optimal solution. A linear programming method for finding th...

Last year’s competition demonstrated that the NER context contains important information that should not be ignored in entity linking. State-of-the-art approaches anchor on unambiguous entities, look for overlap in categories, or approximate a joint model of candidate assignments, after Wikipedia candidates have been selected. Current candidate approaches, such as anchor text maps, are effectiv...

In this paper, time optimal control problems of a class of integrator switched systems with polyhedral state constraint subsets are studied. We first develop a directed graph representation of the system discrete structure. Based on the graph representation, we generate candidate solution paths and propose an algorithm for seeking the optimal solution. A linear programming method for finding th...

We consider the problem of online planning for a mobile robot among obstacles, where it is impractical to test all possible future paths. One approach is for the runtime task to test some subset of the possible paths and select a path that does not collide with obstacles while advancing the robot toward its goal. Performance depends on the choice of path set. In this paper we assume the path se...