7795ce48378d04c41e3273762d32331f1eda97e4

1 libDAI-0.2.2 (2008-??-??)

2 -------------------------

4 * Pervasive change of BipartiteGraph implementation (based on an idea by

5 Giuseppe Passino). BipartiteGraph no longer stores the node properties (former

6 _V1 and _V2), nor does it store a dense adjacency matrix anymore, nor an edge

7 list. Instead, it stores the graph structure as lists of neighboring nodes.

8 This yields a significant memory/speed improvement for large factor graphs, and

9 is more elegant as well. Iterating over neighbors is made easy by using

10 boost::foreach.

11 * Improved index.h (merged from SVN head):

12 - Renamed Index -> IndexFor

13 - Added some .reserve()'s to IndexFor methods which yields a

14 25% speedup of testregression

15 - Replaced multind by Permute

16 - Added MultiFor

17 - Added State

18 * Moved everything into namespace "dai"

19 * Renamed DEBUG to DAI_DEBUG to avoid conflicts

20 * Added conditional compilation of inference methods

21 * Contributions by Peter Gober:

22 - Renamed variable _N in mr.* for compatibility with g++ under cygwin

23 * Contributions by Giuseppe Passino:

24 - removed "using namespace std;" from header files - bad practice

25 - moved header files in include/dai and sources in src

26 - changed #ifndefs to GNU style

27 - added extra warning checks (-W -Wextra) and fixed resulting warnings

28 - dai::TProb:

29 o removed copy constructor and assignment operators (redundant)

30 o implementation of some methods via STL algorithms

31 o added methods takeExp, takeLog, takeLog0 for transformation in-place

32 o explicit constructor (prevents implicit conversion from size_t to TProb)

33 o added operator+,+=,-,-=, with argument T (for calculations in log-scale)

34 - Added "logdomain" property to BP, a boolean that controls whether

35 calculations are done in the log-domain or in the linear domain;

36 doing calculations in the log-domain may help if the numerical range

37 of a double is too small.

38 * Contributions by Christian Wojek:

39 - New FactorGraph constructor that constructs from given ranges of factors

40 and variables

41 - Optimization of FactorGraph constructors using tr1::unordered_map.

42 * FactorGraph constructors no longer check for short loops (huge speed

43 increase for large factor graphs), nor for negative entries. Also, the

44 normtype is now Prob::NORMPROB by default.

45 * Small optimization in Diffs

46 * Interface changes:

47 - VarSet::stateSpace() -> VarSet::states()

48 - FactorGraph::

49 delta(const Var &) -> delta(size_t)

50 Delta(const Var &) -> Delta(size_t)

51 makeCavity(const Var &) -> makeCavity(size_t)

52 vars() -> vars

53 factors() -> factors

54 removed MakeFactorCavity(size_t)

55 removed ExactMarginal(const VarSet &)

56 removed ExactlogZ()

57 moved isConnected() to BipartiteGraph

58 - RegionGraph::

59 nr_ORs() -> nrORs()

60 nr_IRs() -> nrIRs()

61 ORs() -> ORs

62 IRs() -> IRs

63 - *::Regenerate() -> *::create()

64 - Renamed Index -> IndexFor

65 - Diffs:

66 max() -> maxDiff()

67 max_size() -> maxSize()

68 - Prob::max() -> Prob::maxVal()

69 - Factor::max() -> Factor::maxVal()

70 - toc() in util.h now returns seconds as a double

71 * Added possibility to build for Windows in Makefile

74 libDAI-0.2.1 (2008-05-26)

75 -------------------------

77 Bugfix release.

78 * added missing cstdio header in util.h

79 * fixed Properties in MR_CLAMPING_* and MR_EXACT_*

80 * added description of the factor graph fileformat

81 * improved Makefile

84 libDAI-0.2.0 (2006-11-30)

85 -------------------------

87 First public release.