Fixed bug in findMaximum (it only considered a single connected component of the...
[libdai.git] / ChangeLog
1 git master
2 ----------
3 * Fixed bug in findMaximum (it only considered a single connected component of the factor graph)
4 * [Benjamin Piwowarski] Renamed "foreach" macro into "bforeach" to avoid conflicts with newer Boost library versions
5 * Optimized ClusterGraph( const FactorGraph&, bool) constructor
6 * Fixed "typename" bug in src/alldai.cpp which resulted in FTBFS for older g++ compilers
7 * Fixed memory leak in alldai.cpp and removed the function builtinInfAlgs()
8 * Fixed memory leak in CBP::run()
9 * Fixed typo in Priya's name
10
11
12 libDAI-0.3.0 (2011-07-12)
13 -------------------------
14
15 New license:
16 * Changed license from GPL v2+ to FreeBSD (BSD 2-clause)
17
18 Miscellaneous improvements:
19 * Improved Exception class
20 (it now stores more information and doesn't print to stderr by default)
21 * Added builtinInfAlgs() and builtinInfAlgNames()
22
23 Bug fixes:
24 * [Laurens van der Maaten] src/matlab/dai.cpp now correctly handles missing logZ()
25 and maxDiff() implementations
26 * Now uses GMP big integer type to represent linear states and the number of
27 states of VarSets (in some cases). This fixes a bug Jerome Maye and Priya
28 found in the State class. Unfortunately, the supplied Makefile.WINDOWS now
29 no longer works out-of-the-box.
30 * Fixed numerical issues in MF, FBP and TRWBP (discovered in sparse branch)
31 * Fixed bug in findMaximum(): inconsistent max-beliefs are now detected,
32 instead of returning a MAP state with zero joint probability
33 (reported by Hynek Urban)
34 * Fixed a Boost-related bug in src/util.cpp (reported by Avneesh Saluja)
35 (the random seed needs to be an unsigned int on some platforms)
36 * Fixed two bugs in examples/example_sprinkler_gibbs (reported by Priya)
37 * Fixed bug in tokenizeString() and Evidence::addEvidenceTabFile()
38 (a tab character at the end of a line was incorrectly discarded - bug reported by Priya)
39 * Replaced all Name members by name() virtual functions and removed global variable DAINames
40 (this fixes a bug in matlab/dai.cpp reported by Thomas Mensink)
41
42
43 libDAI-0.2.7 (2010-08-19)
44 -------------------------
45
46 * Removed interfaces deprecated in 0.2.6.
47 * Fixed a bug in JTree::findMaximum() (reported by zhengyun84 and Dhruv Batra):
48 if one or more variables had a MAP belief with more than one maximum, an
49 incorrect MAP state could result.
50
51
52 libDAI-0.2.6 (2010-08-05)
53 -------------------------
54
55 New features:
56 * Added decimation algorithm DecMAP for MAP inference (decmap.h/cpp).
57 * Added source code for one of the winning solvers of the
58 UAI 2010 Approximate Inference Challenge (examples/uai2010-aie-solver.cpp).
59 * Added support for reading files in the UAI Approximate Inference Challenge
60 format, supporting both the 2006/2008 evidence file format and the 2010
61 evidence file format (io.h/cpp).
62
63 Miscellaneous improvements:
64 * 'maxtime' property added to various algorithms (BP, Gibbs, HAK, TreeEP)
65 for setting an upper limit on execution time.
66 * 'maxmem' property added to JTree for setting an upper limit on memory usage.
67 * SmallSet:
68 - Added SmallSet::erase( const T& t ).
69 * VarSet:
70 - nrStates() now returns a long double instead of a size_t.
71 * Permute:
72 - Added ranges() accessor.
73 - Added inverse() method.
74 - Added optional reverse argument to Permute( const std::vector<Var>& ) constructor.
75 * Factor:
76 - Added createFactorDelta( const VarSet& vs, size_t state ).
77 * ClusterGraph:
78 - Added ClusterGraph(const FactorGraph& fg, bool onlyMaximal) constructor.
79 - Added findCluster( const VarSet& cl ).
80 - Added elimVar( size_t i ).
81 - Added 'maxStates' argument to VarElim( EliminationChoice f, size_t maxStates=0 ).
82 * FactorGraph:
83 - Added isMaximal(size_t).
84 - Added maximalFactor(size_t).
85 - Added FactorGraph::logScore( const std::vector<size_t>& statevec ).
86 * Gibbs:
87 - Added 'restart' property.
88 - Added Gibbs::findMaximum() for MAP inference.
89 * HAK:
90 - Optimized region graph construction for HAK/GBP with clusters=BETHE.
91 * examples/examples_imagesegmentation.cpp:
92 - [Peter Rockett] Improved Makefiles for image segmentation example.
93 - Added build flag to specify the CImg version.
94 * util.h/cpp:
95 - Added fromString<>( const std::string& x ).
96
97 Interface changes (the old interface is marked obsolete and will be removed in the next release):
98 * Added InfAlg::setMaxIter(size_t) for setting the maximum number of iterations.
99 * Deprecated Graph::Neighbor, BipartiteGraph::Neighbor and DAG::Neighbor
100 and replaced them by a globally defined Neighbor structure
101 * Deprecated Graph::Neighbors, BipartiteGraph::Neighbors and DAG::Neighbors
102 and replaced them by a globally defined Neighbors type
103 * Deprecated Graph::Edge, BipartiteGraph::Edge and DAG::Edge
104 and replaced them by a globally defined Edge type
105 * Renamed 'iters' property of Gibbs algorithm into 'maxiter'.
106 * ClusterGraph::findVar( const Var& n ) no longer throws an exception if the
107 variable is not found.
108 * Deprecated 'void tokenizeString( const string&, vector<string>&, const string& )'
109 and replaced it with an improved version
110 'vector<string> tokenizeString( const string&, bool, const string& )'
111 * Removed interfaces deprecated in 0.2.5.
112
113 Bug fixes:
114 * Fixed a problem with isnan() on FreeBSD; it is now in the dai namespace.
115 * Workaround for older g++ compilers (e.g. version 4.0.0 on Darwin 9.8.0)
116 which have problems when comparing const_reverse_iterator with
117 reverse_iterator.
118 * [Matt Dunham] Fixed a bug in Factors2mx in src/matlab/matlab.cpp
119 (segfault if factors depending on 0 variables were passed to MatLab)
120
121
122 libDAI-0.2.5 (2010-05-09)
123 -------------------------
124
125 New features:
126 * Added unit tests for var, smallset, varset, graph, dag, bipgraph,
127 weightedgraph, enum, util, exceptions, properties, index, prob,
128 factor, factorgraph, clustergraph, regiongraph, daialg, alldai
129 * [Ofer Meshi] Added a script for converting from FastInf to libDAI format
130 * Added utils/uai2fg, a utility to convert the UAI inference competition file
131 formats to the libDAI factor graph file format
132 * Added dag.h/cpp, an implementation of Directed Acyclic Graphs
133 * Added examples/example_imagesegmentation
134
135 Miscellaneous improvements:
136 * TRWBP:
137 - Added initialization of TRWBP weights by sampling spanning trees
138 * MF:
139 - Added an "init" option that allows to initialize randomly
140 - Added an "updates" option that allows to choose between standard
141 mean field and "hard-spin" mean field
142 * MR:
143 - rewrote response propagation implementation with help of BBP
144 - now uses GraphAL to represent the Markov graph
145 - miscellaneous smaller cleanups
146 * TreeEP:
147 - Now also supports disconnected factor graphs
148 * JTree:
149 - Now also supports disconnected factor graphs
150 * ExactInf:
151 - Added findMaximum()
152 * RegionGraph:
153 - Added error checking code
154 - Changed the way a RegionGraph is streamed to an std::ostream.
155 * ClusterGraph:
156 - Added nrVars() method
157 - Added var( size_t ) method
158 - Added cluster( size_t ) method
159 * FactorGraph:
160 - clamped() now contains a delta factor for the clamped variable
161 - Added MarkovGraph()
162 * TFactor:
163 - Added takeAbs()
164 - Added takeExp()
165 - Added takeLog( bool )
166 - Added operator-() const
167 - Added sumAbs() const
168 - Added operator==( const TFactor<T> &y )
169 - Added get(size_t), set(size_t,T)
170 * TProb:
171 - Added operator==( const TProb<T> &q )
172 - accumulate() now also applies op2 to init
173 - operator/= (T x) now yields 0 when dividing by 0
174 - Added resize(size_t)
175 - Added get(size_t) and set(size_t,T)
176 - Changed format of TProb<T> when streamed to an ostream
177 * multifor:
178 - Added reset()
179 * PropertySet:
180 - Added size()
181 - Added clear()
182 - Added erase()
183 * util.h/cpp:
184 - Added std::string toString( const T& x )
185 * weightedgraph.h/cpp:
186 - Added option to MaxSpanningTree and MinSpanningTree for
187 choosing between Prim's algorithm and Kruskal's algorithm
188 - Better error checking in RootedTree constructor
189 - Added GraphEL::GraphEL( const GraphAL& G ) constructor
190 * BipartiteGraph:
191 - Added hasEdge()
192 - Added findNb1()
193 - Added findNb2()
194 - Added nb1Set()
195 - Added nb2Set()
196 - Added operator==( const BipartiteGraph& )
197 - Added BipartiteGraph( size_t nr1, size_t nr2 ) constructor
198 - Added operator<<( std::ostream&, const BipartiteGraph& )
199 * GraphAL:
200 - Added hasEdge(size_t,size_t)
201 - Added nbSet(size_t)
202 - Added operator==( const GraphAL& )
203 - Added operator<<( std::ostream&, const GraphAL& )
204 * SmallSet:
205 - Added insert( const T& t ) method
206 * Improved regression test
207 * Made all "verbose" properties optional
208 * utils/createfg now has a new factor type ('ISINGUNIFORM') and the old
209 'ISING' factor type has been renamed to 'ISINGGAUSS'
210 * tests/testdai option "marginals" now has five possible values: NONE
211 outputs no marginals, VAR only variable marginals, FAC only factor
212 marginals, VARFAC both types of marginals, and ALL outputs all
213 marginals calculated by the algorithm.
214 * Compressed Makefile
215
216 Interface changes (the old interface is marked obsolete and will be removed in the next release):
217 * Removed RandomDRegularGraph(), please use createGraphRegular() instead
218 * TreeEP:
219 - Changed construct( const RootedTree& ) into
220 construct( const FactorGraph&, const RootedTree& )
221 * JTree:
222 - Changed construct( const std::vector<VarSet>&, bool ) into
223 construct( const FactorGraph&, const std::vector<VarSet>&, bool )
224 - Changed GenerateJT( const std::vector<VarSet> & )
225 into GenerateJT( const FactorGraph &, const std::vector<VarSet> & )
226 * RegionGraph:
227 - Made (previously public) members G, ORs, IRs and fac2OR protected and
228 added DAG() accessor which returns a reference to the region graph DAG
229 structure (currently implemented as a BipartiteGraph).
230 - Renamed calcCountingNumbers() into calcCVMCountingNumbers() and made it
231 protected, because exposing it to the world serves no purpose.
232 - Removed partial constructor RegionGraph( const FactorGraph& fg )
233 - Made RecomputeORs(), RecomputeORs( const VarSet& ) and RecomputeOR( size_t )
234 protected and renamed them by changing the "Recompute" into "recompute",
235 because exposing them to the world serves no purpose.
236 * ClusterGraph:
237 - Made (previously public) members G, vars and clusters private and added
238 bipGraph(), vars() and clusters() methods which offer read-only access
239 to these members.
240 - Deprecated toVector()
241 - Renamed size() into nrClusters()
242 * FactorGraph:
243 - Renamed Cliques() into maximalFactorDomains() and made it faster
244 - findVars( const VarSet& ) now returns a SmallSet<size_t>
245 and its argument now has a const-qualifier (which fixes a small bug).
246 - Made (previously public) member G private and added the
247 bipGraph() method, which offers read-only access to it.
248 - Deprecated the iterator interface:
249 o FactorGraph::iterator typedef
250 o FactorGraph::const_iterator typedef
251 o FactorGraph::begin() members
252 o FactorGraph::end() members
253 - Deprecated factor(size_t) which offered write access to a factor
254 because using this functionality in the descendant RegionGraph is dangerous,
255 as the outer regions are not automatically recomputed.
256 * TFactor:
257 - Renamed states() into nrStates()
258 - Added get(size_t) and set(size_t,T) operators;
259 get() is equivalent to "operator[](size_t) const" and set() should
260 be used instead of the non-const operator[], which has been deprecated
261 * TProb:
262 - Deprecated TProb( TIterator begin, TIterator end, size_t sizeHint=0 )
263 constructor: the sizeHint argument no longer defaults to 0
264 - Deprecated accumulate( T init, binOp op1, unOp op2 );
265 instead, accumulateSum( T init, unOp op ) and
266 accumulateMax( T init, unOp op, bool minimize ) should be used.
267 - Deprecated TProb::NormType and TProb::DistType;
268 ProbNormType and ProbDistType should be used instead.
269 - Fixed bug by renaming operator<=() to operator<()
270 - Added get(size_t) and set(size_t,T) operators;
271 get() is equivalent to "operator[](size_t) const" and set() should
272 be used instead of the non-const operator[], which has been deprecated
273 * PropertySet:
274 - Renamed Set() -> set()
275 - Renamed Get() -> get()
276 - Renamed GetAs<T>() -> getAs<T>()
277 - Renamed ConvertTo<T>() -> convertTo<T>()
278 * util.h/cpp:
279 - Removed max( const std::vector<Real> &v )
280 * weightedgraph.h/cpp:
281 - Renamed MaxSpanningTreePrims into MaxSpanningTree
282 - Renamed MinSpanningTreePrims into MinSpanningTree
283 - The vertices in DEdge and UEdge are now named "first" and "second"
284 for compatibility with a std::pair<size_t,size_t>
285 * BipartiteGraph:
286 - delta1() and delta2() now return a SmallSet<size_t> instead of a vector<size_t>
287 * SmallSet:
288 - The sizeHint argument of the iterator constructor
289 SmallSet::SmallSet( TIterator begin, TIterator end, size_t sizeHint=0 )
290 no longer has a default value in order to avoid confusion with the
291 SmallSet::SmallSet( const T &t1, const T &t2 )
292 constructor.
293
294 Bug fixes:
295 * [Stefano Pellegrini] Fixed bug in JTree::findMaximum()
296 * [Stefano Pellegrini] Fixed bug in BP[logdomain=1,inference=MAXPROD]
297 * Fixed some bugs in the MatLab interface build system
298 * Fixed a bug in utils/fginfo.cpp
299 * Fixed a bug in JTree::findMaximum() and simplified the code
300 * Fixed bug in BBPCostFunction::operator=() which prevented the desired
301 assignment from happening
302 * RegionGraph::WriteToFile( const char* ), RegionGraph::ReadFromFile( const char * )
303 and RegionGraph::printDot( std::ostream& ) incorrectly called their respective
304 FactorGraph ancestor methods; this has been corrected by letting them throw a
305 NOT_IMPLEMENTED exception.
306 * Fixed bug in FactorGraph::clone()
307 * Fixed bug in min( const TFactor<T> &, const TFactor<T> & )
308 * Fixed bug in max( const TFactor<T> &, const TFactor<T> & )
309 * Fixed bug by renaming TProb<T>::operator<=() to TProb<T>::operator<()
310 * Fixed bug in PropertySet::setAsString<T>()
311 * Fixed a bug in rnd_seed()
312 * BipartiteGraph:
313 - Fixed bug in eraseNode1()
314 - Fixed bug in eraseNode2()
315 - Fixed bug in isTree()
316 * GraphAL:
317 - Fixed bug in nrEdges()
318 - Fixed bug in addEdge()
319 - Fixed bug in isTree()
320 - Fixed bug in eraseNode()
321 - Fixed bug in printDot()
322 * Fixed bug in createGraphGrid3D()
323 * Fixed bug in createGraphRegular()
324
325
326 libDAI-0.2.4 (2010-02-11)
327 -------------------------
328
329 New features:
330 * Implemented Tree-Reweighted BP
331 * [Frederik Eaton] Implemented Fractional Belief Propagation
332
333 Miscellaneous improvements:
334 * Improved documentation
335 * [Frederik Eaton] Added constructors for BBPCostFunction
336 * [Frederik Eaton] Added accessor/mutator for the elements of a SmallSet<>
337 * [Frederik Eaton] Added unary minus to TProb<>
338 * [Frederik Eaton] Added Hellinger distance to TProb<>::DistType
339 * [Frederik Eaton] Two small patches for src/jtree.cpp and utils/createfg.cpp
340 * tests/testdai option "marginals" now has three possible values: NONE
341 outputs no marginals, VAR only variable marginals, and ALL outputs all
342 marginals calculated by the algorithm.
343 * Strengthened convergence criteria of various algorithms
344 * Added GraphAL, an adjacency list implementation for graphs,
345 similar to (but simpler than) BipartiteGraph
346 * Added some functionality to create various standard factors
347 (the functions whose names start with "createFactor")
348 * Added examples example_sprinkler_gibbs and example_sprinkler_em
349 * Implemented various heuristics for choosing a variable elimination sequence
350 in JTree
351 * Added BETHE method for GBP/HAK cluster choice
352 * Made alias support official part of the library
353
354 Build system:
355 * Moved platform independent build options into Makefile.ALL
356 * Windows platform now needs Boost 1.37 or higher
357
358 Code cleanup:
359 * Cleaned up utils/createfg and tests/testdai
360 * Cleanup of some duplicate code in BP, FBP, TRWBP
361
362 Interface changes (the old interface is marked obsolete and will be removed in the next release):
363 * Removed obsolete/deprecated stuff
364 * Renamed Graph into GraphEL (for Graph, implemented as Edge List)
365 * Renamed some functions of BipartiteGraph:
366 add1() -> addNode1()
367 erase1() -> eraseNode1()
368 nr1() -> nrNodes1()
369 add2() -> addNode2()
370 erase2() -> eraseNode2()
371 nr2() -> nrNodes2()
372 * Renamed some functions in ClusterGraph:
373 ClusterGraph::eliminationCost() -> ::eliminationCost_MinFill()
374 ClusterGraph::VarElim() -> ClusterGraph::VarElim( sequentialVariableElimination( ElimSeq ) )
375 ClusterGraph::VarElim_MinFill() -> ClusterGraph::VarElim( greedyVariableElimination( eliminationCost_MinFill ) )
376 * Changed interface of one RegionGraph constructor
377 * Renamed "Clamped BP" into "Conditioned BP"
378
379 Bug fixes:
380 * Fixed regression in scripts/regenerate-properties (now all errors are
381 gathered before throwing the exception, as used to be the case)
382 * Fixed FTBFS errors on MACOSX (thanks to Sebastian Riedel for reporting this bug)
383 * [Alexander Schwing] Fixed error in BP that occured with damping
384 and using log-domain updates
385 * Fixed bug in HAK for trivial region graphs (with only one outer region
386 and no inner regions), reported by Alejandro Lage.
387 * Fixed long-standing bug in TreeEP (now, within-loop propagation optimization works)
388
389
390 libDAI-0.2.3 (2009-11-16)
391 -------------------------
392
393 New features:
394 * Complete doxygen documentation (although more detailed documentation still
395 has to be written)
396 * [Charles Vaske] Added parameter learning for conditional probabilities by
397 Expectation Maximization
398 * [Patrick Pletscher] Added SWIG wrapper code for experimental python and
399 octave interfaces
400 * Added Max-Product functionality to JTree
401 * [Frederik Eaton] Added Back-Belief-Propagation
402 * [Frederik Eaton] Added approximate inference method "Clamped Belief Propagation"
403 * [Frederik Eaton] Added approximate inference method "Gibbs sampling"
404
405 Code cleanup:
406 * Updated copyright headers
407 * Cleaned up error handling by introducing the DAI_THROWE macro
408 * Introduced DAI_DEBASSERT macro to abbreviate a common pattern
409 * Replaced the standard assert() macro by DAI_ASSERT, which throws a
410 dai::Exception and is even active if NDEBUG is defined
411 * Removed all the virtual default constructors *::create(), as they are not used
412 * [Frederik Eaton] Removed unnecessary copy constructors and assignment operators
413 * [Frederik Eaton] Change cout to cerr in warnings and error messages
414
415 Miscellaneous improvements:
416 * BipartiteGraph:
417 - Added eraseEdge( size_t n1, size_t n2 )
418 - [Frederik Eaton] Improved documentation of Neighbor
419 * TProb<T>:
420 - Added divided_by(const TProb<T>&) const
421 - Added constructor TProb<T>( const std::vector<S> &v )
422 - Added size_t draw(), which draws a random index
423 - [Frederik Eaton] Added setUniform()
424 - [Frederik Eaton] Added sumAbs()
425 - [Frederik Eaton] Added argmax()
426 - [Giuseppe Passino] Added begin(), end()
427 * TFactor<T>:
428 - [Giuseppe Passino] Added begin(), end()
429 - [Charles Vaske] Added TFactor( const std::vector<Var> &vars, const std::vector<T> &p ),
430 which reorders variables to canonical ordering before storing the table
431 - Added constructor TFactor<T>( const VarSet &vars, const std::vector<S> &v )
432 - Extended functionality of TFactor<T>::operators +,-,+=,-= to handle different VarSets
433 - Added TFactor<T>::maxMarginal (similar to marginal but with max instead of sum)
434 * State:
435 - [Giuseppe Passino] Added prefix ++ operator
436 * Permute:
437 - [Charles Vaske] Added constructor in Permute for canonical variable ordering
438 * FactorGraph:
439 - [Frederik Eaton] Added clampVar()
440 - [Frederik Eaton] Added clampFactor()
441 - [Giuseppe Passino] Added begin(), end()
442 * PropertySet:
443 - Added keys(), for getting all keys
444 - [Frederik Eaton] Added default constructor
445 - [Frederik Eaton] Added constructor from string
446 * InfAlg:
447 - Added setProperties(), getProperties() and printProperties()
448 - [Frederik Eaton] Added beliefV(), beliefF()
449 * ExactInf:
450 - Added calcMarginal(const VarSet &)
451 * HAK:
452 - Added "init" parameter to allow for random initialization
453 * BP:
454 - [Giuseppe Passino] Added findMaximum(), which can be used after running
455 max-product BP to construct a global state with maximum probability
456 * JTree:
457 - Added findMaximum(), which can be used after running
458 max-product JTree to construct a global state with maximum probability
459 * MatLab interface:
460 - MEX file dai now also returns variable and factor beliefs
461 - [Sebastian Nowozin] MEX file dai now also optionally returns the MAP state
462 (only for BP and JTree)
463 * README is now created automatically from doxygen documentation
464 * [Frederik Eaton] Added script for automatically generating properties code (used by CBP and BBP)
465 * [Frederik Eaton] Added newInfAlgFromString to alldai.h/cpp
466 * [Frederik Eaton] Added some utility macros (DAI_PV, DAI_DMSG, DAI_IFVERB)
467 and functions (concat(),rnd()) to util.h
468 * Changed output stream operator<< for Var and VarSet
469 * [Frederik Eaton] Improved parsing code in tests/testdai to allow recursive
470 alias substitutions
471 * [Frederik Eaton] Added useful aliases to aliases.conf
472 * [Giuseppe Passino] Optimised maximum-residual BP by using a reversed ordered
473 set instead of the linear search (which can yield enormous speedups - a
474 factor 500 has been measured on a binary Ising grid with 128x128 variables!)
475 * Added debug assertions to Var which check for inconsistent dimensions of
476 variables with the same labels
477 * toc() now returns POSIX system time with maximum accuracy of microseconds
478 * Exception objects now remember their error code
479 * Examples:
480 - Moved example.cpp to examples/
481 - Added examples/example_bipgraph.cpp
482 - Added examples/example_varset.cpp
483 - Added examples/example_sprinkler.cpp
484 - Added examples/example_permute.cpp
485 - Added python and octave ports for examples/example_sprinkler.cpp
486
487 Build system:
488 * Improved Makefile:
489 - Merged Makefile.win and Makefile.shared into Makefile
490 - Macros DAI_VERSION and DAI_DATE have been introduced,
491 in order to store this information in a central place
492 - Introduced CCNODEBUGFLAGS in Makefile
493 - Switched Makefile.win to GNU Make syntax
494 - [Frederik Eaton] Added TAGS, lib targets to Makefile
495 * Compatibility:
496 - [Peter Gober] libDAI can now be built on Cygwin
497 - [Dan Preston] libDAI can now be built on Mac OS X
498 - Changed regression test so that it also works under Windows
499
500 Interface changes (the old interface is marked obsolete and will be removed in the next release):
501 * Var:
502 - Variable labels are now nonnegative (of type size_t)
503 * VarSet:
504 - Replaced calcState() by non-member calcLinearState()
505 - Replaced calcStates() by non-member calcState()
506 * Permute:
507 - Renamed convert_linear_index into convertLinearIndex
508 * TProb<>:
509 - Replaced log0() by log(true)
510 - Replaced takeLog0() by takeLog(true)
511 - Removed hasNonPositives()
512 - Renamed minVal() to min()
513 - Renamed maxVal() to max()
514 - Renamed totalSum() to sum()
515 * TFactor<>:
516 - Replaced log0() by TFactor<T>::log(true)
517 - Removed divided_by, use operator/ instead
518 - Removed divide, use operator/= instead
519 - Removed partSum(const VarSet&), use marginal(const VarSet&,false) instead
520 - Renamed minVal() to min()
521 - Renamed maxVal() to max()
522 - Renamed totalSum() to sum()
523 * FactorGraph:
524 - Changed clamp and clamp interfaces (the variable to be
525 clamped is now indicated by its index, not as a Var)
526 * RegionGraph:
527 - Renamed Check_Counting_Numbers into checkCountingNumbers
528 - Renamed Calc_Counting_Numbers into calcCountingNumbers
529 * Miscellaneous:
530 - Renamed Treewidth(const FactorGraph &) into boundTreewidth(const FactorGraph &)
531 - Replaced UEdgeVec by Graph
532 - Replaced DEdgeVec by new RootedTree class
533 - Moved functionality of GrowRootedTree() into constructor of RootedTree
534 - Merged calcPairBeliefsNew() into calcPairBeliefs()
535 - Removed calcMarginal2ndO()
536 - Renamed smallSet<T> to SmallSet<T>
537 - Removed class Diffs
538 - [Frederik Eaton] Added backwards compatibility layer for edge interface to
539 BipartiteGraph and FactorGraph (which will be obsoleted soon)
540
541 Bug fixes:
542 * Fixed reversal of min and max in
543 TFactor<T> min( const TFactor<T> &, const TFactor<T> & )
544 TFactor<T> max( const TFactor<T> &, const TFactor<T> & )
545 * [Sebastian Nowozin] Fixed memory leak in MEX file dai
546 * [Frederik Eaton] In PropertySet::getStringAs(), check for typeid(ValueType)
547 before typeid(std::string) (this fixes a strange bug for empty string property)
548 * Added work-around for bug in Boost Graph Library
549 * Fixed bug in MaxSpanningTree (it wrongly assumed that the tree was not empty).
550 * Fixed bug in calcMarginal and calcPairBeliefs where states with zero probability
551 mass were clamped, leading to NaNs or assertion errors (thanks to Dan Preston
552 for reporting this)
553
554
555 libDAI-0.2.2 (2008-09-30)
556 -------------------------
557
558 New features:
559 * Approximate inference methods now report the number of iterations needed.
560 * Added damping to various algorithms to improve convergence properties.
561 * Added more features to utils/createfg for creating factor graphs.
562 * Added ExactInf class for brute force exact inference.
563 * [Giuseppe Pasino] Added "logdomain" property to BP, a boolean that controls
564 whether calculations are done in the log-domain or in the linear domain;
565 doing calculations in the log-domain may help if the numerical range
566 of a double is too small.
567 * [Claudio Lima] Added Max-Product functionality to BP.
568 * Improved documentation.
569
570 Improved architecture:
571 * Added Exceptions framework.
572 * Pervasive change of BipartiteGraph implementation (based on an idea by
573 Giuseppe Passino). BipartiteGraph no longer stores the node properties
574 (former _V1 and _V2), nor does it store a dense adjacency matrix anymore,
575 nor an edge list. Instead, it stores the graph structure as lists of
576 neighboring nodes. This yields a significant memory/speed improvement for
577 large factor graphs, and is more elegant as well. Iterating over neighbors is
578 made easy by using boost::foreach.
579 * Added conditional compilation of inference methods.
580 * VarSet is now implemented using a std::vector<Var> instead of a
581 std::set<Var>, which yields a significant speed improvement. Furthermore,
582 the implementation has been generalized, resulting in the small_set<T> class
583 which can be used to represent sets of small cardinality; VarSet is the
584 specialization with T = Var.
585 * Improved ClusterGraph implementation, yielding significant speedups
586 for the JunctionTree algorithm on large factorgraphs.
587
588 Code cleanup:
589 * Moved everything into namespace "dai".
590 * Renamed DEBUG to DAI_DEBUG to avoid conflicts.
591 * Replaced ENUM2,ENUM3,ENUM4,ENUM5,ENUM6 by single DAI_ENUM macro.
592 * Removed utils/remove_short_loops and matlab/remove_short_loops.
593 * Replaced sub_nb class in mr.h by boost::dynamic_bitset.
594 * Improved index.h:
595 - Renamed Index -> IndexFor
596 - Added some .reserve()'s to IndexFor methods which yields a
597 25% speedup of testregression
598 - Replaced multind by Permute
599 - Added MultiFor
600 - Added State
601 * New funcstionality of factor.h.
602 * Moved Properties and MaxDiff frameworks from InfAlg to each individual
603 inference algorithm, because the Properties framework was not as
604 convenient as I hoped, and not every inference algorithm needs a maxdiff
605 variable. Also, replaced some FactorGraph functionality in InfAlg by a
606 function that returns the FactorGraph. The result is cleaner (less
607 entangled) code.
608 * Removed x2x.
609 * Replaced Complex with real numbers (negative potentials are just too rare
610 to warrant the additional "complexity" :)).
611
612 Miscellaneous improvements:
613 * Now compiles also with MS Visual C++ (thanks to Jiuxiang Hu) and with
614 GCC under Cygwin.
615 * Contributions by Peter Gober:
616 - Renamed variable _N in mr.* for compatibility with g++ under Cygwin.
617 * Misc contributions by Giuseppe Passino:
618 - removed "using namespace std;" from header files - bad practice;
619 - moved header files in include/dai and sources in src;
620 - changed #ifndefs to GNU style;
621 - added extra warning checks (-W -Wextra) and fixed resulting warnings;
622 - dai::TProb:
623 o removed copy constructor and assignment operators (redundant);
624 o implementation of some methods via STL algorithms;
625 o added methods takeExp, takeLog, takeLog0 for transformation in-place;
626 o explicit constructor (prevents implicit conversion from size_t to TProb);
627 o added operator+,+=,-,-=, with argument T (for calculations in log-scale);
628 * Misc contributions by Christian Wojek:
629 - New FactorGraph constructor that constructs from given ranges of factors
630 and variables;
631 - Optimization of FactorGraph constructors using tr1::unordered_map.
632 * FactorGraph constructors no longer check for short loops (huge speed
633 increase for large factor graphs), nor for negative entries. Also, the
634 normtype is now Prob::NORMPROB by default.
635 * Improved MaxSpanningTreePrims algorithm (uses boost::graph).
636
637 Interface changes:
638 * VarSet::
639 - VarSet::stateSpace() -> nrStates(const VarSet &)
640 - VarSet( const std::set<Var> ) -> VarSet( begin, end, sizeHint=0 )
641 - VarSet( const std::vector<Var> ) -> VarSet( begin, end, sizeHint=0 )
642 - removed bool operator||
643 - operator&&(const VarSet&) -> intersects(const VarSet&)
644 - operator&&(const Var&) -> contains(const Var&)
645 * FactorGraph::
646 - delta(const Var &) -> delta(size_t)
647 - Delta(const Var &) -> Delta(size_t)
648 - makeCavity(const Var &) -> makeCavity(size_t)
649 - vars() -> vars
650 - factors() -> factors
651 - removed MakeFactorCavity(size_t)
652 - removed ExactMarginal(const VarSet &)
653 - removed ExactlogZ()
654 - removed updatedFactor(size_t)
655 - removed _normtype and NormType()
656 - removed hasShortLoops(...) and removeShortLoops(...)
657 - WriteToDotFile(const char *filename) -> printDot( std::ostream& os )
658 - undoProb(size_t) -> restoreFactor(size_t)
659 - saveProb(size_t) -> backupFactor(size_t)
660 - undoProbs(const VarSet &) -> restoreFactors(const VarSet &)
661 - saveProbs(const VarSet &) -> backupFactors(const VarSet &)
662 - ReadFromFile(const char*) returns void (throws on error)
663 - WriteToFile(const char*) returns void (throws on error)
664 - removed hasNegatives()
665 * RegionGraph::
666 - nr_ORs() -> nrORs()
667 - nr_IRs() -> nrIRs()
668 - ORs() -> ORs
669 - IRs() -> IRs
670 * *::Regenerate() -> *::construct()
671 * Renamed Index -> IndexFor
672 * Diffs:
673 - max() -> maxDiff()
674 - max_size() -> maxSize()
675 * Prob::max() -> Prob::maxVal()
676 * Factor::
677 - max() -> maxVal()
678 - part_sum() -> partSum()
679 * toc() in util.h now returns seconds as a double
680 * VarSet::operator&&
681 * Properties -> PropertySet
682
683
684 libDAI-0.2.1 (2008-05-26)
685 -------------------------
686
687 Bugfix release.
688 * added missing cstdio header in util.h
689 * fixed Properties in MR_CLAMPING_* and MR_EXACT_*
690 * added description of the factor graph fileformat
691 * improved Makefile
692
693
694 libDAI-0.2.0 (2006-11-30)
695 -------------------------
696
697 First public release.
698
699
700 0.1.5 (2006-11-30)
701 ------------------
702
703 Regressions
704
705 - tests/testlcbp and tests/testlcbp are broken.
706 - EXACT method does not work anymore.
707 - The Properties framework gives a speed penalty because of the lookup
708 costs involved; inner loops should be optimized.
709
710 General framework
711
712 - DAIAlg is now a template class; typedefs for DAIAlg<FactorGraph> and for
713 DAIAlg<RegionGraph> are provided. In this way, we do not have to write "wrapper"
714 functions to forward functionality from either FactorGraph or RegionGraph
715 to DAIAlg. Functionality like clamping can be implemented in FactorGraph
716 and in RegionGraph and no explicit interface is needed in descendants.
717 - New abstract base class InfAlg added, representing an inference algorithm,
718 from which DAIAlg<T> inherits. This solves the incompatibility problems of
719 DAIAlg<T> for different T (e.g. DAIAlg<FactorGraph> was incompatible with
720 DAIAlg<RegionGraph>). More work is required to reduce code duplication
721 (make FactorGraph part of InfAlg).
722 - Added generic interface (nrVars(), Vars(), nrFactors(), factor(size_t),
723 beliefs(), belief(VarSet &), ...) to InfAlg and descendants.
724 - Added a saveProbs/undoProbs interface to InfAlg and descendants that enables
725 one to save a few factors, modify them (e.g. clamp them), and then restore them
726 to their old values. Undo should also init the corresponding messages / beliefs.
727 This can be used if a given factor graph repeatedly needs to be clamped in
728 different ways and an approximation method is run for each clamping; using the
729 saveProbs/undoProbs can give a significant speed increase.
730 - Switched to a general Properties framework that handles the parameters of
731 all inference methods in a uniform manner. The Properties class is a map of
732 several properties in boost::any objects, indexed by their names (strings).
733 It can read from a stream and write to a stream. It is recursive, in the sense
734 that a Properties object can hold a variable of type Properties as well.
735 - Added a generic way of constructing inference algorithms from a factor graph,
736 name and properties object. Added the newInfAlg function which constructs
737 the requested object. This is used by LCBP, the Matlab interface and the
738 command line (test) interface.
739 - Added a generic enum framework for enum parameters. Although implemented as a
740 hack, it is quite useful in that it drastically simplifies and reduces the
741 amount of code for handling enum parameters.
742 - Provided generic functions for calculating marginals in different ways that
743 work for all approximate inference methods.
744
745 Bugfixes
746
747 - Fixed GBP free energy.
748 - Fixed bug in junctiontree (it didn't init the _vars variable).
749 - Corrected two bugs in operator&& and operator|| in VarSet (they returned
750 the logical NOT of what they should return).
751 - Fixed bug in RegionGraph::RecomputeOR(s).
752 - Fixed bug in utils/create_dreg_fg:
753 graph structure was not random for given parameters (forgot to call srand()).
754 - TreeEP bug workaround: use the complete junction tree instead of a subtree.
755 - Fixed bug in JTree::HUGIN() and JTree:ShaferShenoy() in case of junction tree
756 that consists of one outer region only.
757 - Fixed INIT bug in LCBP2::UpdatePancake().
758 - Fixed MaxDiffs flow (except for MR).
759
760 New functionality
761
762 - HAK supports several default cluster choices:
763 minimal (only factors)
764 delta (Markov blankets)
765 loop (all loops consisting of loops consisting of <loopdepth> or less variables)
766 Only the maximal clusters are used as outer clusters.
767 - Implemented TreeEP. It generalizes the heuristic method described in the
768 Minka & Qi paper for obtaining a tree with the most relevant interactions to
769 higher order interactions. Almost all optimizations described in the Minka & Qi
770 paper are used, except that evidence is passed over the whole tree instead of
771 relevant subsets (the latter is almost implemented but buggy). Also added
772 alternative (worst-case) algorithm that uses a maximum spanning tree on the
773 weighted graph where the weight between neighbours i and j is given by
774 N(psi,i,j), where psi is the product of all the factors involving both i and j
775 (which is an upper bound on the effective interaction between i and j).
776 - Implemented MR (MontanariRizzo) based on Bastian's code, but extended it
777 to be able to handle connectivities larger than 3 (in principle, up to 32).
778 It supports different initialization methods (the original RESPPROP,
779 the CLAMPING method and EXACT which uses JTree) and different update methods
780 (FULL and LINEAR).
781 - Implemented LCBP2, an analogon of LCBP which represents pancakes as little
782 networks and uses some approximate inference method on them for calculating
783 marginals.
784 - Now there are several LCBP variants (LCBP, LCBPI, LCBPJ, LCBPK, LCBPL);
785 LCBPJ works only for pairwise, LCBPK is LCBP improved for higher order
786 interactions and LCBPL is LCBPI improved for higher-order interactions.
787 - Wrote one single program utils/createfg for creating various types of
788 random factor graphs.
789 - Wrote utility to visualize factor graphs using graphviz.
790 (it uses the BOOST Program Options library)
791 - Added fginfo utility that displays some info about a .fg file.
792 - Implemented Factor::strength function that calculates the potential strength
793 N(psi,i,j) between variables i and j as described in cs.IT:0504030
794 - Wrote a general MatLab interface matlab/dai (similar to tests/test);
795 this unified the matlab functions dai, dai_bp, dai_mf, dai_jt, dai_tep, dai_cvm.
796 - Added MATLAB routine that returns contraction matrix A for BP convergence analysis.
797 - Implemented a MATLAB interface ai_potstrength for Factor::strength
798 - Added Martijn's x2x
799
800 Improvements of existing code
801
802 - Reimplemented RegionGraph and descendants: a RegionGraph ISA FactorGraph
803 and also a BipartiteGraph<FRegion,Region>. It now also keeps a map that
804 associates outer region indices to factor indices (no powers yet, this
805 is deemed superfluous) and provides functions to recompute (some of) the
806 outer regions from the factors.
807 - InfAlg descendants run() methods now stop immediately and return NAN in case
808 they detect NANs. Only BP does not do NAN checking for performance reasons.
809 - LCBP now works with factors containing zeroes (by defining x/0 = 0).
810 - HAK, GBP and DoubleLoop now conform to the standards for verbose reporting,
811 timing and convergence criteria.
812 - Implemented logZ() for JTree. It does the calculation during message-passing.
813 - Marginal2ndO now optionally divides by the single node beliefs (to the power n-2);
814 hopefully this will give more accurate approximations.
815 - Marginal and Marginal2ndO (optionally) use the new saveProbs/undoProbs functionality
816 for a faster way of calculating marginals, which does not require a call to init()
817 nor cloning the whole object for each clamping. This leads to a significant speedup.
818 - LCBP (and LCBP2) now have complete flexibility in the specification of the
819 inner method, i.e. the method used to generate the initial cavity approximations.
820 One can pass two strings, a name and a properties string, and LCBP simply invokes
821 newInfAlg to construct the corresponding inference algorithm and uses the generic
822 marginal functions to approximate cavity marginals.
823 - Replaced the global "method" variable by local properties and removed ai.h
824 - Added some methods to Factor (operators *, *=, /, /= with doubles as
825 second argument, operators -, +=, -= with other Factors as second
826 arguments, randomize(), RemoveFirstOrderInteractions) and similar
827 operations to Prob
828 - Moving towards boost::program_options for handling command line arguments
829 (tests/test is done).
830 - Renamed some FactorGraph methods:
831 nr_vars -> nrVars
832 nr_factors -> nrFactors
833 varind -> findVar
834 factorind -> findFactor
835 makeFacCavity -> makeFactorCavity
836 - LCBP_SEQMAXRES has been removed because it did strange things.
837 - Implemented RandomDRegularGraph
838 - Implemented JTree::calcMarginal for marginals that are not confined
839 within one cluster (using cut-set conditioning).
840 - Added isConnected() method to FactorGraph (some methods do not work with
841 disconnected factor graphs).
842 - Pair beliefs are now calculated in a symmetrical way by calcPairBeliefs
843 - Removed single node interaction "correction" code from clamping methods
844 - Removed calcCavityDist and calcCavityDist2ndO
845 - No longer depends on GSL.
846 - Increased portability by combining platform dependant utility functions
847 in util.{h,cpp}.
848 - Wrote *.m files providing help
849
850 Testing framework
851
852 - Made a new and significantly improved testing framework that provides most
853 functionality from the command line.
854 - The basis is provided by tests/test, which uses the newInfAlg functionality
855 and enables the user to easily compare from the command line different
856 inference methods on a given factorgraph. All parameters can be specified.
857 Output consists of CPU time, average and maximum single variable marginal
858 errors, relative logZ error and MaxDiff().
859 - tests/aliases.conf contains aliases for standard combinations of methods
860 and their options (which can be used in tests/test).
861 - tests/large contains several bash/python scripts that create random factor
862 graphs, compare several approximate inference algorithms (using tests/test) and
863 allow for easy visualization of the results using PyX.
864 - Added several .fg files for test purposes to /tests (e.g. two ALARM versions
865 alarm.fg and alarm_bnt.fg; testfast.fg, a 4x4 periodic Ising grid for
866 regression testing).
867 - Added a regression test to the Makefile which is included in the standard
868 target. It compares all inference methods on tests/testfast.fg with the
869 results stored in tests/testfast.out
870
871 Miscellaneous
872
873 - Expanded all tabs to spaces (":set tabstop 4\n:set expandtab\n:retab" in vim)
874 - Experimental MATLAB code added for StarEP approximation on cavity
875 - Renamed project to libDAI and changed directory name accordingly.
876 - Renamed JunctionTree to JTree.
877 - Fixed licensing (now it's officially GPL).
878 - Improved README
879
880
881 revision 252
882 ------------
883
884 Functionality
885 - Added RegionGraph, GBP, CVM and HAK (double-loop).
886 - Added JunctionTree (with two update algorithms, HUGIN and Shafer-Shenoy), which is a
887 RegionGraph.
888 - NormType is now chosen automatically (in case of negative factors, Prob::NORMLINF is used,
889 otherwise the default Prob::NORMPROB is used). Also, in case of negative factors, the
890 RegionGraph constructors assign each Factor to a unique outer region instead of dividing
891 it over all subsuming outer regions. See README for when negative factors are known to work
892 and when not.
893 - FactorGraph::FactorGraph(const vector<Factor>) only gives a warning in case of short loops,
894 it does not automatically merge factors anymore.
895 - Removed BP_SEQMAXRESNOCLEAR (all cavity initialization methods now are implicitly NOCLEAR)
896 - Added MATLAB interface functions ai_readfg, ai_removeshortloops and ai_bp
897 - Added LCBP-III type that should be equivalent to LCBP-II, but can handle zeroes
898 in potentials. Note that it is significantly slower than LCBP-II (and has to be reimplemented
899 such that it does not store the complete pancakes, but represents them as little factor graphs).
900
901 Implementation / code
902 - Made a seperate type WeightedGraph, which until now only implements Prim's
903 maximal spanning tree algorithm and is only used by the junction tree code. It might
904 be good to make it a class somewhere in the future and extend it's interface.
905 - Made a seperate class ClusterGraph, which is only used by the junction tree
906 code. It's main purpose is a graph-theoretical variable elimination algorithm.
907 - Implemented the heuristic "minimum-new-edges-in-clique-graph" for variable elimination.
908 - Massive code cleanup, moving towards "generic" programming style, using
909 multiple inheritance and polymorphism.
910 o BP, LCBP, MF, HAK and JunctionTree now inherit from a common DAIAlg class
911 o Made generic functions Marginal, Marginal2ndO, calcCavityDist, calcCavityDist2ndO, clamp
912 that can be used by FactorGraph-based DAIAlgs.
913 o Created TProb<T> class, which stores a probability vector (without the accompanying indexing
914 and VarSet) and provides functionality for it (which is used by TFactor<T>).
915 o Rewrote the VarSet class. It now caches its statespace(). It now privately inherits from set<Var>.
916 I had to overload the insert methods of set<Var> so that they calculate the new statespace.
917 o Rewrote the TFactor class. The TFactor class now HAS a TProb and HAS a VarSet.
918 - Rewrote BP to use the new TProb<T> interface. Performance of BP improved up to a factor 6 by:
919 o using Prob's instead of Factor's;
920 o splitting the multiplication of the messages into two parts (thanks to Vicenc!);
921 o optimizing the calculation of the beliefs (only the message calculations were optimized till now).
922 o replacing FactorGraph::_nb1 and _nb2 (which were set<size_t>) by vector<size_t>
923 - LCBP now seperately stores cavitydists and pancakes. Added InitPancakes() method
924 that takes the cavitydists and multiplies them with the relevant factors. This
925 resulted in an API change in AI which now accepts and returns initial cavitydists
926 instead of initial pancakes.
927
928 Minor changes
929 - Started writing DoxyGen documentation
930 - Renamed lcptab2fg.m matlab/ai_writefg.m
931 - Moved all matlab stuff to matlab/
932 - More detailed reporting (also reports clocks used).
933 - Marginal and Marginal2ndO now use *differences* in logZ to avoid NaNs.
934 - Improved testing suite.
935 - Removed logreal support.
936 - FactorGraph now also supports input streams and ignores comment lines in .fg files.
937 - Added tests/create_full_fg.cpp and tests/create_ising_fg.cpp which create
938 full and periodic 2D Ising networks according to some command line parameters.
939 - Now logZ really returns logZ instead of -logZ.
940 - Added FactorGraph::WriteToDotFile
941
942
943 0.1.4 (2006-04-13)
944 ------------------
945 - Added file IO routines to read and write factorgraphs.
946 - Added L-infinity normalization for use with (partially) negative factors.
947 - Renamed BetheF, MFF to logZ, which now use complex numbers to be able to
948 handle (partially) negative factors.
949 - Added test suite.
950 - All probabilities are now represented using double instead of LogReal<double>.
951 - Combined Alg and Alg3 into LCBP. Several update schemes possible.
952 - Combined several variants of BP into doBP. Several update schemes possible.
953 Now uses precalculated indices for optimization.
954 - Renamed Node -> Var and Potential -> Factor.
955 - Extensive code cleanup. More use of OO techniques. Changed API.
956 - MaxIter now means maximum number of passes (corresponding to number of
957 _parallel_ updates).
958 - MaxDiff now means the maximum L-infinity distance between the updated and
959 original single variable beliefs, for all AI methods.
960 - Implemented RBP which converges faster than BP for difficult problems.
961 - Now uses method parameter which is a bitmask combining outmethod and inmethod
962 (see ai.h).
963
964
965 0.1.3 (2006-03-22)
966 --------------------
967 - All AI methods now return maxdiff
968 - ai.cpp:
969 o Now returns maxdiffinner and maxdiffouter
970 o New BP2ndO innermethod (estimate only 2nd order cavity interactions)
971 o New InitCav outermethod (only create initial cavity distributions)
972 - bp.cpp:
973 o New CavityDist2ndO which estimates 2nd order cavity interactions
974 - Makefile:
975 o Bugfix: removed dependencies on algwim.*
976
977
978 0.1.2 (2006-02-28)
979 --------------------
980 - Cleaned up alg.cpp (removed Alg2 and its corresponding data structures).
981 - Added the possibility to provide initial cavity distributions as an input
982 argument to ai (not much error checking is done, so be careful).
983 - Potentials2mx now correctly sets the dimensions of the P field (i.e. for
984 the output arguments Q, Q0 of ai).
985 - Removed algwim.* since it does not work.
986
987
988 0.1.1 (2006-02-28)
989 --------------------
990 - The constructors of (Log)FactorGraph and LogFactorGraph from a
991 vector<(Log)Potential> now merge potentials to prevent short loops (of length
992 4) in the factor graph. These are used in ai to construct the factor graphs
993 from the psi argument. If compiled with DEBUG defined, the method calc_nb()
994 of BipGraph checks for the existence of short loops.
995 - Changed calling syntax of ai (now the actual syntax *does* correspond to its
996 description in the help).
997 - ai does not hook cout anymore (which caused weird segfaults).
998 - Fixed a bug in an assert statement in the matlab interface code in ai.cpp.
999 - Removed network.* since it is not useful.
1000
1001
1002 0.1.0 (2006-02-28)
1003 --------------------
1004 First version worthy of a version number.