Experimental Methods in IIR: The Tension between Rigour and Ethics in Studies Involving Users with Dyslexia

Designing user studies in the interactive information retrieval (IIR) paradigm on people with impairments may sometimes require different methodological considerations than for other users. Consequently, there may be a tension between what the community regards as being a rigorous methodology against what researchers can do ethically with their users. This paper discusses issues to consider when designing IIR studies involving people with dyslexia, such as sampling, informed consent and data collection. The conclusion is that conducting user studies on participants with dyslexia requires special considerations at all stages of the experimental design. The purpose of this paper is to raise awareness and understanding in the research community about experimental methods involving users with dyslexia, and addresses researchers, as well as editors and reviewers. Several of the issues raised do not only apply to people with dyslexia, but have implications when researching other groups, for instance elderly people and users with learning, cognitive, sensory or motor impairments

What Is Known About the Impact of Impairments on Information Seeking and Searching?

Information seeking and access are essential for users in all walks of life, from addressing personal needs such as finding flights to locating information needed to complete work tasks. Over the past decade or so, the general needs of people with impairments have increasingly been recognized as something to be addressed, an issue embedded both in international treaties and in state legislation. The same tendency can be found in research, where a growing number of user studies including people with impairments have been conducted. The purpose of these studies is typically to uncover potential barriers for access to information, especially in the context of inaccessible search user interfaces. This literature review provides an overview of research on the information seeking and searching of users with impairments. The aim is to provide an overview to both researchers and practitioners who work with any of the user groups identified. Some diagnoses are relatively well represented in the literature (for instance, visual impairment), but there is very little work in other areas (for instance, autism) and in some cases no work at all (for instance, aphasia). Gaps are identified in the research, and suggestions are made regarding areas where further research is needed

Equivariant K-theory classes of matrix orbit closures

The group G = \GL_r(k) \times (k^\times)^n acts on $\AA^{r \times n}$, the space of $r$-by-$n$ matrices: \GL_r(k) acts by row operations and $(k^\times)^n$ scales columns. A matrix orbit closure is the Zariski closure of a point orbit for this action. We prove that the class of such an orbit closure in $G$-equivariant $K$-theory of $\AA^{r \times n}$ is determined by the matroid of a generic point. We present two formulas for this class. The key to the proof is to show that matrix orbit closures have rational singularities

Green Care: a Conceptual Framework. A Report of the Working Group on the Health Benefits of Green Care

‘Green Care’ is a range of activities that promotes physical and mental health and well-being through contact with nature. It utilises farms, gardens and other outdoor spaces as a therapeutic intervention for vulnerable adults and children. Green care includes care farming, therapeutic horticulture, animal assisted therapy and other nature-based approaches. These are now the subject of investigation by researchers from many different countries across the world

EQUIVARIANT CHOW CLASSES OF MATRIX ORBIT CLOSURES

Let $G$ be the product $GL_r(C) \times (C^\times)^n$. We show that the $G$-equivariant Chow class of a $G$ orbit closure in the space of $r$-by-$n$ matrices is determined by a matroid. To do this, we split the natural surjective map from the $G$ equvariant Chow ring of the space of matrices to the torus equivariant Chow ring of the Grassmannian. The splitting takes the class of a Schubert variety to the corresponding factorial Schur polynomial, and also has the property that the class of a subvariety of the Grassmannian is mapped to the class of the closure of those matrices whose row span is in the variety.Comment: 11 pages. Theorem 3.5 here proves a version of the main result of arXiv:1306.1810v5, the proof of which contained an erro

Modelling the information seeking and searching behaviour of users with impairments: Are existing models applicable?

Purpose A substantial number of models have been developed over the years, with the purpose of describing the information seeking and searching of people in various user groups and contexts. Several models have been frequently applied in user studies, but are rarely included in research on participants with impairments. Models are purposeful when developing theories. Consequently, it might be valuable to apply models when studying this user group, as well. The purpose of this study was to explore whether existing models are applicable in describing the online information seeking and searching of users with impairments, with an overall aim to increase the use of models in studies involving impairments. Design/methodology/approach Six models were selected according to the following criteria: the model should address information seeking or searching, include the interaction between users and systems whilst incorporate assistive technology. Two user groups were selected from each of the categories cognitive, sensory and motor impairments, namely dyslexia, autism, blindness, deafness, paralysation and Parkinson’s. The models were then analysed based on known barriers reported for these cohorts. Findings All the selected models had potential to be applied in user studies involving impairments. While three of the models had the highest potential to be used in the current form, the other three models were applicable either through minor revisions or by combining models. Originality/value This study contributes with a new perspective on the use of models in information seeking and searching research on users with impairments

Dyslexia and password usage:accessibility in authentication design

Governments and businesses are moving online with alacrity, driven by potential cost savings, changing consumer and citizen expectations, and the momentum towards general digital provision. Services are legally required to be inclusive and accessible. Now consider that almost every online service, where people have to identify themselves, requires a password. Passwords seem to be accessible, until one considers specific disabilities, one of which can lead to many challenges: dyslexia being a case in point. Dyslexia is associated with word processing and retention difficulties, and passwords are essentially words, phrases or alphanumeric combinations. We report on a literature review conducted to identify extant research into the impact of dyslexia on password usage, as well as any ameliorations that have been proposed. We discovered a relatively neglected field. We conclude with recommendations for future research into the needs of a large population of dyslexics who seem to struggle with passwords, in a world where avoiding passwords has become almost impossible. The main contribution of this paper is to highlight the difficulties dyslexics face with passwords, and to suggest some avenues for future research in this area

Levels of nitrate, nitrite and nitrosamines in model sausages during heat treatment and in vitro digestion – The impact of adding nitrite and spinach (Spinacia oleracea L.)

publishedVersio

Matrix Orbit Closures

Let $G$ be the group \GL_r(\CC) \times (\CC^\times)^n. We conjecture that the finely-graded Hilbert series of a $G$ orbit closure in the space of $r$-by-$n$ matrices is wholly determined by the associated matroid. In support of this, we prove that the coefficients of this Hilbert series corresponding to certain hook-shaped Schur functions in the \GL_r(\CC) variables are determined by the matroid, and that the orbit closure has a set-theoretic system of ideal generators whose combinatorics are also so determined. We also discuss relations between these Hilbert series for related matrices