wolffd@0: % Make the following network (from Jensen (1996) p84 fig 4.17)
wolffd@0: %    1
wolffd@0: %  / | \
wolffd@0: % 2  3  4
wolffd@0: % |  |  |
wolffd@0: % 5  6  7
wolffd@0: %  \/ \/
wolffd@0: %  8   9
wolffd@0: % where all arcs point downwards
wolffd@0: 
wolffd@0: 
wolffd@0: N = 9;
wolffd@0: dag = zeros(N,N);
wolffd@0: dag(1,2)=1; dag(1,3)=1; dag(1,4)=1;
wolffd@0: dag(2,5)=1; dag(3,6)=1; dag(4,7)=1;
wolffd@0: dag(5,8)=1; dag(6,8)=1; dag(6,9)=1; dag(7,9) = 1;
wolffd@0: 
wolffd@0: ns = [5 4 3 2 2 1 2 2 2]; % vector-valued nodes
wolffd@0: %ns = ones(1,9); % scalar nodes
wolffd@0: dnodes = [];
wolffd@0: 
wolffd@0: bnet = mk_bnet(dag, ns, 'discrete', []);
wolffd@0: rand('state', 0);
wolffd@0: randn('state', 0);
wolffd@0: for i=1:N
wolffd@0:   bnet.CPD{i} = gaussian_CPD(bnet, i);
wolffd@0: end
wolffd@0: 
wolffd@0: clear engine;
wolffd@0: engine{1} = gaussian_inf_engine(bnet);
wolffd@0: engine{2} = jtree_inf_engine(bnet);
wolffd@0: 
wolffd@0: [err, time] = cmp_inference_static(bnet, engine);
wolffd@0: