114,189 research outputs found
Computing Bounds on Network Capacity Regions as a Polytope Reconstruction Problem
We define a notion of network capacity region of networks that generalizes
the notion of network capacity defined by Cannons et al. and prove its notable
properties such as closedness, boundedness and convexity when the finite field
is fixed. We show that the network routing capacity region is a computable
rational polytope and provide exact algorithms and approximation heuristics for
computing the region. We define the semi-network linear coding capacity region,
with respect to a fixed finite field, that inner bounds the corresponding
network linear coding capacity region, show that it is a computable rational
polytope, and provide exact algorithms and approximation heuristics. We show
connections between computing these regions and a polytope reconstruction
problem and some combinatorial optimization problems, such as the minimum cost
directed Steiner tree problem. We provide an example to illustrate our results.
The algorithms are not necessarily polynomial-time.Comment: Appeared in the 2011 IEEE International Symposium on Information
Theory, 5 pages, 1 figur
Geometric Properties of Isostables and Basins of Attraction of Monotone Systems
In this paper, we study geometric properties of basins of attraction of
monotone systems. Our results are based on a combination of monotone systems
theory and spectral operator theory. We exploit the framework of the Koopman
operator, which provides a linear infinite-dimensional description of nonlinear
dynamical systems and spectral operator-theoretic notions such as eigenvalues
and eigenfunctions. The sublevel sets of the dominant eigenfunction form a
family of nested forward-invariant sets and the basin of attraction is the
largest of these sets. The boundaries of these sets, called isostables, allow
studying temporal properties of the system. Our first observation is that the
dominant eigenfunction is increasing in every variable in the case of monotone
systems. This is a strong geometric property which simplifies the computation
of isostables. We also show how variations in basins of attraction can be
bounded under parametric uncertainty in the vector field of monotone systems.
Finally, we study the properties of the parameter set for which a monotone
system is multistable. Our results are illustrated on several systems of two to
four dimensions.Comment: 12 pages, to appear in IEEE Transaction on Automatic Contro
Area-Universal Rectangular Layouts
A rectangular layout is a partition of a rectangle into a finite set of
interior-disjoint rectangles. Rectangular layouts appear in various
applications: as rectangular cartograms in cartography, as floorplans in
building architecture and VLSI design, and as graph drawings. Often areas are
associated with the rectangles of a rectangular layout and it might hence be
desirable if one rectangular layout can represent several area assignments. A
layout is area-universal if any assignment of areas to rectangles can be
realized by a combinatorially equivalent rectangular layout. We identify a
simple necessary and sufficient condition for a rectangular layout to be
area-universal: a rectangular layout is area-universal if and only if it is
one-sided. More generally, given any rectangular layout L and any assignment of
areas to its regions, we show that there can be at most one layout (up to
horizontal and vertical scaling) which is combinatorially equivalent to L and
achieves a given area assignment. We also investigate similar questions for
perimeter assignments. The adjacency requirements for the rectangles of a
rectangular layout can be specified in various ways, most commonly via the dual
graph of the layout. We show how to find an area-universal layout for a given
set of adjacency requirements whenever such a layout exists.Comment: 19 pages, 16 figure
Optimisation of Mobile Communication Networks - OMCO NET
The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University.
The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing
- …