Vakblad Geron.T. nr 1 v Ray
نویسندگان
چکیده
Quite a few adults experience difficulties in using present-day consumer products with their extensive functionality . Three factors may potentially contribute: complexity of the user interface, age effects in perceptual, cognitive, and motor abilities, and generationrelated lack of experience with such technology. The objective of the present study is to unravel the influences of these three factors. To this end, four age groups between 30 and 70 yrs handled user interfaces of simulated devices in two laboratory experiments. This concerned a video-phone interface with a single layered and a two-layered menu interface in the first and a three-layered interface of a simulated mobile phone in the second experiment. We start with explaining the theoretical framework including the concept of generation effects and how to distinguish these from age effects. Next, the two experiments will be described and discussed. Technology generation and Age in using layered user interfaces
منابع مشابه
Crystalline amidocerium(IV) oxides and a side-on bridging dioxygen complex.
Complexes [Ce(NR(2))(3)] (1) or [Ce(NR''(2))(3)] (2) were cerium(III) precursors to the X-ray characterised crystalline oligomeric oxygen-containing amidocerium(IV) compounds [{Ce(NR(2))(2)(mu-O)}(n)] (3, n = 2; 4, n = 3), [{Ce(NR''(2))(2)(mu-O)}(4)] (5), [{(R(2)N)(3)Ce}(2)(mu-[upper bond 1 start]OMOM[upper bond 1 end])] (6, M = Na; 7, M = K), [{(R(2)N)(3)CeOCe(NR(2))(2)}(2)(mu-[upper bond 1 st...
متن کاملLimited Approximation of Numerical Range of Normal Matrix
Let A be an n× n normal matrix, whose numerical range NR[A] is a k -polygon. If a unit vector v ∈ W ⊆ Cn, with dimW = k and the point v∗Av ∈ IntNR[A], then NR[A] is circumscribed to NR[P∗AP], where P is an n× (k− 1) isometry of {span{v}}⊥ W → Cn, [1]. In this paper, we investigate an internal approximation of NR[A] by an increasing sequence of NR[Cs] of compressed matrices Cs = R∗s ARs, with R∗...
متن کاملCovering Complete Hypergraphs with Cuts of Minimum Total Size
A cut [X,V −X] in a hypergraph with vertex-set V is the set of all edges that meet both X and V −X. Let sr(n) denote the minimum total size of any cover of the edges of the complete r-uniform hypergraph on n vertices Kr n by cuts. We show that there is a number nr such that for every n > nr, sr(n) is uniquely achieved by a cover with � n−1 r−1 � cuts [Xi, V −Xi] such that the Xi are pairwise di...
متن کاملDwork’s Proof of Rationality
That the second definition lies in 1 + tZ[[t]] is clear, while the equality of the two is an elementary combinatorial application of Galois theory. For shorthand, we sometimes write Nr = #V (Fqr), and Z(V/Fq, t) = Z(Nr, t). To begin, we make the following observation. If we can write V = V ′ t V ′′, even merely on the level of Fq-points, then Z(V/Fq, t) = Z(V /Fq, t)Z(V /Fq, t). Written differe...
متن کامل