On bias in magnitude scaling and some conjectures of Stevens

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On bias in magnitude scaling and some conjectures of Stevens.

Bias in magnitude scaling can be viewed as involving deviations of judgments from proportionality. A model of bias is shown to provide a theoretical basis for Stevens's conjecture about geometrically averaging magnitude estimation and magnitude production exponents in order to obtain an estimate of the psychophysical exponent. An overlooked result is that one can also obtain an estimate of the ...

متن کامل

an investigation into iranian teachers consistency and bias in evaluation of students writings

while performance-based language assessment has led to an increased authenticity and content validity in the practice of writing assessment, the reliability of ratings has become a major issue. research findings have shown different reactions by native english speaker (nes) and non-native english speaker (nns) teachers to students’ writings. the focus of this study is on investigating whether i...

Some conjectures on codes

Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations with factorizations of cyclic groups.

متن کامل

Some conjectures on congruences

1. Notation. Let Z and N be the sets of integers and positive integers respectively. For b, c ∈ Z the Lucas sequences {U n (b, c)} and {V n (b, c)} are defined by (1.1) U 0 (b, c) = 0, U 1 (b, c) = 1, U n+1 (b, c) = bU n (b, c) − cU n−1 (b, c) (n ≥ 1) and (1.2) V 0 (b, c) = 2, V 1 (b, c) = b, V n+1 (b, c) = bV n (b, c) − cV n−1 (b, c) (n ≥ 1). Let d = b 2 − 4c. It is well known that for n ∈ N, ...

متن کامل

On Some Conjectures of Griggs and Graffiti

We discuss a conjecture of J. R. Griggs relating the maximum number of leaves in a spanning tree of a simple, connected graph to the order and independence number of the graph. We prove a generalization of this conjecture made by the computer program Graffiti, and discuss other similar conjectures, including several generalizations of the theorem that the independence number of a simple, connec...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Perception & Psychophysics

سال: 2005

ISSN: 0031-5117,1532-5962

DOI: 10.3758/bf03193541