Lateralized behaviour in the domestic cat, Felis silvestris catus

Lateralized behaviour in the felids has been subject to little investigation. We examined the paw use of 42 domestic cats on three tasks designed to determine whether the animals performed asymmetrical motor behaviour. The influence of the cats' sex and age on their paw preferences was also explored. The distribution of the cats' paw preferences differed significantly between the three tasks. Task 1, the most complex exercise involving retrieval of a food treat from an empty jar, encouraged the most apparent display of lateralized behaviour, with all but one animal showing a strong preference to use either their left or right paw consistently. Tasks 2 (an exercise involving reaching for a toy suspended overhead) and 3 (a challenge involving reaching for a toy moving along the ground) encouraged ambilateral motor performance. Lateralized behaviour was strongly sex related. Male and female cats showed paw preferences at the level of the population, but in opposite directions. Females had a greater preference for using their right paw; males were more inclined to adopt their left paw. Feline age was unrelated to either strength or direction of preferred paw use. Overall, the findings suggest that there are two distinct populations of paw preference in the cat that cluster strongly around the animals' sex. The results also point to a relationship between lateralized behaviour and task complexity. More apparent patterns of lateralized behaviour were evident on more complex manipulatory tasks, hinting at functional brain specialization in this species. © 2009 The Association for the Study of Animal Behaviour.

Reviewing the Literature on the Breakdown of Foster Care Placements for Young People: Complexity and the Social Work Task

Young people in long-term foster care are at risk of experiencing poor social, emotional, behavioural and educational outcomes. Moreover, these placements have a significantly greater chance of breaking down compared to those involving children. This article critically evaluates the factors associated with this particular outcome. It was carried out through a literature review conducted by a social work practitioner in one Health and Social Care Trust in Northern Ireland. The findings evidenced that, apart from overriding safety concerns, placement breakdown was not a one-off event but rather a complex process involving the interplay between a range of dynamic risk and protective factors over time, operating in the wider context of the young person’s history and life experiences. The significance of these findings for social work practitioners is finally considered by identifying key theories to inform understanding and intervention.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. The "obvious" lower bounds of O(m) messages (m is the number of edges in the network) and O(D) time (D is the network diameter) are non-trivial to show for randomized (Monte Carlo) algorithms. (Recent results that show that even O(n) (n is the number of nodes in the network) is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms (except for the limited case of comparison algorithms, where it was also required that some nodes may not wake up spontaneously, and that D and n were not known).

We establish these fundamental lower bounds in this paper for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (such algorithms should work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make anyuse of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time algorithm is known. A slight adaptation of our lower bound technique gives rise to an O(m) message lower bound for randomized broadcast algorithms.

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. (The answer is known to be negative in the deterministic setting). We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that trade-off messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

On the Complexity of Universal Leader Election

Electing a leader is a fundamental task in distributed computing. In its implicit version, only the leader must know who is the elected leader. This article focuses on studying the message and time complexity of randomized implicit leader election in synchronous distributed networks. Surprisingly, the most "obvious" complexity bounds have not been proven for randomized algorithms. In particular, the seemingly obvious lower bounds of Ω(m) messages, where m is the number of edges in the network, and Ω(D) time, where D is the network diameter, are nontrivial to show for randomized (Monte Carlo) algorithms. (Recent results, showing that even Ω(n), where n is the number of nodes in the network, is not a lower bound on the messages in complete networks, make the above bounds somewhat less obvious). To the best of our knowledge, these basic lower bounds have not been established even for deterministic algorithms, except for the restricted case of comparison algorithms, where it was also required that nodes may not wake up spontaneously and that D and n were not known. We establish these fundamental lower bounds in this article for the general case, even for randomized Monte Carlo algorithms. Our lower bounds are universal in the sense that they hold for all universal algorithms (namely, algorithms that work for all graphs), apply to every D, m, and n, and hold even if D, m, and n are known, all the nodes wake up simultaneously, and the algorithms can make any use of node's identities. To show that these bounds are tight, we present an O(m) messages algorithm. An O(D) time leader election algorithm is known. A slight adaptation of our lower bound technique gives rise to an Ω(m) message lower bound for randomized broadcast algorithms. 

An interesting fundamental problem is whether both upper bounds (messages and time) can be reached simultaneously in the randomized setting for all graphs. The answer is known to be negative in the deterministic setting. We answer this problem partially by presenting a randomized algorithm that matches both complexities in some cases. This already separates (for some cases) randomized algorithms from deterministic ones. As first steps towards the general case, we present several universal leader election algorithms with bounds that tradeoff messages versus time. We view our results as a step towards understanding the complexity of universal leader election in distributed networks.

Complexity of risk: Mixed methods approach to understanding youth risk and insecurity in post-conflict settings

In settings of intergroup conflict, identifying contextually-relevant risk factors for youth development in an important task. In Vukovar, Croatia, a city devastated during the war in former Yugoslavia, ethno-political tensions remain. The current study utilized a mixed method approach to identify two salient community-level risk factors (ethnic tension and general antisocial behavior) and related emotional insecurity responses (ethnic and non-ethnic insecurity) among youth in Vukovar. In Study 1, focus group discussions (N=66) with mother, fathers, and adolescents 11 to 15-years-old were analyzed using the Constant Comparative Method, revealing two types of risk and insecurity responses. In Study 2, youth (N=227, 58% male, M=15.88 SD=1.12 years old) responded to quantitative scales developed from the focus groups; discriminate validity was demonstrated and path analyses established predictive validity between each type of risk and insecurity. First, community ethnic tension (i.e., threats related to war/ethnic identity) significantly predicted ethnic insecurity for all youth (β=.41, p<.001). Second, experience with community antisocial behavior (i.e., general crime found in any context) predicted non-ethnic community insecurity for girls (β=.32, p<.05), but not for boys. These findings are the first to show multiple forms of emotional insecurity at the community level; implications for future research are discussed.

The area-independent effects of habitat complexity on biodiversity vary between regions.

Potential explanatory variables often co-vary in studies of species richness. Where topography varies within a survey it is difficult to separate area and habitat-diversity effects. Topographically complex surfaces may contain more species due to increased habitat diversity or as a result of increased area per se. Fractal geometry can be used to adjust species richness estimates to control for increases in area on complex surfaces. Application of fractal techniques to a survey of rocky shores demonstrated an unambiguous area-independent effect of topography on species richness in the Isle of Man. In contrast, variation in species richness in south-west England reflected surface availability alone. Multivariate tests and variation in limpet abundances also demonstrated regional variation in the area-independent effects of topography. Community composition did not vary with increasing surface complexity in south-west England. These results suggest large-scale gradients in the effects of heterogeneity on community processes or demography.

Performance Management in the UK Public Sector: addressing multiple stakeholder complexity

Purpose The aim of this paper is to explore the issues involved in developing and applying performance management approaches within a large UK public sector department using a multiple stakeholder perspective and an accompanying theoretical framework. Design/methodology/approach An initial short questionnaire was used to determine perceptions about the implementation and effectiveness of the new performance management system across the organisation. In total, 700 questionnaires were distributed. Running concurrently with an ethnographic approach, and informed by the questionnaire responses, was a series of semi-structured interviews and focus groups. Findings Staff at all levels had an understanding of the new system and perceived it as being beneficial. However, there were concerns that the approach was not continuously managed throughout the year and was in danger of becoming an annual event, rather than an ongoing process. Furthermore, the change process seemed to have advanced without corresponding changes to appraisal and reward and recognition systems. Thus, the business objectives were not aligned with motivating factors within the organisation. Research limitations/implications Additional research to test the validity and usefulness of the theoretical model, as discussed in this paper, would be beneficial. Practical implications The strategic integration of the stakeholder performance measures and scorecards was found to be essential to producing an overall stakeholder-driven strategy within the case study organisation. Originality/value This paper discusses in detail the approach adopted and the progress made by one large UK public sector organisation, as it attempts to develop better relationships with all of its stakeholders and hence improve its performance. This paper provides a concerted attempt to link theory with practice.