%   Title:  bakkarbeit_jrocnik.tex

%   Author: Jan Rocnik

%   (c) copyright due to lincense terms.

%2345678901234567890123456789012345678901234567890123456789012345678901234567890

%       10        20        30        40        50        60        70        80

%TODO:

%%\cite{proakis2004contemporary}

%%

%%patch:

%%structur:    theory part                     ersetzt   project undamentals

%%						 "mechanization of math in isac" ersetzt   introduction

%%             authoring math in isac          ersetzt   mechanization

%define document class

\documentclass[a4paper, 12pt]{article}

%packages for language and input

\usepackage[english]{babel} 

\usepackage[T1]{fontenc}

\usepackage[latin1]{inputenc}

%generel packages

\usepackage{url}

\usepackage{endnotes}

\usepackage{trfsigns}

\usepackage{setspace}

\usepackage[pdfpagelabels]{hyperref}

\usepackage{longtable}

\usepackage{float} %For restylefloat

\newfloat{example}{h}{} %self made floats

\floatname{example}{Example} %name for float

\restylefloat{table} %float tables

\floatstyle{ruled} %boxes around floats

\restylefloat{example} %float examples --> boxes

%colors and graphics

\usepackage{graphicx}

\usepackage{color}

\definecolor{lgray}{RGB}{238,238,238}

%isabelle relevant packages

\usepackage{isabelle,isabellesym}

%define isac logos

\def\isac{${\cal I}\mkern-2mu{\cal S}\mkern-5mu{\cal AC}$}

\def\sisac{\footnotesize${\cal I}\mkern-2mu{\cal S}\mkern-5mu{\cal AC}$}

\newcommand{\HRule}{\rule{\linewidth}{0.2mm}}

%----------// BEGIN DOCUMENT \\----------%

\begin{document}

%----------// TITLE PAGE \\----------%

\input{./bakkarbeit_titlepage.tex}

\cleardoublepage

%----------// EMPTY PAGE \\----------%

%todo

%----------// THANKS \\----------%

\setcounter{page}{2}

\begin{center}

	Special Thanks to\\

	\hfill \\

	\emph{Dr.techn. Walther Neuper}\\

	\emph{Dipl.-Ing. Bernhard Geiger}

\end{center}

\thispagestyle{empty}

\cleardoublepage

%----------// EMPTY PAGE \\----------%

%todo

%----------// ABSTRACT \\----------%

\begin{abstract}

The Baccalaureate Thesis creates interactive course material for Signal Processing (SP) based on the experimental educational math assistant Isabelle/{\sisac} ({\em Isa}belle for Transparent {\em C}alculations in Applied Mathematics).

\par The content of the course material is defined together with the Signal Processing and Speech Communication Laboratory (SPSC Lab) of Graz University of Technology (TUG). The content is planned to be used in specific lectures and labs of the SPSC and thus is thoroughly concerned with underlying mathematical and physical theory.

One challenge of this thesis is, that much theory required for SPSC is not yet mechanized in Computer Theorem Provers (CTP); so this thesis will provide preliminary definitions  and theorems (without proofs~!) implemented in Isabelle \emph{theories}.

\par Another callenge is the implementation of interactive courses: this is done within the educational math assistant Isabelle/{\sisac}, which is under development at TU Graz. The present state of {\sisac{}} happens to provide the {\em first} occasion for authoring by a non-member of the {\sisac}-developer team. So this challenge involves  alpha-testing of the underlying \emph{CTP-based programming language}, because error messages are still not user-friendly and need frequent contact with {\sisac}-developers.

So the practical outcome of this thesis is twofold:

\begin{enumerate}

\item Interactive course material hopefully useful in education within the SPSC Lab and within STEOP, the introductory orientation phase at TUG, as a preview for students in Telematics on later application of math knowledge introduced in the first semester and

\item A detailed description of technicalities in programming implemented as an interactive Isabelle/Isar theory, providing future programmers with guidelines and {\sisac}-developers with feedback in usability of the CTP-based program language. 

\end{enumerate}

\end{abstract}

\clearpage

%----------// T O C \\----------%

\pagenumbering{Roman}

%This thesis is structured into a fundamental part introducing the motivation, the basic notions concerning the thesis aswell as the {\sisac{}} project and describing the mathematic base. Further a automatically generated practical part representing the work on {\sisac{}} which can be extended.

\tableofcontents

\clearpage

\pagenumbering{arabic}

\setcounter{page}{6}

%----------// PART-1 \\----------%

\part{Project Fundamentals}

%The goals of the thesis are finally defined in section \ref{sec:goals} which seems to be very late. The reason for this fact is that there has a lot of research to be done prior and a lot of this research has to be described in this thesis before we are able to define the proper goals. All this is neccessary for understanding the effort on this work. 

\section{Introduction}

%The motivation to this thesis mainly takes it source from the feeling of understanding difficult signal processing tasks and the will to help others to get this feeling to.

%\par Signal Processing (SP) requieres a huge range of mathematic knowledge as well as a feeling for simplification and number tricks but even though this fact, the operations themself are no higher ones. The main task is to understand. Aside this description we think of the classic math ideas and techniques, consisting of predefined formulas, notations and forumularsations we learn.

%

Didactics of mathematics faces a specific issue, a gap between (1) introduction of math concepts and skills and (2) application of these concepts and skills, which ususally are separated into different units in curricula (for good reasons). For instance, (1) teaching partial fraction decomposition is separated from (2) application for inverse Z-transform in signal processing.

This gap is an obstacle for applying math as an foundamental thinking technology in engineering: In (1) motivation is lacking because the question ``What is this stuff good for~?'' cannot be treated sufficiently, and in (2) the ``stuff'' is not available to students in higher semesters as widespread experience shows.

\medskip

Motivated by this didactical issue on the one hand, and ongoing R\&D on a novel kind of educational mathematics assistant at Graz University of Technology~\footnote{http://www.ist.tugraz.at/isac/} promising to cope with this issue on the other hand, several institutes are planning to join their expertise: the Institutes for Institute for Information Systems and Computer Media (IICM), the Institute for Software Technology (IST), the Institutes for Mathematics, the Signal Processing and Speech Communication Laboratory (SPSC Lab), the Institute for Structural Analysis and the Institute of Electrical Measurement and Measurement Signal Processing.

This thesis is the first attempt to tackle the above mentioned issue, it focuses on Telematics, because these specific studies focus on mathematics in STEOP, the introductory orientation phase. STEOP is considered an opportunity to investigate the impact of {\sisac}'s prototype on the issue and others.

\medskip

The thesis is structured as follows: Part I concerns theory, part II the implementation work, where the latter is the main part.

In part I, \S\ref{isabisac} gives a brief description of the state-of-the-art for educational math assistants (\S\ref{emas}) and introduces the notions required for the implementation work (\S\ref{math-auth}). In particular, \S\ref{user-guid} explains, why math authoring in \sisac{} is {\em not} concerned with interaction (and thus not with user guidance etc at all~!). So a concise description of the thesis' goals needs to be postponed to \S\ref{sec:goals}.

\S\ref{sp} analyzes ten (TODO: exact no?) problems defined by the SPSC Lab for the knowledge already provided (\S\ref{know-isab}, \S\ref{know-isac}), discusses the selection of problems for implementation (\S\ref{know-missing}) TODO: further structure ?

%(\S\ref{})

\section{Mechanization of Math in Isabelle/{\isac}}\label{isabisac}

%A problem behind is the mechanization of mathematic theories in CTP-bases languages. There is still a hugh gap between these theories and this what we call an applications - in Example Signal Processing. 

%\begin{example}

%	\[

%		X\cdot(a+b)+Y\cdot(c+d)=aX+bX+cY+dY

%  \]

%	{\small\textit{

%		\noindent A very simple example on this what we call gap is the simplification above. It is needles to say that it is correct and also isabell forfills it correct - \emph{always}. But sometimes we don't want do simplificate these things, sometimes it is easyer for handling and understanding if we keep terms together. Think of a problem were we now would need only the coefficients of $X$ and $Y$. This is what we call the gap between applications and theorem proofment.

%	}}

%	\caption{Correct but not usefull}\label{eg:gap}

%\end{example}

%Until we are not able to fill this gap we have to live with it but first have a look on the meaning of this statement:

%\par Mechanized math starts from mathematical models and \emph{hopefully} proceeds to match physics. Academic engineering starts from physics (experimentation, measurement) and then proceeds to mathematical modelling and formalization. The process from a physical observance to a mathematical theory is unavoidable bound of setting up a big collection of standards, rules, definition but also exceptions. These are the things making mechanization that difficult.

%\begin{example}

%	\[

%		m,\ kg,\ s,\ldots

%  \]

%	{\small\textit{

%		\noindent Think about some units like that one's above. Behind each unit there is a discerning and very accurate definition: One Meter is the distance the light travels, in a vacuum, through the time of 1 / 299.792.458 second; one kilogramm is the weight of a platinum-iridium cylindar in paris; and so on. But are these definitions useable in a computer mechanized world?!

%	}}

%	\caption{Units in measurement}\label{eg:units}

%\end{example}

%\par A computer or a CTP-System builds on programms witth predefined logical ruels and does not know any mathematical trick (follow up example \ref{eg:trick}) or recipe to walk around difficult expressions. 

%\begin{example}

%\[ \frac{1}{j\omega}\cdot\left(e^{-j\omega}-e^{j3\omega}\right)= \]

%\[ \frac{1}{j\omega}\cdot e^{-j2\omega}\cdot\left(e^{j\omega}-e^{-j\omega}\right)=

%	 \frac{1}{\omega}\, e^{-j2\omega}\cdot\colorbox{lgray}{$\frac{1}{j}\,\left(e^{j\omega}-e^{-j\omega}\right)$}= \]

%\[ \frac{1}{\omega}\, e^{-j2\omega}\cdot\colorbox{lgray}{$2\, sin(\omega)$} \]

%	{\small\textit{

%		\noindent Sometimes it is also usefull to be able to apply some \emph{tricks} to get a beautiful and particulary meaningful result, which we are able to interpret. But as seen in this example it can be hard to find out what operations have to be done to transform a result into a meaningful one.

%	}}

%	\caption{Mathematic tricks}\label{eg:trick}

%\end{example}

%For such a system the only possibility is to work through its known definitions and stops if none of these fits. Specified on Signal Processing or any other application it is often possible to walk through by doing simple creases. This creases are in generell based on simple math operatiopms but the challange is to teach the machine \emph{all}\footnote{Its pride to call it \emph{all}.} of them. Unfortunataly the goal of CTP Isabelle is to reach a high level of \emph{all} but it in real it will still be a survey of knowledge which links to other knowledge and {\sisac{}} a trainer and helper but no human compensating calulator. 

%\par {\sisac{}} itselfs aims to adds an \emph{application} axis (formal specifications of problems outof topics from Signal Processing, etc.) and an \emph{algorithmic} axis to the \emph{deductive} axis of physical knowledge. The result is a three-dimensional universe of mathematics.

%

%\subsubsection*{Notes on Mechanization of Mathematics}

%This thesis tries to \emph{connect} these two worlds and is one of the first guidelines to implement problem classes in {\sisac}. As we are still in a eary part of development, this is the first thesis dealing within this topic and there is \emph{no} related work to guid through. A more detailed description about this fact can be found in Section \ref{sec:related}.

%The major challenge of the practical part, of this thesis, is, that "connecting the two worlds" involves programming in a CTP-based programming language which is in a very early state of prototyping. There is no concrete experience data ready to grep.

%

As mentioned in the introduction, a prototype of an educational math assistant called \sisac\footnote{\sisac=\textbf{Isa}belle \cite{Nipkow-Paulson-Wenzel:2002} for \textbf{C}alculations, see http://www.ist.tugraz.at/isac/.} bridges the gap between (1) introducation and (2) application of mathematics: {\sisac} is based on Computer Theorem Proving (CTP), a technology which requires each fact and each action justified by formal logic, so \sisac{} makes justifications transparent to students in interactive step-wise problem solving. By that way {\sisac} already can serve both:

\begin{enumerate}

\item Introduction of math stuff (e.g. partial fraction decomposition) by stepwise explaining and exercising respective symbolic calculations with ``next step guidance (NSG)'' and rigorously checking steps freely input by students  --- this also in context with advanced applications (where the stuff to be taught in higher semesters can be skimmed through by NSG), and

\item Application of math stuff in advanced engineering courses (e.g. problems to be solved by inverse Z-transform in a Signal Processing Lab) --- and now without much ado about basic math techniques (like partical fraction decomposition): ``next step guidance'' supports students in independenly (re-)adopting such techniques.

\end{enumerate}

Before the question is answers, how {\sisac} accoplishes this task from a technical point of view, some remarks on the state-of-the-art is given:

\subsection{Educational Mathematics Assistants (EMAs)}\label{emas}

Educational software in mathematics is, if at all, based on Computer Algebra Systems (CAS, for instance \cite{progr-mathematica,prog-maple06}), Dynamic Geometry Systems (DGS, for instance \footnote{GeoGebra http://www.geogebra.org, Cinderella http://www.cinderella.de/, GCLC http://poincare.matf.bg.ac.rs/~janicic/gclc/}) or spread-sheets. These base technologies are used to program math lessons and sometimes even exercises. The latter are cumbersome: the steps towards a solution of such an interactive exercise need to be provided with feedback, where at each step a wide variety of possible input has to be foreseen by the programmer --- so such interactive exercises either require high development efforts or the exercises constrain possible inputs.

A new generation of educational math assistants (EMAs) is emerging presently, which is based on Computer Theorem Proving (CTP). CTP, for instance Isabelle \cite{Nipkow-Paulson-Wenzel:2002} and Coq \cite{Huet_all:94}, is a technology which requires each fact and each action justified by formal logic. Pushed by demands for \textit{proven} correctness of safety-critical software CTP advances into software engineering; from these advancements computer mathematics benefits in general, and math education in particular. Two features of CTP are immediately beneficial for learning:

\paragraph{CTP have knowledge in human readable format,} that is in standard predicate calculus. CTP following the LCF-tradition have that knowledge down to the basic definitions of set, equality, etc~\footnote{http://isabelle.in.tum.de/dist/library/HOL/HOL.html}; following the typical deductive development of math, natural numbers are defined and their properties proven~\footnote{http://isabelle.in.tum.de/dist/library/HOL/Number_Theory/Primes.html}, etc. Present knowledge mechanized in CTP exceeds high-school mathematics by far, however by knowledge required in software technology, and not in other engineering sciences.

\paragraph{CTP can model the whole problem solving process} in mathematical problem solving {\em within} a coherent logical framework. This is already being done by three projects, by Ralph-Johan Back \cite{Back-SD09}, by ActiveMath \cite{ActiveMath-MAIN11} and by Carnegie Mellon Tutor \cite{mat-tutor-cmu-MAIN11}.

Having the whole problem solving process within a logical coherent system, such a design guarantees correctness of intermediate steps and of the result (which seems essential for math software); and the second advantage is that CTP provides a wealth of theories which can be exploited for mechanizing other features essential for educational software.

\subsection{Generation of User Guidance in EMAs}\label{user-guid}

One essential feature for educational software is feedback to user input and assistance in coming to a solution.

\paragraph{Checking user input} by ATP during stepwise problem solving is being accomplished by the three projects mentioned above \cite{Back-SD09,ActiveMath-MAIN11,mat-tutor-cmu-MAIN11} exclusively. They model the whole problem solving process as mentioned above, so all what happens between formalized assumptions (or formal specification) and goal (or fulfilled postcondition) can be mechanized. Such mechanization promises to greatly extend the scope of educational software in stepwise problem solving.

\paragraph{Next step guidance (NSG)} comprises the system's ability to propose a next step; this is a challenge for CTP: either a radical restriction of the search space by restriction to very specific problem classes is required, or much care and effort is required in designing possible variants in the process of problem solving \cite{proof-strategies-11}.

Another approach is restricted to problem solving in engineering domains, where a problem is specified by input, precondition, output and postcondition, and where the postcondition is proven by ATP behind the scenes \cite{wn:lucas-interp-12}: Here the possible variants in the process of problem solving are provided with feedback {\em automatically}, if the problem is described in a CTP-based programming language~\cite{plmms10}: the programmer only describes the math algorithm without caring about interaction (the respective program is functional and even has no in/output statements~!); interaction is generated as a side-effect by the interpreter --- an efficient separation of concern between math programmers and dialog designers promising application all over engineering disciplines.

\subsection{Math Authoring in Isabelle/\isac}\label{math-auth}

Authoring new mathematics knowledge in {\sisac} can be compared with ``application programming'' of engineering problems; most of such programming uses CAS-based programming languages (CAS = Computer Algebra Systems; e.g. Mathematica's \cite{progr-mathematica} or Maple's programming language \cite{prog-maple06}).

{\sisac}, however, uses a novel type of CTP-based language \cite{plmms10} for describing how to constuct a solution to an engineering problem and for calling equation solvers, integration, etc~\footnote{Implementation of CAS-like functionality in CTP is not primarily concerned with efficiency, but with a didactic question: What to decide for: for high-brow algorithms at the state-of-the-art or for elementary algorithms comprehensible for students~?} within CTP; CTP can ensure ``systems that never make a mistake'' \cite{casproto} --- are impossible for CAS which have no logics underlying.

With writing such CTP-based programs authoring is perfect, the application programmer is not concerned with interaction or with user guidance: this is concern of a novel kind of program interpreter called Lucas-Interpreter \cite{wn:lucas-interp-12}. This interpreter hands over control to a dialog component at each step of calculation (like a debugger at breakpoints) and calls automated CTP to check user input following personalized strategies according to a feedback module.

\medskip

However ``application programming with CTP'' is not done with writing a program: according to the principles of CTP, each step must be justified. Such justifications are given by theorems. So all steps must be related to some theorem, if there is no such theorem it must be added to the existing knowledge, which is organized in so-called \textbf{theories} in  Isabelle. A theorem must be proven; fortunately Isabelle comprises a mechanism (called ``axiomatization''), which allows to omit proofs. Such a theorem is, for instance %TODO: take your example !

{\small\begin{tabbing}

123\=123\=123\=123\=\kill

\>axiomatization where \\

\>\>  rule1: "1 = $\delta$ [n]" and\\

\>\>  rule2: "|| z || > 1 ==> z / (z - 1) = u [n]" and\\

\>\>  rule3: "|| z || < 1 ==> z / (z - 1) = -u [-n - 1]" and \\

\>\>  rule4: "|| z || > || $\alpha$ || ==> z / (z - $\alpha$) = $\alpha^n$ * u [n]" and\\

\>\>  rule5: "|| z || < || $\alpha$ || ==> z / (z - $\alpha$) = -($\alpha^n$) * u [-n - 1]" and\\

\>\>  rule6: "|| z || > 1 ==> z/(z - 1)$^2$ = n $\cdot$ u [n]"\\

\end{tabbing}

}

In order to provide CTP with logical facts for checking user input, the Lucas-Interpreter requires a \textbf{specification}. Such a specification is for instance

{\small\begin{tabbing}

123,\=postcond \=: \= $\forall \,A^\prime\, u^\prime \,v^\prime.\,$\=\kill

Specification no.1:\\

%\>input\>: $\{\;r={\it arbitraryFix}\;\}$  \\

\>input    \>: $\{\;r\;\}$  \\

\>precond  \>: $0 < r$   \\

\>output   \>: $\{\;A,\; u,v\;\}$ \\

\>postcond \>:{\small  $\;A=2uv-u^2 \;\land\; (\frac{u}{2})^2+(\frac{v}{2})^2=r^2 \;\land$}\\

\>     \>\>{\small $\;\forall \;A^\prime\; u^\prime \;v^\prime.\;(A^\prime=2u^\prime v^\prime-(u^\prime)^2 \land

(\frac{u^\prime}{2})^2+(\frac{v^\prime}{2})^2=r^2) \Longrightarrow A^\prime \leq A$} \\

\>props\>: $\{\;A=2uv-u^2,\;(\frac{u}{2})^2+(\frac{v}{2})^2=r^2\;\}$

\end{tabbing}

}

Such a specification is checked before the execution of a program is started, the same applies for sub-programs. In the following example program the sub-programs are designated by {\tt SubProblem}: TODO one example.

\subsection{Goals of the Thesis}\label{sec:goals}

%Imagine a piece of software would be able to support you by understanding every problem class, upcoming in the first years attending university - wouldn't it be great?

%\par {\sisac{}} tries to do that, but the current state of the art is miles away from this goal and a single implementation of a problem is not enough to cahnge this circumstamce. Through this fact it is all the more essential to try, test, research and document the implementation of problem classes from "`real world"' applications. Responding to the abstract at the begin of this document the thesis has two folds; on the one hand certainly to provide interactiv course material for Signal Processing (which means to implement a single problem provided by the Institute of Signal Processing and Speech Communication (SPSC); follow up Calulcations), and to extract experience data respectively help the {\sisac{}}-team by setting up a detailed description of technicalities hacking {\sisac{}} on the other hand.

%\par Another goal is to demonstrate the power and attractivity of {\sisac}.

Now all the notions are in place to describe the task ``Interactive Course Material for Signal Processing based on Isabelle/\sisac'' appropriately by the following points:

\begin{enumerate}

\item Analyze the problems given by the SPSC Lab for mathematics \textbf{knowledge required}, search the knowledge already available in Isabelle/\sisac, estimate efforts required to fill the gap between knowledge required and knowledge available, and finally select problems for implementation accordingly.

\item Implement the selected problems in Isabelle/\sisac, which means, in appropriate Isabelle theories \textbf{for each problem} implement:

  \begin{enumerate}

  \item \textbf{Definitions and theorems} required within the specification (including ``descriptions'' for input variables and output variables) and the program (proofs omitted via ``axiomaization'')

  \item \textbf{A specification} which describes the input variables, the preconditions on the input (a challenge for rigorously exact mathematics~!), the output variables and the postcondition, which relates input to output such that the problem is characterized formally (another challenge for rigorously exact mathematics~!)

  \item \textbf{A program} describing the algorithm which solves the problem, i.e. which constructs output meeting the postcondition. Programming involves identifying the steps (tactics~!) which create the calculation and calling CAS-functions (simplification, equation solvers, etc) appropriately. Modularization of programs into {\tt SubProblems} has to prepare for re-use of code.

  \end{enumerate}

\item Add \textbf{multimedia explanations} to each problem (i.e. to specific definitions, theorems, the specification and the program) such that non-expert students (e.g. within STEOP, the introductory orientation phase at TUG) get an idea the problem is about.

\item \textbf{Document the implementation} such that

  \begin{enumerate}

%  \item Interactive course material hopefully useful in education within the SPSC Lab and within STEOP, the introductory orientation phase at TUG, as a preview for students in Telematics on later application of math knowledge introduced in the first semester and

%  \item A detailed description of technicalities in programming implemented as an interactive Isabelle/Isar theory, providing future programmers with guidelines and {\sisac}-developers with feedback in usability of the CTP-based program language. 

  \item subsequent application programmers have guidelines for further implementation of interactive course material in SPSC and other engineering sciences

  \item \sisac{} developers get feedback for ongoing improvement of the CTP-based programming language, the respective development environment and the respective program interpreter (called Lucas-Interpreter)

  \item development of knowledge for engineering sciences is being motivated in the Isabelle community.

  \end{enumerate}

\end{enumerate}

\section{Mechanization of Signal Processing Problems}\label{sp}

\subsection{Relevant Knowledge available in Isabelle}\label{know-isab}

Isabelle is developed now for a long time and so we are able to access a huge range of theories and usefull snipsets. The main problem according this snipsets is that isabelle still is a theorem proofer and not an algebra system. But due the work of the {\sisac}-development team there are already also many calculation examples provided.

\par The SPSC provided a list of problems which are often done wrong or are missunderstood by studentsin term of the problem classes. Out of these tasks we tried to extract the core operations and looked up which parts are already implemented or usefull. The provided problems are:

\begin{itemize}

\item Fourier-Transformation

\item Convolution

\item Inverse z-Transformation and partial fraction decomposition

\item Indextransformation

\end{itemize}

Following the collection and evaluation of core operations collated with isabelle:

\paragraph{example FFT}, describe in detail !!!! 

? different meaning: FFT in Maple

gap between what is available and what is required (@)!

traditional notation ?

\subsection{Relevant Knowledge available in isac}\label{know-isac}

todo

specifications (``application axis'') and methods (``algorithmic axis'')

partial fractions, cancellation of multivariate rational terms, ...

\subsection{Survey: Requiered Knowledge and Selected Problem(s)}\label{know-missing}

Following tables are showing the expected development effort for speciefic problems. The values are only very inaccurately approximations of the real work, but needed as a basis for descieding with which problem to start:

\begin{table}[!H]

\begin{centering}

\begin{tabular}{p{4cm}|p{5cm}|rp{2.5cm}}

requirements            & comments             &effort\\ \hline\hline

solving Intrgrals		    & simple via propertie table     &     20\\

                        & \emph{real}          &    MT\\ \hline

transformation table    & simple transform     &    20\\ \hline

visualisation						& backend							 &    10\\ \hline

example collection      & with explanations    &    20\\ \hline\hline

\multicolumn{2}{c|}{}                      & 70-80\\

\end{tabular}

\par\end{centering}

\caption{Fourier-Transformation development effort}

\end{table}

\begin{table}[H]

\begin{centering}

\begin{tabular}{p{4cm}|p{5cm}|rp{2.5cm}}

requirements            & comments             &effort\\ \hline\hline

simplify rationals      & \sisac               &     0\\ \hline

define $\sum\limits_{i=0}^{n}i$ & partly \sisac  &    10\\ \hline

simplify sum			      & termorder            &    10\\

                        & simplify rules       &    20\\

                        & use simplify rationals&     0\\ \hline

index adjustments       & with unit step       &      10\\ \hline

example collection      & with explanations    &    20\\ \hline\hline

\multicolumn{2}{c|}{}                      & 70-90\\

\end{tabular}

\par\end{centering}

\caption{Convolution Operations development effort}

\end{table}

\begin{table}[H]

\begin{centering}

\begin{tabular}{p{4cm}|p{5cm}|rp{2.5cm}}

requirements            & comments             &effort\\ \hline\hline

solve for part.fract.   & \sisac: degree 2     &     0\\

                        & complex nomminators  &    30\\

                        & degree > 2           &    MT\\ \hline

simplify polynomial     & \sisac               &     0\\

simplify rational       & \sisac               &     0\\ \hline

partial fraction        & degree 2,            &    20\\

decomposition           & specification, method&    30\\ \hline

${\cal Z}^{-1}$ table   & explanations, figures&    20\\ \hline

example collection      & with explanations    &    20\\ \hline\hline

\multicolumn{2}{c|}{}                      & 90-120\\

%                        &                      & 1 MT

\end{tabular}

\par\end{centering}

\caption{Z-Transformation development effort}

\end{table}

As conclusion of the summerized efforts it is evident that only one topic can be tried to realized as a baccalaureate thesis. In accord with Dr. Neuper we decided after some practical tests to start with the implementation of the (Inverse) Z-Transformation. The Reason is that this topic can mostly be done with knowledge which was already tried to be mechanized in {\sisac}.

\subsection{Formalization of missing knowledge in Isabelle}

todo

axiomatization ... where ... and

\subsection{Notes on Problems with Traditional Notation}

{\footnotesize

\textbf{TODO}

Due the thesis work we discorvers severell problems of traditional notations.

u[n] !!

f x =  why not f(x) ?!?!

...

terms are not full simplified in traditional notations, in isac we have to simplify them complete to check weather results are compatible or not. in e.g. the solutions of an second order linear equation is an rational in isac but in tradition we keep fractions as long as possible and as long as they are 'beautiful' (1/8, 5/16,...)

}\\

The math which should be mechanized in Computer Theorem Provers (\emph{CTP}) has (almost) a problem with traditional notations (predicate calculus) for axioms, definitions, lemmas, theorems as a computer programm or script is not able to interpret every greek or latin letter and every greek, latin or whatever calculations symbol. Also if we would be able to handle thehse symbols we still have a problem to interpret them at all. (Follow up \hbox{Example \ref{eg:symbint1}})

\begin{example}

	\[

		u\left[n\right] \ \ldots \ unitstep

	\]

	{\small\textit{

		\noindent The unitstep is something we need to solve Signal Processing problem classes. But in {\sisac{}} the 	rectangular breakets have a different meaning. So we abuse them for our requirements. We get something which is not defined, but useable. The Result is syntax only without semantic.

	}}

	\caption{Expression Interpretation}\label{eg:symbint1}

\end{example}

\noindent In different problems, symbols and letters have different meanings and ask for different ways to get through. (Follow up \hbox{Example \ref{eg:symbint2}}) 

\begin{example}

	\[

		\widehat{\ }\ \widehat{\ }\ \widehat{\ } \  \ldots \  exponent

	\]

	{\small\textit{

	\noindent For using exponents the three widehat symbols are required. The reason for that is due the development of {\sisac{}} the single widehat and also the double were already in use for different operations.

	}}

	\caption{Symbol Interpretation}\label{eg:symbint2}

\end{example}

Exclusive from the input, also the output can be a problem. We are familar with a specified notations and style taught in university but a computer programm has no knowledge of the form probved by a professor and the maschines themselve also have not yet the possibilities to print every symbol (correct) Recent developments provide proofs in a humand readable format but according to the fact that there is no mony for good working formel editors yet, the style is one thing we have to live with.

\section{Milestones for the Thesis}

The thesis was splitted into six iterations

\begin{description}

\item[(29.06. -- 27.07.)] Collection of detailed informations about different STEOP topics \ref{ssec:infcol}

\item[(27.07.)] First Prsentation - Decition on which Problems will be implemented \ref{ssec:pres1}

\item[(01.09. -- 11.11.)] Implementing the Problem Class in {\sisac{}} \ref{ssec:impl}

\item[(14.11. -- 02.12.)] Documentation of the Implementation \ref{ssec:doc}

\item[(05.12. -- todo)] Writting on the thesis \ref{ssec:thes}

\item[todo] Second Prsentation - Work review \ref{ssec:pres2}

\end{description}

\section{Detailed Milestone Description}

\subsection{Collection of detailed informations about different STEOP topics}\label{ssec:infcol}

identify problems relevant for certain SP lectures

estimate chances to realized them within the scope of this thesis

order for implementing the problems negotiated with lecturers

\subsection{First Prsentation - Decition on which Problems will be implemented}\label{ssec:pres1}

\subsection{Implementing the Problem Class in {\sisac}}\label{ssec:impl}

\subsection{Documentation of the Implementation}\label{ssec:doc}

\subsection{Writting on the thesis}\label{ssec:thes}

\subsection{Second Prsentation - Work review}\label{ssec:pres2}

\section{Related Work}\label{sec:related}

Unusual for a Baccalaureate Thesis, there is {\em no} related work; this requires explanation.

Of course, this thesis relies on front-of-the wave computer mathematics, on CTP. But {\sisac{}} uses CTP in a very specific way, which is too weakly related to other work: programming in the CTP-based language and rigorous formal specification of problems in Signal Processing where the main tasks in the practical part of this thesis. The major challenge for the practical work was given by the fact, that the work concerned alpha-testing of the CTP-based programming environment.

\par Another  area of work could be considered as related work: authoring of e-learning content. However, {\sisac{}} provides division of concern such that the practical part of this thesis could focus on computer mathematics; this work was not concerned with interaction (the CTP-based programming language has neither input statements nor output statements), nor with dialog guidance nor with any kind of learning theory.

\par These two reasons are given for the unusual statement, that there is no related work to be discussed in this thesis. 

\section{Review}

todo

\section{Open Questions}

todo

\section{Conclusions}

todo

\bibliographystyle{alpha}

\bibliography{references}

%\bibliography{bib/math-eng,bib/didact,bib/bk,bib/RISC_2,bib/isac,bib/pl,bib/math}

\clearpage

%----------// PART 2 \\----------%

\part{Implementation}

\input{./preambleForGeneratedDocuments.tex}

\HRule

%\input{../../../test/Tools/isac/ADDTESTS/course/SignalProcess/document/Build_Inverse_Z_Transform}

\clearpage

%----------// APPENDIX \\-----------%

\appendix

%----------// BIB \\-----------%

\renewcommand{\refname}{\section{Sources}} % Using "Sources" as the title of the section

\bibliographystyle{alpha}

\bibliography{references}

\clearpage

%----------// WORK TIME \\-----------%

\section{Stundenliste}

\begin{footnotesize}

\begin{longtable}[h]{l p{6.5cm} c c r}

{\bf Date} & {\bf Description} & {\bf Begin} & {\bf End} & {\bf Dur.}\\

\hline \hline

\endhead

29.06.2011 & Treffen mit Geiger und Neuper & 15:00 & 17:30 & 2,50\\ 

02.07.2011 & Beispielaufbereitung (Bsp. Geiger Mail) & 20:00 & 21:30 & 1,50\\ 

03.07.2011 & Beispielaufbereitung, Vorraussetzungsausw. & 21:00 & 22:45 & 1,75\\ 

05.07.2011 & Treffen mit Neuper, Informationsaustausch & 10:00 & 13:00 & 3,00\\ 

06.07.2011 & Isabelle Installation & 20:00 & 22:30 & 2,50\\ 

07.07.2011 & Treffen mit Neuper, Präsentationsvorbereitung & 14:45 & 16:15 & 1,50\\ 

18.07.2011 & Präsentationsvorbereitung - Struktur & 14:15 & 16:00 & 1,75\\ 

19.07.2011 & Präsentationsvorbereitung - Inhalt & 07:20 & 09:20 & 2,00\\ 

19.07.2011 & Treffen mit Neuper & 10:00 & 12:00 & 2,00\\ 

21.07.2011 & HG Fehlersuche, Latex Ausarbeitung & 11:10 & 14:00 & 2,83\\ 

22.07.2011 & Treffen mit Neuper & 10:00 & 12:00 & 2,00\\ 

23.07.2011 & Berechnungen in Latex fertigstellen & 13:45 & 16:30 & 2,75\\ 

24.07.2011 & Präsentation fertigstellen & 20:10 & 20:40 & 0,50\\ 

25.07.2011 & Treffen mit Neuper, Präsentation \& erste Tests & 15:15 & 17:55 & 2,67\\ 

26.07.2011 & Test\_Complex.thy erarbeiten & 10:45 & 12:10 & 1,42\\ 

27.07.2011 & present-1 mit Neuper, Geiger & 10:00 & 12:00 & 2,00\\

\hline 

02.09.2011 & Treffen mit Neuper, Vorlage Bakk-Arbeit & 08:30 & 10:20 & 1,83\\ 

05.09.2011 & Treffen mit Neuper, Beginn Partialbruchzerlegung & 09:30 & 12:45 & 3,25\\ 

05.09.2011 & Partialbruchzerlegung & 17:10 & 18:30 & 1,33\\ 

06.09.2011 & Dokumentation Partialbruchzerlegung & 10:00 & 13:15 & 3,25\\ 

07.09.2011 & Treffen mit Neuper, Einführung Programmierung & 10:00 & 12:50 & 2,83\\ 

08.09.2011 & Latex Umgebung einrichten - Theory export & 19:00 & 22:45 & 3,75\\ 

09.09.2011 & Latex Umgebung einrichten - Makefile & 11:40 & 15:00 & 3,33\\ 

10.09.2011 & Treffen mit Neuper, HG Fehler, Skript Inv.-Z-Transf. & 10:00 & 12:00 & 2,00\\ 

14.09.2011 & Skript Inv.-Z-Transf Prgrammierung & 09:10 & 12:25 & 3,25\\ 

16.09.2011 & Informationssammlung Summen & 13:15 & 16:00 & 2,75\\ 

19.09.2011 & Programmierübung & 10:00 & 13:10 & 3,17\\ 

20.09.2011 & Trefffen mit Neuper, Unterstützung bei Program. & 15:30 & 18:10 & 2,67\\ 

23.09.2011 & Neukonfiguration IsaMakefile & 13:00 & 14:30 & 1,50\\ 

23.09.2011 & Treffen Neuper, Programmierung Build\_Inverse\_Z & 14:30 & 17:30 & 3,00\\ 

26.09.2011 & Skript Partialbruchzerlegung - getArgument & 13:30 & 16:15 & 2,75\\ 

27.09.2011 & Treffen mit Neuper, HG Fehler & 09:00 & 12:20 & 3,33\\ 

28.09.2011 & Treffen mit Neuper, Dateiumstrukturierung & 10:00 & 12:30 & 2,50\\ 

01.10.2011 & Testen & 10:00 & 11:00 & 1,00\\ 

02.10.2011 & Fehlersuche & 15:00 & 16:10 & 1,17\\ 

06.10.2011 & Treffen mit Neuper & 15:00 & 17:50 & 2,83\\ 

07.10.2011 & Treffen mit Neuper, Programmbesprechung & 15:00 & 16:50 & 1,83\\ 

09.10.2011 & Bakk. Arbeit & 16:30 & 18:45 & 2,25\\ 

11.10.2011 & Treffen mit Neuper, Programmbespr., Abstract & 14:10 & 17:10 & 3,00

\end{longtable}

\end{footnotesize}

\section{Calculations}

\input{calulations}

\end{document}