Artikel — Recent

Achter de ontdekking van de RSA-codes zit heel wat mooie wiskunde, voornamelijk uit de getaltheorie. De wiskundige die onbewust hebben bijgedragen tot de ontdekking van de RSA-codes zijn Eratosthenes, Euclides, Fermat, Euler, Gauss, Bezout en Bachet. De wiskundigen die de RSA-codes bewust hebben ontdekt zijn Rivest, Shamir en Adleman. In deze cursus laten we zien welke bijdrage al deze wiskundigen hebben geleverd aan de codetheorie. We leggen eveneens uit hoe het RSA-codes-mechanisme werkt en hoe deze codes worden gekraakt. De softwarepakketten die hiervoor gebruikt worden zijn Derive (voor het didactische aspect) en Sage (voor de rekenkracht en voor het programmatorisch aspect)

Testing is both technically and economically an important part of high quality software production. It has been estimated that testing accounts for half of the expenses in software production. Much of the testing is done manually or using other labor-intensive methods. It is thus vital for the software industry to develop efficient, cost effective, and automatic means and tools for software testing. Researchers have proposed several methods over years to generate automatically solution which have different drawbacks. This study examines automatic software testing optimization by using genetic algorithm approaches. This study will cover two approaches: a) obtain the sequence of regression tests that cover the greatest amount of code and b) once it is achieved another genetic algorithm will eliminate tests cases that cover the same section of code on the basis of still get the maximum code coverage. The overall aim of this research is to reduce the number of test cases that need to be run with the greatest amount of code covered.

We will form a proof of the Arzela-Ascoli Theorem through use of the Heine-Borel theorem. We will also be considering some notions of compactness on metric spaces. The Arzela-Ascoli Theorem then allows us to show compactness, letting us state and prove Peano's existence theorem, pertaining to the existence of the solutions of a type of ODE. Then we will state the Kolmogorov-Riesz compactness theorem, allowing us to show compactness in $L^p$ spaces, building from the Arzela-Ascoli Theorem.

Consideraciones mecánicas en la instalación de Sistemas Solares Fotovoltaicos

Lab 3 complexity

Deedy - One Page Two Column Resume LaTeX Template Version 1.1 (30/4/2014) Original author: Debarghya Das (http://debarghyadas.com) Original repository: https://github.com/deedydas/Deedy-Resume

Resenha para a disciplina de Filosofia da Tecnologia sobre o filme "O Congresso Futurista"

This document describes the development of a small processor done as a high school self-learning project using the Verilog programming language, a software-based simulator, and FPGA hardware. This processor was made as a learning exercise and is not necessarily efficient, reliable, or compliant with best-practices. I would like to additionally thank the many helpful members of the ##fpga channel on the Freenode IRC network for their helpful tips and expertise.

Dieses Dokument enthält Notizen aus dem Kurs Mathematik 2 des Studienbefähigungslehrgangs 2014/15 der FH Joanneum Graz.