00001 /* 00002 * All of the documentation and software included in the 00003 * Alchemy Software is copyrighted by Stanley Kok, Parag 00004 * Singla, Matthew Richardson, Pedro Domingos, Marc 00005 * Sumner, Hoifung Poon, and Daniel Lowd. 00006 * 00007 * Copyright [2004-08] Stanley Kok, Parag Singla, Matthew 00008 * Richardson, Pedro Domingos, Marc Sumner, Hoifung 00009 * Poon, and Daniel Lowd. All rights reserved. 00010 * 00011 * Contact: Pedro Domingos, University of Washington 00012 * (pedrod@cs.washington.edu). 00013 * 00014 * Redistribution and use in source and binary forms, with 00015 * or without modification, are permitted provided that 00016 * the following conditions are met: 00017 * 00018 * 1. Redistributions of source code must retain the above 00019 * copyright notice, this list of conditions and the 00020 * following disclaimer. 00021 * 00022 * 2. Redistributions in binary form must reproduce the 00023 * above copyright notice, this list of conditions and the 00024 * following disclaimer in the documentation and/or other 00025 * materials provided with the distribution. 00026 * 00027 * 3. All advertising materials mentioning features or use 00028 * of this software must display the following 00029 * acknowledgment: "This product includes software 00030 * developed by Stanley Kok, Parag Singla, Matthew 00031 * Richardson, Pedro Domingos, Marc Sumner, Hoifung 00032 * Poon, and Daniel Lowd in the Department of Computer Science and 00033 * Engineering at the University of Washington". 00034 * 00035 * 4. Your publications acknowledge the use or 00036 * contribution made by the Software to your research 00037 * using the following citation(s): 00038 * Stanley Kok, Parag Singla, Matthew Richardson and 00039 * Pedro Domingos (2005). "The Alchemy System for 00040 * Statistical Relational AI", Technical Report, 00041 * Department of Computer Science and Engineering, 00042 * University of Washington, Seattle, WA. 00043 * http://www.cs.washington.edu/ai/alchemy. 00044 * 00045 * 5. Neither the name of the University of Washington nor 00046 * the names of its contributors may be used to endorse or 00047 * promote products derived from this software without 00048 * specific prior written permission. 00049 * 00050 * THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY OF WASHINGTON 00051 * AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED 00052 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED 00053 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 00054 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY 00055 * OF WASHINGTON OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, 00056 * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 00057 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 00058 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00059 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 00060 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 00061 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 00062 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN 00063 * IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00064 * 00065 */ 00066 #ifndef _BPLINK_H_Jan_2008 00067 #define _BPLINK_H_Jan_2008 00068 00069 #include "util.h" 00070 #include "mrf.h" 00071 #include "array.h" 00072 #include <math.h> 00073 00074 using namespace std; 00075 using namespace __gnu_cxx; 00076 00077 class BPNode; 00078 class BPFactor; 00079 00083 class BPLink 00084 { 00085 public: 00086 00087 BPLink(BPNode * const & node, BPFactor * const & factor, 00088 int & reverseNodeIndex, int & reverseFactorIndex, 00089 int & predIndex, double & cnt) 00090 { 00091 node_ = node; 00092 factor_ = factor; 00093 reverseNodeIndex_ = reverseNodeIndex; 00094 reverseFactorIndex_ = reverseFactorIndex; 00095 predIndex_ = predIndex; 00096 cnt_ = cnt; 00097 } 00098 00099 BPNode * getNode() { return node_;} 00100 BPFactor * getFactor() {return factor_;} 00101 int getReverseNodeIndex() { return reverseNodeIndex_;} 00102 int getReverseFactorIndex() { return reverseFactorIndex_;} 00103 int getPredIndex() { return predIndex_;} 00104 double getCount() {return cnt_;} 00105 00106 ostream& print(ostream& out); 00107 00108 private: 00109 BPNode * node_; 00110 BPFactor * factor_; 00111 int reverseNodeIndex_; 00112 int reverseFactorIndex_; 00113 //Index of the pred amongst the predicates in the corresponding 00114 // clause (factor) 00115 int predIndex_; 00116 double cnt_; 00117 }; 00118 00119 #endif 00120