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