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