✦ LIBER ✦

Reading upper and lower case on viewdata

✍ Scribed by Jeremy J. Foster; Margaret Bruce

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 562 KB
Volume: 13
Category: Article
ISSN: 0003-6870
DOI: 10.1016/0003-6870(82)90236-8

No coin nor oath required. For personal study only.

✦ Synopsis

The times taken to read aloud six passages of nonsense text presented in upper or lower case on an ITT Viewdata receiver were compared. Contrary to the usual finding with printed material, upper case text did not significantly retard reading.

📜 SIMILAR VOLUMES

On upper and lower δ-precontinuous multi

On upper and lower δ-precontinuous multifunctions

✍ Jin Han Park; Bu Young Lee; Mi Jung Son 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 122 KB

In this paper we introduce and study d-precontinuous multifunctions as a generalization of precontinuous multifunctions due to Popa [Problemy Mat. 10 (1988) 9]. Some characterizations and several properties concerning upper (lower) d-precontinuous multifunctions are obtained. The relationships betwe

A note on upper and lower Sugeno integra

A note on upper and lower Sugeno integrals

✍ Toshiaki Murofushi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 207 KB

This paper introduces upper and lower Sugeno integrals and shows that they are representable as the Sugeno integrals with respect to the outer and inner fuzzy measures, respectively.

Upper and lower bounds for the average-c

Upper and lower bounds for the average-case complexity of path-search

✍ Pippenger, Nicholas 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 1 views

A channel graph is the union of all paths between a given input and a given output in an interconnection network. At any moment in time, each vertex in such a graph is either idle or busy. The search problem that we consider is to find a path (from the given input to the given output) consisting ent

Upper and lower bounds on infinite time

Upper and lower bounds on infinite time ruin probabilities in case of constraints on claim size distributions

✍ M.J. Goovaerts; F. De Vylder 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 507 KB

New lower and upper bounds for on-line s

New lower and upper bounds for on-line scheduling

✍ Bo Chen; André van Vliet; Gerhard J. Woeginger 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 507 KB

On strict lower and upper sections of fu

On strict lower and upper sections of fuzzy orderings

✍ Louis Aimé Fono; Henri Gwet 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 284 KB

Strict lower sections, strict upper sections and open order intervals (strict order intervals) are classical notions associated to crisp orderings (crisp total preorders). In this paper, we extend these notions to fuzzy orderings. We determine all the fuzzy orderings (they contain all the crisp orde