Justificando la justificación de la inducción de Salmon

En este trabajo pretendo mostrar cómo la propuesta de Salmon referente a la paradoja de Goodman se inserta dentro de una solución al enigma de la inducción que quiero defender. Para llevarlo a cabo, en primer lugar resumiré la paradoja de Goodman y el intento de solución de Salmon y explicaré por qué, como parece, la propuesta de Salmon no cumple su tarea. A continuación, expondré una consideración general sobre qué tipo de problema es realmente la paradoja de Goodman y qué tenemos que hacer para solucionarla. Finalmente, presentaré lo que considero que tiene que ser por lo menos parte de una solución al enigma de la inducción.In this article I strive to show how Salmon's proposal about Goodman's paradox fits within a solution to the enigma of induction that I wish to defend. To accomplish this, I shall first summarise Goodman's paradox and Salmon's attempt to solve it, and I will explain why Salmon's proposal does not seem to fulfil its mission. Then I shall elaborate on a general consideration about what type of problem Goodman's paradox really is and what we have to do to solve it. Finally, I shall present what I believe must be at least part of the solution to the enigma of induction

Performance Engineering for Real and Complex Tall & Skinny Matrix Multiplication Kernels on GPUs

General matrix-matrix multiplications with double-precision real and complex entries (DGEMM and ZGEMM) in vendor-supplied BLAS libraries are best optimized for square matrices but often show bad performance for tall & skinny matrices, which are much taller than wide. NVIDIA's current CUBLAS implementation delivers only a fraction of the potential performance as indicated by the roofline model in this case. We describe the challenges and key characteristics of an implementation that can achieve close to optimal performance. We further evaluate different strategies of parallelization and thread distribution, and devise a flexible, configurable mapping scheme. To ensure flexibility and allow for highly tailored implementations we use code generation combined with autotuning. For a large range of matrix sizes in the domain of interest we achieve at least 2/3 of the roofline performance and often substantially outperform state-of-the art CUBLAS results on an NVIDIA Volta GPGPU.Comment: 12 pages, 22 figures. Extended version of arXiv:1905.03136v1 for journal submissio

Towards automation of user interface design

This paper suggests an approach to automatic software design in the domain of graphical user interfaces. There are still some drawbacks in existing user interface management systems (UIMS's) which basically offer only quantitative layout specifications via direct manipulation. Our approach suggests a convenient way to get a default graphical user interface which may be customized and redesigned easily in further prototyping cycles