{VERSION 5 0 "IBM INTEL NT" "5.0" } {USTYLETAB {CSTYLE "Maple Input" -1 0 "Courier" 0 1 255 0 0 1 0 1 0 0 1 0 0 0 0 1 }{PSTYLE "Normal" -1 0 1 {CSTYLE "" -1 -1 "Times" 1 12 0 0 0 1 2 2 2 2 2 2 1 1 1 1 }1 1 0 0 0 0 1 0 1 0 2 2 0 1 }} {SECT 0 {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 50 "# \n# Sequentieller \+ Test mit Bernoulli-Verteilung\n#" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 38 "# a,b Schranken zum sequentiellen Test" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "restart;" }}}{EXCHG {PARA 0 "> " 0 " " {MPLTEXT 1 0 6 "a:=13;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 6 " b:=13;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 47 "# c,d Koeffizient en der Testgr\366\337e Tn = c*kn-d*n" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "c:=2;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 5 "d:= 1;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 56 "if (c-d <=0) then pri nt(\"c-d mu\337 positiv sein!\") end if;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 39 "# Maximale Anzahl der Punkte im Fenster" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 19 "F := ceil((a+b)/c);" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 56 "p := 0.4; # Parameter de r Bernoulli-Variablen" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 9 "q : = 1-p;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 144 "#\n# prob[1]..pr ob[F]: Wahrscheinlichkeit der Fensterpunkte\n# (vorbelegt mit 0)\n#\np rob:=array(1..F);\nfor f from 1 to F do\n prob[f] := 0;\nend do:" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 171 "# pan = Annahmewahrscheinli chkeit im Schritt n\n# prn = Ablehnungswahrscheinlichkeit im Schritt n \n# pankum = kumulierte Annahmew'keit\n# prnkum = kumulierte Ablehnung sw'keit" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "pankum := 0;" }} }{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 12 "prnkum := 0;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 41 "# Initialisierung des 1. Fensters f \374r n=0" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 53 "k01:=-ceil(a/c )+1; # Wert von kn im 1. Fensterpunkt" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 53 "t1 := k01*c; # Wert von Tn im Fensterpunkt P1 " }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 56 "tF := t1+(F-1)*c; # \+ Wert von Tn im 1. Fensterpunkt PF" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 64 "prob[-k01+1]:=1; # Wahrscheinlichkeit im Startpun kt n=0,kn=0" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 109 "# Startfens ter\nprint(\"prob, kn, Tn\");\nfor f from F by -1 to 1 do\n print(pro b[f],k01+f-1,t1+(f-1)*c);\nend do;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 47 "E_N := 0; # E_N = Erwartungswert von N" }}} {EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 50 "# Aktualisierung von Schritt n-1 auf n (n=1,2,...)" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "u nassign('n');" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 1079 "for n fr om 1 to 1000 do\n if (n mod 100)=0 then print(\"n = \",n) end if;\n \+ if (t1-d > -a) then # Punkt P1 bleibt im Fenster\n t1 := t1-d; \+ # Wert von Tn im neuen Fensterpunkt P1\n tF := tF-d; \+ # Wert von Tn im neuen Fensterpunkt PF\n pan := 0;\n prn := p rob[F]*p;\n for f from F by -1 to 2 do\n prob[f] := prob[f]*q+ prob[f-1]*p;\n end do;\n prob[1] := prob[1]*q;\n if (tF >= b) then # neuer Punkt PF im Ablehnbereich\n prn := prn+prob[F];\n \+ prob[F] := 0;\n end if;\n else # jetzt ist \+ (t1-d <= -a)\n t1 := t1+c-d; # Wert von Tn im neuen Fensterp unkt P1\n tF := tF+c-d; # Wert von Tn im neuen Fensterpunkt \+ PF\n pan := prob[1]*q;\n for f from 1 to F-1 do\n prob[f] : = prob[f]*p+prob[f+1]*q;\n end do;\n prob[F] := prob[F]*p;\n \+ if (tF >= b) then # neuer Punkt PF im Ablehnbereich\n prn := p rob[F];\n prob[F] := 0;\n else\n prn := 0;\n end if;\n end if;\n pankum := pankum + pan;\n prnkum := prnkum + prn;\n # E rwartungswert von N\n E_N := E_N + (pan+prn)*n;\nend do:" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 7 "pankum;" }}}{EXCHG {PARA 0 "> " 0 " " {MPLTEXT 1 0 7 "prnkum;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 14 "pankum+prnkum;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 4 "E_N;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 8 "pan+prn;" }}}{EXCHG {PARA 0 "> " 0 "" {MPLTEXT 1 0 0 "" }}}}{MARK "33" 0 }{VIEWOPTS 1 1 0 1 1 1803 1 1 1 1 }{PAGENUMBERS 0 1 2 33 1 1 }