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

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

141
142
143
144
145
146
147
148
                   "run(DMP);" );
       
        EDB.This().get("ROOT").print("");
        EquationOperator e = new EquationOperator();
       
        EDBUnit r = e.convert( EDB.This().get("ROOT.NODES.X.EQUATION"), "U", "X" );
        r.print("Inv ");
  }
View Full Code Here
232
233
234
235
236
237
238
239
240
241
242
243
244
245
   * @return true, if successful
   */
  public boolean hasTreeNode( EDBUnit sTree, String str )
  {   
    //iteration 
    EDBUnit ISA = sTree.getRel("ISA");
    if( ISA != null )
    for( String str1 : ISA.getMap().keySet() ){
      EDBUnit child = ISA.map.get(str1);
     
      if( hasTreeNode( child, str ) )
        return true;
    }  

View Full Code Here
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
   */
  public void copyTreeToETree( EDBUnit dNode, EDBUnit sTree )
  {
    // dNode.print("dNode ");
    // sTree.print("sTree ");
    EDBUnit n = dNode.createDummy(sTree.getData());
     //n.print("n ");
     //dNode.print("dNode ");
  //  System.out.println(dNode.getRel("ISA").strList.toString());
   
    //iteration 
    EDBUnit ISA = sTree.getRel("ISA");
    if( ISA != null )
    for( String str1 : ISA.getMap().keySet() ){
      EDBUnit child = ISA.map.get(str1);
     
      copyTreeToETree( n, child ); 
    }   
  }
View Full Code Here
297
298
299
300
301
302
303
304
305
306
307
308
309
310
   * @return the string from inverse iteration
   */
  public String getStringFromInvInteration( EDBUnit sTree, String str ){
   
    //iteration 
    EDBUnit ISA = sTree.getRel("ISA");
    if( ISA != null )
    for( String str1 : ISA.getMap().keySet() ){
      EDBUnit child = ISA.map.get(str1);
     
      str += getStringFromInvInteration( child, str ); 
    } 
   
    str += sTree.getData();
View Full Code Here
330
331
332
333
334
335
336
337
338
339
   * @param X the x
   * @param Y the y
   * @return the eDB unit
   */
  public EDBUnit convert( EDBUnit sTree, String X, String Y ){
    EDBUnit r = convert( sTree, X );
    r.resetAllData( X, Y );
       
    return r;
  }
View Full Code Here
344
345
346
347
348
349
350
351
352
353
354
355
356
357
   * @param sTree the s tree
   * @param X the x
   * @return the eDB unit
   */
  public EDBUnit convert( EDBUnit sTree, String X ){
    EDBUnit dTree = new EDBUnit();
    dTree.removeAllChildren();
    dTree.setName(X);
    dTree.setData(X);
   
    EDBUnit r = convertOperation( sTree.getOne().getOne(), dTree, X );
       
    return r;
  }
View Full Code Here
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
   * @return the eDB unit
   */
  public EDBUnit convertOperation( EDBUnit sNode, EDBUnit dNode, String X ){
    String strCurrent = sNode.getData();
    //System.out.println( strCurrent );
    EDBUnit cExcept = null;
    EDBUnit c0 = null;
    EDBUnit c1 = null; 
   
    //iteration
    int i = 0;
    EDBUnit ISA = sNode.getRel("ISA");
    //ISA.print("sNode ");
    if( ISA != null )
    for( String str1 : ISA.getMap().keySet() ){
      EDBUnit child = ISA.map.get(str1);
     
      if( i == 0 )
        c0 = child;
      else
        c1 = child;
      i++;
    } 
   
    //for nodes
    //System.out.println( strCurrent );
    String str = getComplementaryOperater(strCurrent);
    //System.out.println( str );
    if( str != null  ){
      dNode = dNode.createParent(str);
      
      if( !hasTreeNode(c0, X) ){
        copyTreeToETree(dNode, c0); 
        cExcept = c0;
      }else
      if( !hasTreeNode(c1, X) ){
        copyTreeToETree(dNode, c1);
        cExcept = c1;
      } 
      //dNode.print("dNode ");
    }else{
      return dNode;
    }
         
    //iteration
    i = 0;
    ISA = sNode.getRel("ISA");
    if( ISA != null )
    for( String str1 : ISA.getMap().keySet() ){
      EDBUnit child = ISA.map.get(str1);
     
      //child.print("Child ");
      //cExcept.print("cExcept ");
     
      //if( !cExcept.getData().equalsIgnoreCase(child.getData()) ){
      if( !cExcept.isSameData(child) ){
        EDBUnit r = convertOperation( child, dNode, X );
        if( r != null )
          return r;
      }
    }     
    
View Full Code Here
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
   * @param curDNCombination the discrete node combination
   * @param listDiscreteNodeCombination the list discrete node combination
   */
  public void convertFromCPTToCombinationList(EDBUnit cpt, DiscreteNodesCombination curDNCombination, ArrayList<DiscreteNodesCombination> listDiscreteNodeCombination){
    //iteration  
    EDBUnit ISA = cpt.getRel("ISA");
    if( ISA != null ){
      for( String str : ISA.getMap().keySet() ){
        EDBUnit child = ISA.map.get(str);
        DiscreteNodesCombination childDNCombination = new DiscreteNodesCombination();
        if( curDNCombination != null )
          childDNCombination.copy(curDNCombination);
        childDNCombination.mapValuesForAssingnment.put(child.getData(), str);
        convertFromCPTToCombinationList(child, childDNCombination, listDiscreteNodeCombination); 
      }
    }else{
      if( curDNCombination != null )
        listDiscreteNodeCombination.add(curDNCombination);
View Full Code Here
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
    if( strCurrent.equals("SLIST") ){
       if( newListCombination == null || newListCombination.isEmpty() ){  // in "p(x) = {A:0.4; B:0.6;}" this case, there is SLIST, but there is no IFSTATE.
         return;
      }
        
      EDBUnit ISA = eq.getRel("ISA");
      EDBUnit eqTemp = eq;
      if( ISA.getMap().size() == 1  )
        eqTemp = eq.get();
     
      if( strParent.equals("EXP") ){
        for( DiscreteNodesCombination ds : newListCombination ){
          ds.setEquation(eqTemp);
        }
      }else
      if( strParent.equals("if") ){
        for( DiscreteNodesCombination ds : oriListCombination ){
          if( !ds.EQ.hasChildren() )
            ds.setEquation(eqTemp);
        }
      }
    }
    
    //iteration  
    EDBUnit ISA = eq.getRel("ISA");
    if( ISA != null )
    for( String str : ISA.getMap().keySet() ){
      EDBUnit childEq = ISA.map.get(str);
      get_DiscreteNode_combination2(oriListCombination, childEq); 
    } 
  } 
View Full Code Here
43
44
45
46
47
48
49
50
51
52
53
   *
   * @param t2 the e unit
   * @return true, if successful
   */
  public boolean IsCPTEUnit(EDBUnit t2){
    EDBUnit t1 = EDB.This().get("ROOT.NODES."+strCurrentNode+".CPT");
   
    if( t1 == t2 ) return true;
   
    return false;
  }
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.