Package cu.repsystestbed.entities

Examples of cu.repsystestbed.entities.Agent

63
64
65
66
67
68
69
70
71
72
73
74
        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);
View Full Code Here
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
    int initialSize = edges.size();
   
    Set<TestbedEdge> tempEdges = graph.outgoingEdgesOf(src);
    for(TestbedEdge e : tempEdges)
    {
      Agent tempSink = (Agent) e.sink;
      if(tempSink != null)
      {
        if(isPresent(agentsVisited, tempSink))
        {
          if(errorAtLoop) throw new Exception("Loop found. Stopping DFS.");
        }
        else
        {
          agentsVisited.add(src);
          if(tempSink.equals(sink))
          {
            edges.add(e);
          }
          else
          {
View Full Code Here
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
    }
 
  public static void main(String[] args) throws Exception
  {
    ReputationGraph repGraph = new ReputationGraph(new ReputationEdgeFactory());
    Agent a0 = new Agent();
    Agent a1 = new Agent();
    Agent a2 = new Agent();
    Agent a3 = new Agent();
    Agent a4 = new Agent();
   
    repGraph.addVertex(a0);
    repGraph.addVertex(a1);
    repGraph.addVertex(a2);
    repGraph.addVertex(a3);
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
    if(produceCompleteGraph)
    {
      Set<FeedbackHistoryGraphEdge> edges = ((FeedbackHistoryGraph)this.m_graph2Listen).edgeSet();
      for(FeedbackHistoryGraphEdge 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
    {
      FeedbackHistoryGraph feedbackHistoryGraphTransitive = ((FeedbackHistoryGraph)this.m_graph2Listen).getTransitiveClosureGraph();
      Set<FeedbackHistoryGraphEdge> edges = feedbackHistoryGraphTransitive.edgeSet();
      for(FeedbackHistoryGraphEdge 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);
      }
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
    if(produceCompleteGraph)
    {
      Set<ReputationEdge> edges = ((ReputationGraph)super.m_graph2Listen).edgeSet(); //should be ok to cast here
      for(ReputationEdge 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);
        //not copying the reputation weights. should you? Probably not.
      }
     
    }else
    {
      ReputationGraph ReputationGraphTransitive = ((ReputationGraph)this.m_graph2Listen).getTransitiveClosureGraph();
      Set<ReputationEdge> edges = ReputationGraphTransitive.edgeSet();
      for(ReputationEdge 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);
      }
     
View Full Code Here
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
       * 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);
      }
    }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
75
        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);
        }
View Full Code Here
217
218
219
220
221
222
223
224
225
226
227
   
    //we have all the groups and the strategies associated with them. Now generate the feedbacks
    //create the agents first
    for(Group g : groups)
    {
      for(int i=0;i<g.getMaxNumOfAgents();i++) g.joinGroup(new Agent());
    }
    //create the feedbacks based on the strategies
    for(Group sourceGroup : groups)
    {
      for(TargetGpStrAssignment assignment : sourceGroup.getTargetGpStrategyAssignments())
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
370
        for(int i=0;i<temp.numValues();i++)
        {
          //number of values == 3
          feedbackInstance[i] = temp.stringValue(i);         
        }
        Agent assessor = new Agent(new Integer(feedbackInstance[0]));
        Agent assessee = new Agent(new Integer(feedbackInstance[1]));
        Double value = new Double(feedbackInstance[2]);
       
        Feedback f = new Feedback(assessor, assessee, value);
        feedbacks.add(f);
        logger.info("Added " + f );
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
    try
    {
      //add vertices
      for(Object o : m_graphModel.vertexSet())
      {
        Agent a = (Agent) o;
        mxCell cell = (mxCell) m_graph.insertVertex(parent, new Integer(a.id).toString(), new Integer(a.id).toString(), 20, 20, 20, 20, "ROUNDED");
        jGraphCells.put(new Integer(a.id).toString(), cell);
      }
      //add edges
      for(Object o : m_graphModel.edgeSet())
View Full Code Here
TOP

Related Classes of cu.repsystestbed.entities.Agent

  • cu.repsystestbed.algorithms.examples.EigenTrust
  • cu.repsystestbed.algorithms.examples.EigenTrust1a
  • cu.repsystestbed.algorithms.examples.ManagingTrust
  • cu.repsystestbed.algorithms.examples.ManagingTrustCentralStore
  • cu.repsystestbed.algorithms.examples.PeerTrust
  • cu.repsystestbed.algorithms.ReputationAlgorithm
  • cu.repsystestbed.algorithms.ReputationAlgorithmType1b
  • cu.repsystestbed.algorithms.ReputationAlgorithmType2
  • cu.repsystestbed.graphs.ReputationGraph
  • cu.repsystestbed.gui.GraphMouseAdapter
    • 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.