Recent history of fractional calculus

This survey intends to report some of the major documents and events in the area of fractional calculus that took place since 1974 up to the present date

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008

How Fast Can We Play Tetris Greedily With Rectangular Pieces?

Consider a variant of Tetris played on a board of width $w$ and infinite height, where the pieces are axis-aligned rectangles of arbitrary integer dimensions, the pieces can only be moved before letting them drop, and a row does not disappear once it is full. Suppose we want to follow a greedy strategy: let each rectangle fall where it will end up the lowest given the current state of the board. To do so, we want a data structure which can always suggest a greedy move. In other words, we want a data structure which maintains a set of $O(n)$ rectangles, supports queries which return where to drop the rectangle, and updates which insert a rectangle dropped at a certain position and return the height of the highest point in the updated set of rectangles. We show via a reduction to the Multiphase problem [P\u{a}tra\c{s}cu, 2010] that on a board of width $w=\Theta(n)$, if the OMv conjecture [Henzinger et al., 2015] is true, then both operations cannot be supported in time $O(n^{1/2-\epsilon})$ simultaneously. The reduction also implies polynomial bounds from the 3-SUM conjecture and the APSP conjecture. On the other hand, we show that there is a data structure supporting both operations in $O(n^{1/2}\log^{3/2}n)$ time on boards of width $n^{O(1)}$, matching the lower bound up to a $n^{o(1)}$ factor.Comment: Correction of typos and other minor correction

Towards an Accessible Personal Health Record

Patient empowerment frameworks, including personal health records (PHR), actively engage technology empowered citizens in their healthcare. Particularly today, with the current increase of chronic diseases, the high growth rate of the elderly and disabled populations and at the same time the much higher cross-border patient mobility,such systems may prove to be lifesaving, cost effective and time saving. Currently, there are many different online applications promoted as being functional, user-friendly and detailed enough to provide a complete and accurate summary of an individual’s medical history. However, it seems that most of the Web services available do not fully adhere to well known accessibility standards, such as those promoted by the W3C, thus turning them away from people with disability and elderly people, who most probably need them most. Additionally, support for mobile devices introduces additional obstacles to users with disability when trying to operate such services. This paper presents fundamental (design for all) guidelines for the successful implementation of an accessible ePHR service that can be operated by any patient including people with disabilities irrespective of the device they use to access this service

Redes inalámbricas y protocolos para comunicación de datos en aplicaciones de instrumentación y control

Los Sistemas de Instrumentación y Control basados en red (NCS: Networked Control Systems) disponen de un controlador que interactúa con los instrumentos, sensores y actuadores por medio de una red de comunicaciones. Por las ventajas inherentes, existe un creciente interés en utilizar redes inalámbricas como base para la implementación de NCS, a pesar de que estas redes introducen latencias de transmisión impredecibles y una potencial pérdida de paquetes, que tienden a degradar la performance del sistema de control. En el marco de este proyecto se propone modelar, ensayar, simular y plantear esquemas experimentales en el nivel de Control de Acceso al Medio (MAC) inalámbrico, para que, en función de las condiciones particulares y restricciones impuestas por el entorno de operación (restricciones temporales, calidad de servicio, robustez, etc.) se puedan mejorar determinados aspectos de su desempeño tales como factor de utilización, retardo, jitter, pérdida de paquetes, tasa de transferencia, etc., que impactan sobre el desempeño de los NCS.Eje: Arquitectura, Redes y Sistemas OperativosRed de Universidades con Carreras en Informática (RedUNCI

Redes inalámbricas y protocolos para comunicación de datos en aplicaciones de instrumentación y control

Los Sistemas de Instrumentación y Control basados en red (NCS: Networked Control Systems) disponen de un controlador que interactúa con los instrumentos, sensores y actuadores por medio de una red de comunicaciones. Por las ventajas inherentes, existe un creciente interés en utilizar redes inalámbricas como base para la implementación de NCS, a pesar de que estas redes introducen latencias de transmisión impredecibles y una potencial pérdida de paquetes, que tienden a degradar la performance del sistema de control. En el marco de este proyecto se propone modelar, ensayar, simular y plantear esquemas experimentales en el nivel de Control de Acceso al Medio (MAC) inalámbrico, para que, en función de las condiciones particulares y restricciones impuestas por el entorno de operación (restricciones temporales, calidad de servicio, robustez, etc.) se puedan mejorar determinados aspectos de su desempeño tales como factor de utilización, retardo, jitter, pérdida de paquetes, tasa de transferencia, etc., que impactan sobre el desempeño de los NCS.Eje: Arquitectura, Redes y Sistemas OperativosRed de Universidades con Carreras en Informática (RedUNCI

Fast, Interactive Worst-Case Execution Time Analysis With Back-Annotation

Abstract—For hard real-time systems, static code analysis is needed to derive a safe bound on the worst-case execution time (WCET). Virtually all prior work has focused on the accuracy of WCET analysis without regard to the speed of analysis. The resulting algorithms are often too slow to be integrated into the development cycle, requiring WCET analysis to be postponed until a final verification phase. In this paper we propose interactive WCET analysis as a new method to provide near-instantaneous WCET feedback to the developer during software programming. We show that interactive WCET analysis is feasible using tree-based WCET calculation. The feedback is realized with a plugin for the Java editor jEdit, where the WCET values are back-annotated to the Java source at the statement level. Comparison of this treebased approach with the implicit path enumeration technique (IPET) shows that tree-based analysis scales better with respect to program size and gives similar WCET values. Index Terms—Real time systems, performance analysis, software performance, software reliability, software algorithms, safety I