1,466 research outputs found
Cognitive consequences of clumsy automation on high workload, high consequence human performance
The growth of computational power has fueled attempts to automate more of the human role in complex problem solving domains, especially those where system faults have high consequences and where periods of high workload may saturate the performance capacity of human operators. Examples of these domains include flightdecks, space stations, air traffic control, nuclear power operation, ground satellite control rooms, and surgical operating rooms. Automation efforts may have unanticipated effects on human performance, particularly if they increase the workload at peak workload times or change the practitioners' strategies for coping with workload. Smooth and effective changes in automation requires detailed understanding of the congnitive tasks confronting the user: it has been called user centered automation. The introduction of a new computerized technology in a group of hospital operating rooms used for heart surgery was observed. The study revealed how automation, especially 'clumsy automation', effects practitioner work patterns and suggest that clumsy automation constrains users in specific and significant ways. Users tailor both the new system and their tasks in order to accommodate the needs of process and production. The study of this tailoring may prove a powerful tool for exposing previously hidden patterns of user data processing, integration, and decision making which may, in turn, be useful in the design of more effective human-machine systems
L^2-Betti numbers of one-relator groups
We determine the L^2-Betti numbers of all one-relator groups and all
surface-plus-one-relation groups (surface-plus-one-relation groups were
introduced by Hempel who called them one-relator surface groups). In particular
we show that for all such groups G, the L^2-Betti numbers b_n^{(2)}(G) are 0
for all n>1. We also obtain some information about the L^2-cohomology of
left-orderable groups, and deduce the non-L^2 result that, in any
left-orderable group of homological dimension one, all two-generator subgroups
are free.Comment: 18 pages, version 3, minor changes. To appear in Math. An
Largeness and SQ-universality of cyclically presented groups
Largeness, SQ-universality, and the existence of free subgroups of rank 2 are measures of the complexity of a finitely presented group. We obtain conditions under which a cyclically presented group possesses one or more of these properties. We apply our results to a class of groups introduced by Prishchepov which contains, amongst others, the various generalizations of Fibonacci groups introduced by Campbell and Robertson
Markov semigroups, monoids, and groups
A group is Markov if it admits a prefix-closed regular language of unique
representatives with respect to some generating set, and strongly Markov if it
admits such a language of unique minimal-length representatives over every
generating set. This paper considers the natural generalizations of these
concepts to semigroups and monoids. Two distinct potential generalizations to
monoids are shown to be equivalent. Various interesting examples are presented,
including an example of a non-Markov monoid that nevertheless admits a regular
language of unique representatives over any generating set. It is shown that
all finitely generated commutative semigroups are strongly Markov, but that
finitely generated subsemigroups of virtually abelian or polycyclic groups need
not be. Potential connections with word-hyperbolic semigroups are investigated.
A study is made of the interaction of the classes of Markov and strongly Markov
semigroups with direct products, free products, and finite-index subsemigroups
and extensions. Several questions are posed.Comment: 40 pages; 3 figure
Applications of p-deficiency and p-largeness
We use Schlage-Puchta's concept of p-deficiency and Lackenby's property of
p-largeness to show that a group having a finite presentation with p-deficiency
greater than 1 is large, which implies that Schlage-Puchta's infinite finitely
generated p-groups are not finitely presented. We also show that for all primes
p at least 7, any group having a presentation of p-deficiency greater than 1 is
Golod-Shafarevich, and has a finite index subgroup which is Golod-Shafarevich
for the remaining primes. We also generalise a result of Grigorchuk on Coxeter
groups to odd primes.Comment: 23 page
The Movement of Salmon (Salmo Salar) Through an Estuary and a Fish-Pass
In this paper we have attempted to analyze in quantitative terms the behaviour of the salmon of the River Erne during the important phase of migration when the fish first enter brackish and fresh water
Intra-individual movement variability during skill transitions: A useful marker?
Applied research suggests athletes and coaches need to be challenged in knowing when and how much a movement should be consciously attended to. This is exacerbated when the skill is in transition between two more stable states, such as when an already well learnt skill is being refined. Using existing theory and research, this paper highlights the potential application of movement variability as a tool to inform a coach’s decision-making process when implementing a systematic approach to technical refinement. Of particular interest is the structure of co-variability between mechanical degrees-of-freedom (e.g., joints) within the movement system’s entirety when undergoing a skill transition. Exemplar data from golf are presented, demonstrating the link between movement variability and mental effort as an important feature of automaticity, and thus intervention design throughout the different stages of refinement. Movement variability was shown to reduce when mental effort directed towards an individual aspect of the skill was high (target variable). The opposite pattern was apparent for variables unrelated to the technical refinement. Therefore, two related indicators, movement variability and mental effort, are offered as a basis through which the evaluation of automaticity during technical refinements may be made
- …