全文获取类型
收费全文 | 1023篇 |
免费 | 78篇 |
出版年
2024年 | 5篇 |
2023年 | 16篇 |
2021年 | 13篇 |
2020年 | 28篇 |
2019年 | 28篇 |
2018年 | 41篇 |
2017年 | 40篇 |
2016年 | 50篇 |
2015年 | 21篇 |
2014年 | 33篇 |
2013年 | 114篇 |
2012年 | 53篇 |
2011年 | 44篇 |
2010年 | 36篇 |
2009年 | 34篇 |
2008年 | 50篇 |
2007年 | 43篇 |
2006年 | 35篇 |
2005年 | 44篇 |
2004年 | 39篇 |
2003年 | 37篇 |
2002年 | 26篇 |
2001年 | 14篇 |
2000年 | 11篇 |
1999年 | 18篇 |
1998年 | 11篇 |
1997年 | 6篇 |
1996年 | 11篇 |
1995年 | 6篇 |
1994年 | 5篇 |
1993年 | 12篇 |
1992年 | 11篇 |
1991年 | 18篇 |
1990年 | 7篇 |
1989年 | 8篇 |
1986年 | 5篇 |
1985年 | 6篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 4篇 |
1980年 | 5篇 |
1978年 | 12篇 |
1977年 | 13篇 |
1976年 | 4篇 |
1975年 | 9篇 |
1974年 | 9篇 |
1971年 | 6篇 |
1970年 | 5篇 |
1968年 | 4篇 |
1967年 | 6篇 |
排序方式: 共有1101条查询结果,搜索用时 31 毫秒
251.
Carl P. Duncan 《Quarterly journal of experimental psychology (2006)》1964,16(4):373-377
Two experiments are reported in which student subjects attempted to discover a principle obtaining among pairs of numbers and letters. In the first experiment, subjects were more successful when they were free to select whatever number-letter pairs they wished than if they were restricted in whole or in part to pairs specified by the experimenter. In the second experiment, subjects who did discover the principle were compared to those who did not. Successful subjects were shown to be slightly more systematic in their approach to the task, to work at a faster pace, to write down more positive instances, and to have a much stronger tendency to vary only one variable of the task at a time.
Wason (1960) reported a study in which subjects tried to discover a principle applying to instances each of which consisted of three numbers. He discovered that subjects mostly showed enumerative rather than eliminative induction, i.e. they made little use of instances that would have enabled them to eliminate wrong hypotheses. Wetherick (1962) found that by modifying Wason's procedure in certain ways, enumerative behaviour was reduced and the subject's chance of discovering the principle was increased. Elimination of hypotheses remained infrequent.
In the Wason study, the subject was free to write down, for each instance, any three numbers he wished, i.e. his choice of instances was not restricted in any way. This may account in part for the behaviour Wason observed. In the first experiment to be reported here, the subject is restricted, in various degrees, in his choice of instances, to determine whether the principle is discovered more (or less) readily under such restriction. 相似文献
Wason (1960) reported a study in which subjects tried to discover a principle applying to instances each of which consisted of three numbers. He discovered that subjects mostly showed enumerative rather than eliminative induction, i.e. they made little use of instances that would have enabled them to eliminate wrong hypotheses. Wetherick (1962) found that by modifying Wason's procedure in certain ways, enumerative behaviour was reduced and the subject's chance of discovering the principle was increased. Elimination of hypotheses remained infrequent.
In the Wason study, the subject was free to write down, for each instance, any three numbers he wished, i.e. his choice of instances was not restricted in any way. This may account in part for the behaviour Wason observed. In the first experiment to be reported here, the subject is restricted, in various degrees, in his choice of instances, to determine whether the principle is discovered more (or less) readily under such restriction. 相似文献
252.
253.
254.
255.
S. Wayne Duncan Christine M. Todd Marion Perlmutter John C. Masters 《Motivation and emotion》1985,9(4):391-405
The state-dependent theory of the relationship between affective states and memory holds that recall will be best when the affective state at recall matches that during learning. Sequential happy, neutral, and sad affective states that were either consistent (e.g., Happy-Happy) or inconsistent (e.g., Sad-Neutral) were experimentally induced in preschool children prior to encoding and then again prior to retrieval (free and cued recall, recognition memory). Facial ratings indicated that the inductions were effective in inducing affect. Nevertheless, emotional states did not influence children's ability to recall items under free or cued conditions, and recognition memory was essentially perfect for all subjects. Thus, there was no evidence for state-dependent learning or for a positive loop between subjects' positive affect at retrieval and memory for positively rated information. Results are discussed in terms of the generally inconsistent findings in the literature on the role of affect in children's memory and factors that may limit affective state-dependent learning in children.This research was supported by Research Grant No. 11776 from the National Institute of Child Health and Human Development to Marion Perlmutter, by Grant BNS 78-01108 from the National Science Foundation to John C. Masters, and by Program Project Grant No. 0527 to the Institute of Child Development. Wayne Duncan is now at the University of Denver, and Christine Todd is now at the University of Illinois, Urbana. Marion Perlmutter is now at the University of Michigan. We would like to thank Keith Elliott and LuAnne Tczap for their work as experimenters; Jule Kogan, Carol Revermann, and Sonya Hernandez for their help in coding data; and Jayne Grady-Reitan for her administrative assistance throughout the study. 相似文献
256.
A relational structure is said to be of scale type (M,N) iff M is the largest degree of homogeneity and N the least degree of uniqueness (Narens, 1981a, Narens, 1981b) of its automorphism group.Roberts (in Proceedings of the first Hoboken Symposium on graph theory, New York: Wiley, 1984; in Proceedings of the fifth international conference on graph theory and its applications, New York: Wiley, 1984) has shown that such a structure on the reals is either ordinal or M is less than the order of at least one defining relation (Theorem 1.2). A scheme for characterizing N is outlined in Theorem 1.3. The remainder of the paper studies the scale type of concatenation structures 〈X, ?, ° 〉, where ? is a total ordering and ° is a monotonic operation. Section 2 establishes that for concatenation structures with M>0 and N<∞ the only scale types are (1,1), (1,2), and (2,2), and the structures for the last two are always idempotent. Section 3 is concerned with such structures on the real numbers (i.e., candidates for representations), and it uses general results of Narens for real relational structures of scale type (M, M) (Theorem 3.1) and of Alper (Journal of Mathematical Psychology, 1985, 29, 73–81) for scale type (1, 2) (Theorem 3.2). For M>0, concatenation structures are all isomorphic to numerical ones for which the operation can be written , where f is strictly increasing and is strictly decreasing (unit structures). The equation f(x?)=f(x)? is satisfied for all x as follows: for and only for ? = 1 in the (1,1) case; for and only for ?=kn, k > 0 fixed, and n ranging over the integers, in the (1, 2) case; and for all ?>0 in the (2, 2) case (Theorems 3.9, 3.12, and 3.13). Section 4 examines relations between concatenation catenation and conjoint structures, including the operation induced on one component by the ordering of a conjoint structure and the concept of an operation on one component being distributive in a conjoint structure. The results, which are mainly of interest in proving other results, are mostly formulated in terms of the set of right translations of the induced operation. In Section 5 we consider the existence of representations of concatenation structures. The case of positive ones was dealt with earlier (Narens & Luce (Journal of Pure & Applied Algebra27, 1983, 197–233). For idempotent ones, closure, density, solvability, and Archimedean are shown to be sufficient (Theorem 5.1). The rest of the section is concerned with incomplete results having to do with the representation of cases with M>0. A variety of special conditions, many suggested by the conjoint equivalent of a concatenation structure, are studied in Section 6. The major result (Theorem 6.4) is that most of these concepts are equivalent to bisymmetry for idempotent structures that are closed, dense, solvable, and Dedekind complete. This result is important in Section 7, which is devoted to a general theory of scale type (2, 2) for the utility of gambles. The representation is a generalization of the usual SEU model which embodies a distinctly bounded form of rationality; by the results of Section 6 it reduces to the fully rational SEU model when rationality is extended beyond the simplest equivalences. Theorem 7.3 establishes that under plausible smoothness conditions, the ratio scale case does not introduce anything different from the (2, 2) case. It is shown that this theory is closely related to, but somewhat more general, than Kahneman and Tversky's (Econometrica47, 1979, 263–291) prospect theory. 相似文献
257.
258.
Sean Allen‐Hermanson 《Pacific Philosophical Quarterly》2017,98(2):171-192
Philosophers have recently argued that since there are people who are blind, but don't know it, and people who echolocate, but don't know it, conscious introspection is highly unreliable. I contend that a second look at Anton's syndrome, human echolocation, and ‘facial vision’ suggests otherwise. These examples do not support skepticism about the reliability of introspection. 相似文献
259.
260.