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