Maximum st-flow in directed planar graphs via shortest paths

Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on a common face. In this paper, we give a correspondence between maximum flows and shortest paths via duality in directed planar graphs with no constraints on the source and sink. We believe this a promising avenue for developing algorithms that are more practical than the current asymptotically best algorithms for maximum st-flow.Comment: 20 pages, 4 figures. Short version to be published in proceedings of IWOCA'1

Capacitated max-Batching with Interval Graph Compatibilities

We consider the problem of partitioning interval graphs into cliques of bounded size. Each interval has a weight, and the cost of a clique is the maximum weight of any interval in the clique. This natural graph problem can be interpreted as a batch scheduling problem. Solving an open question from [7, 4, 5], we show NP-hardness, even if the bound on the clique sizes is constant. Moreover, we give a PTAS based on a novel dynamic programming technique for this case.

Scheduling data flow program in xkaapi: A new affinity based Algorithm for Heterogeneous Architectures

Efficient implementations of parallel applications on heterogeneous hybrid architectures require a careful balance between computations and communications with accelerator devices. Even if most of the communication time can be overlapped by computations, it is essential to reduce the total volume of communicated data. The literature therefore abounds with ad-hoc methods to reach that balance, but that are architecture and application dependent. We propose here a generic mechanism to automatically optimize the scheduling between CPUs and GPUs, and compare two strategies within this mechanism: the classical Heterogeneous Earliest Finish Time (HEFT) algorithm and our new, parametrized, Distributed Affinity Dual Approximation algorithm (DADA), which consists in grouping the tasks by affinity before running a fast dual approximation. We ran experiments on a heterogeneous parallel machine with six CPU cores and eight NVIDIA Fermi GPUs. Three standard dense linear algebra kernels from the PLASMA library have been ported on top of the Xkaapi runtime. We report their performances. It results that HEFT and DADA perform well for various experimental conditions, but that DADA performs better for larger systems and number of GPUs, and, in most cases, generates much lower data transfers than HEFT to achieve the same performance

Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems

Packing and vehicle routing problems play an important role in the area of supply chain management. In this paper, we introduce a non-linear knapsack problem that occurs when packing items along a fixed route and taking into account travel time. We investigate constrained and unconstrained versions of the problem and show that both are NP-hard. In order to solve the problems, we provide a pre-processing scheme as well as exact and approximate mixed integer programming (MIP) solutions. Our experimental results show the effectiveness of the MIP solutions and in particular point out that the approximate MIP approach often leads to near optimal results within far less computation time than the exact approach

Healthcare Game Design: Behavioral Modeling of Serious Gaming Design for Children with Chronic Diseases

This article introduces the design principles of serious games for chronic patients based on behavioral models. First, key features of the targeted chronic condition (Diabetes) are explained. Then, the role of psychological behavioral models in the management of chronic conditions is covered. After a short review of the existing health focused games, two recent health games that are developed based on behavioral models are overviewed in more detail. Furthermore, design principles and usability issues regarding the creation of these health games are discussed. Finally, the authors conclude that designing healthcare games based on behavioral models can increase the usability of the game in order to improve the effectiveness of the game’s desired healthcare outcomes

Approximation Algorithms for Covering/Packing Integer Programs

Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min {c.x: x in Z^n_+, Ax > a, Bx < b, x < d}. We give a bicriteria-approximation algorithm that, given epsilon in (0, 1], finds a solution of cost O(ln(m)/epsilon^2) times optimal, meeting the covering constraints (Ax > a) and multiplicity constraints (x < d), and satisfying Bx < (1 + epsilon)b + beta, where beta is the vector of row sums beta_i = sum_j B_ij. Here m denotes the number of rows of A. This gives an O(ln m)-approximation algorithm for CIP -- minimum-cost covering integer programs with multiplicity constraints, i.e., the special case when there are no packing constraints Bx < b. The previous best approximation ratio has been O(ln(max_j sum_i A_ij)) since 1982. CIP contains the set cover problem as a special case, so O(ln m)-approximation is the best possible unless P=NP.Comment: Preliminary version appeared in IEEE Symposium on Foundations of Computer Science (2001). To appear in Journal of Computer and System Science

Establishment of a validation and benchmark database for the assessment of ship operation in adverse conditions

The Energy Efficiency Design Index (EEDI), introduced by the IMO [1] is applicable for various types of new-built ships since January 2013. Despite the release of an interim guideline [2], concerns regarding the sufficiency of propulsion power and steering devices to maintain manoeuvrability of ships in adverse conditions were raised. This was the motivation for the EU research project SHOPERA (Energy Efficient Safe SHip OPERAtion, 2013-2016 [3-6]). The aim of the project is the development of suitable methods, tools and guidelines to effectively address these concerns and to enable safe and green shipping. Within the framework of SHOPERA, a comprehensive test program consisting of more than 1,300 different model tests for three ship hulls of different geometry and hydrodynamic characteristics has been conducted by four of the leading European maritime experimental research institutes: MARINTEK, CEHIPAR, Flanders Hydraulics Research and Technische Universität Berlin. The hull types encompass two public domain designs, namely the KVLCC2 tanker (KRISO VLCC, developed by KRISO) and the DTC container ship (Duisburg Test Case, developed by Universität Duisburg-Essen) as well as a RoPax ferry design, which is a proprietary hull design of a member of the SHOPERA consortium. The tests have been distributed among the four research institutes to benefit from the unique possibilities of each facility and to gain added value by establishing data sets for the same hull model and test type at different under keel clearances (ukc). This publication presents the scope of the SHOPERA model test program for the two public domain hull models – the KVLCC2 and the DTC. The main particulars and loading conditions for the two vessels as well as the experimental setup is provided to support the interpretation of the examples of experimental data that are discussed. The focus lies on added resistance at moderate speed and drift force tests in high and steep regular head, following and oblique waves. These climates have been selected to check the applicability of numerical models in adverse wave conditions and to cover possible non-linear effects. The obtained test results with the KVLCC2 model in deep water at CEHIPAR are discussed and compared against the results obtained in shallow water at Flanders Hydraulics Research. The DTC model has been tested at MARINTEK in deep water and at Technische Universität Berlin and Flanders Hydraulics Research in intermediate/shallow water in different set-ups. Added resistance and drift force measurements from these facilities are discussed and compared. Examples of experimental data is also presented for manoeuvring in waves. At MARINTEK, turning circle and zig-zag tests have been performed with the DTC in regular waves. Parameters of variation are the initial heading, the wave period and height

Capacitated Center Problems with Two-Sided Bounds and Outliers

In recent years, the capacitated center problems have attracted a lot of research interest. Given a set of vertices $V$, we want to find a subset of vertices $S$, called centers, such that the maximum cluster radius is minimized. Moreover, each center in $S$ should satisfy some capacity constraint, which could be an upper or lower bound on the number of vertices it can serve. Capacitated $k$-center problems with one-sided bounds (upper or lower) have been well studied in previous work, and a constant factor approximation was obtained. We are the first to study the capacitated center problem with both capacity lower and upper bounds (with or without outliers). We assume each vertex has a uniform lower bound and a non-uniform upper bound. For the case of opening exactly $k$ centers, we note that a generalization of a recent LP approach can achieve constant factor approximation algorithms for our problems. Our main contribution is a simple combinatorial algorithm for the case where there is no cardinality constraint on the number of open centers. Our combinatorial algorithm is simpler and achieves better constant approximation factor compared to the LP approach