We develop the Latent Multi-group Membership Graph (LMMG) model, a model of networks with rich node feature structure. In the LMMG model, each node belongs to multiple groups and each latent group models the occurrence of links as well as the node feature structure. The LMMG can be used to summarize the network structure, to predict links between the nodes, and to predict missing features of a ...

We study experimentally how males and females differ in the way same-gender peers observing their action affects their social behavior. In our experiment, people play a Prisoner’s Dilemma Game with a partisan audience watching the choice. Two groups of the same size (6-10 persons) participated in each session; these groups could be both all-male, both all-female, or one allmale and one all-fema...

People who are members of a group, and identify with it, behave differently from people in isolation. The way in which the behavior differs depends in subtle ways from the way in which the nature of the group is perceived, as well as its saliency, and also on the way in which people perceive that the behavior of others is affected by the group. We study these hypotheses in a strategic experimen...

In this paper, we present a process-algebraic specification of group membership protocols specified in [Y. Amir, D. Dolev, S. Kramer and D. Malki, Membership Algorithms for Multicast Communication Groups, Springer-Verlag, 1992]. In order to formalise the protocol and its properties we disambiguate the informal specification provided by the paper. This requires trying different possible interpre...

Background/introduction Task Group (TG) 241 of the American Association of Physicists in Medicine (AAPM), operating under the Work Group for Technology Assessment in ImageGuided Interventions, was formed in September of 2013 with an international membership of experts from MRguided focused ultrasound (MRgFUS), focused ultrasound and ultrasound physics, radiation oncology, industry and federal a...

The modular group plays an important role in many branches of mathematics. We show that the membership problem for the modular group is decidable in polynomial time. To this end, we develop a new syllable-based version of the known subgroup-graph approach. The new approach can be used to prove additional results. We demonstrate this by using it to prove that the membership problem for a free gr...

According to the Evolving Algebra thesis [3], evolving algebras should allow one to specify succinctly any algorithm. There exists substantial evidence con rming this thesis in the case of sequential algorithms (see the annotated bibliography in [3]). In other papers, e.g., [1, 5], evolving algebras are used to specify distributed algorithms. For this paper, we wanted to look at a time-constrai...

François Le Gall Department of Computer Science, The University of Tokyo, 7-3-1 Hongo, Bunkyoku, Tokyo, 113-8656, Japan Abstract It is known that the group non-membership problem is in QMA relative to any group oracle and in SPP∩BQP relative to group oracles for solvable groups. We consider a modified version of the group non-membership problem where the order of the group is also given as an a...

We address the problem of verifying clique avoidance in the TTP protocol. TTP allows several stations embedded in a car to communicate. It has many mechanisms to ensure robustness to faults. In particular, it has an algorithm that allows a station to recognize itself as faulty and leave the communication. This algorithm must satisfy the crucial ’non-clique’ property: it is impossible to have tw...