5,717 research outputs found
A Tutorial on Clique Problems in Communications and Signal Processing
Since its first use by Euler on the problem of the seven bridges of
K\"onigsberg, graph theory has shown excellent abilities in solving and
unveiling the properties of multiple discrete optimization problems. The study
of the structure of some integer programs reveals equivalence with graph theory
problems making a large body of the literature readily available for solving
and characterizing the complexity of these problems. This tutorial presents a
framework for utilizing a particular graph theory problem, known as the clique
problem, for solving communications and signal processing problems. In
particular, the paper aims to illustrate the structural properties of integer
programs that can be formulated as clique problems through multiple examples in
communications and signal processing. To that end, the first part of the
tutorial provides various optimal and heuristic solutions for the maximum
clique, maximum weight clique, and -clique problems. The tutorial, further,
illustrates the use of the clique formulation through numerous contemporary
examples in communications and signal processing, mainly in maximum access for
non-orthogonal multiple access networks, throughput maximization using index
and instantly decodable network coding, collision-free radio frequency
identification networks, and resource allocation in cloud-radio access
networks. Finally, the tutorial sheds light on the recent advances of such
applications, and provides technical insights on ways of dealing with mixed
discrete-continuous optimization problems
A new model for solution of complex distributed constrained problems
In this paper we describe an original computational model for solving
different types of Distributed Constraint Satisfaction Problems (DCSP). The
proposed model is called Controller-Agents for Constraints Solving (CACS). This
model is intended to be used which is an emerged field from the integration
between two paradigms of different nature: Multi-Agent Systems (MAS) and the
Constraint Satisfaction Problem paradigm (CSP) where all constraints are
treated in central manner as a black-box. This model allows grouping
constraints to form a subset that will be treated together as a local problem
inside the controller. Using this model allows also handling non-binary
constraints easily and directly so that no translating of constraints into
binary ones is needed. This paper presents the implementation outlines of a
prototype of DCSP solver, its usage methodology and overview of the CACS
application for timetabling problems
The CIAO multiparadigm compiler and system: A progress report
Abstract is not available
The CIAO Multi-Dialect Compiler and System: An Experimentation Workbench for Future (C)LP Systems
CIAO is an advanced programming environment supporting Logic and Constraint programming. It offers a simple concurrent kernel on top of which declarative and non-declarative extensions are added via librarles. Librarles are available for supporting the ISOProlog standard, several constraint domains, functional and higher order programming, concurrent and distributed programming, internet programming, and others. The source language allows declaring properties of predicates via assertions, including types and modes. Such properties are checked at compile-time or at run-time. The compiler and system architecture are designed to natively support modular global analysis, with the two objectives of proving properties in assertions and performing program optimizations, including transparently exploiting parallelism in programs. The purpose of this paper is to report on recent progress made in the context of the CIAO system, with special emphasis on the capabilities of the compiler, the techniques used for supporting such capabilities, and the results in the áreas of program analysis and transformation already obtained with the system
A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
Real world combinatorial optimization problems such as scheduling are
typically too complex to solve with exact methods. Additionally, the problems
often have to observe vaguely specified constraints of different importance,
the available data may be uncertain, and compromises between antagonistic
criteria may be necessary. We present a combination of approximate reasoning
based constraints and iterative optimization based heuristics that help to
model and solve such problems in a framework of C++ software libraries called
StarFLIP++. While initially developed to schedule continuous caster units in
steel plants, we present in this paper results from reusing the library
components in a shift scheduling system for the workforce of an industrial
production plant.Comment: 33 pages, 9 figures; for a project overview see
http://www.dbai.tuwien.ac.at/proj/StarFLIP
Trajectory Synthesis for Fisher Information Maximization
Estimation of model parameters in a dynamic system can be significantly
improved with the choice of experimental trajectory. For general, nonlinear
dynamic systems, finding globally "best" trajectories is typically not
feasible; however, given an initial estimate of the model parameters and an
initial trajectory, we present a continuous-time optimization method that
produces a locally optimal trajectory for parameter estimation in the presence
of measurement noise. The optimization algorithm is formulated to find system
trajectories that improve a norm on the Fisher information matrix. A
double-pendulum cart apparatus is used to numerically and experimentally
validate this technique. In simulation, the optimized trajectory increases the
minimum eigenvalue of the Fisher information matrix by three orders of
magnitude compared to the initial trajectory. Experimental results show that
this optimized trajectory translates to an order of magnitude improvement in
the parameter estimate error in practice.Comment: 12 page
Achievable Sum Rates of Half- and Full-Duplex Bidirectional OFDM Communication Links
While full-duplex (FD) transmission has the potential to double the system
capacity, its substantial benefit can be offset by the self-interference (SI)
and non-ideality of practical transceivers. In this paper, we investigate the
achievable sum rates (ASRs) of half-duplex (HD) and FD transmissions with
orthogonal frequency division multiplexing (OFDM), where the non-ideality is
taken into consideration. Four transmission strategies are considered, namely
HD with uniform power allocation (UPA), HD with non-UPA (NUPA), FD with UPA,
and FD with NUPA. For each of the four transmission strategies, an optimization
problem is formulated to maximize its ASR, and a (suboptimal/optimal) solution
with low complexity is accordingly derived. Performance evaluations and
comparisons are conducted for three typical channels, namely symmetric
frequency-flat/selective and asymmetric frequency-selective channels. Results
show that the proposed solutions for both HD and FD transmissions can achieve
near optimal performances. For FD transmissions, the optimal solution can be
obtained under typical conditions. In addition, several observations are made
on the ASR performances of HD and FD transmissions.Comment: To appear in IEEE TVT. This paper solves the problem of sum
achievable rate optimization of bidirectional FD OFDM link, where joint time
and power allocation is involve
- …