Your search
Results 22 resources
-
H-spaces are examined by studying left translations, actions and a homotopy version of left translations to be called homolations. If (F, m) is an H-space, the map s: F-→FF given by s(x) = Lx, i.e. s(x) is left translation by x, is a homomorphism if and only if m is associative. In general, s is an An-map if and only if (F, m) is an An+1 space. The action r: FF × F → F is given by r(φ, x) = φ(x). The map s respects the action only of left translations. In general, s respects the action of homolations up to higherorder homotopies. Each homolation generates a family of maps to be called a homolation family. Denoting the set of all homolation families by H∞(F), s: F -→ FF factors through F → H∞(F) and this latter map is a homotopy equivalence. © 1971 Pacific Journal of Mathematics.
-
Proposed that the cue of relative size may facilitate depth perception in accordance with a crossed or uncrossed disparity in stereograms in which both tendencies are equally represented. A concurrent concept was that the latency associated with the perception of depth in random-dot stereograms may be due, in part, to a cue conflict between binocular disparity and relative size. 4 male and 2 female graduate students were given 8 presentations of 5 stereographic stimuli, in which disparity was ambiguous but relative size was systematically altered. Ss were tested for direction of depth preferences and response latency. Both the relative-size effects and an uncrossed disparity bias were evidenced in the data. The latter effect was attributed to binocular rivalry between dissimilar elements in the stereoscopic half-fields. It is concluded that depth cue relationships are more complex than had been suggested by simple dominance theories. (PsycINFO Database Record (c) 2006 APA, all rights reserved). © 1971 American Psychological Association.
-
This investigation was originally motivated by the problem of determining the maximum number of points in finite n-dimensional projective space PG(n, s) based on the Galois field GF(s) of order s=ph (where p and h are positive integers and p is the prime characteristic of the field), such that no t of these chosen points are linearly dependent. A set of k distinct points in PG(n, s), no t linearly dependent, is called a (k, t)-set for k1 >k. The maximum value of k is denoted by mt (n+1, s). The purpose of this paper is to find new upper bounds for some values of n, s and t. These bounds are of importance in the experimental design and information theory problems. © 1971 Institute of Statistical Mathematics.
Explore
Department
- Administration (2)
- Art (1)
- Athletics (1)
- Economics (1)
- English (1)
- Finance (1)
- Health and Movement Sciences (1)
- History (3)
- Information and Library Science (3)
- Mathematics (4)
- Philosophy (1)
- Physics (1)
- President (Office of the) (1)
- Psychology (1)
- Unidentified (1)
- World Languages and Literatures (1)
Resource type
- Book (11)
- Document (1)
- Journal Article (9)
- Thesis (1)