Development of a test bench for the electronics of ionizing radiationdetectors

In the present final degree project a low cost test bench is presented. A test bench is an envi-ronment used to verify the correctness of devices. In this case, the test bench is used to test preamplifiers and digitizers of the nuclear instrumentation laboratory. These instruments are used for ionizing particle detection. The initial problematic of the project was to investigate if it was possible to do a testing working bench with a cheap digital circuit as microcontrollers. After a study of the actual market, the Arduino Due was chosen. Arduino is an open-source electronics platform based on easy-to-use hardware and software. In the initial stage of the project, the attention was focused on the documentation about the Arduino boards. It was quickly observed that the sampling time delivered by the Aduino IDE was not acceptable for a nuclear test bech. When inquiring into the technical datasheet of the Atmel SAM3X microchip, used by the Arduino Due, it was achieved making signals with sampling time acceptable for nuclear instrumentation. Once discovered the potential of Arduino Due, a GUI was made to fully customize the shape of the pulses generated by the Arduino board. Therefore, the development of a cheap testing workbench was achieved

Introductory programming: a systematic literature review

As computing becomes a mainstream discipline embedded in the school curriculum and acts as an enabler for an increasing range of academic disciplines in higher education, the literature on introductory programming is growing. Although there have been several reviews that focus on specific aspects of introductory programming, there has been no broad overview of the literature exploring recent trends across the breadth of introductory programming. This paper is the report of an ITiCSE working group that conducted a systematic review in order to gain an overview of the introductory programming literature. Partitioning the literature into papers addressing the student, teaching, the curriculum, and assessment, we explore trends, highlight advances in knowledge over the past 15 years, and indicate possible directions for future research

A checklist for choosing between R packages in ecology and evolution

The open source and free programming language R is a phenomenal mechanism to address a multiplicity of challenges in ecology and evolution. It is also a complex ecosystem because of the diversity of solutions available to the analyst. Packages for R enhance and specialize the capacity to explore both niche data/experiments and more common needs. However, the paradox of choice or how we select between many seemingly similar options can be overwhelming and lead to different potential outcomes. There is extensive choice in ecology and evolution between packages for both fundamental statistics and for more specialized domain‐level analyses. Here, we provide a checklist to inform these decisions based on the principles of resilience, need, and integration with scientific workflows for evidence. It is important to explore choices in any analytical coding environment—not just R—for solutions to challenges in ecology and evolution, and document this process because it advances reproducible science, promotes a deeper understand of the scientific evidence, and ensures that the outcomes are correct, representative, and robust.York University Librarie

Programming GPUs with CUDA

El documento contiene el material de un tutorial impartido en el congreso. No es una artículo científico en formato tradicional.Analizamos las prestaciones y características de las distintas generaciones de procesadores gráficos desarrollados por Nvidia para la programación de aplicaciones de propósito general bajo CUDA, un paradigma nuevo que aporta en la vertiente hardware y software de forma simultánea.Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tec

Programming Quantum Computers Using Design Automation

Recent developments in quantum hardware indicate that systems featuring more than 50 physical qubits are within reach. At this scale, classical simulation will no longer be feasible and there is a possibility that such quantum devices may outperform even classical supercomputers at certain tasks. With the rapid growth of qubit numbers and coherence times comes the increasingly difficult challenge of quantum program compilation. This entails the translation of a high-level description of a quantum algorithm to hardware-specific low-level operations which can be carried out by the quantum device. Some parts of the calculation may still be performed manually due to the lack of efficient methods. This, in turn, may lead to a design gap, which will prevent the programming of a quantum computer. In this paper, we discuss the challenges in fully-automatic quantum compilation. We motivate directions for future research to tackle these challenges. Yet, with the algorithms and approaches that exist today, we demonstrate how to automatically perform the quantum programming flow from algorithm to a physical quantum computer for a simple algorithmic benchmark, namely the hidden shift problem. We present and use two tool flows which invoke RevKit. One which is based on ProjectQ and which targets the IBM Quantum Experience or a local simulator, and one which is based on Microsoft's quantum programming language Q$\#$.Comment: 10 pages, 10 figures. To appear in: Proceedings of Design, Automation and Test in Europe (DATE 2018

Trace checking of Metric Temporal Logic with Aggregating Modalities using MapReduce

Modern complex software systems produce a large amount of execution data, often stored in logs. These logs can be analyzed using trace checking techniques to check whether the system complies with its requirements specifications. Often these specifications express quantitative properties of the system, which include timing constraints as well as higher-level constraints on the occurrences of significant events, expressed using aggregate operators. In this paper we present an algorithm that exploits the MapReduce programming model to check specifications expressed in a metric temporal logic with aggregating modalities, over large execution traces. The algorithm exploits the structure of the formula to parallelize the evaluation, with a significant gain in time. We report on the assessment of the implementation - based on the Hadoop framework - of the proposed algorithm and comment on its scalability.Comment: 16 pages, 6 figures, Extended version of the SEFM 2014 pape