Few neurological disorders have been more successful in introducing novel therapies than Parkinson disease (PD). However, despite enormous progress, many challenges remain. Although levodopa is still the most effective drug in the symptomatic treatment of PD, adverse effects, particularly motor fluctuations and dyskinesias, limit its usefulness. Furthermore, there is a growing concern about the...

In this paper we propose a context-specific cost allocation rule for inventory transportation systems. We consider the setting defined in Fiestras-Janeiro et al. (2012) [3] and propose a new cost allocation rule, the so-called AMEF value, which is inspired by the Shapley value. We prove that, under suitable conditions, the AMEF value provides core allocations. Besides, we provide a characteriza...

Sparse matrix-vector multiplication (SpMV) represents the dominant cost in sparse linear algebra. However, sparse matrices exhibit inherent irregularity in both amount and distribution of none-zero values. This harnessed the tremendous potential of Single Instruction Multiple Data (SIMD) architectures, which is widely adopted in nowadays data-parallel processors. To improve the performance of S...

We investigate the usage of Ant Colony Optimization to detect balanced graph cuts. In order to do so we develop an algorithm based on competing ant colonies. We use a heuristic from social network analysis called the edge clustering coefficient, which greatly helps our colonies in local search. The algorithm is able to detect cuts that correspond very well to known cuts on small real-world netw...

Load balancing algorithms improve a program's performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-e ective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon...