Package cu.repsystestbed.entities

Examples of cu.repsystestbed.entities.Agent

111
112
113
114
115
116
117
118
119
120
121
          if(feedback.value >= threshold2Satisfy) sij++;
          else sij--;
        }
       
        if(sij<1) sij=0;
        Agent sinkTemp = (Agent)edge.sink;
        if(this.agentIdmapping.get(source.id) > cijMatrix.length || this.agentIdmapping.get(sinkTemp.id) > cijMatrix.length)
          throw new Exception("Array out of bounds exception will occur. Problem with internal id mapping.");
        cijMatrix[this.agentIdmapping.get(source.id)][this.agentIdmapping.get(sinkTemp.id)] = sij;       
      }
    }
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
            if(feedback.value >= threshold2Satisfy) sij++;
            else sij--;
          }
         
          if(sij<1) sij=0;
          Agent sinkTemp = (Agent)edge.sink;
          if(this.agentIdmapping.get(source.id) > cijMatrix.length || this.agentIdmapping.get(sinkTemp.id) > cijMatrix.length)
            throw new Exception("Array out of bounds exception will occur. Problem with internal id mapping.");
          cijMatrix[this.agentIdmapping.get(source.id)][this.agentIdmapping.get(sinkTemp.id)] = sij;   
        }
      }
View Full Code Here
141
142
143
144
145
146
147
148
149
150
  private boolean nodeAlreadyVisited(ArrayList nodesVisited, Agent b)
  {
    Iterator it = nodesVisited.iterator();
    while(it.hasNext())
    {
      Agent a = (Agent)it.next();
      if(a.id == b.id) return true;
    }
    return false;
  }
View Full Code Here
52
53
54
55
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
          String agentIdString = (String) cell.getValue();
          try
          {
            int agentId = new Integer(agentIdString);
            Util.assertNotNull(m_viewer.m_graphModel);
            Set<TestbedEdge> edges = m_viewer.m_graphModel.incomingEdgesOf(new Agent(agentId));
            Util.assertNotNull(edges);
            if(edges.size() > 0)
            {
              display += "\n" + "Incoming Edges:" + "\n";
            }
           
            for(TestbedEdge e : edges)
            {
              display += e.src + "\n";
              if(e instanceof FeedbackHistoryGraphEdge)
              {
                FeedbackHistoryGraphEdge fhe = (FeedbackHistoryGraphEdge) e;
                display += "Feedbacks: "  + fhe.toString3() + "\n";
              }
              else if(e instanceof ReputationEdge)
              {
                ReputationEdge re = (ReputationEdge) e;
                display += "Reputation: "  + re.getReputation() + "\n";
              }
             
            }
           
            display += "--";
           
            edges = m_viewer.m_graphModel.outgoingEdgesOf(new Agent(agentId));
            Util.assertNotNull(edges);
            if(edges.size() > 0)
            {
              display += "\n" + "Outgoing Edges:" + "\n";
            }
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
     * @param id the ID of the agent that must exist
     * @param caller The graph to search in for the agent
     * @return An instance of the Agent that is to exist in the graph
     */
    protected Agent ensureAgentExists(int id, JungAdapterGraph<Agent, TestbedEdge> caller) {
        Agent tempAgent = new Agent(id);
        for (Agent agent : caller.getVertices()) {
            if (agent.equals(tempAgent)) {
                return agent;
            }
        }
View Full Code Here
34
35
36
37
38
39
40
41
42
43
44
     * @param event The TrustLogEvent that is being processed
     * @param forward Whether or not the graph is being played forward
     */
    @Override
    public void graphEvent(TrustLogEvent event, boolean forward) {
        Agent src = ensureAgentExists(event.getAssessor(), this), sink = ensureAgentExists(event.getAssessee(), this);
        SimFeedbackEdge dynEdge = (SimFeedbackEdge) ensureEdgeExists(src, sink, this);
        SimFeedbackEdge refEdge = (SimFeedbackEdge) referenceGraph.findEdge(src, sink);
        double feedback = event.getFeedback();
        if (forward) {
            //Add the feedback to the full edge so it can be seen in the viewer           
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
     * @param event The current event being processed that contains the ids of the assessor and assesse and feedback given
     */
    @Override
    public void graphConstructionEvent(TrustLogEvent event) {
        if (event != null) {
            Agent src = ensureAgentExists(event.getAssessor(), referenceGraph);
            Agent sink = ensureAgentExists(event.getAssessee(), referenceGraph);
            ensureEdgeExists(src, sink, referenceGraph);
        }
      
    }
View Full Code Here
289
290
291
292
293
294
295
296
297
298
299
300
301
302
   
  }
 
  public static void main(String[] args) throws Exception
  {
    Agent a = new Agent();
    Agent b = new Agent();
    Agent c = new Agent();
    Agent d = new Agent();
    Feedback tr = new Feedback(a,b,0.2);
    Feedback tr1 = new Feedback(c,b,0.2);
    Feedback tr2 = new Feedback(d,b,0.2);
    Feedback tr3 = new Feedback(b,a,0.2);
    Feedback tr4 = new Feedback(c,a,0.2);
View Full Code Here
169
170
171
172
173
174
175
176
177
178
179
      crnormi[i]=0;
    }
   
    for(int i=0;i<numArbitraryAgentsToPick;i++)
    {
      Agent arbAgent = new Agent(arbitraryAgents[i]);
      int complaintsAgainst = store.queryComplaintsAgainst(arbAgent, sink);
      logger.info("Complaints against:: Arbitrary agent " + arbAgent + " returned " + complaintsAgainst + " about " + sink);
      int complaintsFiled = store.queryComplaintsby(arbAgent, sink);
      logger.info("Complaints by:: Arbitrary agent " + arbAgent + " returned " + complaintsFiled + " about " + sink);
      cri[arbitraryAgents[i]] = complaintsAgainst;
View Full Code Here
160
161
162
163
164
165
166
167
168
169
170
171
  {
    ReputationGraph temp = new ReputationGraph(new ReputationEdgeFactory());
    Set<FeedbackHistoryGraphEdge> edges = f.edgeSet();
    for(FeedbackHistoryGraphEdge edge : edges)
    {
      Agent src = (Agent)edge.src;
      Agent sink = (Agent)edge.sink;
      temp.addVertex(src);
      temp.addVertex(sink);
      temp.addEdge(src, sink);
    }
    TransitiveClosure.INSTANCE.closeSimpleDirectedGraph(temp);
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.