Information theory and resistance fluctuations in one-dimensional disordered conductors

1985 ◽  
Vol 31 (5) ◽  
pp. 3109-3111 ◽  
Author(s):  
N. Kumar ◽  
P. A. Mello
Keyword(s):  
Information Theory ◽  
One Dimensional ◽  
Resistance Fluctuations

Constructing and Deconstructing Concepts

2016 ◽  
Vol 63 (5) ◽  
pp. 249-262 ◽  
Author(s):  
Charles A. Doan ◽  
Ronaldo Vigo
Keyword(s):  
Information Theory ◽  
Model Performance ◽  
Unsupervised Classification ◽  
Family Resemblance ◽  
Category Membership ◽  
Formal Models ◽  
Human Beings ◽  
One Dimensional ◽  
Relational Patterns ◽  
Optimal Classification

Abstract. Several empirical investigations have explored whether observers prefer to sort sets of multidimensional stimuli into groups by employing one-dimensional or family-resemblance strategies. Although one-dimensional sorting strategies have been the prevalent finding for these unsupervised classification paradigms, several researchers have provided evidence that the choice of strategy may depend on the particular demands of the task. To account for this disparity, we propose that observers extract relational patterns from stimulus sets that facilitate the development of optimal classification strategies for relegating category membership. We conducted a novel constrained categorization experiment to empirically test this hypothesis by instructing participants to either add or remove objects from presented categorical stimuli. We employed generalized representational information theory (GRIT; Vigo, 2011b , 2013a , 2014 ) and its associated formal models to predict and explain how human beings chose to modify these categorical stimuli. Additionally, we compared model performance to predictions made by a leading prototypicality measure in the literature.

scholarly journals Winner-Relaxing Self-Organizing Maps

2005 ◽  
Vol 17 (5) ◽  
pp. 996-1009 ◽  
Author(s):  
Jens Christian Claussen
Keyword(s):  
Information Theory ◽  
Dimensional Case ◽  
Self Organizing Maps ◽  
One Dimensional ◽  
New Family ◽  
Wide Range ◽  
The One ◽  
Self Organizing

A new family of self-organizing maps, the winner-relaxing Kohonen algorithm, is introduced as a generalization of a variant given by Kohonen in 1991. The magnification behavior is calculated analytically. For the original variant, a magnification exponent of 4/7 is derived; the generalized version allows steering the magnification in the wide range from exponent 1/2 to 1 in the one-dimensional case, thus providing optimal mapping in the sense of information theory. The winner-relaxing algorithm requires minimal extra computations per learning step and is conveniently easy to implement.

Resistance fluctuations in ballistic transport through one-dimensional channels

1992 ◽  
Vol 45 (23) ◽  
pp. 13781-13783 ◽  
Author(s):  
K. Nakamura ◽  
D. C. Tsui ◽  
F. Nihey ◽  
H. Toyoshima ◽  
T. Itoh
Keyword(s):  
Ballistic Transport ◽  
One Dimensional ◽  
Resistance Fluctuations

Information theory and one-dimensional disordered conductors

1985 ◽  
Vol 75 (1-3) ◽  
pp. 135-140 ◽  
Author(s):  
Pier A Mello ◽  
Narendra Kumar
Keyword(s):  
Information Theory ◽  
One Dimensional

Note on Information Capacity of Discrete Motor Responses

1979 ◽  
Vol 49 (1) ◽  
pp. 291-296 ◽  
Author(s):  
Tarald O. Kvåiseth
Keyword(s):  
Experimental Study ◽  
Information Theory ◽  
Motor System ◽  
Estimation Method ◽  
Information Capacity ◽  
Maximum Information ◽  
Motor Responses ◽  
One Dimensional ◽  
Fitts Law ◽  
Human Motor

An experimental study shows that the classical Fitts' law of motor control, which is claimed to be based on an inappropriate analogy with information theory, yields false estimates for the information capacity of the human motor system. An alternative and rigorous estimation method indicates that the maximum information capacity is about 22–24 bits/sec. for discrete single one-dimensional positioning movements.

Sign in / Sign up

Export Citation Format

Share Document