On the computational security of a distributed key distribution scheme

In a distributed key distribution scheme, a set of servers helps a set of users in a group to securely obtain a common key. Security means that an adversary who corrupts some servers and some users has no information about the key of a noncorrupted group. In this work, we formalize the security analysis of one such scheme which was not considered in the original proposal. We prove the scheme is secure in the random oracle model, assuming that the Decisional Diffie-Hellman (DDH) problem is hard to solve. We also detail a possible modification of that scheme and the one in which allows us to prove the security of the schemes without assuming that a specific hash function behaves as a random oracle. As usual, this improvement in the security of the schemes is at the cost of an efficiency loss.

Multiuser detection with an unknown number of active users: receiver design

In multiuser detection, the set of users active at any time may be unknown to the receiver. In these conditions, optimum reception consists of detecting simultaneously the set of activeusers and their data, problem that can be solved exactly by applying random-set theory (RST) and Bayesian recursions (BR). However, implementation of optimum receivers may be limited by their complexity, which grows exponentially with the number of potential users. In this paper we examine three strategies leading to reduced-complexity receivers.In particular, we show how a simple approximation of BRs enables the use of Sphere Detection (SD) algorithm, whichexhibits satisfactory performance with limited complexity.

Asymptotic capacity of static multiuser channels with an unknown number of users

We examine a multiple-access communication system in which multiuser detection is performed without knowledge of the number of active interferers. Using a statistical-physics approach, we compute the single-user channel capacity and spectral efficiency in the large-system limit.

CLFP intrinsic constraints-based group management of blended learning situations

When applying a Collaborative Learning Flow Pattern (CLFP) to structure sequences of activities in real contexts, one of the tasks is to organize groups of students according to the constraints imposed by the pattern. Sometimes,unexpected events occurring at runtime force this pre-defined distribution to be changed. In such situations, an adjustment of the group structures to be adapted to the new context is needed. If the collaborative pattern is complex, this group redefinitionmight be difficult and time consuming to be carried out in real time. In this context, technology can help on notifying the teacher which incompatibilitiesbetween the actual context and the constraints imposed by the pattern. This chapter presents a flexible solution for supporting teachers in the group organization profiting from the intrinsic constraints defined by a CLFPs codified in IMS Learning Design. A prototype of a web-based tool for the TAPPS and Jigsaw CLFPs and the preliminary results of a controlled user study are alsopresented as a first step towards flexible technological systems to support grouping tasks in this context.

Why do workers leave unions? - group differences in a Spanish Union Federation

This study analyses the characteristics of members leaving a Spanishunion federation – Catalonia branch of Workers’ Commissions(CCOO-Catalonia), together with their reasons for leaving using avariety of data sources. Our findings indicate that higher union attritionamong members in instable employment (i.e. casual employment andlow seniority). In general, union leavers confirm that their job situationis an important reason for leaving the union. We therefore concludethat efforts made by the union to retain members in vulnerable labormarket positions are important in reducing high rates of union attritionin Spain.

PhD Students’ Research Group Social Capital in Two Countries: A Clustering Approach with Duocentred Network Measures

The article examines the structure of the collaboration networks of research groups where Slovenian and Spanish PhD students are pursuing their doctorate. The units of analysis are student-supervisor dyads. We use duocentred networks, a novel network structure appropriate for networks which are centred around a dyad. A cluster analysis reveals three typical clusters of research groups. Those which are large and belong to several institutions are labelled under a bridging social capital label. Those which are small, centred in a single institution but have high cohesion are labelled as bonding social capital. Those which are small and with low cohesion are called weak social capital groups. Academic performance of both PhD students and supervisors are highest in bridging groups and lowest in weak groups. Other variables are also found to differ according to the type of research group. At the end, some recommendations regarding academic and research policy are drawn

The effect of intergroup competition on group coordination: An experimental study

We report an experiment on the effect of intergroup competition on group coordination in the minimal-effort game (Van Huyck et al., 1990). The competition was between two 7-person groups. Each player in each group independently chose an integer from 1 to 7. The group with the higher minimum won the competition and each of its members was paid according to the game s original payoff matrix. Members of the losing group were paid nothing. In case of a tie, each player was paid half the payoff in the original matrix. This treatment was contrasted with two control treatments where each of the two groups played an independent coordination game, either with or without information about the minimum chosen by the outgroup. Although the intergroup competition does not change the set of strict equilibria, we found that it improved collective rationality by moving group members in the direction of higher-payoff equilibria. Merely providing group members with information about the minimal-effort level in the other group was not sufficient to generate this effect.

Grinder's Group Mastery Theory : scientific research and its application to classroom teaching

Estudi centrat en el paper de la comunicació no verbal com a eina docent per a la gestió de l’aula, prenent com a referència el model de comunicació de Michael Grinder (Pentimento), basat en la Programació Neuro-lingüística (PNL). Aquest model s’analitza i es compara amb altres models i estudis sobre la comunicació no verbal, per establir-ne similituds i diferències. Per tal d’avaluar l’eficàcia de les tècniques de gestió de l’aula a través de la comunicació no verbal proposades per Grinder en un context educatiu real, s’inclouen i s’analitzen enregistraments de la implementació de diferents tècniques en un institut de secundària de Catalunya. Tota la informació recollida i analitzada permet valorar i ressaltar com és de significatiu tot allò que s’expressa més enllà del llenguatge, i per tant, com són d’importants i d’útils les habilitats comunicatives d’un professor en la seva tasca d’ensenyar.