968 resultados para in-group favoritism
Resumo:
Streptococcus pyogenes isolates from a tropical region and a subtropical region of Australia with high and low incidences of severe streptococcal diseases, respectively, were analyzed for speA, speB, and speC gene distributions and NAD-glycohydrolase expression. No direct correlation of these characteristics with a propensity to cause invasive diseases was observed.
Resumo:
In the wake of the success of Peer-to-Peer (P2P) networking, security has arisen as one of its main concerns, becoming a key issue when evaluating a P2P system. Unfortunately, some systems' design focus targeted issues such as scalabil-ity or overall performance, but not security. As a result, security mechanisms must be provided at a later stage, after the system has already been designed and partially (or even fully) implemented, which may prove a cumbersome proposition. This work exposes how a security layer was provided under such circumstances for a specic Java based P2P framework: JXTA-Overlay.
Resumo:
Information processing in groups has long been seen as a cooperative process. In contrast with this assumption, group members were rarely found to behave cooperatively: They withhold unshared information and stick to initial incorrect decisions. In the present article, we examined how group members' cooperative and competitivemotives impact on group information processing and propose that information sharing and use in groups could be seen as strategic behavior. We reviewed the latest developments in the literature investigating different forms of strategic information processing and their underlying mechanisms. This review suggests that explicit cooperative goals are needed for effective group decision-making.
Resumo:
Computer Supported Collaborative Learning (CSCL) is a teaching and learning approach which is widely adopted. However there are still some problems can be found when CSCL takes place. Studies show that using game-like mechanics can increase motivation, engagement, as well as modelling behaviors of players. Gamification is a rapid growing trend by applying the same mechanics. It refers to use game design elements in non-game contexts. This thesis is about combining gamification concept and computer supported collaborative learning together in software engineering education field. And finally a gamified prototype system is designed.
Resumo:
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case that the Wedderburn decomposition E[G] \cong \oplus_xM_x is explicitly computable and each M_x is in fact a matrix ring over a field, this leads to an algorithm that either gives elements \alpha_1,...,\alpha_d \in X such that X = A\alpha_1 \oplus ... \oplusA\alpha_d or determines that no such elements exist. Let L/K be a finite Galois extension of number fields with Galois group G such that E is a subfield of K and put d = [K : E]. The algorithm can be applied to certain Galois modules that arise naturally in this situation. For example, one can take X to be O_L, the ring of algebraic integers of L, and A to be the associated order A(E[G];O_L) \subseteq E[G]. The application of the algorithm to this special situation is implemented in Magma under certain extra hypotheses when K = E = \IQ.
Resumo:
slides plus mark scheme and link to group work videos