welcome: please sign in
location: Diff for "AndrewThomas"
Differences between revisions 3 and 4
Revision 3 as of 2008-03-07 14:56:15
Size: 627
Editor: AndrewThomas
Comment:
Revision 4 as of 2008-03-07 15:03:54
Size: 1027
Editor: AndrewThomas
Comment:
Deletions are marked like this. Additions are marked like this.
Line 14: Line 14:
The algorithm for internalzing pointers to nodes in a graph uses a vector storing pointers
to each node in the graph. It would be good to dispose of this vector as soon as possible
but not before the last pointer to node has been internalized. I think the MCMC updaters
might contain pointers to anomylous nodes in the graphical model. Monitors will only have
pointers to name nodes in graph.

Andrew Thomas

Email: <helsinkiant AT gmail DOT com>

Working on binary file format for parse tree, symbol table and virtual graphical model. The symbol table acts as alink between the parse tree and the virtual graphical model. The symbol table is externalized in two parts: the first containing information about names in the OpenBUGS model, the second pointers to named nodes in the virstual graphical model and then information (including pointers to anomynous nodes) associated with nodes in the virstual graphical model.

The algorithm for internalzing pointers to nodes in a graph uses a vector storing pointers to each node in the graph. It would be good to dispose of this vector as soon as possible but not before the last pointer to node has been internalized. I think the MCMC updaters might contain pointers to anomylous nodes in the graphical model. Monitors will only have pointers to name nodes in graph.


CategoryHomepage

AndrewThomas (last edited 2008-03-07 15:03:54 by AndrewThomas)