BigSee
Hats Simulator
This network illustrates working with an agent simulation program. In the Hats simulator, a small proportion of agents may be planning to access a protected area. To do this, they must arrive at the area as a group, and between them have the right set of capabilities to make access. Agents have different native capabilities, and can acquire capabilities from each other in meetings. The goal for the user is to find a group of agents that may be planning to access some protected area, in a simulation containing perhaps millions of agents, mostly benign, and thousands of protected areas. The image below highlights a group that may be planning to access an area requiring four capabilities. Only agents within a small fixed distance of a chosen area are initially selected interactively in KP, showing a few hundred out of more than 10,000 agents. Groups have been assigned by a separate analytic tool, and are used to color the agents, with agents colored blue belonging only to benign groups. The red agents at the top right of the diagram may be planning to make an access. Agents are linked to meetings, shown as ovals, and colored links indicate that the agent got or shared some capability in a meeting. The meetings have been laid out in time order from left to right, so it is clear that the group acquired all four capabilities through meetings, two of them quite recently. Also, two of the capabilities were acquired through a chain of meetings, behavior not seen elsewhere in the local network
Hats Simulator
This network illustrates working with an agent simulation program. In the Hats simulator, a small proportion of agents may be planning to access a protected area. To do this, they must arrive at the area as a group, and between them have the right set of capabilities to make access. Agents have different native capabilities, and can acquire capabilities from each other in meetings. The goal for the user is to find a group of agents that may be planning to access some protected area, in a simulation containing perhaps millions of agents, mostly benign, and thousands of protected areas. The image below highlights a group that may be planning to access an area requiring four capabilities. Only agents within a small fixed distance of a chosen area are initially selected interactively in KP, showing a few hundred out of more than 10,000 agents. Groups have been assigned by a separate analytic tool, and are used to color the agents, with agents colored blue belonging only to benign groups. The red agents at the top right of the diagram may be planning to make an access. Agents are linked to meetings, shown as ovals, and colored links indicate that the agent got or shared some capability in a meeting. The meetings have been laid out in time order from left to right, so it is clear that the group acquired all four capabilities through meetings, two of them quite recently. Also, two of the capabilities were acquired through a chain of meetings, behavior not seen elsewhere in the local network