Comparing word contexts is a key component of many NLP tasks, but rarely is it used in conjunction with additional ontological knowledge. One problem is that the amount of overhead required can be high. In this paper, we provide a graphical method which easily combines an ontology with contextual information. We take advantage of the intrinsic graphical structure of an ontology for representing...

Given a product design and a repair network for capital goods, a level of repair analysis determines for each component in the product (1) whether it should be discarded or repaired upon failure and (2) at which location in the repair network to do this. In this paper, we show how the problem can be modelled as a minimum cost flow problem with side constraints. Advantages are that (1) solving o...

We consider the problem of finding an optimal mining sequence for an open pit during a number of time periods subject to only spatial and temporal precedence constraints. This problem is of interest because such constraints are generic to any open-pit scheduling problem and, in particular, because it arises as a Lagrangean relaxation of an open-pit scheduling problem. We show that this multi-pe...

The ongoing transition from the traditional electrical grid to the digitally interconnected smart grid and the increasing deregulation of electricity markets, allow to envision new types of distributed local energy markets. In order to develop such markets, it is important that energy producers and consumers can access a local energy price. In this project, we define an agent-based real-time lo...

Network flow problems form an important and much-studied family of combinatorial optimization problems, with a huge array practical applications. Two network in particular have received great deal attention: the maximum minimum-cost problems. We review progress that has been made on exact solution algorithms for these two emphasis worst-case running times.

An inverse optimization problems is defined as follows: Let S denote the set of feasible solutions of an optimization problem P, let c be a specified cost vector, and xO be a given feasible solution. We want to perturb the cost vector c to d so that x is an optimal solution of P with respect to the cost vector d , and lid clip is minimum, where 11.llp denotes some selected Lp norm. In this pape...

In this report, we discuss two approximate max-flow min-cut theorems that first introduced by Tom Leighton and Satish Rao in 1988 [9] and extended in 1999 [10] for uniform multicommodity flow problems. In the theorems they first showed that for any n-node multicommodity flow problem with uniform demands, the max-flow is a Ω(log n) factor smaller than the min-cut; further,they proved the max-flo...

We study the task of computing a matching between two images by formulating it as an instance of the minimum-cost flow problem. Here, we use a cycle cancelling algorithm to find the optimal flow. To reduce the practical runtime, we propose a hierarchical scheme in which the images are first scaled down and then the optimal solution for the smaller problem is used as a starting point for the hig...

commonly used environmental flow evaluation techniques range in complexity. some requires stream flow records alone, and some accounts for the habitat requirements of individual species life-stages and physical characteristics of the stream. hydrological based methods for environmental flow assessment are the first step in planning for environmental allocation in developing countries. for deter...

water crisis is one of the basic problems in the arid and drought prone areas like iran. this condition in the recent years has aggravated due to drought phenomenon. thus, using poor water quality has increased in areas where good quality is not available. in this study, in order to investigate clogging, 5 types of emitters including micro flapper, netafim, corona, axios and iran drip were test...