Package edu.gmu.seor.prognos.unbbayesplugin.cps.datastructure

Examples of edu.gmu.seor.prognos.unbbayesplugin.cps.datastructure.EDBUnit

120
121
122
123
124
125
126
127
128
129
130
   *
   * @param n the n
   */
  public void createEDBNodesFromUnBBayeNode(Node n){  
   
    EDBUnit cNode = null;
   
    cNode = EDB.This().get("ROOT.NODES."+n.getName());
    if( cNode != null ) return;
     
    // create EDB node
View Full Code Here
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
   * Creates the parent edb nodes.
   *
   * @param n the n
   */
  public void createParentEDBNodes(Node n){  
    EDBUnit cNode = EDB.This().get("ROOT.NODES."+n.getName());
    EDBUnit nodeFlag = cNode.get("INFO.SEARCH_FLAG");
    
    if( nodeFlag.getData().equals("TRUE") ) return;
     
    // set flag
    nodeFlag.setData("TRUE");
   
    //create parents
    ArrayList<Node> nodeParents = n.getParents();
    for( Node pNode : nodeParents ){
      CPSCompilerMain.This().createPARENT(EDB.This().get("ROOT.NODES."+n.getName()), pNode.getName());
View Full Code Here
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
   * Creates the edb nodes cpt.
   *
   * @param n the n
   */
  public void createEDBNodesCPT(Node n){  
    EDBUnit cNode = EDB.This().get("ROOT.NODES."+n.getName());
    EDBUnit nodeFlag = cNode.get("INFO.SEARCH_FLAG");
    
    if( nodeFlag.getData().equals("TRUE") ) return;
     
    // set flag
    nodeFlag.setData("TRUE");
     
    if( n.getType() == Node.PROBABILISTIC_NODE_TYPE ) {
      //create cpt
      CPSCompilerMain.This().createCPT(EDB.This().get("ROOT.NODES."+n.getName()));  
     
      int coord[] = new int[n.getParentNodes().size()+1];
      EDBUnit cpt = EDB.This().get("ROOT.NODES."+n.getName()+".CPT");
      PotentialTable auxTab = (PotentialTable) ((IRandomVariable) n).getProbabilityFunction();
     
      getNewStatesValueToBNNode( n, cpt,  coord, auxTab );
     
      //set script from BN to EDB
View Full Code Here
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
   * @param coord the coord
   * @param auxTab the aux tab
   * @return the new states value to bn node
   */
  public void getNewStatesValueToBNNode(Node cNode, EDBUnit lastCPT, int coord[], PotentialTable auxTab){ 
    EDBUnit lastCPTISA = lastCPT.getRel("ISA");
     if(lastCPTISA != null && lastCPTISA.map.size() != 0 ){
      for( String str : lastCPTISA.map.keySet() ){
        EDBUnit t = lastCPTISA.map.get(str); 
       
        int variableIndex = auxTab.indexOfVariable(t.getData());
        Node n = (Node)auxTab.getVariableAt(variableIndex);
        coord[variableIndex] = getStateIndexFromBN(n, t.getName());
       
        getNewStatesValueToBNNode(cNode, t, coord, auxTab);
      }
    }
    else{   
View Full Code Here
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
       
    String strFirstStateName = nextNode.getName();

    // if this node is Continuous, it don't need to add the last state. The last state will be ignored.
    if( type.equals("Continuous") || type.equals("Discretized") ){
      EDBUnit stateSecond = nextNode.getNext();
      if( stateSecond == null )
        return;

      strFirstStateName = "[" + nextNode.getName() +", "+ stateSecond.getName() + "]";
     
    } 
     
    cNode.appendState(strFirstStateName); 
   
View Full Code Here
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
   * @param stateIndexMap the state index map
   * @param auxTab the aux tab
   */
  public void AddNewStatesValueToBNNode(String type, EDBUnit lastCPT, int coord[], ArrayMap<Object, Integer> stateIndexMap, PotentialTable auxTab){ 
    //finding last row of CPT            EX) ROOT.NODES.Child.CPT.5.[DATA]:Number.high.[DATA]:Height.
    EDBUnit lastCPTISA = lastCPT.getRel("ISA");
     if(lastCPTISA != null && lastCPTISA.map.size() != 0 ){
      for( String str : lastCPTISA.map.keySet() ){
        EDBUnit t = lastCPTISA.map.get(str);
        //t.print("");
        //System.out.println(auxTab);
        int variableIndex = auxTab.indexOfVariable( t.getData() );
        Node n = (Node)auxTab.getVariableAt(variableIndex);
        coord[variableIndex] = getStateIndexFromBN( n, t.getName() );
       
        AddNewStatesValueToBNNode(type, t, coord, stateIndexMap, auxTab);
      }
    }
    else{   
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
      return;
   
    String strFirstStateName = state.getName();
    // if this node is Continuous, it don't need to add the last state. The last state will be ignored.
    if( type.equals("Continuous") || type.equals("Discretized") ){
      EDBUnit stateSecond = state.getNext();
      if( stateSecond == null )
        return;

      strFirstStateName = "[" + state.getName() +", "+ stateSecond.getName() + "]";
     
    } 
   
    state.print("");
    coord[0] = stateIndexMap.get( strFirstStateName );
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
  /**
   * Reset search flag.
   */
  public void resetSearchFlag()
  {
    EDBUnit nodes = EDB.This().get("ROOT.NODES");
    //reset all nodes' search flags
    EDBUnit lastCPTISA = nodes.getRel("ISA");
     if(lastCPTISA != null && lastCPTISA.map.size() != 0 ){
      for( String str : lastCPTISA.map.keySet() ){
        EDBUnit node = lastCPTISA.map.get(str);
        EDBUnit nodeFlag = node.get("INFO.SEARCH_FLAG");
        nodeFlag.setData("FALSE");
              tempENode = node;
      }
     }
  }
View Full Code Here
492
493
494
495
496
497
498
499
500
501
502
503
    CPSDialog.This().insertTextOut("Inference Results:");
    countTree = 0;
    sizeTree = 0;
   
    if( str != null && !str.equals("") && curNode != null ){
      EDBUnit nodeEQ = EDB.This().get("ROOT.NODES."+curNode.getName()+".SCRIPT");
      nodeEQ.setData(str);
    }
     
    resetSearchFlag();
    SearchAvailableNodeAndCompile(tempENode);
    resetSearchFlag(); 
View Full Code Here
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
  public void SearchAvailableNodeAndCompile(EDBUnit nodeNext)
  {  
    if( nodeNext == null )
      return;
   
    EDBUnit node = EDB.This().get("ROOT.NODES."+nodeNext.getName());
       
    if( node == null )
      return;
   
    EDBUnit nodeFlag;
    EDBUnit nodeEQ;
    nodeFlag = node.get("INFO.SEARCH_FLAG");
    nodeEQ = node.get("SCRIPT");
    
    EDBUnit parents = node.get("PARENTS");
    SearchAvailableNodeAndCompile(parents.getNext());
   
    if( nodeFlag.getData().equals("TRUE") ){
      SearchAvailableNodeAndCompile(nodeNext.getNext());
      return;
    }
  
    nodeFlag.setData("TRUE");
    //1. set current node to compiler
    CPSCompilerMain.This().setCurrentNode(node.getName());
   
    //text
    CPSDialog.This().insertTextOut("Compiling (" + node.getName() + ")", 1);
    
    //2. Compile node
    CPSCompilerMain.This().compile(nodeEQ.getData());

    //text
    CPSDialog.This().insertTextOut("Compiling (" + node.getName() + ") was done.", 1);
    
    //3. Convert node to UnBBayes'node
     convertEDBToBN(mapBNNodes.get(node));
      
    EDBUnit children = node.get("CHILDREN");
    SearchAvailableNodeAndCompile(children.getNext());
  }
View Full Code Here
TOP

Related Classes of edu.gmu.seor.prognos.unbbayesplugin.cps.datastructure.EDBUnit

  • DMP_with_UBN_PROGNOS_Continuous_Test
  • DMP_with_UBN_PROGNOS_Discrete_Test
  • edu.gmu.seor.prognos.unbbayesplugin.continuous.ssbn.HybridLaskeyAlgorithmSSBNGenerator
  • edu.gmu.seor.prognos.unbbayesplugin.cps.controller.CPSController
  • edu.gmu.seor.prognos.unbbayesplugin.cps.converter.SDB2UDB
  • edu.gmu.seor.prognos.unbbayesplugin.cps.converter.UDB2SDB
  • edu.gmu.seor.prognos.unbbayesplugin.cps.CPSCompiler
  • edu.gmu.seor.prognos.unbbayesplugin.cps.CPSCompiler_CPTCreataion
  • edu.gmu.seor.prognos.unbbayesplugin.cps.CPSCompiler_Default
  • edu.gmu.seor.prognos.unbbayesplugin.cps.CPSCompilerMain
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.