The Multiplication algorithm

In the multi-dimensional model of data warehouses, data drawn from multiple sources is organized into fact tables and dimension tables. Data cubes pre-compute the aggregations of measurements along combinations of dimensions to speed up the processing of Online Analytical Processing (OLAP) queries. When the underlying fact tables or dimension tables change over time, data cubes need to be incrementally maintained to reflect these changes. In this thesis, we study the problem of incrementally maintaining data cubes under slowly changing dimensions.

22p runthenight05 01-03-2023 10 3   Download

This paper introduces a novel practical variant, namely an open close multiple travelling salesmen problem with single depot (OCMTSP) that concerns the generalization of classical travelling salesman problem (TSP).

16p tohitohi 22-05-2020 26 1   Download

This paper addresses the problem of uncapacitated multiple allocation p-hub center problem (UMApHCP) which is fundamental in proper functioning of time-sensitive transportation systems. A mixed-integer programming formulation is proposed for the problem and a highly efficient Benders decomposition algorithm is developed for solving it.

10p tohitohi 22-05-2020 38 0   Download

Parallel Implementation of MAFFT on CUDA-Enabled Graphics Hardware present a new approach to accelerat- ing MAFFT on Graphics Processing Units (GPUs) using the Compute Unified Device Architecture (CUDA) programming model. Compared with the implementations of other MSA algorithms on GPUs, parallelization of MAFFT is more challenging since the space complexity.

14p ducla78 30-07-2015 48 6   Download