[Octave-cvsupdate] SF.net SVN: octave:[10983] trunk/octave-forge/main/queueing/inst

[<mma...@us...>]

Revision: 10983
          http://octave.svn.sourceforge.net/octave/?rev=10983&view=rev
Author:   mmarzolla
Date:     2012-09-08 16:50:10 +0000 (Sat, 08 Sep 2012)
Log Message:
-----------
Increased tolerance in tests

Modified Paths:
--------------
    trunk/octave-forge/main/queueing/inst/dtmc_fpt.m
    trunk/octave-forge/main/queueing/inst/dtmc_mtta.m
    trunk/octave-forge/main/queueing/inst/qnvisits.m

Modified: trunk/octave-forge/main/queueing/inst/dtmc_fpt.m
===================================================================
--- trunk/octave-forge/main/queueing/inst/dtmc_fpt.m	2012-09-07 20:54:56 UTC (rev 10982)
+++ trunk/octave-forge/main/queueing/inst/dtmc_fpt.m	2012-09-08 16:50:10 UTC (rev 10983)
@@ -138,5 +138,5 @@
 %! P(8,[7 5 9]) = 1/3;
 %! P(9,[6 8]) = .5;
 %! M = dtmc_fpt(P);
-%! assert( M(1:9 != 5,5)', [6 5 6 5 5 6 5 6], 10*eps );
+%! assert( M(1:9 != 5,5)', [6 5 6 5 5 6 5 6], 100*eps );
 

Modified: trunk/octave-forge/main/queueing/inst/dtmc_mtta.m
===================================================================
--- trunk/octave-forge/main/queueing/inst/dtmc_mtta.m	2012-09-07 20:54:56 UTC (rev 10982)
+++ trunk/octave-forge/main/queueing/inst/dtmc_mtta.m	2012-09-08 16:50:10 UTC (rev 10983)
@@ -158,9 +158,9 @@
 %!test
 %! P = dtmc_bd([0 .5 .5 .5 .5], [.5 .5 .5 .5 0]);
 %! [t N B] = dtmc_mtta(P);
-%! assert( t(2:5), [4 6 6 4], 10*eps );
-%! assert( B(2:5,1), [.8 .6 .4 .2]', 10*eps );
-%! assert( B(2:5,6), [.2 .4 .6 .8]', 10*eps );
+%! assert( t(2:5), [4 6 6 4], 100*eps );
+%! assert( B(2:5,1), [.8 .6 .4 .2]', 100*eps );
+%! assert( B(2:5,6), [.2 .4 .6 .8]', 100*eps );
 
 ## Compute the probability of completing the "snakes and ladders"
 ## game in n steps, for various values of n. Also, computes the expected

Modified: trunk/octave-forge/main/queueing/inst/qnvisits.m
===================================================================
--- trunk/octave-forge/main/queueing/inst/qnvisits.m	2012-09-07 20:54:56 UTC (rev 10982)
+++ trunk/octave-forge/main/queueing/inst/qnvisits.m	2012-09-08 16:50:10 UTC (rev 10983)
@@ -189,7 +189,7 @@
 %! P(2,3,2,1) = 0.2;
 %! P(2,4,2,1) = 0.16;
 %! lambda = [0.1 0 0 0.1 ; 0 0 0.2 0.1];
-%! lambda_sum = sum(sum(lambda));
+%! lambda_sum = sum(lambda(:));
 %! V = qnvisits(P, lambda);
 %! assert( all( all(V>=0) ) );
 %! for i=1:K
@@ -413,7 +413,7 @@
     
     ## solve the traffic equation
     A = eye(K*C) - reshape(P,[K*C K*C]);
-    b = reshape(lambda / sum(sum(lambda)), [1,K*C]);
+    b = reshape(lambda / sum(lambda(:)), [1,K*C]);
     V = reshape(b/A, [C, K]);
   endif
   ## Make sure that no negative values appear (sometimes, numerical

This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.