In this work we propose a novel geometric clustering algorithm based on the Tensor Voting Framework (TVF). More precisely, we propose the construction of a weighted graph by means of the information diffused by TVF during the vote casting step. This graph, which summarizes informations related to the manifold geometric structure, was used for clustering purposes. To this aim, we applied the wel...

In this paper we introduce a new kind of flow networks, called flow graphs, different to that proposed by Ford and Fulkerson. Flow graphs are meant to be used as a mathematical tool to analysis of information flow in decision algorithms, in contrast to material flow optimization considered in classical flow network analysis. In the proposed approach branches of the flow graph are interpreted as...

Agricultural science has established a framework for biological impact assessment through past work. Various risk assessments for diverse areas of agriculture, resulted in an accumulation of considerable information. Baseline information for biological impact assessment dates from the last century (Fulkerson 1987). One type of biological impact assessment is the environmental impact assessment ...

In this project we investigate the problem of channel allocation to a set of users in a centralized Cognitive Radio System. We consider three possible formulations of the problem and explain the relationship of these constraints to physical limiting factors. In the first formulation, we aim to minimize total power used in the system while fulfilling user rate requirements. This problem can be s...

This paper expands the use of network flows to the multidimensional case, in which network flows are associated with vectors, instead of the conventionally used scalar values. A method for solving a multidimensional max-flow problem is systematically developed, on the basis of the primal-dual algorithm. It is demonstrated that upon reduction to a one-dimensional case, the method is transformed ...

A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψk(G) the minimum cardinality of a k-path vertex cover in G. In this article a lower and an upper bound for ψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2 and ψ3 are exactly de...

No part of this book may be reproduced, in any form or by any means, without permission in writing from the author. Cover picture: Three dimensional schematic representation of the steps that lead to controller design. The fish is cloned for scientific purposes only, without permission of the Dutch government.

We show that for each integer h ≥ 2, there exists a least positive integer ch so that if P is a poset having a planar cover graph and the height of P is h, then the dimension of P is at most ch. Trivially, c1 = 2. Also, Felsner, Li and Trotter showed that c2 exists and is 4, but their proof techniques do not seem to apply when h ≥ 3. We focus on establishing the existence of ch, although we sus...

We consider capacitated vertex cover with hard capacity constraints (VC-HC) on hypergraphs. In this problem we are given a hypergraph G = (V,E) with a maximum edge size f . Each edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset such that the demands of the edge...