'She just got me’: supporting care experienced young people negotiating relationships and identities at school

In this article we examine the complex relationship between care experience, mental health and exclusion from school and how young people (YP) negotiate these different experiences and identities. The study is a secondary analysis, informed by symbolic interactionist theory, of interviews conducted with 19 care experienced YP in Scotland. Not all of the YP were excluded and not all had a formal mental health diagnosis, as such our study design allows interrogation of the contexts and relationships which not only facilitate but also disrupt pathways to exclusion. It also allows reconsideration of assumptions of vulnerability which are often applied to care experienced YP. Our findings suggest that these YP are moving beyond ‘role playing’ the identities ascribed to them and actively seek out relationships which enable them to construct alternative identities.     

Beyond traditional collaborative search: Understanding the effect of awareness on multi-level collaborative information retrieval

Although there has been a great deal of research into Collaborative Information Retrieval (CIR) and Collaborative Information Seeking (CIS), the majority has assumed that team members have the same level of unrestricted access to underlying information. However, observations from different domains (e.g. healthcare, business, etc.) have suggested that collaboration sometimes involves people with differing levels of access to underlying information. This type of scenario has been referred to as Multi-Level Collaborative Information Retrieval (MLCIR). To the best of our knowledge, no studies have been conducted to investigate the effect of awareness, an existing CIR/CIS concept, on MLCIR. To address this gap in current knowledge, we conducted two separate user studies using a total of 5 different collaborative search interfaces and 3 information access scenarios. A number of Information Retrieval (IR), CIS and CIR evaluation metrics, as well as questionnaires were used to compare the interfaces. Design interviews were also conducted after evaluations to obtain qualitative feedback from participants. Results suggested that query properties such as time spent on query, query popularity and query effectiveness could allow users to obtain information about team's search performance and implicitly suggest better queries without disclosing sensitive data. Besides, having access to a history of intersecting viewed, relevant and bookmarked documents could provide similar positive effect as query properties. Also, it was found that being able to easily identify different team members and their actions is important for users in MLCIR. Based on our findings, we provide important design recommendations to help develop new CIR and MLCIR interfaces.     

The Development of Measures of Individual Differences in Self-Regulatory Control and Their Relationship to Academic Performance

Two studies are reported describing the development and validation of the Strategic Flexibility Questionnaire (SFQ): a self-report instrument aimed at eliciting students’ beliefs about the need for, and conditional nature of, self-regulatory control over learning. In Study 1, 281 first-year university education students completed a 40-item pilot questionnaire. Factor analysis of responses revealed a 21-item instrument indicating three types of control beliefs: adaptive executive control, inflexible executive control, and irresolute executive control. In Study 2, the predictive validity of these conceptions was tested against the academic performance of 105 third-year university education students. Results indicated that students reporting adaptive executive control beliefs were more successful academically, while those students reporting inflexible or irresolute control beliefs were significantly less successful academically.     

Quantum algorithms: A?survey of some recent results

Quantum algorithms are a field of growing interest within the theoretical computer science as well as the physics community. Surprisingly, although the number of researchers working on the subject is ever-increasing, the number of quantum algorithms found so far is quite small. In fact, the task of designing new quantum algorithms has been proven to be extremely difficult. In this paper we give an overview of the known quantum algorithms and briefly describe the underlying ideas. Roughly, the algorithms presented are divided into hidden subgroup type algorithms and in amplitude amplification type algorithms. While the former deal with problems of group-theoretical nature and have the promise to yield strong separations of classical and quantum algorithms, the latter have been proved to be a prolific source of algorithms in which a polynomial speed-up as compared to classical algorithms can be achieved. We also discuss quantum algorithms which do not fall under these two categories and give a survey of techniques of general interest in quantum computing such as adiabatic computing, lower bounds for quantum algorithms, and quantum interactive proofs.