Package cu.repsystestbed.exceptions

Examples of cu.repsystestbed.exceptions.GenericTestbedException

56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
        Instance temp = (Instance)enu.nextElement();
        logger.info("Parsing " + temp);
        String[] feedbackInstance = new String[3];
        //go through each feedback line
       
        if(temp.numValues()!=3) throw new GenericTestbedException("Reputation line does not have 3 elements. This is illegal.");
       
        for(int i=0;i<temp.numValues();i++)
        {
          //number of values == 3
          feedbackInstance[i] = temp.stringValue(i);         
        }
        Agent src = new Agent(new Integer(feedbackInstance[0]));
        Agent sink = new Agent(new Integer(feedbackInstance[1]));
        Double reputation = new Double(feedbackInstance[2]);
       
        if(!repGraph.containsVertex(src))
        {
          repGraph.addVertex(src);
        }
       
        if(!repGraph.containsVertex(sink))
        {
          repGraph.addVertex(sink);
        }
       
        repGraph.addEdge(src, sink);
        ReputationEdge repEdge = (ReputationEdge) repGraph.getEdge(src, sink);
        repEdge.setReputation(reputation);
        System.out.println(repGraph);
      }
     
      return repGraph;

    } catch (Exception e)
    {
      logger.error("Error parsing arff file '" + arffFileName +"'.");
      logger.error(e);
      throw new GenericTestbedException("Error parsing arff file.", e);
    }
   
   
   
  }
View Full Code Here
46
47
48
49
50
51
52
53
  }
 
  @Override
  public Graph getGraph2Output() throws Exception
  {
    if(this.m_graph2Output.edgeSet().size()<1) throw new GenericTestbedException("No edges in reputation graph.");
    return (ReputationGraph) m_graph2Output;
  }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
    {
      Util.assertNotNull(m_graph2Listen);
    }
    catch(Exception e)
    {
      throw new GenericTestbedException("Call setGraph2Listen() first.", e);
    }
    //initialize the reputation graph
    if(outputGraphType == OutputGraphType.COMPLETE_GRAPH)
    {
      /*
       * For every src and sink in the input graph, create an edge in the output graph
       */
      Graph graphTransitive = ((Graph)this.m_graph2Listen).getTransitiveClosureGraph();
      for(Agent src: (Set<Agent>) graphTransitive.vertexSet())
      {
        for(Agent sink: (Set<Agent>) graphTransitive.vertexSet())
        {
          if(!src.equals(sink))
          {
            m_graph2Output.addVertex(src);
            m_graph2Output.addVertex(sink);
            m_graph2Output.addEdge(src, sink);
          }
         
        }
      }
    }
    else if(outputGraphType == OutputGraphType.TRANSITIVE_GRAPH)
    {
      /*
       * Find the transitive closure edges of the input graph and add them to the output grph
       */
      Graph graphTransitive = ((Graph)this.m_graph2Listen).getTransitiveClosureGraph();
      for(TestbedEdge edge : (Set<TestbedEdge>)graphTransitive.edgeSet())
      {
        Agent src = (Agent)edge.src;
        Agent sink = (Agent)edge.sink;
        m_graph2Output.addVertex(src);
        m_graph2Output.addVertex(sink);
        m_graph2Output.addEdge(src, sink);
      }
    }
    else if(outputGraphType == OutputGraphType.COPY_INPUT_GRAPH)
    {
      /*
       * Copy the edges in the input graph to the output graph
       */
      Set<TestbedEdge> edges = ((Graph)this.m_graph2Listen).edgeSet();
      for(TestbedEdge edge : edges)
      {
        Agent src = (Agent)edge.src;
        Agent sink = (Agent)edge.sink;
        m_graph2Output.addVertex(src);
        m_graph2Output.addVertex(sink);
        m_graph2Output.addEdge(src, sink);
      }
    }
    else
    {
      throw new GenericTestbedException("Unknown OutputGraphType.");
    }
  }
View Full Code Here
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
            double trustScore = calculateTrustScore(src, sink);
            //TODO - move this to preconditions and postconditions
            //ensure the trust score is in [0,1].
            if(!assertVariablePrecondition(trustScore))
            {
              throw new GenericTestbedException("Failed postconditions: assertVariablePrecondition()");
            }
           
            if(m_graph2Output.getEdge(src, sink) != null &&
                !(m_graph2Output.getEdge(src, sink) instanceof ReputationEdge))
            {
              throw new GenericTestbedException("Expected edge type is ReputationEdge.");
            }
           
            ReputationEdge repEdge = (ReputationEdge) m_graph2Output.getEdge(src, sink);
           
            //repEdge may be null. all edges in the graph this alg listens to may have been added but that is not
            //reflected in the reputation graph edge. So reputationGraph.getEdge(src, sink) may return null.
           
            if(repEdge==null)
            {
              if(!m_graph2Output.containsVertex(src)) m_graph2Output.addVertex(src);
              if(!m_graph2Output.containsVertex(sink)) m_graph2Output.addVertex(sink);
              m_graph2Output.addEdge(src, sink); 
              repEdge = (ReputationEdge) m_graph2Output.getEdge(src, sink); 
            }
           
            repEdge.setReputation(trustScore);
            m_graph2Output.setEdgeWeight(repEdge, trustScore);
            edgesTobeUpdated.add(repEdge);
          }
        }
      }
    }else if(outputGraphType == OutputGraphType.TRANSITIVE_GRAPH)
    {
     
      /**
       * Calculate trust scores of sink agents that are reachable from the source.
       * that is determine the transitive closure of the graph that this alg listens to
       * and set the weights of the edges.
       */
     
      Graph transitiveGraph = m_graph2Listen.getTransitiveClosureGraph();
      
      for(Agent src : agents)
      {
        Set<TestbedEdge> outgoingEdges = transitiveGraph.outgoingEdgesOf(src);
        for(TestbedEdge e : outgoingEdges)
        {
          double trustScore = calculateTrustScore(src, (Agent)e.sink);
          if(!assertVariablePrecondition(trustScore))
          {
            throw new GenericTestbedException("Failed postconditions: assertVariablePrecondition()");
          }
         
          if(!((ReputationEdge) m_graph2Output.getEdge(src, (Agent)e.sink) instanceof ReputationEdge))
          {
            throw new GenericTestbedException("Expected edge type is ReputationEdge.");
          }
         
          ReputationEdge repEdge = (ReputationEdge) m_graph2Output.getEdge(src, (Agent)e.sink);
         
          //repEdge may be null. see setFeedbackHistoryGraph(). a feedback history graph edge may have been added but that is not
          //reflected in the reputation graph edge. So reputationGraph.getEdge(src, sink) may return null.
         
          if(repEdge==null)
          {
            if(!m_graph2Output.containsVertex(src)) m_graph2Output.addVertex(src);
            if(!m_graph2Output.containsVertex((Agent)e.sink)) m_graph2Output.addVertex((Agent)e.sink);
            m_graph2Output.addEdge(src, (Agent)e.sink);
            repEdge = (ReputationEdge) m_graph2Output.getEdge(src, (Agent)e.sink);
            repEdge.setReputation(trustScore);
          }
          m_graph2Output.setEdgeWeight(repEdge, trustScore);
          edgesTobeUpdated.add(repEdge);
         
        }
      }
    }
    else
    {
      for(Agent src : agents)
      {
        Set<TestbedEdge> outgoingEdges = super.m_graph2Listen.outgoingEdgesOf(src);
        for(TestbedEdge e : outgoingEdges)
        {
          double trustScore = calculateTrustScore(src, (Agent)e.sink);
          if(!assertVariablePrecondition(trustScore))
          {
            throw new GenericTestbedException("Failed postconditions: assertVariablePrecondition()");
          }
         
          if(!((ReputationEdge) m_graph2Output.getEdge(src, (Agent)e.sink) instanceof ReputationEdge))
          {
            throw new GenericTestbedException("Expected edge type is ReputationEdge.");
          }
         
          ReputationEdge repEdge = (ReputationEdge) m_graph2Output.getEdge(src, (Agent)e.sink);
         
          if(repEdge==null)
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
      algorithm = (TrustAlgorithm) cls.newInstance();
    }catch(Exception e)
    {
      String msg = "Error loading trust algorithm with name " + className;
      logger.error(msg);
      throw new GenericTestbedException(msg, e);

    }
    return algorithm;
   
  }
View Full Code Here
104
105
106
107
108
109
110
111
112
113
114
    {
      Util.assertNotNull(m_graph2Listen);
    }
    catch(Exception e)
    {
      throw new GenericTestbedException("Call setGraph2Listen() first.", e);
    }
   
    m_graph2Output = new TrustGraph(new TrustEdgeFactory());
    //an edge in the trust graph means src trusts sink. So don't copy the edges from the rep graph. just copy the agents
    for(Agent agent : (Set<Agent>) m_graph2Listen.vertexSet())
View Full Code Here
37
38
39
40
41
42
43
44
45
46
     
    }catch(Exception e)
    {
      String msg = "Error loading reputation algorithm with name " + className;
      logger.error(msg);
      throw new GenericTestbedException(msg, e);
    }
    return algorithm;
   
  }
View Full Code Here
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
        Instance temp = (Instance)enu.nextElement();
        logger.info("Parsing " + temp);
        String[] feedbackInstance = new String[3];
        //go through each feedback line
       
        if(temp.numValues()!=2) throw new GenericTestbedException("Trust line does not have 2 elements. This is illegal.");
       
        for(int i=0;i<temp.numValues();i++)
        {
          //number of values == 2
          feedbackInstance[i] = temp.stringValue(i);         
        }
        Agent src = new Agent(new Integer(feedbackInstance[0]));
        Agent sink = new Agent(new Integer(feedbackInstance[1]));
       
        if(!trustGraph.containsVertex(src))
        {
          trustGraph.addVertex(src);
        }
       
        if(!trustGraph.containsVertex(sink))
        {
          trustGraph.addVertex(sink);
        }
       
        trustGraph.addEdge(src, sink);
       
      }

    } catch (Exception e)
    {
      logger.info("Error parsing arff file '" + arffFileName +"'.");
      logger.info(e.getStackTrace());
      throw new GenericTestbedException("Error parsing arff file.", e);
    }
   
    return trustGraph;
   
  }
View Full Code Here
TOP

Related Classes of cu.repsystestbed.exceptions.GenericTestbedException

  • cu.repsystestbed.algorithms.ReputationAlgorithm
  • cu.repsystestbed.algorithms.TrustAlgorithm
  • cu.repsystestbed.util.ReputationGraphCreator
  • cu.repsystestbed.util.TrustGraphCreator
    • 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.